#include <btree.h>
| Static Public Attributes | |
| static const bool | selfverify = false | 
| If true, the tree will self verify it's invariants after each insert() or erase(). | |
| static const bool | debug = false | 
| If true, the tree will print out debug information and a tree dump during insert() or erase() operation. | |
| static const int | leafslots = BTREE_MAX( 8, 256 / (sizeof(_Key)) ) | 
| Number of slots in each leaf of the tree. | |
| static const int | innerslots = BTREE_MAX( 8, 256 / (sizeof(_Key) + sizeof(void*)) ) | 
| Number of slots in each inner node of the tree. | |
It estimates leaf and inner node sizes by assuming a cache line size of 256 bytes.
Definition at line 73 of file btree.h.
| const bool stx::btree_default_set_traits< _Key >::selfverify = false  [static] | 
| const bool stx::btree_default_set_traits< _Key >::debug = false  [static] | 
| const int stx::btree_default_set_traits< _Key >::leafslots = BTREE_MAX( 8, 256 / (sizeof(_Key)) )  [static] | 
| const int stx::btree_default_set_traits< _Key >::innerslots = BTREE_MAX( 8, 256 / (sizeof(_Key) + sizeof(void*)) )  [static] | 
 1.5.4
 1.5.4