fairport::const_btree_node_iter< K, V > Class Template Reference

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 >:

List of all members.

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

---

Detailed Description

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

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.

Parameters:

K	key type
V	value type

Definition at line 228 of file btree.h.

---

Constructor & Destructor Documentation

template<typename K , typename V >

fairport::const_btree_node_iter< K, V >::const_btree_node_iter

(

)

Default constructor.

Definition at line 425 of file btree.h.

template<typename K , typename V >

fairport::const_btree_node_iter< K, V >::const_btree_node_iter	(	const btree_node< K, V > *	root,
		bool	last
	)

Constructs an iterator from a root node.

Parameters:

[in]	root	The root of the BTree to iterator over
[in]	last	True if this is a begin iterator, false for an end iterator

Definition at line 432 of file btree.h.

---

Friends And Related Function Documentation

template<typename K , typename V >

friend class boost::iterator_core_access [friend]

Definition at line 240 of file btree.h.

---

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

• fairport/util/btree.h