stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats Struct Reference

A small struct containing basic statistics about the B+ tree. More...

#include <btree.h>

List of all members.

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.

---

Detailed Description

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>
struct stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats

A small struct containing basic statistics about the B+ tree.

It can be fetched using get_stats().

Definition at line 1199 of file btree.h.

---

Constructor & Destructor Documentation

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::tree_stats

(

)

[inline]

Zero initialized.

Definition at line 1217 of file btree.h.

---

Member Function Documentation

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

double stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::avgfill_leaves

(

)

const [inline]

Return the average fill of leaves.

Definition at line 1230 of file btree.h.

References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::itemcount, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::leafslots, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::leaves.

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

size_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::nodes

(

)

const [inline]

Return the total number of nodes.

Definition at line 1224 of file btree.h.

References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::innernodes, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::leaves.

---

Member Data Documentation

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

size_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::innernodes

Number of inner nodes in the B+ tree.

Definition at line 1208 of file btree.h.

Referenced by stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::allocate_inner(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::btree(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::erase_iter_descend(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::erase_one_descend(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::free_node(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::nodes(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::operator=(), and stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::verify().

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

const unsigned short stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::innerslots = btree_self::innerslotmax [static]

Base B+ tree parameter: The number of key slots in each inner node.

Definition at line 1214 of file btree.h.

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

size_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::itemcount

Number of items in the B+ tree.

Definition at line 1202 of file btree.h.

Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::avgfill_leaves(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::clear(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::erase(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::erase_iter_descend(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::erase_one(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::erase_one_descend(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::insert_start(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::restore(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::size(), and stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::verify().

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

const unsigned short stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::leafslots = btree_self::leafslotmax [static]

Base B+ tree parameter: The number of key/data slots in each leaf.

Definition at line 1211 of file btree.h.

Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::avgfill_leaves().

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>

size_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::leaves

Number of leaves in the B+ tree.

Definition at line 1205 of file btree.h.

Referenced by stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::allocate_leaf(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::avgfill_leaves(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::btree(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::erase_iter_descend(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::erase_one_descend(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::free_node(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::tree_stats::nodes(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::operator=(), and stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::verify().

---

The documentation for this struct was generated from the following file:

• stx/btree.h