1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
|
/* Copyright (C) 2000 MySQL AB
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 of the License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
#pragma once
#include <unistd.h>
#include <drizzled/base.h> // for 'enum ha_rkey_function'
#include <drizzled/memory/root.h>
#include <drizzled/qsort_cmp.h>
namespace drizzled
{
// Worst case tree is half full. This gives us 2^(MAX_TREE_HEIGHT/2) leaves
static const int MAX_TREE_HEIGHT= 64;
static const int TREE_NO_DUPS= 1;
typedef enum { left_root_right, right_root_left } TREE_WALK;
typedef int (*tree_walk_action)(void *,uint32_t,void *);
typedef enum { free_init, free_free, free_end } TREE_FREE;
typedef void (*tree_element_free)(void*, TREE_FREE, void *);
class Tree_Element
{
public:
Tree_Element *left,*right;
uint32_t count:31,
colour:1; /* black is marked as 1 */
};
static const int TREE_ELEMENT_EXTRA_SIZE= (sizeof(Tree_Element) + sizeof(void*));
/**
* red-black binary tree class
*
* NOTE: unused search code removed 11/2011
*/
class Tree
{
private:
Tree_Element *root, null_element;
void *custom_arg;
Tree_Element **parents[MAX_TREE_HEIGHT];
uint32_t offset_to_key, elements_in_tree, size_of_element;
size_t memory_limit;
size_t allocated;
qsort_cmp2 compare;
memory::Root mem_root;
bool with_delete;
tree_element_free free;
uint32_t flag;
public:
void* getCustomArg() {
return custom_arg;
}
Tree_Element* getRoot() {
return root;
}
void setRoot(Tree_Element* root_arg) {
root = root_arg;
}
uint32_t getElementsInTree() {
return elements_in_tree;
}
// tree methods
void init_tree(size_t default_alloc_size, uint32_t memory_limit,
uint32_t size, qsort_cmp2 compare, bool with_delete,
tree_element_free free_element, void *custom_arg);
bool is_inited()
{
return this->root != 0;
}
void delete_tree();
void reset_tree();
// element methods
Tree_Element *tree_insert(void *key, uint32_t key_size, void *custom_arg);
int tree_walk(tree_walk_action action, void *argument, TREE_WALK visit);
private:
void free_tree(myf free_flags);
void* element_key(Tree_Element* element);
void delete_tree_element(Tree_Element* element);
int tree_walk_left_root_right(Tree_Element* element, tree_walk_action action, void* argument);
int tree_walk_right_root_left(Tree_Element* element, tree_walk_action action, void* argument);
void left_rotate(Tree_Element **parent,Tree_Element *element);
void right_rotate(Tree_Element **parent, Tree_Element *element);
void rb_insert(Tree_Element ***parent, Tree_Element *element);
};
} /* namespace drizzled */
|