|
static const bool | selfverify = false |
| If true, the tree will self verify it's invariants after each insert() or erase(). More...
|
|
static const bool | debug = false |
| If true, the tree will print out debug information and a tree dump during insert() or erase() operation. More...
|
|
static const int | leafslots = BTREE_MAX( 8, 256 / (sizeof(_Key)) ) |
| Number of slots in each leaf of the tree. More...
|
|
static const int | innerslots = BTREE_MAX( 8, 256 / (sizeof(_Key) + sizeof(void*)) ) |
| Number of slots in each inner node of the tree. More...
|
|
static const size_t | binsearch_threshold = 256 |
| As of stx-btree-0.9, the code does linear search in find_lower() and find_upper() instead of binary_search, unless the node size is larger than this threshold. More...
|
|
template<typename _Key>
struct stx::btree_default_set_traits< _Key >
Generates default traits for a B+ tree used as a set.
It estimates leaf and inner node sizes by assuming a cache line size of 256 bytes.
Definition at line 86 of file btree.h.