Util::HashTable< KEYTYPE, VALUETYPE, TABLE_SIZE, STACK_SIZE >::Iterator Class Reference

#include <hashtable.h>

Public Member Functions
Iterator &	operator++ (int)
	progress to next item in the hash table
const bool	operator== (const Iterator &rhs) const
	check if iterator is identical
const bool	operator!= (const Iterator &rhs) const
	check if iterator is identical

Public Attributes
VALUETYPE *	val
	the current value
KEYTYPE const *	key

Private Attributes
FixedArray< StackArray< KeyValuePair< KEYTYPE, VALUETYPE >, STACK_SIZE > > *	arr
uint32_t	hashIndex
IndexT	bucketIndex

Friends
class	HashTable< KEYTYPE, VALUETYPE, TABLE_SIZE, STACK_SIZE >

Member Function Documentation

operator!=()

template<class KEYTYPE , class VALUETYPE , int TABLE_SIZE, int STACK_SIZE>

const bool Util::HashTable< KEYTYPE, VALUETYPE, TABLE_SIZE, STACK_SIZE >::Iterator::operator!=

(

const Iterator &

rhs

)

const

check if iterator is identical

operator++()

template<class KEYTYPE , class VALUETYPE , int TABLE_SIZE, int STACK_SIZE>

HashTable< KEYTYPE, VALUETYPE, TABLE_SIZE, STACK_SIZE >::Iterator & Util::HashTable< KEYTYPE, VALUETYPE, TABLE_SIZE, STACK_SIZE >::Iterator::operator++

(

int

)

progress to next item in the hash table

operator==()

template<class KEYTYPE , class VALUETYPE , int TABLE_SIZE, int STACK_SIZE>

const bool Util::HashTable< KEYTYPE, VALUETYPE, TABLE_SIZE, STACK_SIZE >::Iterator::operator==

(

const Iterator &

rhs

)

const

check if iterator is identical

Friends And Related Symbol Documentation

HashTable< KEYTYPE, VALUETYPE, TABLE_SIZE, STACK_SIZE >

template<class KEYTYPE , class VALUETYPE , int TABLE_SIZE = 128, int STACK_SIZE = 1>

friend class HashTable< KEYTYPE, VALUETYPE, TABLE_SIZE, STACK_SIZE >

friend

Member Data Documentation

arr

template<class KEYTYPE , class VALUETYPE , int TABLE_SIZE = 128, int STACK_SIZE = 1>

FixedArray<StackArray<KeyValuePair<KEYTYPE, VALUETYPE>, STACK_SIZE> >* Util::HashTable< KEYTYPE, VALUETYPE, TABLE_SIZE, STACK_SIZE >::Iterator::arr

private

bucketIndex

template<class KEYTYPE , class VALUETYPE , int TABLE_SIZE = 128, int STACK_SIZE = 1>

IndexT Util::HashTable< KEYTYPE, VALUETYPE, TABLE_SIZE, STACK_SIZE >::Iterator::bucketIndex

private

hashIndex

template<class KEYTYPE , class VALUETYPE , int TABLE_SIZE = 128, int STACK_SIZE = 1>

uint32_t Util::HashTable< KEYTYPE, VALUETYPE, TABLE_SIZE, STACK_SIZE >::Iterator::hashIndex

private

key

template<class KEYTYPE , class VALUETYPE , int TABLE_SIZE = 128, int STACK_SIZE = 1>

KEYTYPE const* Util::HashTable< KEYTYPE, VALUETYPE, TABLE_SIZE, STACK_SIZE >::Iterator::key

val

template<class KEYTYPE , class VALUETYPE , int TABLE_SIZE = 128, int STACK_SIZE = 1>

VALUETYPE* Util::HashTable< KEYTYPE, VALUETYPE, TABLE_SIZE, STACK_SIZE >::Iterator::val

the current value

---

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

• /github/workspace/code/foundation/util/hashtable.h