/dports/textproc/html2text/html2text-1.3.2a/libstd/include/ |
H A D | set | 48 #include "../rb_tree.h" 193 if (rb_tree::find_any((value_pointer) &x) != rb_tree::end()) { 215 rb_tree::swap((rb_tree &) x); 261 return rb_tree::operator==((const rb_tree &) x); 264 return rb_tree::operator<((const rb_tree &) x); 289 /*virtual*/ rb_tree::node_type *copy_node(const rb_tree::node_type *n) const { 310 static rb_tree::node_type *copy_node2(const rb_tree::node_type *n) { 399 rb_tree::swap((rb_tree &) x); 442 return rb_tree::operator==((const rb_tree &) x); 445 return rb_tree::operator<((const rb_tree &) x); [all …]
|
H A D | map | 48 #include "../rb_tree.h" 197 rb_tree::node_type *n = rb_tree::find_any((value_pointer) &x); 208 if (rb_tree::find_any((value_pointer) &x.first) != rb_tree::end()) { 230 rb_tree::swap((rb_tree &) x); 276 return rb_tree::operator==((const rb_tree &) x); 279 return rb_tree::operator<((const rb_tree &) x); 339 static rb_tree::node_type *copy_node2(const rb_tree::node_type *n) { 431 rb_tree::swap((rb_tree &) x); 475 return rb_tree::operator==((const rb_tree &) x); 478 return rb_tree::operator<((const rb_tree &) x); [all …]
|
/dports/devel/libavl/avl-1.4.0/ |
H A D | rb.h | 76 typedef struct rb_tree struct 86 rb_tree; argument 96 void rb_destroy (rb_tree *, avl_node_func); 97 void rb_free (rb_tree *); 98 int rb_count (const rb_tree *); 99 rb_tree *rb_copy (MAYBE_ARENA const rb_tree *, avl_copy_func); 107 void **rb_probe (rb_tree *, void *); 108 void *rb_delete (rb_tree *, const void *); 114 rb_insert (rb_tree *tree, void *item) in rb_insert() 121 rb_replace (rb_tree *tree, void *item) in rb_replace() [all …]
|
/dports/math/R-cran-nloptr/nloptr/src/nlopt_src/util/ |
H A D | redblack.h | 50 } rb_tree; typedef 53 extern void rb_tree_destroy(rb_tree *t); 54 extern void rb_tree_destroy_with_keys(rb_tree *t); 55 extern rb_node *rb_tree_insert(rb_tree *t, rb_key k); 56 extern int rb_tree_check(rb_tree *t); 57 extern rb_node *rb_tree_find(rb_tree *t, rb_key k); 58 extern rb_node *rb_tree_find_le(rb_tree *t, rb_key k); 59 extern rb_node *rb_tree_find_lt(rb_tree *t, rb_key k); 60 extern rb_node *rb_tree_find_gt(rb_tree *t, rb_key k); 62 extern rb_node *rb_tree_min(rb_tree *t); [all …]
|
H A D | redblack.c | 49 void rb_tree_destroy(rb_tree *t) in rb_tree_destroy() 55 void rb_tree_destroy_with_keys(rb_tree *t) in rb_tree_destroy_with_keys() 65 static void rotate_left(rb_node *p, rb_tree *t) in rotate_left() 81 static void rotate_right(rb_node *p, rb_tree *t) in rotate_right() 97 static void insert_node(rb_tree *t, rb_node *n) in insert_node() 162 rb_node *rb_tree_insert(rb_tree *t, rb_key k) in rb_tree_insert() 192 int rb_tree_check(rb_tree *t) in rb_tree_check() 202 rb_node *rb_tree_find(rb_tree *t, rb_key k) in rb_tree_find() 231 rb_node *rb_tree_find_le(rb_tree *t, rb_key k) in rb_tree_find_le() 280 rb_node *rb_tree_min(rb_tree *t) in rb_tree_min() [all …]
|
/dports/math/nlopt/nlopt-2.7.1/src/util/ |
H A D | redblack.h | 49 } rb_tree; typedef 52 extern void nlopt_rb_tree_destroy(rb_tree * t); 53 extern void nlopt_rb_tree_destroy_with_keys(rb_tree * t); 54 extern rb_node *nlopt_rb_tree_insert(rb_tree * t, rb_key k); 55 extern int nlopt_rb_tree_check(rb_tree * t); 56 extern rb_node *nlopt_rb_tree_find(rb_tree * t, rb_key k); 57 extern rb_node *nlopt_rb_tree_find_le(rb_tree * t, rb_key k); 58 extern rb_node *nlopt_rb_tree_find_lt(rb_tree * t, rb_key k); 59 extern rb_node *nlopt_rb_tree_find_gt(rb_tree * t, rb_key k); 61 extern rb_node *nlopt_rb_tree_min(rb_tree * t); [all …]
|
H A D | redblack.c | 36 void nlopt_rb_tree_init(rb_tree * t, rb_compare compare) in nlopt_rb_tree_init() 52 void nlopt_rb_tree_destroy(rb_tree * t) in nlopt_rb_tree_destroy() 58 void nlopt_rb_tree_destroy_with_keys(rb_tree * t) in nlopt_rb_tree_destroy_with_keys() 69 static void rotate_left(rb_node * p, rb_tree * t) in rotate_left() 87 static void rotate_right(rb_node * p, rb_tree * t) in rotate_right() 105 static void insert_node(rb_tree * t, rb_node * n) in insert_node() 169 rb_node *nlopt_rb_tree_insert(rb_tree * t, rb_key k) in nlopt_rb_tree_insert() 209 int nlopt_rb_tree_check(rb_tree * t) in nlopt_rb_tree_check() 223 rb_node *nlopt_rb_tree_find(rb_tree * t, rb_key k) in nlopt_rb_tree_find() 305 rb_node *nlopt_rb_tree_min(rb_tree * t) in nlopt_rb_tree_min() [all …]
|
/dports/net-p2p/uhub/uhub-a8ee6e7/src/util/ |
H A D | rbtree.h | 42 struct rb_tree struct 62 extern struct rb_tree* rb_tree_create(rb_tree_compare compare, rb_tree_alloc alloc, rb_tree_free de… argument 68 extern void rb_tree_destroy(struct rb_tree*); 74 extern int rb_tree_insert(struct rb_tree* tree, const void* key, const void* data); 83 extern int rb_tree_remove(struct rb_tree* tree, const void* key); 90 extern int rb_tree_remove_node(struct rb_tree* tree, const void* key, rb_tree_free_node free); 95 extern void* rb_tree_get(struct rb_tree* tree, const void* key); 100 extern size_t rb_tree_size(struct rb_tree* tree); 117 extern struct rb_node* rb_tree_first(struct rb_tree* tree); 123 extern struct rb_node* rb_tree_next(struct rb_tree* tree); [all …]
|
H A D | rbtree.c | 55 int rb_tree_check(struct rb_tree* tree, struct rb_node* node) in rb_tree_check() 160 struct rb_tree* tree = a ? a(sizeof(struct rb_tree)) : hub_malloc(sizeof(struct rb_tree)); in rb_tree_create() 172 void rb_tree_destroy(struct rb_tree* tree) in rb_tree_destroy() 195 int rb_tree_remove(struct rb_tree* tree, const void* key) in rb_tree_remove() 289 void* rb_tree_get(struct rb_tree* tree, const void* key) in rb_tree_get() 297 size_t rb_tree_size(struct rb_tree* tree) in rb_tree_size() 302 static void push(struct rb_tree* tree, struct rb_node* n) in push() 307 static struct rb_node* pop(struct rb_tree* tree) in pop() 321 struct rb_node* rb_tree_first(struct rb_tree* tree) in rb_tree_first() 372 struct rb_node* rb_tree_next(struct rb_tree* tree) in rb_tree_next() [all …]
|
/dports/textproc/html2text/html2text-1.3.2a/libstd/ |
H A D | rb_tree.C | 51 rb_tree::rb_tree( in rb_tree() function 66 rb_tree::node_type * 67 rb_tree::begin() in begin() 86 rb_tree::node_type * 98 rb_tree::node_type * 127 rb_tree::size_type 142 rb_tree::node_type * 167 rb_tree::node_type * 193 rb_tree::check( in check() 511 rb_tree::size_type [all …]
|
H A D | rb_tree.h | 61 class rb_tree { 89 rb_tree() : root(0) {} in rb_tree() function 90 rb_tree( 95 rb_tree(const rb_tree &x) : in rb_tree() function 100 const rb_tree &operator=(const rb_tree &); 128 void swap(rb_tree &x); 136 { return ((rb_tree *) this)->find_first(vp); } in find_first() 139 { return ((rb_tree *) this)->find_any(vp); } in find_any() 144 { return ((rb_tree *) this)->lower_bound(vp); } in lower_bound() 149 bool operator==(const rb_tree &x) const; [all …]
|
/dports/sysutils/fluent-bit/fluent-bit-1.8.11/lib/monkey/deps/rbtree/ |
H A D | rbtree.h | 115 struct rb_tree { 229 rb_result_t rb_tree_new(struct rb_tree *tree, 241 rb_result_t rb_tree_destroy(struct rb_tree *tree); 262 rb_result_t rb_tree_find(struct rb_tree *tree, 276 rb_result_t rb_tree_insert(struct rb_tree *tree, 288 rb_result_t rb_tree_remove(struct rb_tree *tree, 306 rb_result_t rb_tree_find_or_insert(struct rb_tree *tree, 327 rb_result_t rb_tree_find_or_insert(struct rb_tree *tree, 336 rb_result_t rb_tree_get_rightmost(struct rb_tree *tree, 389 rb_result_t rb_tree_find_successor(struct rb_tree *tree, [all …]
|
/dports/sysutils/fluent-bit/fluent-bit-1.8.11/lib/rbtree/ |
H A D | rbtree.h | 115 struct rb_tree { struct 229 rb_result_t rb_tree_new(struct rb_tree *tree, 241 rb_result_t rb_tree_destroy(struct rb_tree *tree); 262 rb_result_t rb_tree_find(struct rb_tree *tree, 276 rb_result_t rb_tree_insert(struct rb_tree *tree, 288 rb_result_t rb_tree_remove(struct rb_tree *tree, 306 rb_result_t rb_tree_find_or_insert(struct rb_tree *tree, 327 rb_result_t rb_tree_find_or_insert(struct rb_tree *tree, 336 rb_result_t rb_tree_get_rightmost(struct rb_tree *tree, in rb_tree_get_rightmost() 389 rb_result_t rb_tree_find_successor(struct rb_tree *tree, in rb_tree_find_successor() [all …]
|
/dports/audio/moc/moc-2.5.2/ |
H A D | rbtree.h | 19 struct rb_tree struct 33 void rb_clear (struct rb_tree *t); argument 34 void rb_init_tree (struct rb_tree *t, 39 void rb_delete (struct rb_tree *t, const void *key); 41 struct rb_node *rb_min (struct rb_tree *t); 43 struct rb_node *rb_search (struct rb_tree *t, const void *key); 44 void rb_insert (struct rb_tree *t, void *data);
|
/dports/graphics/libosmesa-gallium/mesa-21.3.6/src/util/ |
H A D | rb_tree.h | 66 struct rb_tree { struct 71 void rb_tree_init(struct rb_tree *T); argument 75 rb_tree_is_empty(const struct rb_tree *T) in rb_tree_is_empty() 107 void rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, 119 rb_tree_insert(struct rb_tree *T, struct rb_node *node, in rb_tree_insert() 146 void rb_tree_remove(struct rb_tree *T, struct rb_node *z); 160 rb_tree_search(struct rb_tree *T, const void *key, in rb_tree_search() 196 rb_tree_search_sloppy(struct rb_tree *T, const void *key, in rb_tree_search_sloppy() 219 struct rb_node *rb_tree_first(struct rb_tree *T); 222 struct rb_node *rb_tree_last(struct rb_tree *T); [all …]
|
/dports/lang/clover/mesa-21.3.6/src/util/ |
H A D | rb_tree.h | 66 struct rb_tree { struct 71 void rb_tree_init(struct rb_tree *T); argument 75 rb_tree_is_empty(const struct rb_tree *T) in rb_tree_is_empty() 107 void rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, 119 rb_tree_insert(struct rb_tree *T, struct rb_node *node, in rb_tree_insert() 146 void rb_tree_remove(struct rb_tree *T, struct rb_node *z); 160 rb_tree_search(struct rb_tree *T, const void *key, in rb_tree_search() 196 rb_tree_search_sloppy(struct rb_tree *T, const void *key, in rb_tree_search_sloppy() 219 struct rb_node *rb_tree_first(struct rb_tree *T); 222 struct rb_node *rb_tree_last(struct rb_tree *T); [all …]
|
/dports/graphics/libosmesa/mesa-21.3.6/src/util/ |
H A D | rb_tree.h | 66 struct rb_tree { struct 71 void rb_tree_init(struct rb_tree *T); argument 75 rb_tree_is_empty(const struct rb_tree *T) in rb_tree_is_empty() 107 void rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, 119 rb_tree_insert(struct rb_tree *T, struct rb_node *node, in rb_tree_insert() 146 void rb_tree_remove(struct rb_tree *T, struct rb_node *z); 160 rb_tree_search(struct rb_tree *T, const void *key, in rb_tree_search() 196 rb_tree_search_sloppy(struct rb_tree *T, const void *key, in rb_tree_search_sloppy() 219 struct rb_node *rb_tree_first(struct rb_tree *T); 222 struct rb_node *rb_tree_last(struct rb_tree *T); [all …]
|
/dports/graphics/mesa-libs/mesa-21.3.6/src/util/ |
H A D | rb_tree.h | 66 struct rb_tree { struct 71 void rb_tree_init(struct rb_tree *T); argument 75 rb_tree_is_empty(const struct rb_tree *T) in rb_tree_is_empty() 107 void rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, 119 rb_tree_insert(struct rb_tree *T, struct rb_node *node, in rb_tree_insert() 146 void rb_tree_remove(struct rb_tree *T, struct rb_node *z); 160 rb_tree_search(struct rb_tree *T, const void *key, in rb_tree_search() 196 rb_tree_search_sloppy(struct rb_tree *T, const void *key, in rb_tree_search_sloppy() 219 struct rb_node *rb_tree_first(struct rb_tree *T); 222 struct rb_node *rb_tree_last(struct rb_tree *T); [all …]
|
/dports/graphics/mesa-dri-gallium/mesa-21.3.6/src/util/ |
H A D | rb_tree.h | 66 struct rb_tree { struct 71 void rb_tree_init(struct rb_tree *T); argument 75 rb_tree_is_empty(const struct rb_tree *T) in rb_tree_is_empty() 107 void rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, 119 rb_tree_insert(struct rb_tree *T, struct rb_node *node, in rb_tree_insert() 146 void rb_tree_remove(struct rb_tree *T, struct rb_node *z); 160 rb_tree_search(struct rb_tree *T, const void *key, in rb_tree_search() 196 rb_tree_search_sloppy(struct rb_tree *T, const void *key, in rb_tree_search_sloppy() 219 struct rb_node *rb_tree_first(struct rb_tree *T); 222 struct rb_node *rb_tree_last(struct rb_tree *T); [all …]
|
/dports/graphics/mesa-dri-classic/mesa-20.2.3/src/util/ |
H A D | rb_tree.h | 66 struct rb_tree { struct 71 void rb_tree_init(struct rb_tree *T); argument 75 rb_tree_is_empty(const struct rb_tree *T) in rb_tree_is_empty() 107 void rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, 119 rb_tree_insert(struct rb_tree *T, struct rb_node *node, in rb_tree_insert() 146 void rb_tree_remove(struct rb_tree *T, struct rb_node *z); 160 rb_tree_search(struct rb_tree *T, const void *key, in rb_tree_search() 196 rb_tree_search_sloppy(struct rb_tree *T, const void *key, in rb_tree_search_sloppy() 219 struct rb_node *rb_tree_first(struct rb_tree *T); 222 struct rb_node *rb_tree_last(struct rb_tree *T); [all …]
|
/dports/graphics/mesa-gallium-va/mesa-21.3.6/src/util/ |
H A D | rb_tree.h | 66 struct rb_tree { struct 71 void rb_tree_init(struct rb_tree *T); argument 75 rb_tree_is_empty(const struct rb_tree *T) in rb_tree_is_empty() 107 void rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, 119 rb_tree_insert(struct rb_tree *T, struct rb_node *node, in rb_tree_insert() 146 void rb_tree_remove(struct rb_tree *T, struct rb_node *z); 160 rb_tree_search(struct rb_tree *T, const void *key, in rb_tree_search() 196 rb_tree_search_sloppy(struct rb_tree *T, const void *key, in rb_tree_search_sloppy() 219 struct rb_node *rb_tree_first(struct rb_tree *T); 222 struct rb_node *rb_tree_last(struct rb_tree *T); [all …]
|
/dports/graphics/mesa-gallium-vdpau/mesa-21.3.6/src/util/ |
H A D | rb_tree.h | 66 struct rb_tree { struct 71 void rb_tree_init(struct rb_tree *T); argument 75 rb_tree_is_empty(const struct rb_tree *T) in rb_tree_is_empty() 107 void rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, 119 rb_tree_insert(struct rb_tree *T, struct rb_node *node, in rb_tree_insert() 146 void rb_tree_remove(struct rb_tree *T, struct rb_node *z); 160 rb_tree_search(struct rb_tree *T, const void *key, in rb_tree_search() 196 rb_tree_search_sloppy(struct rb_tree *T, const void *key, in rb_tree_search_sloppy() 219 struct rb_node *rb_tree_first(struct rb_tree *T); 222 struct rb_node *rb_tree_last(struct rb_tree *T); [all …]
|
/dports/graphics/mesa-gallium-xa/mesa-21.3.6/src/util/ |
H A D | rb_tree.h | 66 struct rb_tree { struct 71 void rb_tree_init(struct rb_tree *T); argument 75 rb_tree_is_empty(const struct rb_tree *T) in rb_tree_is_empty() 107 void rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, 119 rb_tree_insert(struct rb_tree *T, struct rb_node *node, in rb_tree_insert() 146 void rb_tree_remove(struct rb_tree *T, struct rb_node *z); 160 rb_tree_search(struct rb_tree *T, const void *key, in rb_tree_search() 196 rb_tree_search_sloppy(struct rb_tree *T, const void *key, in rb_tree_search_sloppy() 219 struct rb_node *rb_tree_first(struct rb_tree *T); 222 struct rb_node *rb_tree_last(struct rb_tree *T); [all …]
|
/dports/graphics/mesa-devel/mesa-22.0-branchpoint-2059-ge8a63cf61ec/src/util/ |
H A D | rb_tree.h | 70 struct rb_tree { struct 75 void rb_tree_init(struct rb_tree *T); argument 79 rb_tree_is_empty(const struct rb_tree *T) in rb_tree_is_empty() 111 void rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, 123 rb_tree_insert(struct rb_tree *T, struct rb_node *node, in rb_tree_insert() 150 void rb_tree_remove(struct rb_tree *T, struct rb_node *z); 164 rb_tree_search(struct rb_tree *T, const void *key, in rb_tree_search() 200 rb_tree_search_sloppy(struct rb_tree *T, const void *key, in rb_tree_search_sloppy() 223 struct rb_node *rb_tree_first(struct rb_tree *T); 226 struct rb_node *rb_tree_last(struct rb_tree *T); [all …]
|
/dports/graphics/mesa-dri/mesa-21.3.6/src/util/ |
H A D | rb_tree.h | 66 struct rb_tree { struct 71 void rb_tree_init(struct rb_tree *T); argument 75 rb_tree_is_empty(const struct rb_tree *T) in rb_tree_is_empty() 107 void rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, 119 rb_tree_insert(struct rb_tree *T, struct rb_node *node, in rb_tree_insert() 146 void rb_tree_remove(struct rb_tree *T, struct rb_node *z); 160 rb_tree_search(struct rb_tree *T, const void *key, in rb_tree_search() 196 rb_tree_search_sloppy(struct rb_tree *T, const void *key, in rb_tree_search_sloppy() 219 struct rb_node *rb_tree_first(struct rb_tree *T); 222 struct rb_node *rb_tree_last(struct rb_tree *T); [all …]
|