hash_map< K, T >::Entry Struct Reference

Public Member Functions
	Entry (K k, T v, Entry *n)
Data Fields
std::pair< const K, T >	data
Entry *	next

---

Detailed Description

template<class K, class T>
struct hash_map< K, T >::Entry

Definition at line 27 of file hash_map.icc.

---

Constructor & Destructor Documentation

template<class K, class T>

hash_map< K, T >::Entry::Entry	(	K	k,
		T	v,
		Entry *	n
	)			[inline]

Definition at line 30 of file hash_map.icc.

: data(k,v), next(n) {}

---

Field Documentation

template<class K, class T>

std::pair<const K,T> hash_map< K, T >::Entry::data

Definition at line 28 of file hash_map.icc.

Referenced by hash_map< K, T >::erase(), hash_map< K, T >::hash_map_iterator::operator *(), and hash_map< K, T >::operator[]().

template<class K, class T>

Entry* hash_map< K, T >::Entry::next

Definition at line 29 of file hash_map.icc.

Referenced by hash_map< K, T >::erase(), hash_map< K, T >::find(), hash_map< K, T >::resize(), and hash_map< K, T >::~hash_map().

---

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

• hash_map.icc

---