|
Fairport
v1.0.38
|
Contains the actual key value pairs of the BTH. More...
#include <heap.h>
Inheritance diagram for fairport::bth_leaf_node< K, V >:
Collaboration diagram for fairport::bth_leaf_node< K, V >:Public Member Functions | |
| bth_leaf_node (const heap_ptr &h, heap_id id, std::vector< std::pair< K, V > > data) | |
| Construct a bth_leaf_node. | |
| virtual | ~bth_leaf_node () |
| const V & | get_value (uint pos) const |
| Returns the value at the associated position on this leaf node. | |
| const K & | get_key (uint pos) const |
| Returns the key at the specified position. | |
| uint | num_values () const |
| Returns the number of entries in this btree_node. | |
Contains the actual key value pairs of the BTH.
| K | The key type for this BTH |
| V | The value type for this BTH |
| fairport::bth_leaf_node< K, V >::bth_leaf_node | ( | const heap_ptr & | h, |
| heap_id | id, | ||
| std::vector< std::pair< K, V > > | data | ||
| ) | [inline] |
Construct a bth_leaf_node.
| [in] | h | The heap to open out of |
| [in] | id | The id to interpret as a non-leaf BTH node |
| [in] | data | The key/value pairs stored in this leaf |
| virtual fairport::bth_leaf_node< K, V >::~bth_leaf_node | ( | ) | [inline, virtual] |
| const K& fairport::bth_leaf_node< K, V >::get_key | ( | uint | pos | ) | const [inline, virtual] |
Returns the key at the specified position.
This is specific to this btree_node, not the entire tree
| [in] | pos | The position to retrieve the key for |
Implements fairport::btree_node< K, V >.
| const V& fairport::bth_leaf_node< K, V >::get_value | ( | uint | pos | ) | const [inline, virtual] |
Returns the value at the associated position on this leaf node.
| [in] | pos | The position to retrieve the value for |
Implements fairport::btree_node_leaf< K, V >.
| uint fairport::bth_leaf_node< K, V >::num_values | ( | ) | const [inline, virtual] |
Returns the number of entries in this btree_node.
This is specific to this btree_node, not the entire tree
Implements fairport::btree_node< K, V >.