HashMap< K, T, H, A, E >::Iter Class Reference

#include <elm/data/HashMap.h>

Inheritance diagram for HashMap< K, T, H, A, E >::Iter:

Public Member Functions
	Iter (const self_t &htab)
	Iter (const self_t &htab, bool end)
bool	ended (void) const
const T &	item (void) const
void	next (void)
const K &	key (void) const
bool	equals (const Iter &it) const
Public Member Functions inherited from InplacePreIterator< Iter, T >
bool	operator() () const
bool	operator! () const
const T &	operator* () const
const T &	operator-> () const
Iter &	operator++ ()
void	operator++ (int)
bool	operator== (const Iter &i) const
bool	operator!= (const Iter &i) const

Additional Inherited Members
Public Types inherited from InplacePreIterator< Iter, T >
typedef T	t
Public Attributes inherited from InplacePreIterator< Iter, T >
const typedef T &	return_t

Detailed Description

template<class K, class T, class H = HashKey<K>, class A = DefaultAlloc, class E = Equiv<T>>
class elm::HashMap< K, T, H, A, E >::Iter

Iterator on the items of the map.

Constructor & Destructor Documentation

Iter() [1/2]

Iter ( const self_t &  htab )

inline

Iter() [2/2]

Iter ( const self_t &  htab, bool  end  )

inline

Member Function Documentation

ended()

bool ended ( void  ) const

inline

equals()

bool equals ( const Iter &  it ) const

inline

item()

const T& item ( void  ) const

inline

References HashTable< T, H, A >::Iter::item().

key()

const K & key ( void  ) const

inline

Get the key of the current item.

Returns

Current item key.

References HashTable< T, H, A >::Iter::item().

next()

void next ( void  )

inline

---

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

• include/elm/data/HashMap.h
• src/data_HashTable.cpp