|
Fairport
v1.0.38
|
Contains the actual subnode information. More...
#include <node.h>
Inheritance diagram for fairport::subnode_leaf_block:
Collaboration diagram for fairport::subnode_leaf_block:Public Member Functions | |
| subnode_leaf_block (const shared_db_ptr &db, const block_info &info, std::vector< std::pair< node_id, subnode_info > > subnodes) | |
| Construct a subnode_leaf_block from disk. | |
| const subnode_info & | get_value (uint pos) const |
| Returns the value at the associated position on this leaf node. | |
| const node_id & | 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 subnode information.
Typically a node will point directly to one of these. Because they are blocks, and thus up to 8k in size, they can hold information for about ~300 subnodes in a unicode store, and up to ~600 in an ANSI store.
| fairport::subnode_leaf_block::subnode_leaf_block | ( | const shared_db_ptr & | db, |
| const block_info & | info, | ||
| std::vector< std::pair< node_id, subnode_info > > | subnodes | ||
| ) | [inline] |
Construct a subnode_leaf_block from disk.
| [in] | db | The database context |
| [in] | info | Information about this block |
| [in] | subnodes | Information about the subnodes |
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 subnode_info& fairport::subnode_leaf_block::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< node_id, subnode_info >.
| uint fairport::subnode_leaf_block::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 >.