Searched refs:heir (Results 1 - 2 of 2) sorted by relevance

/external/chromium_org/third_party/bintrees/bintrees/
H A Davltree.py251 heir = node.right
258 while heir.left is not None:
260 node_stack[top] = heir
262 heir = heir.left
265 node.key = heir.key
266 node.value = heir.value
270 node_stack[top - 1][xdir] = heir.right
271 heir.free()
H A Dctrees.c614 node_t *heir = it->link[1]; local
620 while ( heir->link[0] != NULL ) {
622 up[top++] = heir;
623 heir = heir->link[0];
626 ct_swap_data(it, heir);
628 up[top - 1]->link[up[top - 1] == it] = heir->link[1];
629 ct_delete_node(heir);

Completed in 138 milliseconds