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


GNU libavl 2.0.1

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

F. Index

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

A
aborting allocatorSection 2.5
array of search functionsSection 3.5
array of search functionsSection 3.5
AVL copy function6.7 Copying
AVL functions6.3 Operations
AVL item deletion function6.5 Deletion
AVL item insertion function6.4 Insertion
AVL node structure6.2 Data Types
AVL traversal functions6.6 Traversal
AVL traverser advance function6.6 Traversal
AVL traverser back up function6.6 Traversal
AVL traverser greatest-item initializer6.6 Traversal
AVL traverser insertion initializer6.6 Traversal
AVL traverser least-item initializer6.6 Traversal
AVL traverser search initializer6.6 Traversal
AVL tree verify function6.8 Testing
avl-test.c6.8 Testing
avl.c6. AVL Trees
avl.h6. AVL Trees
avl_copy function6.7 Copying
avl_delete function6.5 Deletion
avl_node structure6.2 Data Types
avl_probe function6.4 Insertion
avl_probe() local variables6.4 Insertion
avl_t_find function6.6 Traversal
avl_t_first function6.6 Traversal
avl_t_insert function6.6 Traversal
avl_t_last function6.6 Traversal
avl_t_next function6.6 Traversal
avl_t_prev function6.6 Traversal

B
bin-ary-test.cSection 3.6
bin_cmp functionSection 2.3
binary search of ordered array4.5 Binary Search of Ordered Array
binary search tree entry4.6 Binary Search Tree in Array
binary search using bsearch()Section 3.5
binary_tree_entry structure4.6 Binary Search Tree in Array
block structure5.14.4 Memory Manager
blp's implementation of bsearch()Section 3.5
blp_bsearch functionSection 3.5
BST balance function5.12 Balance
BST compression function5.12.2.3 Implementing Compression
BST copy error helper function5.10.3 Error Handling
BST copy function5.10.3 Error Handling
BST creation function5.5 Creation
BST destruction function5.11.1 Destruction by Rotation
BST extra function prototypes5.12 Balance
BST item deletion functionImplementation
BST item deletion function, by merging5.8.1 Aside: Deletion by Merging
BST item insertion function5.7 Insertion
BST item insertion function, alternate versionSection 4.7
BST item insertion function, root insertion version5.7.1 Aside: Root Insertion
BST join function, iterative versionSection 4.13
BST join function, recursive versionImplementation
BST maximum height5.2.3 Maximum Height
BST node structure5.2.1 Node Structure
BST operations5.4 Operations
BST overflow test function5.14.3 Testing Overflow
BST print function5.14.1.2 Displaying BST Structures
BST print function5.14.1.2 Displaying BST Structures
BST search function5.6 Search
BST table structure5.2.2 Tree Structure
BST test function5.14.1 Testing BSTs
BST to vine function5.12.1 From Tree to Vine
BST traversal functions5.9.3 Better Iterative Traversal
BST traverser advance function5.9.3.7 Advancing to the Next Node
BST traverser back up function5.9.3.8 Backing Up to the Previous Node
BST traverser check function5.14.1 Testing BSTs
BST traverser copy initializer5.9.3.6 Initialization by Copying
BST traverser current item function5.9.3.9 Getting the Current Item
BST traverser greatest-item initializer5.9.3.3 Starting at the Last Node
BST traverser insertion initializer5.9.3.5 Starting at an Inserted Node
BST traverser least-item initializer5.9.3.2 Starting at the First Node
BST traverser null initializer5.9.3.1 Starting at the Null Node
BST traverser refresher5.9.3 Better Iterative Traversal
BST traverser refresher, with cachingSection 4.9.3
BST traverser replacement function5.9.3.10 Replacing the Current Item
BST traverser search initializer5.9.3.4 Starting at a Found Node
BST traverser structure5.9.3 Better Iterative Traversal
BST verify function5.14.1.1 BST Verification
bst-test.c5.14 Testing
bst.c5. Binary Search Trees
bst.h5. Binary Search Trees
bst_balance function5.12 Balance
bst_copy function5.10.3 Error Handling
bst_copy_iterative function5.10.2 Iterative Copying
bst_copy_iterative functionSection 4.10.2
bst_copy_recursive_1 function5.10.1 Recursive Copying
bst_create function5.5 Creation
bst_deallocate_recursive functionSection 4.10.1
bst_delete functionImplementation
bst_delete function5.8.1 Aside: Deletion by Merging
bst_destroy function5.11.1 Destruction by Rotation
bst_destroy function5.11.3 Aside: Iterative Destruction
bst_destroy_recursive function5.11.2 Aside: Recursive Destruction
bst_find function5.6 Search
bst_find functionSection 2.3
bst_node structure5.2.1 Node Structure
bst_probe function5.7 Insertion
bst_probe function5.7.1 Aside: Root Insertion
bst_probe functionSection 4.7
bst_robust_copy_recursive_1 functionSection 4.10.1
bst_robust_copy_recursive_2 functionSection 4.10.1
bst_t_copy function5.9.3.6 Initialization by Copying
bst_t_cur function5.9.3.9 Getting the Current Item
bst_t_find function5.9.3.4 Starting at a Found Node
bst_t_first function5.9.3.2 Starting at the First Node
bst_t_init function5.9.3.1 Starting at the Null Node
bst_t_insert function5.9.3.5 Starting at an Inserted Node
bst_t_last function5.9.3.3 Starting at the Last Node
bst_t_next function5.9.3.7 Advancing to the Next Node
bst_t_prev function5.9.3.8 Backing Up to the Previous Node
bst_t_replace function5.9.3.10 Replacing the Current Item
bst_table structure5.2.2 Tree Structure
bst_traverse_level_order functionSection 4.7
bst_traverser structure5.9.3 Better Iterative Traversal
BSTS functionsSection 4.15
BSTS functionsSection 4.15
BSTS structuresSection 4.15
BSTS testSection 4.15
bsts.cSection 4.15
bsts_find functionSection 4.15
bsts_insert functionSection 4.15
bsts_node structureSection 4.15
bsts_tree structureSection 4.15

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