Searched refs:DeadNode (Results 1 – 8 of 8) sorted by relevance
/dports/security/ADMsmb/ADMsmb_0.3/ubiqx/ |
H A D | ubi_AVLtree.c | 611 ubi_avlNodePtr DeadNode ) in ubi_avlRemove() argument 634 if( (DeadNode->Link[ubi_trLEFT]) && (DeadNode->Link[ubi_trRIGHT]) ) in ubi_avlRemove() 635 SwapNodes( RootPtr, DeadNode, ubi_trPrev( DeadNode ) ); in ubi_avlRemove() 641 if( DeadNode->Link[ubi_trPARENT] ) in ubi_avlRemove() 643 &((DeadNode->Link[ubi_trPARENT])->Link[(int)(DeadNode->gender)]); in ubi_avlRemove() 650 if( ubi_trEQUAL == DeadNode->balance ) in ubi_avlRemove() 654 p = (ubi_btNodePtr)(DeadNode->Link[(int)(DeadNode->balance)]); in ubi_avlRemove() 655 p->Link[ubi_trPARENT] = (ubi_btNodePtr)DeadNode->Link[ubi_trPARENT]; in ubi_avlRemove() 656 p->gender = DeadNode->gender; in ubi_avlRemove() 661 DeadNode->gender ); in ubi_avlRemove() [all …]
|
H A D | ubi_BinTree.c | 620 ubi_btNodePtr DeadNode ) in ubi_btRemove() argument 644 if( (DeadNode->Link[ubi_trLEFT]) && (DeadNode->Link[ubi_trRIGHT]) ) in ubi_btRemove() 645 SwapNodes( RootPtr, DeadNode, ubi_btPrev( DeadNode ) ); in ubi_btRemove() 651 if (DeadNode->Link[ubi_trPARENT]) in ubi_btRemove() 652 parentp = &((DeadNode->Link[ubi_trPARENT])->Link[(int)(DeadNode->gender)]); in ubi_btRemove() 657 tmp = ((DeadNode->Link[ubi_trLEFT])?ubi_trLEFT:ubi_trRIGHT); in ubi_btRemove() 659 p = (DeadNode->Link[tmp]); in ubi_btRemove() 662 p->Link[ubi_trPARENT] = DeadNode->Link[ubi_trPARENT]; in ubi_btRemove() 663 p->gender = DeadNode->gender; in ubi_btRemove() 669 return( DeadNode ); in ubi_btRemove()
|
H A D | ubi_SplayTree.c | 279 ubi_btNodePtr ubi_sptRemove( ubi_btRootPtr RootPtr, ubi_btNodePtr DeadNode ) in ubi_sptRemove() argument 297 (void)Splay( DeadNode ); /* Move dead node to root. */ in ubi_sptRemove() 298 if( (p = DeadNode->Link[ubi_trLEFT]) ) /* If left subtree exists... */ in ubi_sptRemove() 300 ubi_btNodePtr q = DeadNode->Link[ubi_trRIGHT]; in ubi_sptRemove() 312 if( (p = DeadNode->Link[ubi_trRIGHT]) ) /* No left, but right subtree... */ in ubi_sptRemove() 323 return( DeadNode ); /* Return pointer to pruned node. */ in ubi_sptRemove()
|
H A D | ubi_SplayTree.h | 168 ubi_btNodePtr ubi_sptRemove( ubi_btRootPtr RootPtr, ubi_btNodePtr DeadNode );
|
H A D | ubi_AVLtree.h | 232 ubi_avlNodePtr DeadNode );
|
H A D | ubi_BinTree.h | 412 ubi_btNodePtr DeadNode );
|
/dports/devel/py-hypothesis/hypothesis-6.28.0/src/hypothesis/internal/conjecture/ |
H A D | choicetree.py | 83 node.children[i] = DeadNode 102 target.children[i] = DeadNode 144 DeadNode = TreeNode() variable 145 DeadNode.live_child_count = 0
|
/dports/net/rabbitmq/rabbitmq-server-3.9.11/deps/rabbit/src/ |
H A D | rabbit_amqqueue.erl | 1766 forget_node_for_queue(DeadNode, Q) -> 1768 forget_node_for_queue(DeadNode, RS, Q). 1778 forget_node_for_queue(DeadNode, [DeadNode | T], Q) -> 1779 forget_node_for_queue(DeadNode, T, Q); 1781 forget_node_for_queue(DeadNode, [H|T], Q) when ?is_amqqueue(Q) -> 1784 {false, _} -> forget_node_for_queue(DeadNode, T, Q);
|