← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to drizzled/tree.h

  • Committer: Mark Atwood
  • Date: 2012-01-04 16:59:32 UTC
  • mfrom: (2478.2.3 real-key-use-catalog)
  • Revision ID: me@mark.atwood.name-20120104165932-cm0xqs4by0u3p4cy
merge lp:~stewart/drizzle/key-use-catalog

Show diffs side-by-side

added added

removed removed

Lines of Context:
drizzled/tree.h
13
13
   along with this program; if not, write to the Free Software
14
14
   Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA */
15
15
 
16
 
#ifndef DRIZZLED_TREE_H
17
 
#define DRIZZLED_TREE_H
 
16
#pragma once
18
17
 
19
18
#include <unistd.h>
20
19
 
21
 
#include <drizzled/base.h>              /* get 'enum ha_rkey_function' */
 
20
#include <drizzled/base.h>              // for 'enum ha_rkey_function'
 
21
#include <drizzled/memory/root.h>
22
22
#include <drizzled/qsort_cmp.h>
23
 
#include <drizzled/memory/root.h>
24
23
 
25
24
namespace drizzled
26
25
{
27
26
 
28
 
/* Worst case tree is half full. This gives use 2^(MAX_TREE_HEIGHT/2) leafs */
 
27
// Worst case tree is half full. This gives us 2^(MAX_TREE_HEIGHT/2) leaves
29
28
static const int MAX_TREE_HEIGHT= 64;
30
29
 
31
30
static const int TREE_NO_DUPS= 1;
36
35
typedef enum { free_init, free_free, free_end } TREE_FREE;
37
36
typedef void (*tree_element_free)(void*, TREE_FREE, void *);
38
37
 
39
 
typedef struct st_tree_element {
40
 
  struct st_tree_element *left,*right;
41
 
  uint32_t count:31,
42
 
         colour:1;                      /* black is marked as 1 */
43
 
} TREE_ELEMENT;
44
 
 
45
 
static const int TREE_ELEMENT_EXTRA_SIZE= (sizeof(TREE_ELEMENT) + sizeof(void*));
46
 
 
47
 
 
48
 
typedef struct st_tree {
49
 
  TREE_ELEMENT *root,null_element;
50
 
  TREE_ELEMENT **parents[MAX_TREE_HEIGHT];
51
 
  uint32_t offset_to_key, elements_in_tree, size_of_element;
52
 
  size_t memory_limit;
53
 
  size_t allocated;
54
 
  qsort_cmp2 compare;
55
 
  void *custom_arg;
56
 
  memory::Root mem_root;
57
 
  bool with_delete;
58
 
  tree_element_free free;
59
 
  uint32_t flag;
60
 
} TREE;
61
 
 
62
 
/* Functions on whole tree */
63
 
void init_tree(TREE *tree, size_t default_alloc_size, uint32_t memory_limit,
64
 
               uint32_t size, qsort_cmp2 compare, bool with_delete,
65
 
               tree_element_free free_element, void *custom_arg);
66
 
void delete_tree(TREE*);
67
 
void reset_tree(TREE*);
68
 
 
69
 
/* 
70
 
  similar to delete tree, except we do not free() blocks in mem_root
71
 
*/
72
 
#define is_tree_inited(tree) ((tree)->root != 0)
73
 
 
74
 
/* Functions on leafs */
75
 
TREE_ELEMENT *tree_insert(TREE *tree,void *key, uint32_t key_size,
76
 
                          void *custom_arg);
77
 
int tree_walk(TREE *tree,tree_walk_action action,
78
 
              void *argument, TREE_WALK visit);
79
 
int tree_delete(TREE *tree, void *key, uint32_t key_size, void *custom_arg);
80
 
void *tree_search_key(TREE *tree, const void *key,
81
 
                      TREE_ELEMENT **parents, TREE_ELEMENT ***last_pos,
82
 
                      enum ha_rkey_function flag, void *custom_arg);
83
 
void *tree_search_edge(TREE *tree, TREE_ELEMENT **parents,
84
 
                        TREE_ELEMENT ***last_pos, int child_offs);
85
 
void *tree_search_next(TREE *tree, TREE_ELEMENT ***last_pos, int l_offs,
86
 
                       int r_offs);
87
 
ha_rows tree_record_pos(TREE *tree, const void *key,
88
 
                        enum ha_rkey_function search_flag, void *custom_arg);
 
38
 
 
39
class Tree_Element
 
40
{
 
41
public:
 
42
        Tree_Element *left,*right;
 
43
        uint32_t count:31,
 
44
                         colour:1;                      /* black is marked as 1 */
 
45
};
 
46
 
 
47
static const int TREE_ELEMENT_EXTRA_SIZE= (sizeof(Tree_Element) + sizeof(void*));
 
48
 
 
49
/**
 
50
 * red-black binary tree class
 
51
 *
 
52
 * NOTE: unused search code removed 11/2011
 
53
 */
 
54
class Tree
 
55
{
 
56
private:
 
57
        Tree_Element *root, null_element;
 
58
        void *custom_arg;
 
59
        Tree_Element **parents[MAX_TREE_HEIGHT];
 
60
        uint32_t offset_to_key, elements_in_tree, size_of_element;
 
61
        size_t memory_limit;
 
62
        size_t allocated;
 
63
        qsort_cmp2 compare;
 
64
        memory::Root mem_root;
 
65
        bool with_delete;
 
66
        tree_element_free free;
 
67
        uint32_t flag;
 
68
 
 
69
public:
 
70
        void* getCustomArg() {
 
71
                return custom_arg;
 
72
        }
 
73
        Tree_Element* getRoot() {
 
74
                return root;
 
75
        }
 
76
        void setRoot(Tree_Element* root_arg) {
 
77
                root = root_arg;
 
78
        }
 
79
        uint32_t getElementsInTree() {
 
80
                return elements_in_tree;
 
81
        }
 
82
        // tree methods
 
83
        void init_tree(size_t default_alloc_size, uint32_t memory_limit,
 
84
                                   uint32_t size, qsort_cmp2 compare, bool with_delete,
 
85
                                   tree_element_free free_element, void *custom_arg);
 
86
        bool is_inited()
 
87
        {
 
88
                return this->root != 0;
 
89
        }
 
90
        void delete_tree();
 
91
        void reset_tree();
 
92
 
 
93
        // element methods
 
94
        Tree_Element *tree_insert(void *key, uint32_t key_size, void *custom_arg);
 
95
        int tree_walk(tree_walk_action action, void *argument, TREE_WALK visit);
 
96
 
 
97
private:
 
98
        void free_tree(myf free_flags);
 
99
 
 
100
        void* element_key(Tree_Element* element);
 
101
        void delete_tree_element(Tree_Element* element);
 
102
        int tree_walk_left_root_right(Tree_Element* element, tree_walk_action action, void* argument);
 
103
        int tree_walk_right_root_left(Tree_Element* element, tree_walk_action action, void* argument);
 
104
 
 
105
        void left_rotate(Tree_Element **parent,Tree_Element *element);
 
106
        void right_rotate(Tree_Element **parent, Tree_Element *element);
 
107
        void rb_insert(Tree_Element ***parent, Tree_Element *element);
 
108
};
89
109
 
90
110
} /* namespace drizzled */
91
111
 
92
 
#endif /* DRIZZLED_TREE_H */