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


GNU libavl 2.0.1

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

Index: C

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

C
calculate leaves5.12.2.2 Implementation
case 1 in AVL deletionCase 1: p has no right child
case 1 in BST deletionImplementation
case 1 in left-looking RTBST deletionCase 1: p has a right child but no left child
case 1 in left-side initial-black RB insertion rebalancingCase 1: q's uncle is red
case 1 in left-side PRB deletion rebalancingCase 1: w has no red children
case 1 in left-side PRB insertion rebalancingCase 1: q's uncle is red
case 1 in left-side RB deletion rebalancingCase 1: w has no red children
case 1 in left-side RB insertion rebalancingCase 1: q's uncle is red
case 1 in left-side RTRB insertion rebalancingCase 1: q's uncle is red
case 1 in left-side TRB deletion rebalancingCase 1: w has no red children
case 1 in left-side TRB insertion rebalancingCase 1: q's uncle is red
case 1 in PAVL deletionCase 1: p has no right child
case 1 in PBST deletionCase 1: p has no right child
case 1 in PRB deletionCase 1: p has no right child
case 1 in RB deletionCase 1: p has no right child
case 1 in right-looking RTBST deletionCase 1: p has a right thread and a left child
case 1 in right-side initial-black RB insertion rebalancing7.4.5.1 Symmetric Case
case 1 in right-side PRB deletion rebalancing16.4.4 Symmetric Case
case 1 in right-side PRB insertion rebalancing16.3.3 Symmetric Case
case 1 in right-side RB deletion rebalancing7.5.4 Symmetric Case
case 1 in right-side RB insertion rebalancing7.4.4 Symmetric Case
case 1 in right-side RTRB insertion rebalancingCase 1: q's uncle is red
case 1 in right-side TRB deletion rebalancing10.4.5 Symmetric Case
case 1 in right-side TRB insertion rebalancing10.3.3 Symmetric Case
case 1 in RTAVL deletionCase 1: p has a right child but no left child
case 1 in RTAVL deletion, right-lookingSection 11.5.4
case 1 in RTRB deletionCase 1: p has a right child but no left child
case 1 in TAVL deletionCase 1: p has a right thread and a left child
case 1 in TAVL deletion, with stackSection 8.5.6
case 1 in TBST deletionCase 1: p has a right thread and a left child
case 1 in TRB deletionCase 1: p has a right thread and a left child
case 1.5 in BST deletionSection 4.8
case 2 in AVL deletionCase 2: p's right child has no left child
case 2 in BST deletionImplementation
case 2 in left-looking RTBST deletionCase 2: p has a right thread and no left child
case 2 in left-side initial-black RB insertion rebalancingCase 2: q is the left child of pa[k - 1]
case 2 in left-side PRB deletion rebalancingCase 2: w's right child is red
case 2 in left-side PRB insertion rebalancingCase 2: q is the left child of its parent
case 2 in left-side RB deletion rebalancingCase 2: w's right child is red
case 2 in left-side RB insertion rebalancingCase 2: q is the left child of pa[k - 1]
case 2 in left-side RTRB deletion rebalancingCase 2: w's child opposite the deletion is red
case 2 in left-side RTRB insertion rebalancingCase 2: q is on same side of parent as parent is of grandparent
case 2 in left-side TRB deletion rebalancingCase 2: w's right child is red
case 2 in left-side TRB insertion rebalancingCase 2: q is the left child of its parent
case 2 in PAVL deletionCase 2: p's right child has no left child
case 2 in PBST deletionCase 2: p's right child has no left child
case 2 in PRB deletionCase 2: p's right child has no left child
case 2 in RB deletionCase 2: p's right child has no left child
case 2 in right-looking RTBST deletionCase 2: p has a right thread and no left child
case 2 in right-side initial-black RB insertion rebalancing7.4.5.1 Symmetric Case
case 2 in right-side PRB deletion rebalancing16.4.4 Symmetric Case
case 2 in right-side PRB insertion rebalancing16.3.3 Symmetric Case
case 2 in right-side RB deletion rebalancing7.5.4 Symmetric Case
case 2 in right-side RB insertion rebalancing7.4.4 Symmetric Case
case 2 in right-side RTRB deletion rebalancingCase 2: w's child opposite the deletion is red
case 2 in right-side RTRB insertion rebalancingCase 2: q is on same side of parent as parent is of grandparent
case 2 in right-side TRB deletion rebalancing10.4.5 Symmetric Case
case 2 in right-side TRB insertion rebalancing10.3.3 Symmetric Case
case 2 in RTAVL deletionCase 2: p has a right thread and no left child
case 2 in RTAVL deletion, right-lookingSection 11.5.4
case 2 in RTRB deletionCase 2: p has a right thread and no left child
case 2 in TAVL deletionCase 2: p has a right thread and a left thread
case 2 in TAVL deletion, with stackSection 8.5.6
case 2 in TBST deletionCase 2: p has a right thread and a left thread
case 2 in TRB deletionCase 2: p has a right thread and a left thread
case 3 in AVL deletionCase 3: p's right child has a left child
case 3 in AVL deletion, alternate versionSection 5.5.2
case 3 in BST deletionImplementation
case 3 in BST deletionImplementation
case 3 in BST deletion, alternate versionSection 4.8
case 3 in left-looking RTBST deletionCase 3: p's left child has a right thread
case 3 in left-side initial-black RB insertion rebalancingCase 3: q is the right child of pa[k - 1]
case 3 in left-side PRB insertion rebalancingCase 3: q is the right child of its parent
case 3 in left-side RB insertion rebalancingCase 3: q is the right child of pa[k - 1]
case 3 in left-side RTRB insertion rebalancingCase 3: q is on opposite side of parent as parent is of grandparent
case 3 in left-side TRB insertion rebalancingCase 3: q is the right child of its parent
case 3 in PAVL deletionCase 3: p's right child has a left child
case 3 in PBST deletionCase 3: p's right child has a left child
case 3 in PBST deletionCase 3: p's right child has a left child
case 3 in PRB deletionCase 3: p's right child has a left child
case 3 in RB deletionCase 3: p's right child has a left child
case 3 in right-looking RTBST deletionCase 3: p's right child has no left child
case 3 in right-side initial-black RB insertion rebalancing7.4.5.1 Symmetric Case
case 3 in right-side PRB insertion rebalancing16.3.3 Symmetric Case
case 3 in right-side RB insertion rebalancing7.4.4 Symmetric Case
case 3 in right-side RTRB insertion rebalancingCase 3: q is on opposite side of parent as parent is of grandparent
case 3 in right-side TRB insertion rebalancing10.3.3 Symmetric Case
case 3 in RTAVL deletionCase 3: p's left child has a right thread
case 3 in RTAVL deletion, right-lookingSection 11.5.4
case 3 in RTRB deletionCase 3: p's left child has a right thread
case 3 in TAVL deletionCase 3: p's right child has a left thread
case 3 in TAVL deletion, with stackSection 8.5.6
case 3 in TBST deletionCase 3: p's right child has a left thread
case 3 in TRB deletionCase 3: p's right child has a left thread
case 4 in left-looking RTBST deletionCase 4: p's left child has a right child
case 4 in left-looking RTBST deletionCase 4: p's left child has a right child
case 4 in left-looking RTBST deletionCase 4: p's left child has a right child
case 4 in left-looking RTBST deletion, alternate versionSection 10.5.2
case 4 in right-looking RTBST deletionCase 4: p's right child has a left child
case 4 in right-looking RTBST deletion, alternate versionSection 10.5.1
case 4 in RTAVL deletionCase 4: p's left child has a right child
case 4 in RTAVL deletionCase 4: p's left child has a right child
case 4 in RTAVL deletionCase 4: p's left child has a right child
case 4 in RTAVL deletion, alternate versionSection 11.5.4
case 4 in RTAVL deletion, right-lookingSection 11.5.4
case 4 in RTRB deletionCase 4: p's left child has a right child
case 4 in TAVL deletionCase 4: p's right child has a left child
case 4 in TAVL deletion, alternate versionSection 8.5.2
case 4 in TAVL deletion, with stackSection 8.5.6
case 4 in TBST deletionCase 4: p's right child has a left child
case 4 in TBST deletionCase 4: p's right child has a left child
case 4 in TBST deletionCase 4: p's right child has a left child
case 4 in TBST deletion, alternate versionSection 7.7
case 4 in TRB deletionCase 4: p's right child has a left child
case 4 in TRB deletion, alternate versionSection 9.4.2
cheat_search functionSection 3.5
cheating searchSection 3.5
check AVL tree structure6.8 Testing
check BST structure5.14.1.1 BST Verification
check counted nodes5.14.1.1 BST Verification
check for tree height in range5.12.2.2 Implementation
check RB tree structure7.6 Testing
check root is black7.6 Testing
check that backward traversal works5.14.1.1 BST Verification
check that forward traversal works5.14.1.1 BST Verification
check that the tree contains all the elements it should5.14.1.1 BST Verification
check that traversal from the null element works5.14.1.1 BST Verification
check tree-&#62;bst_count is correct5.14.1.1 BST Verification
check_traverser function5.14.1 Testing BSTs
clean up after search testsSection 3.5
command line parserB.2 Command-Line Parser
compare two AVL trees for structure and content6.8 Testing
compare two BSTs for structure and content5.14.1 Testing BSTs
compare two PAVL trees for structure and content15.8 Testing
compare two PBSTs for structure and content14.8 Testing
compare two PRB trees for structure and content16.5 Testing
compare two RB trees for structure and content7.6 Testing
compare two RTAVL trees for structure and content12.7 Testing
compare two RTBSTs for structure and content11.10 Testing
compare two RTRB trees for structure and content13.5 Testing
compare two TAVL trees for structure and content9.7 Testing
compare two TBSTs for structure and content8.12 Testing
compare two TRB trees for structure and content10.5 Testing
compare_fixed_strings functionSection 2.3
compare_ints function3.3 Comparison Function
compare_ints functionSection 2.3
compare_ints functionSection 2.3
compare_ints functionSection 3.5
compare_trees function6.8 Testing
compare_trees function7.6 Testing
compare_trees function8.12 Testing
compare_trees function9.7 Testing
compare_trees function10.5 Testing
compare_trees function11.10 Testing
compare_trees function12.7 Testing
compare_trees function13.5 Testing
compare_trees function14.8 Testing
compare_trees function15.8 Testing
compare_trees function16.5 Testing
comparison function for ints3.3 Comparison Function
compress function8.11.2 From Vine to Balanced Tree
compress functionSection 13.7
copy_error_recovery function5.10.3 Error Handling
copy_error_recovery function8.9 Copying
copy_error_recovery function11.7 Copying
copy_error_recovery function14.6 Copying
copy_node function8.9 Copying
copy_node function9.6 Copying
copy_node function11.7 Copying
copy_node function12.6 Copying

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