LDK::Hash< Key, Data, Alloc >::Iterator Class Reference

Allows iteration over a non-const Hash. More...

#include <LDK/Hash.h>

Collaboration diagram for LDK::Hash< Key, Data, Alloc >::Iterator:

[legend]

Public Member Functions
	Iterator (Hash *ht=NULL, size_t index=0)
	Iterator (const Iterator &rhs)
	Copy constructor.
Iterator &	operator= (const Iterator &rhs)
	Assignment operator.
bool	operator== (const Iterator &rhs) const
	Equals operator.
bool	operator!= (const Iterator &rhs) const
	Not equals operator.
Pair &	operator * ()
	De-reference operator to make the iterator somewhat resemble a pointer.
size_t	index () const
	The index this iterator refers to.
Iterator &	operator++ ()
	Prefix increment operator.
Iterator &	operator++ (int)
	Postfix increment operator.
Iterator &	operator-- ()
	Prefix decrement operator.
Iterator &	operator-- (int)
	Postfix decrement operator.
Friends
class	Hash

---

Detailed Description

template<class Key, class Data, template< class > class Alloc = Allocator>
class LDK::Hash< Key, Data, Alloc >::Iterator

Supports both prefix and postfix forms of increment and decrement operators. Behaves much like an STL iterator.

Definition at line 310 of file Hash.h.

---

Constructor & Destructor Documentation

template<class Key, class Data, template< class > class Alloc = Allocator>

LDK::Hash< Key, Data, Alloc >::Iterator::Iterator	(	Hash *	ht = NULL,
		size_t	index = 0
	)			[inline]

Constructor.

Parameters:

	ht	The Hash table this iterator belongs to.
	index	The index of the element this iterator referes to.

Definition at line 321 of file Hash.h.

---

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

• Hash.h

---