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
|
#ifndef _PTREE_H_
#define _PTREE_H_
typedef struct ptree_node ptree_node_t;
typedef enum {
PTREE_PREORDER = 1,
PTREE_INORDER = 2,
PTREE_POSTORDER = 3
} ptree_order_t;
typedef enum {
PTREE_WALK_STOP = 0,
PTREE_WALK_CONTINUE = 1
} ptree_walk_res_t;
int ptree_contains(void *v, ptree_node_t *root, int(*)(const void *sv,
const void *tv), void **nodeval);
int ptree_remove(void *v, ptree_node_t **root, int(*)(const void *sv,
const void *tv), void **oltval);
int ptree_replace(void *v, ptree_node_t **root, int(*)(const void *sv,
const void *tv), void **oltval);
void ptree_clear(ptree_node_t **root);
ptree_walk_res_t
ptree_walk(ptree_node_t *start,
ptree_order_t order,
ptree_walk_res_t (*func)(const void *v1, int level, void *arg, void *ptree_inorder_walking_remove_arg),
int (*cmp)(const void *v1, const void *v2),
void *arg);
int ptree_inorder_walk_remove(ptree_node_t **rootp, void **oldval, void *piwra,
int (*cmp)(const void *v1, const void *v2));
#endif
|
