Fairport  v1.0.38
fairport::btree_node_leaf< K, V > Class Template Reference

Represents a leaf node in a BTree structure. More...

#include <btree.h>

+ Inheritance diagram for fairport::btree_node_leaf< K, V >:
+ Collaboration diagram for fairport::btree_node_leaf< K, V >:

List of all members.

Public Member Functions

virtual ~btree_node_leaf ()
const V & lookup (const K &key) const
 Looks up the associated value for a given key.
virtual const V & get_value (uint pos) const =0
 Returns the value at the associated position on this leaf node.

Protected Member Functions

void first (btree_iter_impl< K, V > &iter) const
 Positions the iterator at the first element on this tree.
void last (btree_iter_impl< K, V > &iter) const
 Positions the iterator at the "end" element.
void next (btree_iter_impl< K, V > &iter) const
 Moves the iterator to the next element.
void prev (btree_iter_impl< K, V > &iter) const
 Moves the iterator to the previous element.

Friends

class const_btree_node_iter< K, V >

Detailed Description

template<typename K, typename V>
class fairport::btree_node_leaf< K, V >

Represents a leaf node in a BTree structure.

Classes which model a leaf of a BTree structure inherit from this. They have a total of three simple virtual functions to implement:

  • num_values, from btree_node
  • get_key(uint pos), from btree_node
  • get_value(uint pos)
    Parameters:
    KThe key type. Must be LessThan comparable.
    VThe value type

Definition at line 131 of file btree.h.


Constructor & Destructor Documentation

template<typename K, typename V>
virtual fairport::btree_node_leaf< K, V >::~btree_node_leaf ( ) [inline, virtual]

Definition at line 134 of file btree.h.


Member Function Documentation

template<typename K, typename V>
void fairport::btree_node_leaf< K, V >::first ( btree_iter_impl< K, V > &  iter) const [inline, protected, virtual]

Positions the iterator at the first element on this tree.

Parameters:
[in,out]iterIterator state class

Implements fairport::btree_node< K, V >.

Definition at line 151 of file btree.h.

template<typename K, typename V>
virtual const V& fairport::btree_node_leaf< K, V >::get_value ( uint  pos) const [pure virtual]

Returns the value at the associated position on this leaf node.

Parameters:
[in]posThe position to retrieve the value for
Returns:
The value at the requested position

Implemented in fairport::subnode_leaf_block, fairport::bth_leaf_node< K, V >, and fairport::bt_leaf_page< K, V >.

template<typename K, typename V>
void fairport::btree_node_leaf< K, V >::last ( btree_iter_impl< K, V > &  iter) const [inline, protected, virtual]

Positions the iterator at the "end" element.

Parameters:
[in,out]iterIterator state class

Implements fairport::btree_node< K, V >.

Definition at line 153 of file btree.h.

template<typename K, typename V >
const V & fairport::btree_node_leaf< K, V >::lookup ( const K &  key) const [virtual]

Looks up the associated value for a given key.

Exceptions:
key_not_found<K>if the requested key is not in this btree
Parameters:
[in]keyThe key to lookup
Returns:
The associated value

Implements fairport::btree_node< K, V >.

Definition at line 292 of file btree.h.

template<typename K, typename V>
void fairport::btree_node_leaf< K, V >::next ( btree_iter_impl< K, V > &  iter) const [protected, virtual]

Moves the iterator to the next element.

Parameters:
[in,out]iterIterator state class

Implements fairport::btree_node< K, V >.

Definition at line 306 of file btree.h.

template<typename K, typename V>
void fairport::btree_node_leaf< K, V >::prev ( btree_iter_impl< K, V > &  iter) const [protected, virtual]

Moves the iterator to the previous element.

Parameters:
[in,out]iterIterator state class

Implements fairport::btree_node< K, V >.

Definition at line 330 of file btree.h.


Friends And Related Function Documentation

template<typename K, typename V>
friend class const_btree_node_iter< K, V > [friend]

Reimplemented from fairport::btree_node< K, V >.

Definition at line 150 of file btree.h.


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