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