| /dports/devel/valgrind-lts/valgrind-dragonfly-dragonfly/coregrind/ |
| H A D | m_oset.c | 92 typedef OSet AvlTree; typedef
244 static void stackClear(AvlTree* t) in stackClear()
292 AvlTree* t; in VG_()
323 AvlTree* t; in VG_()
341 AvlTree* VG_(OSetGen_EmptyClone) (const AvlTree* os) in VG_()
343 AvlTree* t; in VG_()
471 AvlTree left_subtree; in avl_insert()
503 AvlTree right_subtree; in avl_insert()
655 AvlTree left_subtree; in avl_remove()
691 AvlTree right_subtree; in avl_remove()
[all …]
|
| /dports/devel/valgrind/valgrind-dragonfly-dragonfly/coregrind/ |
| H A D | m_oset.c | 92 typedef OSet AvlTree; typedef
244 static void stackClear(AvlTree* t) in stackClear()
292 AvlTree* t; in VG_()
323 AvlTree* t; in VG_()
341 AvlTree* VG_(OSetGen_EmptyClone) (const AvlTree* os) in VG_()
343 AvlTree* t; in VG_()
471 AvlTree left_subtree; in avl_insert()
503 AvlTree right_subtree; in avl_insert()
655 AvlTree left_subtree; in avl_remove()
691 AvlTree right_subtree; in avl_remove()
[all …]
|
| /dports/devel/ragel/ragel-6.10/aapl/ |
| H A D | avlcommon.h | 208 AvlTree(const AvlTree &other);
216 ~AvlTree() { empty(); } in ~AvlTree()
227 AvlTree &operator=( const AvlTree &tree );
241 ~AvlTree() {} in ~AvlTree()
252 AvlTree &operator=( const AvlTree &tree );
321 struct IterFirst { IterFirst( const AvlTree &t ) : t(t) { } const AvlTree &t; }; in IterFirst()
322 struct IterLast { IterLast( const AvlTree &t ) : t(t) { } const AvlTree &t; }; in IterLast()
502 const AvlTree *tree;
546 AvlTree(const AvlTree<AVLMEL_TEMPUSE> &other) in AvlTree() function
569 template <AVLMEL_TEMPDEF> AvlTree<AVLMEL_TEMPUSE> &AvlTree<AVLMEL_TEMPUSE>::
[all …]
|
| H A D | avltree.h | 62 #define AvlTree AvlTree macro
71 #undef AvlTree
|
| H A D | avlkeyless.h | 46 #define AvlTree AvlKeyless macro
55 #undef AvlTree
|
| H A D | avlikeyless.h | 49 #define AvlTree AvliKeyless macro
60 #undef AvlTree
|
| H A D | avlbasic.h | 52 #define AvlTree AvlBasic macro
62 #undef AvlTree
|
| H A D | avlibasic.h | 52 #define AvlTree AvliBasic macro
63 #undef AvlTree
|
| H A D | avlset.h | 56 #define AvlTree AvlSet macro
67 #undef AvlTree
|
| H A D | avlmel.h | 63 #define AvlTree AvlMel macro
72 #undef AvlTree
|
| H A D | avlmap.h | 58 #define AvlTree AvlMap macro
69 #undef AvlTree
|
| H A D | avlitree.h | 64 #define AvlTree AvliTree macro
75 #undef AvlTree
|
| H A D | avliset.h | 58 #define AvlTree AvliSet macro
71 #undef AvlTree
|
| H A D | avlmelkey.h | 60 #define AvlTree AvlMelKey macro
69 #undef AvlTree
|
| H A D | avlimel.h | 65 #define AvlTree AvliMel macro
76 #undef AvlTree
|
| H A D | avlimap.h | 60 #define AvlTree AvliMap macro
73 #undef AvlTree
|
| H A D | avlimelkey.h | 62 #define AvlTree AvliMelKey macro
73 #undef AvlTree
|
| /dports/x11/eaglemode/eaglemode-0.95.0/src/emCore/ |
| H A D | emContext.cpp | 36 AvlTree=NULL; in emContext()
52 while (AvlTree) { in ~emContext()
64 if (!AvlTree) break; in ~emContext()
106 EM_AVL_SEARCH_BEGIN(emModel,AvlNode,AvlTree) in Lookup()
147 EM_AVL_LOOP_START(emModel,AvlNode,AvlTree) in GetListing()
167 EM_AVL_LOOP_START(emModel,AvlNode,AvlTree) in GetModelInfo()
177 EM_AVL_LOOP_START(emModel,AvlNode,AvlTree) in GetModelInfo()
274 AvlTree=NULL; in emContext()
302 EM_AVL_LOOP_START(emModel,AvlNode,AvlTree) in SearchUnused()
392 while (AvlTree) { in CollectGarbage()
[all …]
|
| /dports/textproc/go-yq/yq-4.7.0/vendor/github.com/timtadh/data-structures/tree/avl/ |
| H A D | avltree.go | 23 type AvlTree struct { struct
27 func NewAvlTree() *AvlTree {
28 return &AvlTree{}
31 func (self *AvlTree) Root() types.TreeNode { argument
35 func (self *AvlTree) Size() int { argument
39 func (self *AvlTree) Has(key types.Hashable) bool { argument
43 func (self *AvlTree) Put(key types.Hashable, value interface{}) (err error) { argument
61 func (self *AvlTree) Iterate() types.KVIterator { argument
65 func (self *AvlTree) Items() (vi types.KIterator) { argument
69 func (self *AvlTree) Values() types.Iterator { argument
[all …]
|
| /dports/devel/libds/libds-2.2/ |
| H A D | avltree.c | 91 # define TREE(t) ((AvlTree*)(t))
92 # define TREEROOT(t) (((AvlTree*)(t))->root)
93 # define CURR(t) (((AvlTree*)(t))->current)
952 AvlTree *tr; in avlNewTree()
954 tr = (AvlTree*) malloc(sizeof(AvlTree)); in avlNewTree()
1098 AvlTree * tree = TREE(tr); in avlInsert()
1324 AvlTree * tree = TREE(tr); in avlRemoveNode()
1371 AvlTree * tree = (AvlTree *)tr; in avlCurrent()
1386 AvlTree * tree = (AvlTree *)tr; in avlPrev()
1406 AvlTree * tree = (AvlTree *)tr; in avlNext()
[all …]
|
| /dports/x11/eaglemode/eaglemode-0.95.0/include/emCore/ |
| H A D | emAvlTreeSet.h | 283 emAvlTree AvlTree; member
357 EM_AVL_SEARCH_BEGIN(Element,AvlNode,Data->AvlTree) in Get()
368 EM_AVL_SEARCH_BEGIN(Element,AvlNode,Data->AvlTree) in GetFirst()
378 EM_AVL_SEARCH_BEGIN(Element,AvlNode,Data->AvlTree) in GetLast()
571 return !Data->AvlTree; in IsEmpty()
580 EM_AVL_LOOP_START(Element,AvlNode,Data->AvlTree) in GetCount()
1038 d2->AvlTree=NULL; in MakeWritable()
1043 if (d1->AvlTree) { in MakeWritable()
1044 d2->AvlTree=CloneTree(d1->AvlTree,preserve); in MakeWritable()
1060 if (Data->AvlTree) { in DeleteData()
[all …]
|
| H A D | emAvlTreeMap.h | 282 emAvlTree AvlTree; member
361 EM_AVL_SEARCH_BEGIN(Element,AvlNode,Data->AvlTree) in Get()
374 EM_AVL_SEARCH_BEGIN(Element,AvlNode,Data->AvlTree) in GetFirst()
386 EM_AVL_SEARCH_BEGIN(Element,AvlNode,Data->AvlTree) in GetLast()
627 return !Data->AvlTree; in IsEmpty()
637 EM_AVL_LOOP_START(Element,AvlNode,Data->AvlTree) in GetCount()
955 d2->AvlTree=NULL; in MakeWritable()
960 if (d1->AvlTree) { in MakeWritable()
961 d2->AvlTree=CloneTree(d1->AvlTree,preserve); in MakeWritable()
978 if (Data->AvlTree) { in DeleteData()
[all …]
|
| /dports/net/osrtspproxy/osrtspproxy_2_0/libapp/ |
| H A D | Avl.h | 116 class AvlTree
119 AvlTree( const AvlTree<KeyType>& );
120 AvlTree & operator=( const AvlTree<KeyType>& );
123 AvlTree( void ) : m_root(NULL) {}; in AvlTree() function
124 ~AvlTree( void ) { delete m_root; } in ~AvlTree()
|
| H A D | resolver.h | 126 typedef AvlTree<CHostInfo> CHostInfoTree;
152 typedef AvlTree<CAddrInfo> CAddrInfoTree;
207 typedef AvlTree<CHostQuery> CHostQueryTree;
257 typedef AvlTree<CAddrQuery> CAddrQueryTree;
|
| /dports/databases/hbase/hbase-1.2.1/hbase-server/src/main/java/org/apache/hadoop/hbase/master/procedure/ |
| H A D | MasterProcedureScheduler.java | 215 Queue<T> node = AvlTree.getFirst(treeMap); in clear()
217 treeMap = AvlTree.remove(treeMap, node.getKey()); in clear()
467 Queue<TableName> node = AvlTree.get(tableMap, tableName); in getTableQueue()
471 tableMap = AvlTree.insert(tableMap, node); in getTableQueue()
476 tableMap = AvlTree.remove(tableMap, tableName); in removeTableQueue()
511 Queue<ServerName> node = AvlTree.get(root, serverName); in getServerQueue()
515 serverBuckets[index] = AvlTree.insert(root, node); in getServerQueue()
521 serverBuckets[index] = AvlTree.remove((ServerQueue)serverBuckets[index], serverName); in removeServerQueue()
1082 private static class AvlTree { class in MasterProcedureScheduler
|