stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc > | Basic class implementing a base B+ tree data structure in memory |
stx::btree_default_map_traits< _Key, _Data > | Generates default traits for a B+ tree used as a map |
stx::btree_default_set_traits< _Key > | Generates default traits for a B+ tree used as a set |
stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc > | Specialized B+ tree template class implementing STL's map container |
stx::btree_multimap< _Key, _Data, _Compare, _Traits, _Alloc > | Specialized B+ tree template class implementing STL's multimap container |
stx::btree_multiset< _Key, _Compare, _Traits, _Alloc > | Specialized B+ tree template class implementing STL's multiset container |
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::btree_pair_to_value< value_type, pair_type > | For sets the second pair_type is an empty struct, so the value_type should only be the first |
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::btree_pair_to_value< value_type, value_type > | For maps value_type is the same as the pair_type |
stx::btree_set< _Key, _Compare, _Traits, _Alloc > | Specialized B+ tree template class implementing STL's set container |
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::const_iterator | STL-like read-only iterator object for B+ tree items |
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::const_reverse_iterator | STL-like read-only reverse iterator object for B+ tree items |
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::dump_header | A header for the binary image containing the base properties of the B+ tree |
stx::btree_multiset< _Key, _Compare, _Traits, _Alloc >::empty_struct | The empty struct used as a placeholder for the data_type |
stx::btree_set< _Key, _Compare, _Traits, _Alloc >::empty_struct | The macro BTREE_FRIENDS can be used by outside class to access the B+ tree internals |
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::inner_node | Extended structure of a inner node in-memory |
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::iterator | STL-like iterator object for B+ tree items |
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node | Extended structure of a leaf node in memory |
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node | The header structure of each node in-memory |
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::result_t | B+ tree recursive deletion has much information which is needs to be passed upward |
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator | STL-like mutable reverse iterator object for B+ tree items |
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats | A small struct containing basic statistics about the B+ tree |
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::value_compare | Function class to compare value_type objects. Required by the STL |