/dports/devel/valgrind-lts/valgrind-dragonfly-dragonfly/coregrind/ |
H A D | m_oset.c | 503 AvlTree right_subtree; in avl_insert() local 505 right_subtree.cmp = t->cmp; in avl_insert() 506 right_subtree.keyOff = t->keyOff; in avl_insert() 507 if (avl_insert(&right_subtree, n)) { in avl_insert() 522 t->root->right=right_subtree.root; in avl_insert() 691 AvlTree right_subtree; in avl_remove() local 694 right_subtree.root = t->root->right; in avl_remove() 695 right_subtree.cmp = t->cmp; in avl_remove() 696 right_subtree.keyOff = t->keyOff; in avl_remove() 697 ch = avl_remove(&right_subtree, n); in avl_remove() [all …]
|
H A D | m_wordfm.c | 220 AvlNode* right_subtree = (*rootp)->child[1]; in avl_insert_wrk() local 221 if (avl_insert_wrk(&right_subtree, oldV, a, kCmp)) { in avl_insert_wrk() 238 (*rootp)->child[1] = right_subtree; in avl_insert_wrk() 311 AvlNode* right_subtree = (*rootp)->child[1]; in avl_remove_wrk() local 312 vg_assert(right_subtree); in avl_remove_wrk() 313 ch = avl_remove_wrk(&right_subtree, a, kCmp); in avl_remove_wrk() 314 (*rootp)->child[1] = right_subtree; in avl_remove_wrk()
|
/dports/devel/valgrind/valgrind-dragonfly-dragonfly/coregrind/ |
H A D | m_oset.c | 503 AvlTree right_subtree; in avl_insert() local 505 right_subtree.cmp = t->cmp; in avl_insert() 506 right_subtree.keyOff = t->keyOff; in avl_insert() 507 if (avl_insert(&right_subtree, n)) { in avl_insert() 522 t->root->right=right_subtree.root; in avl_insert() 691 AvlTree right_subtree; in avl_remove() local 694 right_subtree.root = t->root->right; in avl_remove() 695 right_subtree.cmp = t->cmp; in avl_remove() 696 right_subtree.keyOff = t->keyOff; in avl_remove() 697 ch = avl_remove(&right_subtree, n); in avl_remove() [all …]
|
H A D | m_wordfm.c | 220 AvlNode* right_subtree = (*rootp)->child[1]; in avl_insert_wrk() local 221 if (avl_insert_wrk(&right_subtree, oldV, a, kCmp)) { in avl_insert_wrk() 238 (*rootp)->child[1] = right_subtree; in avl_insert_wrk() 311 AvlNode* right_subtree = (*rootp)->child[1]; in avl_remove_wrk() local 312 vg_assert(right_subtree); in avl_remove_wrk() 313 ch = avl_remove_wrk(&right_subtree, a, kCmp); in avl_remove_wrk() 314 (*rootp)->child[1] = right_subtree; in avl_remove_wrk()
|
/dports/biology/avida/avida-2.12.4-src/avida-core/source/tools/ |
H A D | cWeightedIndex.cc | 72 const double right_subtree = (right_id >= size) ? 0.0 : subtree_weight[right_id]; in SetWeight() local 73 subtree_weight[id] = item_weight[id] + left_subtree + right_subtree; in SetWeight()
|
/dports/devel/valgrind-lts/valgrind-dragonfly-dragonfly/cachegrind/ |
H A D | cg_merge.c | 1122 AvlNode* right_subtree = (*rootp)->right; in avl_insert_wrk() local 1123 if (avl_insert_wrk(&right_subtree, oldV, a, kCmp)) { in avl_insert_wrk() 1140 (*rootp)->right = right_subtree; in avl_insert_wrk() 1210 AvlNode* right_subtree = (*rootp)->right; in avl_remove_wrk() local 1211 assert(right_subtree); in avl_remove_wrk() 1212 ch = avl_remove_wrk(&right_subtree, a, kCmp); in avl_remove_wrk() 1213 (*rootp)->right = right_subtree; in avl_remove_wrk()
|
/dports/devel/valgrind/valgrind-dragonfly-dragonfly/cachegrind/ |
H A D | cg_merge.c | 1122 AvlNode* right_subtree = (*rootp)->right; in avl_insert_wrk() local 1123 if (avl_insert_wrk(&right_subtree, oldV, a, kCmp)) { in avl_insert_wrk() 1140 (*rootp)->right = right_subtree; in avl_insert_wrk() 1210 AvlNode* right_subtree = (*rootp)->right; in avl_remove_wrk() local 1211 assert(right_subtree); in avl_remove_wrk() 1212 ch = avl_remove_wrk(&right_subtree, a, kCmp); in avl_remove_wrk() 1213 (*rootp)->right = right_subtree; in avl_remove_wrk()
|
/dports/devel/py-blist/blist-1.3.6/prototype/ |
H A D | blist.py | 847 def __concat(left_subtree, right_subtree, height_diff): argument 861 assert right_subtree.refcount == 1 867 root.children = [left_subtree, right_subtree] 877 overflow = root._insert_subtree(-1, right_subtree, 880 root = right_subtree 888 def __concat_subtrees(left_subtree, left_depth, right_subtree,right_depth): argument 896 root, adj = BList.__concat(left_subtree, right_subtree,
|
/dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/sanakirja-core-1.2.13/src/btree/ |
H A D | del.rs | 142 let right_subtree = P::right_child(cur.page.as_page(), &cur.cursor); in del_at_cursor() localVariable 143 cursor.set_first_leaf(txn, right_subtree)?; in del_at_cursor()
|
/dports/devel/py-blist/blist-1.3.6/blist/ |
H A D | _blist.c | 2376 blist_concat_blist(PyBList *left_subtree, PyBList *right_subtree, in blist_concat_blist() argument 2394 assert(Py_REFCNT(right_subtree) == 1); in blist_concat_blist() 2402 decref_later((PyObject*)right_subtree); in blist_concat_blist() 2406 root->children[1] = (PyObject *) right_subtree; in blist_concat_blist() 2417 overflow = blist_insert_subtree(root, -1, right_subtree, in blist_concat_blist() 2420 root = right_subtree; in blist_concat_blist() 2434 PyBList *right_subtree, int right_depth, int *pdepth) in blist_concat_subtrees() argument 2443 PyBList *root = blist_concat_blist(left_subtree, right_subtree, in blist_concat_subtrees()
|
/dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/sql/ |
H A D | sql_executor.cc | 2048 qep_tab_map right_subtree, in PushedJoinRejectsHashJoin() argument 2058 SubtreeHasIncompletePushedJoin(join, right_subtree); in PushedJoinRejectsHashJoin()
|