Home
last modified time | relevance | path

Searched refs:avl_tree (Results 1 – 25 of 376) sorted by relevance

12345678910>>...16

/dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/mplibdir/
H A Davl.h16 #define avl_tree mp_avl_tree macro
123 avl_reset(avl_tree t,
135 void avl_empty(avl_tree t);
142 void avl_destroy(avl_tree t);
150 avl_tree avl_dup(avl_tree t, void *param);
172 void *avl_first(avl_tree t);
180 void *avl_last(avl_tree t);
318 void avl_cat(avl_tree t0, avl_tree t1);
332 avl_code_t avl_split(const void *item, avl_tree t, avl_tree t0, avl_tree t1);
352 avl_tree
[all …]
/dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/mplibdir/
H A Davl.h16 #define avl_tree mp_avl_tree macro
123 avl_reset(avl_tree t,
135 void avl_empty(avl_tree t);
142 void avl_destroy(avl_tree t);
150 avl_tree avl_dup(avl_tree t, void *param);
172 void *avl_first(avl_tree t);
180 void *avl_last(avl_tree t);
318 void avl_cat(avl_tree t0, avl_tree t1);
332 avl_code_t avl_split(const void *item, avl_tree t, avl_tree t0, avl_tree t1);
352 avl_tree
[all …]
/dports/japanese/tex-ptex/texlive-20150521-source/texk/web2c/mplibdir/
H A Davl.h16 #define avl_tree mp_avl_tree macro
123 avl_reset(avl_tree t,
135 void avl_empty(avl_tree t);
142 void avl_destroy(avl_tree t);
150 avl_tree avl_dup(avl_tree t, void *param);
172 void *avl_first(avl_tree t);
180 void *avl_last(avl_tree t);
318 void avl_cat(avl_tree t0, avl_tree t1);
332 avl_code_t avl_split(const void *item, avl_tree t, avl_tree t0, avl_tree t1);
352 avl_tree
[all …]
/dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/mplibdir/
H A Davl.h16 #define avl_tree mp_avl_tree macro
123 avl_reset(avl_tree t,
135 void avl_empty(avl_tree t);
142 void avl_destroy(avl_tree t);
150 avl_tree avl_dup(avl_tree t, void *param);
172 void *avl_first(avl_tree t);
180 void *avl_last(avl_tree t);
318 void avl_cat(avl_tree t0, avl_tree t1);
332 avl_code_t avl_split(const void *item, avl_tree t, avl_tree t0, avl_tree t1);
352 avl_tree
[all …]
/dports/print/tex-aleph/texlive-20150521-source/texk/web2c/mplibdir/
H A Davl.h16 #define avl_tree mp_avl_tree macro
123 avl_reset(avl_tree t,
135 void avl_empty(avl_tree t);
142 void avl_destroy(avl_tree t);
150 avl_tree avl_dup(avl_tree t, void *param);
172 void *avl_first(avl_tree t);
180 void *avl_last(avl_tree t);
318 void avl_cat(avl_tree t0, avl_tree t1);
332 avl_code_t avl_split(const void *item, avl_tree t, avl_tree t0, avl_tree t1);
352 avl_tree
[all …]
/dports/print/tex-luatex/texlive-20150521-source/texk/web2c/mplibdir/
H A Davl.h16 #define avl_tree mp_avl_tree macro
123 avl_reset(avl_tree t,
135 void avl_empty(avl_tree t);
142 void avl_destroy(avl_tree t);
150 avl_tree avl_dup(avl_tree t, void *param);
172 void *avl_first(avl_tree t);
180 void *avl_last(avl_tree t);
318 void avl_cat(avl_tree t0, avl_tree t1);
332 avl_code_t avl_split(const void *item, avl_tree t, avl_tree t0, avl_tree t1);
352 avl_tree
[all …]
/dports/print/tex-xetex/texlive-20150521-source/texk/web2c/mplibdir/
H A Davl.h16 #define avl_tree mp_avl_tree macro
123 avl_reset(avl_tree t,
135 void avl_empty(avl_tree t);
142 void avl_destroy(avl_tree t);
150 avl_tree avl_dup(avl_tree t, void *param);
172 void *avl_first(avl_tree t);
180 void *avl_last(avl_tree t);
318 void avl_cat(avl_tree t0, avl_tree t1);
332 avl_code_t avl_split(const void *item, avl_tree t, avl_tree t0, avl_tree t1);
352 avl_tree
[all …]
/dports/devel/libavl/avl-1.4.0/
H A Davl.h69 typedef struct avl_tree struct
79 avl_tree; argument
89 void avl_destroy (avl_tree *, avl_node_func);
90 void avl_free (avl_tree *);
91 int avl_count (const avl_tree *);
92 avl_tree *avl_copy (MAYBE_ARENA const avl_tree *, avl_copy_func);
100 void **avl_probe (avl_tree *, void *);
101 void *avl_delete (avl_tree *, const void *);
107 avl_insert (avl_tree *tree, void *item) in avl_insert()
114 avl_replace (avl_tree *tree, void *item) in avl_replace()
[all …]
/dports/audio/icecast-kh/icecast-kh-icecast-2.4.0-kh15/src/avl/
H A Davl.h102 } avl_tree; typedef
113 avl_tree * tree,
118 avl_tree * ob,
123 avl_tree * tree,
129 avl_tree * tree,
135 avl_tree * tree,
141 avl_tree * tree,
147 avl_tree * tree,
155 avl_tree * tree,
162 avl_tree * tree,
[all …]
/dports/audio/icecast/icecast-2.4.4/src/avl/
H A Davl.h104 } avl_tree; typedef
110 avl_tree * tree,
115 avl_tree * ob,
120 avl_tree * tree,
126 avl_tree * tree,
132 avl_tree * tree,
138 avl_tree * tree,
144 avl_tree * tree,
152 avl_tree * tree,
159 avl_tree * tree,
[all …]
/dports/audio/ices/ices-2.0.3/src/common/avl/
H A Davl.h104 } avl_tree; typedef
110 avl_tree * tree,
115 avl_tree * ob,
120 avl_tree * tree,
126 avl_tree * tree,
132 avl_tree * tree,
138 avl_tree * tree,
144 avl_tree * tree,
152 avl_tree * tree,
159 avl_tree * tree,
[all …]
/dports/audio/mixxx/mixxx-2.3.0/lib/libshout-idjc/src/common/avl/
H A Davl.h104 } avl_tree; typedef
110 avl_tree * tree,
115 avl_tree * ob,
120 avl_tree * tree,
126 avl_tree * tree,
132 avl_tree * tree,
138 avl_tree * tree,
144 avl_tree * tree,
152 avl_tree * tree,
159 avl_tree * tree,
[all …]
/dports/audio/libshout/libshout-2.4.5/src/common/avl/
H A Davl.h105 } avl_tree; typedef
111 avl_tree * tree,
116 avl_tree * ob,
121 avl_tree * tree,
127 avl_tree * tree,
133 avl_tree * tree,
139 avl_tree * tree,
145 avl_tree * tree,
153 avl_tree * tree,
160 avl_tree * tree,
[all …]
/dports/dns/yadifa/yadifa-2.5.3-10333/lib/dnsdb/include/dnsdb/
H A Davl.h173 typedef avl_node* avl_tree; typedef
192 void avl_init(avl_tree* tree);
204 void* avl_find(avl_tree* tree, hashcode obj_hash);
210 avl_find(const avl_tree* root, hashcode obj_hash) in avl_find()
252 void** avl_findp(avl_tree* tree, hashcode obj_hash);
255 avl_findp(const avl_tree* root, hashcode obj_hash) in avl_findp()
298 void** avl_insert(avl_tree* tree, hashcode obj_hash);
310 void* avl_delete(avl_tree* tree, hashcode obj_hash);
319 void avl_destroy(avl_tree* tree);
374 ya_result avl_check(avl_tree tree);
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/avl/
H A Davl.h45 typedef struct avl_tree_struct avl_tree; typedef
56 avl_tree *tree;
66 EXTERN avl_tree *avl_init_table ARGS((int (*)()));
67 EXTERN int avl_delete ARGS((avl_tree *, char **, char **));
68 EXTERN int avl_insert ARGS((avl_tree *, char *, char *));
69 EXTERN int avl_lookup ARGS((avl_tree *, char *, char **));
70 EXTERN int avl_first ARGS((avl_tree *, char **, char **));
71 EXTERN int avl_last ARGS((avl_tree *, char **, char **));
73 EXTERN int avl_count ARGS((avl_tree *));
76 EXTERN void avl_foreach ARGS((avl_tree *, void (*)(), int));
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/Common/
H A Davl.h40 typedef struct avl_tree_struct avl_tree; typedef
51 avl_tree *tree;
89 inline void avl_foreach(avl_tree *tree, void (*func)(void *key, void *value), int direction) in avl_foreach()
98 avl_tree *avl_init_table(int (*compar)(const void *key1, const void *key2));
99 int avl_lookup(avl_tree *tree, void *key, void **value_p);
100 int avl_insert(avl_tree *tree, void *key, void *value);
101 int avl_delete(avl_tree *tree, void **key_p, void **value_p);
103 int avl_count(avl_tree *tree);
104 int avl_check_tree(avl_tree *tree);
105 int avl_extremum(avl_tree *tree, int side, void **value_p);
[all …]
/dports/science/getdp/getdp-3.4.0-source/Common/
H A Davl.h40 typedef struct avl_tree_struct avl_tree; typedef
51 avl_tree *tree;
89 inline void avl_foreach(avl_tree *tree, void (*func)(void *key, void *value), int direction) in avl_foreach()
98 avl_tree *avl_init_table(int (*compar)(const void *key1, const void *key2));
99 int avl_lookup(avl_tree *tree, void *key, void **value_p);
100 int avl_insert(avl_tree *tree, void *key, void *value);
101 int avl_delete(avl_tree *tree, void **key_p, void **value_p);
103 int avl_count(avl_tree *tree);
104 int avl_check_tree(avl_tree *tree);
105 int avl_extremum(avl_tree *tree, int side, void **value_p);
[all …]
/dports/www/p5-HTML5-DOM/HTML5-DOM-1.25/third_party/modest/source/mycore/utils/
H A Davl_tree.c28 mystatus_t mycore_utils_avl_tree_init(mycore_utils_avl_tree_t* avl_tree) in mycore_utils_avl_tree_init() argument
31 avl_tree->mc_nodes = mcobject_create(); in mycore_utils_avl_tree_init()
32 if(avl_tree->mc_nodes == NULL) in mycore_utils_avl_tree_init()
42 void mycore_utils_avl_tree_clean(mycore_utils_avl_tree_t* avl_tree) in mycore_utils_avl_tree_clean() argument
44 mcobject_clean(avl_tree->mc_nodes); in mycore_utils_avl_tree_clean()
49 if(avl_tree == NULL) in mycore_utils_avl_tree_destroy()
52 mcobject_destroy(avl_tree->mc_nodes, true); in mycore_utils_avl_tree_destroy()
55 mycore_free(avl_tree); in mycore_utils_avl_tree_destroy()
59 return avl_tree; in mycore_utils_avl_tree_destroy()
190 *root = mycore_utils_avl_tree_node_create_root(avl_tree, type, value); in mycore_utils_avl_tree_add()
[all …]
H A Davl_tree.h52 mystatus_t mycore_utils_avl_tree_init(mycore_utils_avl_tree_t* avl_tree);
53 void mycore_utils_avl_tree_clean(mycore_utils_avl_tree_t* avl_tree);
54 mycore_utils_avl_tree_t * mycore_utils_avl_tree_destroy(mycore_utils_avl_tree_t* avl_tree, bool sel…
56 …ode_t * mycore_utils_avl_tree_node_create_root(mycore_utils_avl_tree_t* avl_tree, size_t type, voi…
58 void mycore_utils_avl_tree_add(mycore_utils_avl_tree_t* avl_tree, mycore_utils_avl_tree_node_t** ro…
59 void * mycore_utils_avl_tree_delete(mycore_utils_avl_tree_t *avl_tree, mycore_utils_avl_tree_node_t…
60 …_node_t * mycore_utils_avl_tree_search_by_type(mycore_utils_avl_tree_t *avl_tree, mycore_utils_avl…
62 void mycore_utils_avl_tree_list_all_nodes(mycore_utils_avl_tree_t *avl_tree, mycore_utils_avl_tree_…
/dports/www/p5-HTML5-DOM/HTML5-DOM-1.25/third_party/modest/include/mycore/utils/
H A Davl_tree.h52 mystatus_t mycore_utils_avl_tree_init(mycore_utils_avl_tree_t* avl_tree);
53 void mycore_utils_avl_tree_clean(mycore_utils_avl_tree_t* avl_tree);
54 mycore_utils_avl_tree_t * mycore_utils_avl_tree_destroy(mycore_utils_avl_tree_t* avl_tree, bool sel…
56 …ode_t * mycore_utils_avl_tree_node_create_root(mycore_utils_avl_tree_t* avl_tree, size_t type, voi…
58 void mycore_utils_avl_tree_add(mycore_utils_avl_tree_t* avl_tree, mycore_utils_avl_tree_node_t** ro…
59 void * mycore_utils_avl_tree_delete(mycore_utils_avl_tree_t *avl_tree, mycore_utils_avl_tree_node_t…
60 …_node_t * mycore_utils_avl_tree_search_by_type(mycore_utils_avl_tree_t *avl_tree, mycore_utils_avl…
62 void mycore_utils_avl_tree_list_all_nodes(mycore_utils_avl_tree_t *avl_tree, mycore_utils_avl_tree_…
/dports/net/olsrd/olsrd-0.9.8/src/common/
H A Davl.h66 struct avl_tree { struct
77 void avl_init(struct avl_tree *, avl_tree_comp); argument
78 struct avl_node *avl_find(struct avl_tree *, const void *);
79 int avl_insert(struct avl_tree *, struct avl_node *, int);
80 void avl_delete(struct avl_tree *, struct avl_node *);
83 avl_walk_first(struct avl_tree *tree) in avl_walk_first()
92 avl_walk_last(struct avl_tree *tree) in avl_walk_last()
121 avl_walk_first_c(const struct avl_tree *tree) in avl_walk_first_c()
130 avl_walk_last_c(const struct avl_tree *tree) in avl_walk_last_c()
/dports/databases/grass7/grass-7.8.6/raster/r.li/r.li.daemon/
H A Davl.h24 typedef avl_node *avl_tree; typedef
36 avl_tree avl_make(const generic_cell k, const long n);
37 void avl_destroy(avl_tree root);
38 avl_node *avl_find(const avl_tree root, const generic_cell k);
39 int avl_add(avl_tree * root, const generic_cell k, const long n);
41 long howManyCell(const avl_tree root, const generic_cell k);
/dports/databases/slony1v2/slony1-2.2.10/src/backend/
H A DMakefile49 $(NAME).o: $(NAME).c avl_tree.c avl_tree.h
51 avl_tree.c: ../misc/avl_tree.c
54 avl_tree.h: ../misc/avl_tree.h
58 rm -f $(SO_NAME) $(SO_OBJS) avl_tree.c avl_tree.h
/dports/devel/boost-docs/boost_1_72_0/libs/container/bench/
H A Dbench_set_avl.cpp24 …int, std::less<int>, std::allocator<int>, tree_assoc_options< tree_type<avl_tree> >::type >, set<i… in main()
26 …td::less<string>, std::allocator<string>, tree_assoc_options< tree_type<avl_tree> >::type >, set<s… in main()
30 …ts< set<int, std::less<int>, std::allocator<int>, tree_assoc_options< tree_type<avl_tree> >::type > in main()
31 …int, std::less<int>, std::allocator<int>, tree_assoc_options< tree_type<avl_tree>, optimize_size<f… in main()
33 …tring, std::less<string>, std::allocator<string>, tree_assoc_options< tree_type<avl_tree> >::type > in main()
34 …td::less<string>, std::allocator<string>, tree_assoc_options< tree_type<avl_tree>, optimize_size<f… in main()
/dports/devel/boost-python-libs/boost_1_72_0/libs/container/bench/
H A Dbench_set_avl.cpp24 …int, std::less<int>, std::allocator<int>, tree_assoc_options< tree_type<avl_tree> >::type >, set<i… in main()
26 …td::less<string>, std::allocator<string>, tree_assoc_options< tree_type<avl_tree> >::type >, set<s… in main()
30 …ts< set<int, std::less<int>, std::allocator<int>, tree_assoc_options< tree_type<avl_tree> >::type > in main()
31 …int, std::less<int>, std::allocator<int>, tree_assoc_options< tree_type<avl_tree>, optimize_size<f… in main()
33 …tring, std::less<string>, std::allocator<string>, tree_assoc_options< tree_type<avl_tree> >::type > in main()
34 …td::less<string>, std::allocator<string>, tree_assoc_options< tree_type<avl_tree>, optimize_size<f… in main()

12345678910>>...16