|
Fairport
v1.0.38
|
The actual iterator type used by the btree_node class hierarchy. More...
#include <btree.h>
Inheritance diagram for fairport::const_btree_node_iter< K, V >:
Collaboration diagram for fairport::const_btree_node_iter< K, V >:Public Member Functions | |
| const_btree_node_iter () | |
| Default constructor. | |
| const_btree_node_iter (const btree_node< K, V > *root, bool last) | |
| Constructs an iterator from a root node. | |
Friends | |
| class | boost::iterator_core_access |
The actual iterator type used by the btree_node class hierarchy.
We use the boost iterator library here to implement our iterator. All of the actual iteration logic is contained in the first, last, next, and prev member functions of the btree_node classes. They know how to modify the btree_iter_impl state class to move between various btree pages. The iterator class itself therefore is very light weight.
| K | key type |
| V | value type |
| fairport::const_btree_node_iter< K, V >::const_btree_node_iter | ( | ) |
| fairport::const_btree_node_iter< K, V >::const_btree_node_iter | ( | const btree_node< K, V > * | root, |
| bool | last | ||
| ) |
friend class boost::iterator_core_access [friend] |