Home
last modified time | relevance | path

Searched refs:avltree (Results 1 – 25 of 356) sorted by relevance

12345678910>>...15

/dports/games/scummvm/scummvm-2.5.1/engines/ultima/nuvie/misc/
H A Diavl_tree.cpp73 free(avltree); in iAVLFreeTree()
77 if (avltree->top) in iAVLCleanTree()
80 avltree->top = NULL; in iAVLCleanTree()
81 avltree->count = 0; in iAVLCleanTree()
109 if (avltree->top != NULL) { in iAVLInsert()
136 avltree->top = newnode; in iAVLInsert()
139 avltree->count++; in iAVLInsert()
189 avltree->count--; in iAVLDelete()
202 avlcursor->avltree = avltree; in iAVLFirst()
204 if (avltree->top == NULL) { in iAVLFirst()
[all …]
H A Diavl_tree.h59 const iAVLTree *avltree; member
65 extern void iAVLFreeTree(iAVLTree *avltree, void (freeitem)(void *item));
66 extern void iAVLCleanTree(iAVLTree *avltree, void (freeitem)(void *item));
67 extern int iAVLInsert(iAVLTree *avltree, void *item);
68 extern void *iAVLSearch(iAVLTree const *avltree, iAVLKey key);
69 extern int iAVLDelete(iAVLTree *avltree, iAVLKey key);
70 extern void *iAVLFirst(iAVLCursor *avlcursor, iAVLTree const *avltree);
/dports/security/samhain-server/samhain-4.4.3/src/
H A DzAVLTree.c194 if (avltree->top) in zAVLFreeTree()
196 free(avltree); in zAVLFreeTree()
227 if (avltree->top != NULL) { in zAVLInsert()
254 avltree->top = newnode; in zAVLInsert()
257 avltree->count++; in zAVLInsert()
310 superparent = &(avltree->top); in zAVLDelete()
315 avltree->count--; in zAVLDelete()
332 avlcursor->avltree = avltree; in zAVLFirst()
334 if (avltree->top == NULL) { in zAVLFirst()
339 for (avlnode = avltree->top; in zAVLFirst()
[all …]
/dports/security/samhain-client/samhain-4.4.3/src/
H A DzAVLTree.c194 if (avltree->top) in zAVLFreeTree()
196 free(avltree); in zAVLFreeTree()
227 if (avltree->top != NULL) { in zAVLInsert()
254 avltree->top = newnode; in zAVLInsert()
257 avltree->count++; in zAVLInsert()
310 superparent = &(avltree->top); in zAVLDelete()
315 avltree->count--; in zAVLDelete()
332 avlcursor->avltree = avltree; in zAVLFirst()
334 if (avltree->top == NULL) { in zAVLFirst()
339 for (avlnode = avltree->top; in zAVLFirst()
[all …]
/dports/security/samhain/samhain-4.4.3/src/
H A DzAVLTree.c194 if (avltree->top) in zAVLFreeTree()
196 free(avltree); in zAVLFreeTree()
227 if (avltree->top != NULL) { in zAVLInsert()
254 avltree->top = newnode; in zAVLInsert()
257 avltree->count++; in zAVLInsert()
310 superparent = &(avltree->top); in zAVLDelete()
315 avltree->count--; in zAVLDelete()
332 avlcursor->avltree = avltree; in zAVLFirst()
334 if (avltree->top == NULL) { in zAVLFirst()
339 for (avlnode = avltree->top; in zAVLFirst()
[all …]
/dports/databases/sqlrelay/sqlrelay-1.7.0/src/server/
H A Dsqlrmoduledata.cpp55 avltree<dictionarynode<uint16_t, avltree<char *> *> *> in ~sqlrmoduledata_tag()
57 for (avltreenode<dictionarynode<uint16_t, avltree<char *> *> *> in ~sqlrmoduledata_tag()
66 avltree<char *> *tree=tags.getValue(cursorid); in addTag()
71 tree=new avltree<char *>(); in addTag()
79 avltree<char *> *tree=tags.getValue(cursorid); in addTag()
84 tree=new avltree<char *>(); in addTag()
90 avltree<char *> *sqlrmoduledata_tag::getTags(uint16_t cursorid) { in getTags()
95 avltree<char *> *tree=tags.getValue(cursorid); in tagExists()
100 avltree<char *> *tree=tags.getValue(sqlrcur->getId()); in closeResultSet()
/dports/devel/boost-docs/boost_1_72_0/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree class
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 BOOST_INTRUSIVE_FORCEINLINE avltree() in avltree() function in boost::intrusive::avltree
547 BOOST_INTRUSIVE_FORCEINLINE avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
553 BOOST_INTRUSIVE_FORCEINLINE avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
557 BOOST_INTRUSIVE_FORCEINLINE avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
574 BOOST_INTRUSIVE_FORCEINLINE static avltree &container_from_iterator(iterator it) in container_from_iterator()
575 { return static_cast<avltree &>(Base::container_from_iterator(it)); } in container_from_iterator()
[all …]
/dports/devel/hyperscan/boost_1_75_0/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree class
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 BOOST_INTRUSIVE_FORCEINLINE avltree() in avltree() function in boost::intrusive::avltree
547 BOOST_INTRUSIVE_FORCEINLINE avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
553 BOOST_INTRUSIVE_FORCEINLINE avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
557 BOOST_INTRUSIVE_FORCEINLINE avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
574 BOOST_INTRUSIVE_FORCEINLINE static avltree &container_from_iterator(iterator it) in container_from_iterator()
575 { return static_cast<avltree &>(Base::container_from_iterator(it)); } in container_from_iterator()
[all …]
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree class
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 BOOST_INTRUSIVE_FORCEINLINE avltree() in avltree() function in boost::intrusive::avltree
547 BOOST_INTRUSIVE_FORCEINLINE avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
553 BOOST_INTRUSIVE_FORCEINLINE avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
557 BOOST_INTRUSIVE_FORCEINLINE avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
574 BOOST_INTRUSIVE_FORCEINLINE static avltree &container_from_iterator(iterator it) in container_from_iterator()
575 { return static_cast<avltree &>(Base::container_from_iterator(it)); } in container_from_iterator()
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree class
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 BOOST_INTRUSIVE_FORCEINLINE avltree() in avltree() function in boost::intrusive::avltree
547 BOOST_INTRUSIVE_FORCEINLINE avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
553 BOOST_INTRUSIVE_FORCEINLINE avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
557 BOOST_INTRUSIVE_FORCEINLINE avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
574 BOOST_INTRUSIVE_FORCEINLINE static avltree &container_from_iterator(iterator it) in container_from_iterator()
575 { return static_cast<avltree &>(Base::container_from_iterator(it)); } in container_from_iterator()
[all …]
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree class
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 BOOST_INTRUSIVE_FORCEINLINE avltree() in avltree() function in boost::intrusive::avltree
547 BOOST_INTRUSIVE_FORCEINLINE avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
553 BOOST_INTRUSIVE_FORCEINLINE avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
557 BOOST_INTRUSIVE_FORCEINLINE avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
574 BOOST_INTRUSIVE_FORCEINLINE static avltree &container_from_iterator(iterator it) in container_from_iterator()
575 { return static_cast<avltree &>(Base::container_from_iterator(it)); } in container_from_iterator()
[all …]
/dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree class
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 BOOST_INTRUSIVE_FORCEINLINE avltree() in avltree() function in boost::intrusive::avltree
547 BOOST_INTRUSIVE_FORCEINLINE avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
553 BOOST_INTRUSIVE_FORCEINLINE avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
557 BOOST_INTRUSIVE_FORCEINLINE avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
574 BOOST_INTRUSIVE_FORCEINLINE static avltree &container_from_iterator(iterator it) in container_from_iterator()
575 { return static_cast<avltree &>(Base::container_from_iterator(it)); } in container_from_iterator()
[all …]
/dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree class
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 BOOST_INTRUSIVE_FORCEINLINE avltree() in avltree() function in boost::intrusive::avltree
547 BOOST_INTRUSIVE_FORCEINLINE avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
553 BOOST_INTRUSIVE_FORCEINLINE avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
557 BOOST_INTRUSIVE_FORCEINLINE avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
574 BOOST_INTRUSIVE_FORCEINLINE static avltree &container_from_iterator(iterator it) in container_from_iterator()
575 { return static_cast<avltree &>(Base::container_from_iterator(it)); } in container_from_iterator()
[all …]
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree class
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 avltree() in avltree() function in boost::intrusive::avltree
547 avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
553 avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
557 avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
568 static avltree &container_from_end_iterator(iterator end_iterator) in container_from_end_iterator()
574 static avltree &container_from_iterator(iterator it) in container_from_iterator()
[all …]
/dports/devel/boost-libs/boost_1_72_0/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree class
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 BOOST_INTRUSIVE_FORCEINLINE avltree() in avltree() function in boost::intrusive::avltree
547 BOOST_INTRUSIVE_FORCEINLINE avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
553 BOOST_INTRUSIVE_FORCEINLINE avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
557 BOOST_INTRUSIVE_FORCEINLINE avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
574 BOOST_INTRUSIVE_FORCEINLINE static avltree &container_from_iterator(iterator it) in container_from_iterator()
575 { return static_cast<avltree &>(Base::container_from_iterator(it)); } in container_from_iterator()
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree class
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 BOOST_INTRUSIVE_FORCEINLINE avltree() in avltree() function in boost::intrusive::avltree
547 BOOST_INTRUSIVE_FORCEINLINE avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
553 BOOST_INTRUSIVE_FORCEINLINE avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
557 BOOST_INTRUSIVE_FORCEINLINE avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
574 BOOST_INTRUSIVE_FORCEINLINE static avltree &container_from_iterator(iterator it) in container_from_iterator()
575 { return static_cast<avltree &>(Base::container_from_iterator(it)); } in container_from_iterator()
[all …]
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 avltree()
547 avltree( bool unique, Iterator b, Iterator e
553 avltree(BOOST_RV_REF(avltree) x)
557 avltree& operator=(BOOST_RV_REF(avltree) x)
568 static avltree &container_from_end_iterator(iterator end_iterator)
574 static avltree &container_from_iterator(iterator it)
[all …]
/dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree class
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 avltree() in avltree() function in boost::intrusive::avltree
547 avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
553 avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
557 avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
568 static avltree &container_from_end_iterator(iterator end_iterator) in container_from_end_iterator()
574 static avltree &container_from_iterator(iterator it) in container_from_iterator()
[all …]
/dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree class
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 avltree() in avltree() function in boost::intrusive::avltree
547 avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
553 avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
557 avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
568 static avltree &container_from_end_iterator(iterator end_iterator) in container_from_end_iterator()
574 static avltree &container_from_iterator(iterator it) in container_from_iterator()
[all …]
/dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/
H A Davltree.hpp441 void merge_unique(avltree<T, Options2...> &);
445 void merge_equal(avltree<T, Options2...> &);
508 class avltree class
525 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
538 BOOST_INTRUSIVE_FORCEINLINE avltree() in avltree() function in boost::intrusive::avltree
547 BOOST_INTRUSIVE_FORCEINLINE avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
553 BOOST_INTRUSIVE_FORCEINLINE avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
557 BOOST_INTRUSIVE_FORCEINLINE avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
558 { return static_cast<avltree &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x))); } in operator =()
575 { return static_cast<avltree &>(Base::container_from_iterator(it)); } in container_from_iterator()
[all …]
/dports/security/samhain-client/samhain-4.4.3/include/
H A DzAVLTree.h63 const zAVLTree *avltree; member
69 extern void zAVLFreeTree (zAVLTree *avltree, void (freeitem)(void *item));
70 extern int zAVLInsert (zAVLTree *avltree, void *item);
71 extern void *zAVLSearch (zAVLTree const *avltree, zAVLKey key);
72 extern int zAVLDelete (zAVLTree *avltree, zAVLKey key);
73 extern void *zAVLFirst (zAVLCursor *avlcursor, zAVLTree const *avltree);
/dports/security/samhain/samhain-4.4.3/include/
H A DzAVLTree.h63 const zAVLTree *avltree; member
69 extern void zAVLFreeTree (zAVLTree *avltree, void (freeitem)(void *item));
70 extern int zAVLInsert (zAVLTree *avltree, void *item);
71 extern void *zAVLSearch (zAVLTree const *avltree, zAVLKey key);
72 extern int zAVLDelete (zAVLTree *avltree, zAVLKey key);
73 extern void *zAVLFirst (zAVLCursor *avlcursor, zAVLTree const *avltree);
/dports/security/samhain-server/samhain-4.4.3/include/
H A DzAVLTree.h63 const zAVLTree *avltree; member
69 extern void zAVLFreeTree (zAVLTree *avltree, void (freeitem)(void *item));
70 extern int zAVLInsert (zAVLTree *avltree, void *item);
71 extern void *zAVLSearch (zAVLTree const *avltree, zAVLKey key);
72 extern int zAVLDelete (zAVLTree *avltree, zAVLKey key);
73 extern void *zAVLFirst (zAVLCursor *avlcursor, zAVLTree const *avltree);
/dports/databases/cego/cego-2.47.11/dbcheck/
H A Dcheck003.sql10 create unique avltree id1 on t1 (b);
11 create avltree id2 on t1 (c);
16 check avltree id1;
17 check avltree id2;
23 drop avltree id1;
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/
H A Davltree.hpp480 class avltree class
497 BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
510 explicit avltree( const key_compare &cmp = key_compare() in avltree() function in boost::intrusive::avltree
516 avltree( bool unique, Iterator b, Iterator e in avltree() function in boost::intrusive::avltree
522 avltree(BOOST_RV_REF(avltree) x) in avltree() function in boost::intrusive::avltree
526 avltree& operator=(BOOST_RV_REF(avltree) x) in operator =()
530 void clone_from(const avltree &src, Cloner cloner, Disposer disposer) in clone_from()
537 static avltree &container_from_end_iterator(iterator end_iterator) in container_from_end_iterator()
543 static avltree &container_from_iterator(iterator it) in container_from_iterator()
544 { return static_cast<avltree &>(Base::container_from_iterator(it)); } in container_from_iterator()
[all …]

12345678910>>...15