www.delorie.com/gnu/docs/avl/libavl_307.html   search  
 
Buy GNU books!


GNU libavl 2.0.1

[ < ] [ > ]   [ << ] [ Up ] [ >> ]         [Top] [Contents] [Index] [ ? ]

Index: R

Jump to:   A   B   C   D   E   F   G   H   I   L   M   N   O   P   R   S   T   U   V   W   X  

Index Entry Section

R
random number seedingSection 4.14.2
RB functions7.3 Operations
RB item deletion function7.5 Deletion
RB item insertion function7.4 Insertion
RB item insertion function, initial black7.4.5 Aside: Initial Black Insertion
RB maximum height7.2 Data Types
RB node structure7.2 Data Types
RB tree verify function7.6 Testing
rb-test.c7.6 Testing
rb.c7. Red-Black Trees
rb.h7. Red-Black Trees
rb_color enumeration7.2 Data Types
rb_delete function7.5 Deletion
rb_node structure7.2 Data Types
rb_probe function7.4 Insertion
rb_probe function7.4.5 Aside: Initial Black Insertion
rb_probe() local variables7.4 Insertion
rebalance + balance in TAVL insertion in left subtree, alternate versionSection 8.4.2
rebalance after AVL deletion6.5.4 Step 4: Rebalance
rebalance after AVL insertion6.4.4 Step 4: Rebalance
rebalance after AVL insertion6.4.4 Step 4: Rebalance
rebalance after AVL insertion6.4.4 Step 4: Rebalance
rebalance after initial-black RB insertion7.4.5 Aside: Initial Black Insertion
rebalance after PAVL deletion15.5.3 Step 4: Rebalance
rebalance after PAVL insertion15.4.3 Step 4: Rebalance
rebalance after PRB insertion16.3.2 Step 3: Rebalance
rebalance after RB deletion7.5.2 Step 3: Rebalance
rebalance after RB insertion7.4.3 Step 3: Rebalance
rebalance after RTAVL deletion in left subtree12.5.4 Step 4: Rebalance
rebalance after RTAVL deletion in right subtree12.5.4 Step 4: Rebalance
rebalance after RTAVL insertion12.4.2 Step 4: Rebalance
rebalance after RTRB deletion13.4.2 Step 3: Rebalance
rebalance after RTRB insertion13.3.2 Step 3: Rebalance
rebalance after TAVL deletion9.5.4 Step 4: Rebalance
rebalance after TAVL deletion, with stackSection 8.5.6
rebalance after TAVL insertion9.4.2 Step 4: Rebalance
rebalance after TRB insertion10.3.2 Step 3: Rebalance
rebalance AVL tree after insertion in left subtree6.4.4 Step 4: Rebalance
rebalance AVL tree after insertion in right subtree6.4.5 Symmetric Case
rebalance for + balance factor after left-side RTAVL deletionCase 3: x has taller subtree on side opposite deletion
rebalance for + balance factor after right-side RTAVL deletionCase 1: x has taller subtree on same side as deletion
rebalance for + balance factor after TAVL deletion in left subtreeCase 3: x has + balance factor
rebalance for + balance factor after TAVL deletion in right subtree9.5.5 Symmetric Case
rebalance for + balance factor in PAVL insertion in left subtreeCase 2: x has + balance factor
rebalance for + balance factor in PAVL insertion in right subtree15.4.4 Symmetric Case
rebalance for + balance factor in RTAVL insertion in left subtreeCase 2: x has taller subtree on side opposite insertion
rebalance for + balance factor in RTAVL insertion in right subtreeCase 1: x has taller subtree on side of insertion
rebalance for + balance factor in TAVL insertion in left subtreeCase 2: x has + balance factor
rebalance for + balance factor in TAVL insertion in right subtree9.4.3 Symmetric Case
rebalance for - balance factor after left-side RTAVL deletionCase 1: x has taller subtree on same side as deletion
rebalance for - balance factor after right-side RTAVL deletionCase 3: x has taller subtree on side opposite deletion
rebalance for - balance factor after TAVL deletion in left subtreeCase 1: x has - balance factor
rebalance for - balance factor after TAVL deletion in right subtree9.5.5 Symmetric Case
rebalance for - balance factor in PAVL insertion in left subtreeCase 1: x has - balance factor
rebalance for - balance factor in PAVL insertion in right subtree15.4.4 Symmetric Case
rebalance for - balance factor in RTAVL insertion in left subtreeCase 1: x has taller subtree on side of insertion
rebalance for - balance factor in RTAVL insertion in right subtreeCase 2: x has taller subtree on side opposite insertion
rebalance for - balance factor in TAVL insertion in left subtreeCase 1: x has - balance factor
rebalance for - balance factor in TAVL insertion in right subtree9.4.3 Symmetric Case
rebalance for 0 balance factor after left-side RTAVL deletionCase 2: x's subtrees are equal height
rebalance for 0 balance factor after right-side RTAVL deletionCase 2: x's subtrees are equal height
rebalance for 0 balance factor after TAVL deletion in left subtreeCase 2: x has 0 balance factor
rebalance for 0 balance factor after TAVL deletion in right subtree9.5.5 Symmetric Case
rebalance PAVL tree after insertion in left subtree15.4.3 Step 4: Rebalance
rebalance PAVL tree after insertion in right subtree15.4.4 Symmetric Case
rebalance RTAVL tree after insertion to left12.4.2 Step 4: Rebalance
rebalance RTAVL tree after insertion to right12.4.2 Step 4: Rebalance
rebalance TAVL tree after insertion in left subtree9.4.2 Step 4: Rebalance
rebalance TAVL tree after insertion in right subtree9.4.3 Symmetric Case
rebalance tree after PRB deletion16.4.2 Step 3: Rebalance
rebalance tree after RB deletion7.5.2 Step 3: Rebalance
rebalance tree after TRB deletion10.4.3 Step 3: Rebalance
recurse_verify_tree function5.14.1.1 BST Verification
recurse_verify_tree function6.8 Testing
recurse_verify_tree function7.6 Testing
recurse_verify_tree function8.12 Testing
recurse_verify_tree function9.7 Testing
recurse_verify_tree function10.5 Testing
recurse_verify_tree function11.10 Testing
recurse_verify_tree function12.7 Testing
recurse_verify_tree function13.5 Testing
recurse_verify_tree function14.8 Testing
recurse_verify_tree function15.8 Testing
recurse_verify_tree function16.5 Testing
recursive copy of BST, take 15.10.1 Recursive Copying
recursive copy of BST, take 25.10.1 Recursive Copying
recursive deallocation functionSection 4.10.1
recursive insertion into AVL tree6.4.7 Aside: Recursive Insertion
recursive insertion into AVL tree6.4.7 Aside: Recursive Insertion
recursive traversal of BST5.9.1 Traversal by Recursion
recursive traversal of BST5.9.1 Traversal by Recursion
recursive traversal of BST, using nested functionSection 4.9.1
recursively verify AVL tree structure6.8 Testing
recursively verify BST structure5.14.1.1 BST Verification
recursively verify PAVL tree structure15.8 Testing
recursively verify PBST structure14.8 Testing
recursively verify PRB tree structure16.5 Testing
recursively verify RB tree structure7.6 Testing
recursively verify RTAVL tree structure12.7 Testing
recursively verify RTBST structure11.10 Testing
recursively verify RTRB tree structure13.5 Testing
recursively verify TAVL tree structure9.7 Testing
recursively verify TBST structure8.12 Testing
recursively verify TRB tree structure10.5 Testing
reduce TBST vine general case to special case8.11.2 From Vine to Balanced Tree
reduce vine general case to special case5.12.2.2 Implementation
reject_request function5.14.4 Memory Manager
right-side rebalancing after initial-black RB insertion7.4.5.1 Symmetric Case
right-side rebalancing after PRB deletion16.4.4 Symmetric Case
right-side rebalancing after PRB insertion16.3.3 Symmetric Case
right-side rebalancing after RB deletion7.5.4 Symmetric Case
right-side rebalancing after RB insertion7.4.4 Symmetric Case
right-side rebalancing after RTRB deletion13.4.2 Step 3: Rebalance
right-side rebalancing after RTRB insertion13.3.2 Step 3: Rebalance
right-side rebalancing after TRB deletion10.4.5 Symmetric Case
right-side rebalancing after TRB insertion10.3.3 Symmetric Case
right-side rebalancing case 1 in PAVL deletion15.5.4 Symmetric Case
right-side rebalancing case 2 in PAVL deletion15.5.4 Symmetric Case
robust recursive copy of BST, take 1Section 4.10.1
robust recursive copy of BST, take 2Section 4.10.1
robust recursive copy of BST, take 3Section 4.10.1
robust root insertion of existing node in arbitrary subtreeSection 4.7.1
robustly move BST node to rootSection 4.7.1
robustly search for insertion point in arbitrary subtreeSection 4.7.1
root insertion of existing node in arbitrary subtreeSection 4.7.1
root_insert functionSection 4.7.1
root_insert functionSection 4.7.1
rotate left at x then right at y in AVL treeCase 2: x has + balance factor
rotate left at y in AVL tree6.4.5 Symmetric Case
rotate right at x then left at y in AVL tree6.4.5 Symmetric Case
rotate right at y in AVL treeCase 1: x has - balance factor
rotate_left functionSection 4.3
rotate_left functionSection 8.2
rotate_left functionSection 11.3
rotate_left functionSection 14.2
rotate_right functionSection 4.3
rotate_right functionSection 8.2
rotate_right functionSection 11.3
rotate_right functionSection 14.2
RTAVL copy function12.6 Copying
RTAVL functions12.2 Operations
RTAVL item deletion function12.5 Deletion
RTAVL item insertion function12.4 Insertion
RTAVL node copy function12.6 Copying
RTAVL node structure12.1 Data Types
rtavl-test.c12.7 Testing
rtavl.c12. Right-Threaded AVL Trees
rtavl.h12. Right-Threaded AVL Trees
rtavl_delete function12.5 Deletion
rtavl_node structure12.1 Data Types
rtavl_probe function12.4 Insertion
rtavl_tag enumeration12.1 Data Types
RTBST balance function11.9 Balance
RTBST copy error helper function11.7 Copying
RTBST copy function11.7 Copying
RTBST destruction function11.8 Destruction
RTBST functions11.2 Operations
RTBST item deletion function11.5 Deletion
RTBST item insertion function11.4 Insertion
RTBST main copy function11.7 Copying
RTBST node copy function11.7 Copying
RTBST node structure11.1 Data Types
RTBST print function11.10 Testing
RTBST search function11.3 Search
RTBST traversal functions11.6 Traversal
RTBST traverser advance function11.6.4 Advancing to the Next Node
RTBST traverser back up function11.6.5 Backing Up to the Previous Node
RTBST traverser first initializer11.6.1 Starting at the First Node
RTBST traverser last initializer11.6.2 Starting at the Last Node
RTBST traverser search initializer11.6.3 Starting at a Found Node
RTBST tree-to-vine function11.9 Balance
RTBST vine compression function11.9 Balance
rtbst-test.c11.10 Testing
rtbst.c11. Right-Threaded Binary Search Trees
rtbst.h11. Right-Threaded Binary Search Trees
rtbst_copy function11.7 Copying
rtbst_delete function11.5 Deletion
rtbst_destroy function11.8 Destruction
rtbst_find function11.3 Search
rtbst_node structure11.1 Data Types
rtbst_probe function11.4 Insertion
rtbst_t_find function11.6.3 Starting at a Found Node
rtbst_t_first function11.6.1 Starting at the First Node
rtbst_t_last function11.6.2 Starting at the Last Node
rtbst_t_next function11.6.4 Advancing to the Next Node
rtbst_t_prev function11.6.5 Backing Up to the Previous Node
rtbst_tag enumeration11.1 Data Types
RTRB functions13.2 Operations
RTRB item deletion function13.4 Deletion
RTRB item insertion function13.3 Insertion
RTRB node structure13.1 Data Types
rtrb-test.c13.5 Testing
rtrb.c13. Right-Threaded Red-Black Trees
rtrb.h13. Right-Threaded Red-Black Trees
rtrb_color enumeration13.1 Data Types
rtrb_delete function13.4 Deletion
rtrb_node structure13.1 Data Types
rtrb_probe function13.3 Insertion
rtrb_tag enumeration13.1 Data Types
run search testsSection 3.5

Jump to:   A   B   C   D   E   F   G   H   I   L   M   N   O   P   R   S   T   U   V   W   X  


[ < ] [ > ]   [ << ] [ Up ] [ >> ]         [Top] [Contents] [Index] [ ? ]

  webmaster   donations   bookstore     delorie software   privacy  
  Copyright 2003   by The Free Software Foundation     Updated Jun 2003