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


GNU libavl 2.0.1

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

Index: S -- T

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

S
s variableSection 5.5.2
s variableSection 9.4.2
s variableSection 11.5.4
search AVL tree for insertion point6.4.1 Step 1: Search
search AVL tree for item to delete6.5.1 Step 1: Search
search BST for insertion point, root insertion version5.7.1 Aside: Root Insertion
search for insertion point in arbitrary subtreeSection 4.7.1
search functionsSection 3.5
search of binary search tree stored as array4.6 Binary Search Tree in Array
search PAVL tree for insertion point15.4.1 Steps 1 and 2: Search and Insert
search PBST tree for insertion point14.3 Insertion
search RB tree for insertion point7.4.1 Step 1: Search
search RTAVL tree for insertion point12.4.1 Steps 1--2: Search and Insert
search RTAVL tree for item to delete12.5.1 Step 1: Search
search RTBST for insertion point11.4 Insertion
search RTRB tree for insertion point13.3.1 Steps 1 and 2: Search and Insert
search TAVL tree for insertion point9.4.1 Steps 1 and 2: Search and Insert
search TAVL tree for item to delete9.5.1 Step 1: Search
search TBST for insertion point8.6 Insertion
search test functionsSection 3.5
search test functionsSection 3.5
search test functionsSection 3.5
search test main programSection 3.5
search TRB tree for insertion point10.3.1 Steps 1 and 2: Search and Insert
search TRB tree for item to delete10.4.1 Step 1: Search
search_func structureSection 3.5
seq-test.cSection 3.1
sequentially search a sorted array of ints4.3 Sequential Search of Ordered Array
sequentially search a sorted array of ints using a sentinel4.4 Sequential Search of Ordered Array with Sentinel
sequentially search a sorted array of ints using a sentinel (2)4.4 Sequential Search of Ordered Array with Sentinel
sequentially search an array of ints4.1 Sequential Search
sequentially search an array of ints using a sentinel4.2 Sequential Search with Sentinel
set parents of main vineSection 13.7
show `bin-ary-test' usage messageSection 3.6
srch-test.cSection 3.5
start_timer functionSection 3.5
stoi functionB.2 Command-Line Parser
stoi functionSection 3.5
stop_timer functionSection 3.5
string to integer function stoi()Section 3.5
summing string lengths with next_item()5.9.2.1 Improving Convenience
summing string lengths with walk()5.9.2.1 Improving Convenience
symmetric case in PAVL deletion15.5.4 Symmetric Case
symmetric case in TAVL deletion9.5.5 Symmetric Case
symmetric case in TAVL deletion, with stackSection 8.5.6

T
table assertion function control directivesSection 2.9
table assertion function prototypes3.9 Assertions
table assertion functionsSection 2.9
table count function prototype3.7 Count
table count macroSection 2.7
table creation function prototypes3.6 Creation and Destruction
table function prototypes3.11 Table Headers
table function types3.3 Comparison Function
table function types3.4 Item and Copy Functions
table insertion and deletion function prototypes3.8 Insertion and Deletion
table insertion convenience functionsSection 2.8
table types3.11 Table Headers
TAVL copy function9.6 Copying
TAVL functions9.3 Operations
TAVL item deletion function9.5 Deletion
TAVL item deletion function, with stackSection 8.5.6
TAVL item insertion function9.4 Insertion
TAVL node copy function9.6 Copying
TAVL node structure9.1 Data Types
tavl-test.c9.7 Testing
tavl.c9. Threaded AVL Trees
tavl.h9. Threaded AVL Trees
tavl_delete function9.5 Deletion
tavl_delete functionSection 8.5.6
tavl_node structure9.1 Data Types
tavl_probe function9.4 Insertion
tavl_tag enumeration9.1 Data Types
tbl_allocator_default variable3.5 Memory Allocation
tbl_assert_delete functionSection 2.9
tbl_assert_insert functionSection 2.9
tbl_copy_func type3.4 Item and Copy Functions
tbl_free function3.5 Memory Allocation
tbl_insert functionSection 2.8
tbl_item_func type3.4 Item and Copy Functions
tbl_malloc_abort functionSection 2.5
tbl_replace functionSection 2.8
TBST balance function8.11 Balance
TBST copy error helper function8.9 Copying
TBST copy function8.9 Copying
TBST creation function8.4 Creation
TBST destruction function8.10 Destruction
TBST functions8.3 Operations
TBST item deletion function8.7 Deletion
TBST item insertion function8.6 Insertion
TBST main balance function8.11 Balance
TBST main copy function8.9 Copying
TBST node copy function8.9 Copying
TBST node structure8.2 Data Types
TBST print function8.12 Testing
TBST search function8.5 Search
TBST table structure8.2 Data Types
TBST test function8.12 Testing
TBST traversal functions8.8 Traversal
TBST traverser advance function8.8.7 Advancing to the Next Node
TBST traverser back up function8.8.8 Backing Up to the Previous Node
TBST traverser copy initializer8.8.6 Initialization by Copying
TBST traverser first initializer8.8.2 Starting at the First Node
TBST traverser insertion initializer8.8.5 Starting at an Inserted Node
TBST traverser last initializer8.8.3 Starting at the Last Node
TBST traverser null initializer8.8.1 Starting at the Null Node
TBST traverser search initializer8.8.4 Starting at a Found Node
TBST traverser structure8.8 Traversal
TBST tree-to-vine function8.11.1 From Tree to Vine
TBST verify function8.12 Testing
TBST vine compression function8.11.2 From Vine to Balanced Tree
TBST vine-to-tree function8.11.2 From Vine to Balanced Tree
tbst-test.c8.12 Testing
tbst.c8. Threaded Binary Search Trees
tbst.h8. Threaded Binary Search Trees
tbst_balance function8.11 Balance
tbst_copy function8.9 Copying
tbst_create function8.4 Creation
tbst_delete function8.7 Deletion
tbst_destroy function8.10 Destruction
tbst_find function8.5 Search
tbst_link structureSection 7.7
tbst_node structure8.2 Data Types
tbst_node structureSection 7.7
tbst_probe function8.6 Insertion
tbst_t_copy function8.8.6 Initialization by Copying
tbst_t_find function8.8.4 Starting at a Found Node
tbst_t_first function8.8.2 Starting at the First Node
tbst_t_init function8.8.1 Starting at the Null Node
tbst_t_insert function8.8.5 Starting at an Inserted Node
tbst_t_last function8.8.3 Starting at the Last Node
tbst_t_next function8.8.7 Advancing to the Next Node
tbst_t_prev function8.8.8 Backing Up to the Previous Node
tbst_table structure8.2 Data Types
tbst_table structureSection 7.7
tbst_tag enumeration8.2 Data Types
tbst_traverser structure8.8 Traversal
test BST traversal during modifications5.14.1 Testing BSTs
test creating a BST and inserting into it5.14.1 Testing BSTs
test declarations5.14.2 Test Set Generation
test declarations5.14.4 Memory Manager
test declarations5.14.5 User Interaction
test declarations5.14.7 Main Program
test declarations5.14.7 Main Program
test declarations5.14.7 Main Program
test deleting from an empty tree5.14.1 Testing BSTs
test deleting nodes from the BST and making copies of it5.14.1 Testing BSTs
test destroying the tree5.14.1 Testing BSTs
test enumeration5.14.7 Main Program
test main program5.14.7 Main Program
test prototypes5.14.1 Testing BSTs
test prototypes5.14.3 Testing Overflow
test prototypes5.14.6 Utility Functions
test TBST balancing8.12 Testing
test utility functions5.14.6 Utility Functions
test utility functions5.14.6 Utility Functions
test utility functions5.14.6 Utility Functions
test.c5.14 Testing
test.h5.14 Testing
test_bst_copy functionSection 4.14.3
test_bst_t_find functionSection 4.14.3
test_bst_t_first function5.14.3 Testing Overflow
test_bst_t_insert functionSection 4.14.3
test_bst_t_last functionSection 4.14.3
test_bst_t_next functionSection 4.14.3
test_bst_t_prev functionSection 4.14.3
test_correctness function5.14.1 Testing BSTs
test_correctness function8.12 Testing
test_correctness functionSection 4.15
test_options enumeration5.14.7 Main Program
test_overflow function5.14.3 Testing Overflow
test_overflow functionSection 4.15
time_seed functionSection 4.14.2
time_successful_search functionSection 3.5
time_unsuccessful_search functionSection 3.5
timer functionsSection 3.5
timer functionsSection 3.5
total_length function5.9.2.1 Improving Convenience
total_length function5.9.2.1 Improving Convenience
transform left-side PRB deletion rebalancing case 3 into case 2Case 3: w's left child is red
transform left-side RB deletion rebalancing case 3 into case 2Case 3: w's left child is red
transform left-side RTRB deletion rebalancing case 3 into case 2Case 3: w's child on the side of the deletion is red
transform left-side TRB deletion rebalancing case 3 into case 2Case 3: w's left child is red
transform right-side PRB deletion rebalancing case 3 into case 216.4.4 Symmetric Case
transform right-side RB deletion rebalancing case 3 into case 27.5.4 Symmetric Case
transform right-side RTRB deletion rebalancing case 3 into case 2Case 3: w's child on the side of the deletion is red
transform right-side TRB deletion rebalancing case 3 into case 210.4.5 Symmetric Case
trav_refresh function5.9.3 Better Iterative Traversal
trav_refresh functionSection 4.9.3
traverse_iterative function5.9.2 Traversal by Iteration
traverse_iterative function5.9.2 Traversal by Iteration
traverse_iterative function5.9.2 Traversal by Iteration
traverse_iterative function5.9.2 Traversal by Iteration
traverse_iterative function5.9.2 Traversal by Iteration
traverse_iterative functionSection 4.9.2
traverse_recursive function5.9.1 Traversal by Recursion
traverser constructor function prototypes3.10.1 Constructors
traverser manipulator function prototypes3.10.2 Manipulators
traverser structure5.9.2.1 Improving Convenience
TRB functions10.2 Operations
TRB item deletion function10.4 Deletion
TRB item deletion function, without stackSection 9.4.5
TRB item insertion function10.3 Insertion
TRB item insertion function, without stackSection 9.3.3
TRB node structure10.1 Data Types
trb-test.c10.5 Testing
trb.c10. Threaded Red-Black Trees
trb.h10. Threaded Red-Black Trees
trb_color enumeration10.1 Data Types
trb_delete function10.4 Deletion
trb_delete functionSection 9.4.5
trb_node structure10.1 Data Types
trb_probe function10.3 Insertion
trb_probe functionSection 9.3.3
trb_tag enumeration10.1 Data Types
tree_to_vine function5.12.1 From Tree to Vine
tree_to_vine function8.11.1 From Tree to Vine
tree_to_vine function11.9 Balance

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