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


GNU libavl 2.0.1

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

Index: M -- P

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

M
main function5.14.7 Main Program
main functionSection 3.1
main functionSection 3.5
main functionSection 3.6
main program to test binary_search_tree_array()Section 3.6
make special case TBST vine into balanced tree and count height8.11.2 From Vine to Balanced Tree
make special case TBST vine into balanced tree and count height8.11.2 From Vine to Balanced Tree
make special case vine into balanced tree and count height5.12.2.2 Implementation
memory allocator3.5 Memory Allocation
memory tracker5.14.4 Memory Manager
memory tracker5.14.4 Memory Manager
memory tracker5.14.4 Memory Manager
memory tracker5.14.4 Memory Manager
memory tracker5.14.4 Memory Manager
memory tracker5.14.4 Memory Manager
memory tracker5.14.4 Memory Manager
move BST node to root5.7.1 Aside: Root Insertion
move down then up in recursive AVL insertion6.4.7 Aside: Recursive Insertion
mt_allocate function5.14.4 Memory Manager
mt_allocator function5.14.4 Memory Manager
mt_allocator structure5.14.4 Memory Manager
mt_arg_index enumeration5.14.4 Memory Manager
mt_create function5.14.4 Memory Manager
mt_free function5.14.4 Memory Manager
mt_policy enumeration5.14.4 Memory Manager

N
new_block function5.14.4 Memory Manager

O
option parserB.1 Option Parser
option parserB.1 Option Parser
option parserB.1 Option Parser
option structure5.14.5 User Interaction
option_get functionB.1 Option Parser
option_init functionB.1 Option Parser
option_state structureB.1 Option Parser
overflow testers5.14.3 Testing Overflow
overflow testersSection 4.14.3

P
parse search test command lineSection 3.5
parse_command_line functionB.2 Command-Line Parser
PAVL copy function15.7 Copying
PAVL functions15.3 Operations
PAVL item deletion function15.5 Deletion
PAVL item insertion function15.4 Insertion
PAVL node structure15.1 Data Types
PAVL traversal functions15.6 Traversal
pavl-test.c15.8 Testing
pavl.c15. AVL Trees with Parent Pointers
pavl.h15. AVL Trees with Parent Pointers
pavl_copy function15.7 Copying
pavl_delete function15.5 Deletion
pavl_node structure15.1 Data Types
pavl_probe function15.4 Insertion
PBST balance function14.7 Balance
PBST balance function, with integrated parent updatesSection 13.7
PBST compression functionSection 13.7
PBST copy error helper function14.6 Copying
PBST copy function14.6 Copying
PBST extra function prototypes14.7 Balance
PBST functions14.2 Operations
PBST item deletion function14.4 Deletion
PBST item insertion function14.3 Insertion
PBST node structure14.1 Data Types
PBST traversal functions14.5 Traversal
PBST traverser advance function14.5.5 Advancing to the Next Node
PBST traverser back up function14.5.6 Backing Up to the Previous Node
PBST traverser first initializer14.5.1 Starting at the First Node
PBST traverser insertion initializer14.5.4 Starting at an Inserted Node
PBST traverser last initializer14.5.2 Starting at the Last Node
PBST traverser search initializer14.5.3 Starting at a Found Node
pbst-test.c14.8 Testing
pbst.c14. BSTs with Parent Pointers
pbst.h14. BSTs with Parent Pointers
pbst_balance function14.7 Balance
pbst_balance functionSection 13.7
pbst_copy function14.6 Copying
pbst_delete function14.4 Deletion
pbst_node structure14.1 Data Types
pbst_probe function14.3 Insertion
pbst_t_find function14.5.3 Starting at a Found Node
pbst_t_first function14.5.1 Starting at the First Node
pbst_t_insert function14.5.4 Starting at an Inserted Node
pbst_t_last function14.5.2 Starting at the Last Node
pbst_t_next function14.5.5 Advancing to the Next Node
pbst_t_prev function14.5.6 Backing Up to the Previous Node
permuted_integers functionSection 4.14.2
pgm_name variable5.14.7 Main Program
pool_allocator structureSection 2.5
pool_allocator_free functionSection 2.5
pool_allocator_malloc functionSection 2.5
pool_allocator_tbl_create functionSection 2.5
PRB functions16.2 Operations
PRB item deletion function16.4 Deletion
PRB item insertion function16.3 Insertion
PRB node structure16.1 Data Types
prb-test.c16.5 Testing
prb.c16. Red-Black Trees with Parent Pointers
prb.h16. Red-Black Trees with Parent Pointers
prb_color enumeration16.1 Data Types
prb_delete function16.4 Deletion
prb_node structure16.1 Data Types
prb_probe function16.3 Insertion
print_tree_structure function8.12 Testing
print_tree_structure function11.10 Testing
print_whole_tree function5.14.1.2 Displaying BST Structures
print_whole_tree function8.12 Testing
print_whole_tree function11.10 Testing
probe function6.4.7 Aside: Recursive Insertion
process_node function5.9.2.1 Improving Convenience

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