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
|
/*
* Revision Control Information
*
* $Source: /vol/opua/opua2/sis/sis-1.2/common/src/sis/avl/RCS/avl.h,v $
* $Author: sis $
* $Revision: 1.3 $
* $Date: 1994/07/15 23:00:40 $
*
*/
#ifndef ABC__misc__avl__avl_h
#define ABC__misc__avl__avl_h
ABC_NAMESPACE_HEADER_START
#define EXTERN
#ifndef ARGS
#define ARGS(protos) protos
#endif
#define MAX(a,b) ((a) > (b) ? (a) : (b))
#define NIL(type) \
((type *) 0)
#define ALLOC(type, num) \
((type *) malloc(sizeof(type) * (num)))
#define REALLOC(type, obj, num) \
((type *) realloc((char *) obj, sizeof(type) * (num)))
#define FREE(obj) \
free((char *) (obj))
typedef struct avl_node_struct avl_node;
struct avl_node_struct {
avl_node *left, *right;
char *key;
char *value;
int height;
};
typedef struct avl_tree_struct avl_tree;
struct avl_tree_struct {
avl_node *root;
int (*compar)();
int num_entries;
int modified;
};
typedef struct avl_generator_struct avl_generator;
struct avl_generator_struct {
avl_tree *tree;
avl_node **nodelist;
int count;
};
#define AVL_FORWARD 0
#define AVL_BACKWARD 1
EXTERN avl_tree *avl_init_table ARGS((int (*)()));
EXTERN int avl_delete ARGS((avl_tree *, char **, char **));
EXTERN int avl_insert ARGS((avl_tree *, char *, char *));
EXTERN int avl_lookup ARGS((avl_tree *, char *, char **));
EXTERN int avl_first ARGS((avl_tree *, char **, char **));
EXTERN int avl_last ARGS((avl_tree *, char **, char **));
EXTERN int avl_find_or_add ARGS((avl_tree *, char *, char ***));
EXTERN int avl_count ARGS((avl_tree *));
EXTERN int avl_numcmp ARGS((char *, char *));
EXTERN int avl_gen ARGS((avl_generator *, char **, char **));
EXTERN void avl_foreach ARGS((avl_tree *, void (*)(), int));
EXTERN void avl_free_table ARGS((avl_tree *, void (*)(), void (*)()));
EXTERN void avl_free_gen ARGS((avl_generator *));
EXTERN avl_generator *avl_init_gen ARGS((avl_tree *, int));
#define avl_is_member(tree, key) avl_lookup(tree, key, (char **) 0)
#define avl_foreach_item(table, gen, dir, key_p, value_p) \
for(gen = avl_init_gen(table, dir); \
avl_gen(gen, key_p, value_p) || (avl_free_gen(gen),0);)
ABC_NAMESPACE_HEADER_END
#endif
|
