#include <btree.h>
Public Member Functions | |
tree_stats () | |
Zero initialized. | |
size_type | nodes () const |
Return the total number of nodes. | |
double | avgfill_leaves () const |
Return the average fill of leaves. | |
Public Attributes | |
size_type | itemcount |
Number of items in the B+ tree. | |
size_type | leaves |
Number of leaves in the B+ tree. | |
size_type | innernodes |
Number of inner nodes in the B+ tree. | |
Static Public Attributes | |
static const unsigned short | leafslots = btree_self::leafslotmax |
Base B+ tree parameter: The number of key/data slots in each leaf. | |
static const unsigned short | innerslots = btree_self::innerslotmax |
Base B+ tree parameter: The number of key slots in each inner node. |
It can be fetched using get_stats().
Definition at line 1183 of file btree.h.
stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::tree_stats | ( | ) | [inline] |
size_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::nodes | ( | ) | const [inline] |
Return the total number of nodes.
Definition at line 1208 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::innernodes, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::leaves.
double stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::avgfill_leaves | ( | ) | const [inline] |
Return the average fill of leaves.
Definition at line 1214 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::itemcount, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::leafslots, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::leaves.
size_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::itemcount |
Number of items in the B+ tree.
Definition at line 1186 of file btree.h.
Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::avgfill_leaves(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::clear(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::erase_one(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::erase_one_descend(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::insert_start(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::restore(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::size(), and stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::verify().
size_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::leaves |
Number of leaves in the B+ tree.
Definition at line 1189 of file btree.h.
Referenced by stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::allocate_leaf(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::avgfill_leaves(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::btree(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::erase_one_descend(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::free_node(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::nodes(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::operator=(), and stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::verify().
size_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::innernodes |
Number of inner nodes in the B+ tree.
Definition at line 1192 of file btree.h.
Referenced by stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::allocate_inner(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::btree(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::erase_one_descend(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::free_node(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::nodes(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::operator=(), and stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::verify().
const unsigned short stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::leafslots = btree_self::leafslotmax [static] |
Base B+ tree parameter: The number of key/data slots in each leaf.
Definition at line 1195 of file btree.h.
Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::avgfill_leaves().
const unsigned short stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats::innerslots = btree_self::innerslotmax [static] |