| rev |
line source |
|
nuclear@21
|
1 #ifndef RBTREE_H_
|
|
nuclear@21
|
2 #define RBTREE_H_
|
|
nuclear@21
|
3
|
|
nuclear@21
|
4 struct rbtree;
|
|
nuclear@21
|
5
|
|
nuclear@21
|
6
|
|
nuclear@21
|
7 struct rbnode {
|
|
nuclear@21
|
8 void *key, *data;
|
|
nuclear@21
|
9 int red;
|
|
nuclear@21
|
10 struct rbnode *left, *right;
|
|
nuclear@21
|
11 struct rbnode *next; /* for iterator stack */
|
|
nuclear@21
|
12 };
|
|
nuclear@21
|
13
|
|
nuclear@21
|
14
|
|
nuclear@21
|
15 typedef void *(*rb_alloc_func_t)(size_t);
|
|
nuclear@21
|
16 typedef void (*rb_free_func_t)(void*);
|
|
nuclear@21
|
17
|
|
nuclear@21
|
18 typedef int (*rb_cmp_func_t)(const void*, const void*);
|
|
nuclear@21
|
19 typedef void (*rb_del_func_t)(struct rbnode*, void*);
|
|
nuclear@21
|
20
|
|
nuclear@21
|
21 #define RB_KEY_ADDR (rb_cmp_func_t)(0)
|
|
nuclear@21
|
22 #define RB_KEY_INT (rb_cmp_func_t)(1)
|
|
nuclear@21
|
23 #define RB_KEY_STRING (rb_cmp_func_t)(3)
|
|
nuclear@21
|
24
|
|
nuclear@21
|
25
|
|
nuclear@21
|
26 #ifdef __cplusplus
|
|
nuclear@21
|
27 extern "C" {
|
|
nuclear@21
|
28 #endif
|
|
nuclear@21
|
29
|
|
nuclear@21
|
30 struct rbtree *rb_create(rb_cmp_func_t cmp_func);
|
|
nuclear@21
|
31 void rb_free(struct rbtree *rb);
|
|
nuclear@21
|
32
|
|
nuclear@21
|
33 int rb_init(struct rbtree *rb, rb_cmp_func_t cmp_func);
|
|
nuclear@21
|
34 void rb_destroy(struct rbtree *rb);
|
|
nuclear@21
|
35
|
|
nuclear@21
|
36 void rb_set_allocator(struct rbtree *rb, rb_alloc_func_t alloc, rb_free_func_t free);
|
|
nuclear@21
|
37 void rb_set_compare_func(struct rbtree *rb, rb_cmp_func_t func);
|
|
nuclear@21
|
38 void rb_set_delete_func(struct rbtree *rb, rb_del_func_t func, void *cls);
|
|
nuclear@21
|
39 /* TODO add user deep copy function */
|
|
nuclear@21
|
40
|
|
nuclear@21
|
41 void rb_clear(struct rbtree *rb);
|
|
nuclear@21
|
42 int rb_copy(struct rbtree *dest, struct rbtree *src);
|
|
nuclear@21
|
43
|
|
nuclear@21
|
44 int rb_size(struct rbtree *rb);
|
|
nuclear@21
|
45
|
|
nuclear@21
|
46 int rb_insert(struct rbtree *rb, void *key, void *data);
|
|
nuclear@21
|
47 int rb_inserti(struct rbtree *rb, int key, void *data);
|
|
nuclear@21
|
48
|
|
nuclear@21
|
49 int rb_delete(struct rbtree *rb, void *key);
|
|
nuclear@21
|
50 int rb_deletei(struct rbtree *rb, int key);
|
|
nuclear@21
|
51
|
|
nuclear@21
|
52 void *rb_find(struct rbtree *rb, void *key);
|
|
nuclear@21
|
53 void *rb_findi(struct rbtree *rb, int key);
|
|
nuclear@21
|
54
|
|
nuclear@21
|
55 void rb_foreach(struct rbtree *rb, void (*func)(struct rbnode*, void*), void *cls);
|
|
nuclear@21
|
56
|
|
nuclear@21
|
57 struct rbnode *rb_root(struct rbtree *rb);
|
|
nuclear@21
|
58
|
|
nuclear@21
|
59 void rb_begin(struct rbtree *rb);
|
|
nuclear@21
|
60 struct rbnode *rb_next(struct rbtree *rb);
|
|
nuclear@21
|
61
|
|
nuclear@21
|
62 void *rb_node_key(struct rbnode *node);
|
|
nuclear@21
|
63 int rb_node_keyi(struct rbnode *node);
|
|
nuclear@21
|
64 void *rb_node_data(struct rbnode *node);
|
|
nuclear@21
|
65
|
|
nuclear@21
|
66 #ifdef __cplusplus
|
|
nuclear@21
|
67 }
|
|
nuclear@21
|
68 #endif
|
|
nuclear@21
|
69
|
|
nuclear@21
|
70
|
|
nuclear@21
|
71 #endif /* RBTREE_H_ */
|
