| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/nasm/include/ |
| H A D | rbtree.h | 42 struct rbtree { struct
44 struct rbtree *left, *right; argument
48 struct rbtree *rb_insert(struct rbtree *, struct rbtree *); argument
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/nasm/include/ |
| H A D | rbtree.h | 42 struct rbtree { struct
44 struct rbtree *left, *right; argument
48 struct rbtree *rb_insert(struct rbtree *, struct rbtree *); argument
|
| /dports/devel/nasm/nasm-2.15.05/include/ |
| H A D | rbtree.h | 42 struct rbtree { struct
44 struct rbtree *left, *right; argument
48 struct rbtree *rb_insert(struct rbtree *, struct rbtree *); argument
|
| /dports/sysutils/syslinux/syslinux-6.03/com32/sysdump/ |
| H A D | rbtree.h | 43 struct rbtree { struct
45 struct rbtree *left, *right; argument
49 struct rbtree *rb_insert(struct rbtree *, struct rbtree *); argument
|
| /dports/dns/nsd/nsd-4.3.9/ |
| H A D | rbtree.h | 33 struct rbtree { struct
49 /* rbtree.c */ argument
64 #define RBTREE_WALK(rbtree, k, d) \ argument
71 #define RBTREE_FOR(node, type, rbtree) \ argument
|
| H A D | rbtree.c | 42 rbtree_type *rbtree; in rbtree_create() local
64 rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node) in rbtree_rotate_left()
91 rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node) in rbtree_rotate_right()
114 rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node) in rbtree_insert_fixup()
184 rbtree_insert (rbtree_type *rbtree, rbnode_type *data) in rbtree_insert()
236 rbtree_search (rbtree_type *rbtree, const void *key) in rbtree_search()
279 rbtree_delete(rbtree_type *rbtree, const void *key) in rbtree_delete()
356 static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child, rbnode_type* child_parent) in rbtree_delete_fixup()
460 rbtree_find_less_equal(rbtree_type *rbtree, const void *key, rbnode_type **result) in rbtree_find_less_equal()
496 rbtree_first (rbtree_type *rbtree) in rbtree_first()
[all …]
|
| /dports/dns/p5-DNS-Ldns/ldns-1.8.1/ |
| H A D | rbtree.c | 82 ldns_rbtree_t *rbtree; in ldns_rbtree_create() local
106 ldns_rbtree_free(ldns_rbtree_t *rbtree) in ldns_rbtree_free()
116 ldns_rbtree_rotate_left(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) in ldns_rbtree_rotate_left()
143 ldns_rbtree_rotate_right(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) in ldns_rbtree_rotate_right()
166 ldns_rbtree_insert_fixup(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) in ldns_rbtree_insert_fixup()
229 ldns_rbtree_insert_vref(ldns_rbnode_t *data, void *rbtree) in ldns_rbtree_insert_vref()
242 ldns_rbtree_insert (ldns_rbtree_t *rbtree, ldns_rbnode_t *data) in ldns_rbtree_insert()
294 ldns_rbtree_search (ldns_rbtree_t *rbtree, const void *key) in ldns_rbtree_search()
336 ldns_rbtree_delete(ldns_rbtree_t *rbtree, const void *key) in ldns_rbtree_delete()
548 ldns_rbtree_first(const ldns_rbtree_t *rbtree) in ldns_rbtree_first()
[all …]
|
| /dports/dns/py-ldns/ldns-1.8.1/ |
| H A D | rbtree.c | 82 ldns_rbtree_t *rbtree; in ldns_rbtree_create() local
106 ldns_rbtree_free(ldns_rbtree_t *rbtree) in ldns_rbtree_free()
116 ldns_rbtree_rotate_left(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) in ldns_rbtree_rotate_left()
143 ldns_rbtree_rotate_right(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) in ldns_rbtree_rotate_right()
166 ldns_rbtree_insert_fixup(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) in ldns_rbtree_insert_fixup()
229 ldns_rbtree_insert_vref(ldns_rbnode_t *data, void *rbtree) in ldns_rbtree_insert_vref()
242 ldns_rbtree_insert (ldns_rbtree_t *rbtree, ldns_rbnode_t *data) in ldns_rbtree_insert()
294 ldns_rbtree_search (ldns_rbtree_t *rbtree, const void *key) in ldns_rbtree_search()
336 ldns_rbtree_delete(ldns_rbtree_t *rbtree, const void *key) in ldns_rbtree_delete()
548 ldns_rbtree_first(const ldns_rbtree_t *rbtree) in ldns_rbtree_first()
[all …]
|
| /dports/dns/ldns/ldns-1.8.1/ |
| H A D | rbtree.c | 82 ldns_rbtree_t *rbtree; in ldns_rbtree_create() local
106 ldns_rbtree_free(ldns_rbtree_t *rbtree) in ldns_rbtree_free()
116 ldns_rbtree_rotate_left(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) in ldns_rbtree_rotate_left()
143 ldns_rbtree_rotate_right(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) in ldns_rbtree_rotate_right()
166 ldns_rbtree_insert_fixup(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) in ldns_rbtree_insert_fixup()
229 ldns_rbtree_insert_vref(ldns_rbnode_t *data, void *rbtree) in ldns_rbtree_insert_vref()
242 ldns_rbtree_insert (ldns_rbtree_t *rbtree, ldns_rbnode_t *data) in ldns_rbtree_insert()
294 ldns_rbtree_search (ldns_rbtree_t *rbtree, const void *key) in ldns_rbtree_search()
336 ldns_rbtree_delete(ldns_rbtree_t *rbtree, const void *key) in ldns_rbtree_delete()
548 ldns_rbtree_first(const ldns_rbtree_t *rbtree) in ldns_rbtree_first()
[all …]
|
| /dports/dns/getdns/getdns-1.5.2/src/util/ |
| H A D | rbtree.c | 80 rbtree_type *rbtree; in rbtree_create() local
95 rbtree_init(rbtree_type *rbtree, int (*cmpf)(const void *, const void *)) in rbtree_init()
108 rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node) in rbtree_rotate_left()
135 rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node) in rbtree_rotate_right()
158 rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node) in rbtree_insert_fixup()
228 rbtree_insert (rbtree_type *rbtree, rbnode_type *data) in rbtree_insert()
281 rbtree_search (rbtree_type *rbtree, const void *key) in rbtree_search()
329 rbtree_delete(rbtree_type *rbtree, const void *key) in rbtree_delete()
511 rbtree_find_less_equal(rbtree_type *rbtree, const void *key, in rbtree_find_less_equal()
549 rbtree_first (const rbtree_type *rbtree) in rbtree_first()
[all …]
|
| /dports/dns/unbound/unbound-1.14.0/util/ |
| H A D | rbtree.c | 80 rbtree_type *rbtree; in rbtree_create() local
95 rbtree_init(rbtree_type *rbtree, int (*cmpf)(const void *, const void *)) in rbtree_init()
108 rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node) in rbtree_rotate_left()
135 rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node) in rbtree_rotate_right()
158 rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node) in rbtree_insert_fixup()
228 rbtree_insert (rbtree_type *rbtree, rbnode_type *data) in rbtree_insert()
281 rbtree_search (rbtree_type *rbtree, const void *key) in rbtree_search()
329 rbtree_delete(rbtree_type *rbtree, const void *key) in rbtree_delete()
511 rbtree_find_less_equal(rbtree_type *rbtree, const void *key, in rbtree_find_less_equal()
549 rbtree_first (rbtree_type *rbtree) in rbtree_first()
[all …]
|
| /dports/security/silktools/silk-3.19.1/src/libsilk/redblack/ |
| H A D | redblack.h | 150 struct rbtree { struct
165 * required. A pointer to type struct rbtree is returned and is argument
|
| /dports/security/sudo/sudo-1.9.8p2/plugins/sudoers/ |
| H A D | redblack.h | 40 struct rbtree { struct
52 void *rbdelete(struct rbtree *, struct rbnode *); argument
|
| /dports/databases/twemproxy/twemproxy-0.5.0/src/ |
| H A D | nc_rbtree.h | 36 struct rbtree { struct
42 void rbtree_init(struct rbtree *tree, struct rbnode *node); argument
|
| /dports/lang/yorick/yorick-y_2_2_04/yorick/ |
| H A D | codger.c | 213 typedef struct rbtree rbtree; typedef
228 struct rbtree { struct
230 rbtree *left, *right, *up; argument
234 rbtree *next; argument
246 rbtree * argument
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/ |
| H A D | rbtree.hpp | 511 class rbtree class
541 BOOST_INTRUSIVE_FORCEINLINE rbtree() in rbtree() function in boost::intrusive::rbtree
545 …BOOST_INTRUSIVE_FORCEINLINE explicit rbtree( const key_compare &cmp, const value_traits &v_traits … in rbtree() function in boost::intrusive::rbtree
550 BOOST_INTRUSIVE_FORCEINLINE rbtree( bool unique, Iterator b, Iterator e in rbtree() function in boost::intrusive::rbtree
556 BOOST_INTRUSIVE_FORCEINLINE rbtree(BOOST_RV_REF(rbtree) x) in rbtree() function in boost::intrusive::rbtree
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/ |
| H A D | rbtree.hpp | 511 class rbtree class
541 BOOST_INTRUSIVE_FORCEINLINE rbtree() in rbtree() function in boost::intrusive::rbtree
545 …BOOST_INTRUSIVE_FORCEINLINE explicit rbtree( const key_compare &cmp, const value_traits &v_traits … in rbtree() function in boost::intrusive::rbtree
550 BOOST_INTRUSIVE_FORCEINLINE rbtree( bool unique, Iterator b, Iterator e in rbtree() function in boost::intrusive::rbtree
556 BOOST_INTRUSIVE_FORCEINLINE rbtree(BOOST_RV_REF(rbtree) x) in rbtree() function in boost::intrusive::rbtree
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/ |
| H A D | rbtree.hpp | 511 class rbtree class
541 BOOST_INTRUSIVE_FORCEINLINE rbtree() in rbtree() function in boost::intrusive::rbtree
545 …BOOST_INTRUSIVE_FORCEINLINE explicit rbtree( const key_compare &cmp, const value_traits &v_traits … in rbtree() function in boost::intrusive::rbtree
550 BOOST_INTRUSIVE_FORCEINLINE rbtree( bool unique, Iterator b, Iterator e in rbtree() function in boost::intrusive::rbtree
556 BOOST_INTRUSIVE_FORCEINLINE rbtree(BOOST_RV_REF(rbtree) x) in rbtree() function in boost::intrusive::rbtree
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/ |
| H A D | rbtree.hpp | 511 class rbtree class
541 BOOST_INTRUSIVE_FORCEINLINE rbtree() in rbtree() function in boost::intrusive::rbtree
545 …BOOST_INTRUSIVE_FORCEINLINE explicit rbtree( const key_compare &cmp, const value_traits &v_traits … in rbtree() function in boost::intrusive::rbtree
550 BOOST_INTRUSIVE_FORCEINLINE rbtree( bool unique, Iterator b, Iterator e in rbtree() function in boost::intrusive::rbtree
556 BOOST_INTRUSIVE_FORCEINLINE rbtree(BOOST_RV_REF(rbtree) x) in rbtree() function in boost::intrusive::rbtree
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/ |
| H A D | rbtree.hpp | 511 class rbtree class
541 BOOST_INTRUSIVE_FORCEINLINE rbtree() in rbtree() function in boost::intrusive::rbtree
545 …BOOST_INTRUSIVE_FORCEINLINE explicit rbtree( const key_compare &cmp, const value_traits &v_traits … in rbtree() function in boost::intrusive::rbtree
550 BOOST_INTRUSIVE_FORCEINLINE rbtree( bool unique, Iterator b, Iterator e in rbtree() function in boost::intrusive::rbtree
556 BOOST_INTRUSIVE_FORCEINLINE rbtree(BOOST_RV_REF(rbtree) x) in rbtree() function in boost::intrusive::rbtree
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/ |
| H A D | rbtree.hpp | 511 class rbtree class
541 BOOST_INTRUSIVE_FORCEINLINE rbtree() in rbtree() function in boost::intrusive::rbtree
545 …BOOST_INTRUSIVE_FORCEINLINE explicit rbtree( const key_compare &cmp, const value_traits &v_traits … in rbtree() function in boost::intrusive::rbtree
550 BOOST_INTRUSIVE_FORCEINLINE rbtree( bool unique, Iterator b, Iterator e in rbtree() function in boost::intrusive::rbtree
556 BOOST_INTRUSIVE_FORCEINLINE rbtree(BOOST_RV_REF(rbtree) x) in rbtree() function in boost::intrusive::rbtree
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | rbtree.hpp | 511 class rbtree class
541 BOOST_INTRUSIVE_FORCEINLINE rbtree() in rbtree() function in boost::intrusive::rbtree
545 …BOOST_INTRUSIVE_FORCEINLINE explicit rbtree( const key_compare &cmp, const value_traits &v_traits … in rbtree() function in boost::intrusive::rbtree
550 BOOST_INTRUSIVE_FORCEINLINE rbtree( bool unique, Iterator b, Iterator e in rbtree() function in boost::intrusive::rbtree
556 BOOST_INTRUSIVE_FORCEINLINE rbtree(BOOST_RV_REF(rbtree) x) in rbtree() function in boost::intrusive::rbtree
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | rbtree.hpp | 511 class rbtree class
541 BOOST_INTRUSIVE_FORCEINLINE rbtree() in rbtree() function in boost::intrusive::rbtree
545 …BOOST_INTRUSIVE_FORCEINLINE explicit rbtree( const key_compare &cmp, const value_traits &v_traits … in rbtree() function in boost::intrusive::rbtree
550 BOOST_INTRUSIVE_FORCEINLINE rbtree( bool unique, Iterator b, Iterator e in rbtree() function in boost::intrusive::rbtree
556 BOOST_INTRUSIVE_FORCEINLINE rbtree(BOOST_RV_REF(rbtree) x) in rbtree() function in boost::intrusive::rbtree
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/ |
| H A D | rbtree.hpp | 511 class rbtree class
541 rbtree() in rbtree() function in boost::intrusive::rbtree
545 explicit rbtree( const key_compare &cmp, const value_traits &v_traits = value_traits()) in rbtree() function in boost::intrusive::rbtree
550 rbtree( bool unique, Iterator b, Iterator e in rbtree() function in boost::intrusive::rbtree
556 rbtree(BOOST_RV_REF(rbtree) x) in rbtree() function in boost::intrusive::rbtree
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/ |
| H A D | rbtree.hpp | 511 class rbtree class
541 BOOST_INTRUSIVE_FORCEINLINE rbtree() in rbtree() function in boost::intrusive::rbtree
545 …BOOST_INTRUSIVE_FORCEINLINE explicit rbtree( const key_compare &cmp, const value_traits &v_traits … in rbtree() function in boost::intrusive::rbtree
550 BOOST_INTRUSIVE_FORCEINLINE rbtree( bool unique, Iterator b, Iterator e in rbtree() function in boost::intrusive::rbtree
556 BOOST_INTRUSIVE_FORCEINLINE rbtree(BOOST_RV_REF(rbtree) x) in rbtree() function in boost::intrusive::rbtree
|