STX B+ Tree Template Classes
0.9
|
![]() ![]() | STX - Some Template Extensions namespace |
![]() ![]() ![]() | Generates default traits for a B+ tree used as a set |
![]() ![]() ![]() | Generates default traits for a B+ tree used as a map |
![]() ![]() ![]() | Basic class implementing a base B+ tree data structure in memory |
![]() ![]() ![]() ![]() | For sets the second pair_type is an empty struct, so the value_type should only be the first |
![]() ![]() ![]() ![]() | For maps value_type is the same as the pair_type |
![]() ![]() ![]() ![]() | STL-like read-only iterator object for B+ tree items |
![]() ![]() ![]() ![]() | STL-like read-only reverse iterator object for B+ tree items |
![]() ![]() ![]() ![]() | A header for the binary image containing the base properties of the B+ tree |
![]() ![]() ![]() ![]() | Extended structure of a inner node in-memory |
![]() ![]() ![]() ![]() | STL-like iterator object for B+ tree items |
![]() ![]() ![]() ![]() | Extended structure of a leaf node in memory |
![]() ![]() ![]() ![]() | The header structure of each node in-memory |
![]() ![]() ![]() ![]() | B+ tree recursive deletion has much information which is needs to be passed upward |
![]() ![]() ![]() ![]() | STL-like mutable reverse iterator object for B+ tree items |
![]() ![]() ![]() ![]() | A small struct containing basic statistics about the B+ tree |
![]() ![]() ![]() ![]() | Function class to compare value_type objects. Required by the STL |
![]() ![]() ![]() | Specialized B+ tree template class implementing STL's map container |
![]() ![]() ![]() | Specialized B+ tree template class implementing STL's multimap container |
![]() ![]() ![]() | Specialized B+ tree template class implementing STL's multiset container |
![]() ![]() ![]() ![]() | The empty struct used as a placeholder for the data_type |
![]() ![]() ![]() | Specialized B+ tree template class implementing STL's set container |
![]() ![]() ![]() ![]() | The macro BTREE_FRIENDS can be used by outside class to access the B+ tree internals |