tlx
|
Generates default traits for a B+ tree used as a set or map. More...
#include <btree.hpp>
Static Public Attributes | |
static const bool | self_verify |
If true, the tree will self verify its invariants after each insert() or erase(). More... | |
static const bool | debug |
If true, the tree will print out debug information and a tree dump during insert() or erase() operation. More... | |
static const int | leaf_slots |
Number of slots in each leaf of the tree. More... | |
static const int | inner_slots |
Number of slots in each inner node of the tree. More... | |
static const size_t | binsearch_threshold |
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... | |
Generates default traits for a B+ tree used as a set or map.
It estimates leaf and inner node sizes by assuming a cache line multiple of 256 bytes.
|
static |
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.
See notes at http://panthema.net/2013/0504-STX-B+Tree-Binary-vs-Linear-Search
|
static |
|
static |
|
static |
|
static |