BTree< K, V, ORDER >::Iterator Class Reference

A BTree iterator. More...

#include <BTree.h++>

Inheritance diagram for BTree< K, V, ORDER >::Iterator:

Collaboration diagram for BTree< K, V, ORDER >::Iterator:

Public Member Functions
	Iterator (BTree< K, V, ORDER > &tree)
	Construct a new Iterator for the given BTree. More...
virtual	~Iterator ()
	Destructor. More...
virtual void	rewind ()
	Rewind the iterator to the first item in the sequence. More...
virtual V	next ()
	Get the next item in the sequence. More...
virtual bool	hasNext ()
	Test if there are more items in the sequence. More...
virtual void	remove ()
	Remove the current item from the sequence. More...

Detailed Description

template<typename K, typename V, int ORDER = 10>
class ccxx::BTree< K, V, ORDER >::Iterator

A BTree iterator.

Author

Mark Lindner.

Constructor & Destructor Documentation

Iterator()

Iterator

(

BTree< K, V, ORDER > &

tree

)

Construct a new Iterator for the given BTree.

~Iterator()

virtual ~Iterator ( )

inlinevirtual

Destructor.

Reimplemented from Iterator< V >.

Member Function Documentation

hasNext()

virtual bool hasNext ( )

virtual

Test if there are more items in the sequence.

Implements Iterator< V >.

next()

virtual V next ( )

virtual

Get the next item in the sequence.

Implements Iterator< V >.

remove()

virtual void remove ( )

virtual

Remove the current item from the sequence.

Implements Iterator< V >.

rewind()

virtual void rewind ( )

virtual

Rewind the iterator to the first item in the sequence.

Implements Iterator< V >.

---

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

• BTree.h++