hxhash_table< node_t_, deleter_t_, multi_t_, table_size_bits_ >::const_iterator Class Reference

#include <hxhash_table.hpp>

Public Member Functions
	const_iterator (void)
const_iterator &	operator++ (void)
const_iterator	operator++ (int)
bool	operator== (const const_iterator &x_) const
const node_t_ &	operator* (void) const
const node_t_ *	operator-> (void) const

Detailed Description

template<hxhash_table_concept_ node_t_, typename deleter_t_ = hxdefault_delete, bool multi_t_ = false, uint32_t table_size_bits_ = hxallocator_dynamic_capacity>
class hxhash_table< node_t_, deleter_t_, multi_t_, table_size_bits_ >::const_iterator

const_iterator - A const forward iterator over the elements of the hash table.

Iteration is Θ(n + (1 << table_size_bits)). Iterators are only invalidated by the removal of the node_t referenced. WARNING: The iterators will automatically convert themselves to pointers when used in pointer context.

Constructor & Destructor Documentation

const_iterator()

template<hxhash_table_concept_ node_t_, typename deleter_t_ = hxdefault_delete, bool multi_t_ = false, uint32_t table_size_bits_ = hxallocator_dynamic_capacity>

hxhash_table< node_t_, deleter_t_, multi_t_, table_size_bits_ >::const_iterator::const_iterator ( void )

inline

Constructs an iterator pointing to the end of the hash table.

Member Function Documentation

operator*()

template<hxhash_table_concept_ node_t_, typename deleter_t_ = hxdefault_delete, bool multi_t_ = false, uint32_t table_size_bits_ = hxallocator_dynamic_capacity>

const node_t_ & hxhash_table< node_t_, deleter_t_, multi_t_, table_size_bits_ >::const_iterator::operator*

(

void

)

const

Dereferences the iterator to access the current node_t.

operator++() [1/2]

template<hxhash_table_concept_ node_t_, typename deleter_t_ = hxdefault_delete, bool multi_t_ = false, uint32_t table_size_bits_ = hxallocator_dynamic_capacity>

const_iterator hxhash_table< node_t_, deleter_t_, multi_t_, table_size_bits_ >::const_iterator::operator++ ( int )

inline

Advances the iterator to the next element (post-increment).

operator++() [2/2]

template<hxhash_table_concept_ node_t_, typename deleter_t_ = hxdefault_delete, bool multi_t_ = false, uint32_t table_size_bits_ = hxallocator_dynamic_capacity>

const_iterator & hxhash_table< node_t_, deleter_t_, multi_t_, table_size_bits_ >::const_iterator::operator++

(

void

)

Advances the iterator to the next element.

operator->()

template<hxhash_table_concept_ node_t_, typename deleter_t_ = hxdefault_delete, bool multi_t_ = false, uint32_t table_size_bits_ = hxallocator_dynamic_capacity>

const node_t_ * hxhash_table< node_t_, deleter_t_, multi_t_, table_size_bits_ >::const_iterator::operator->

(

void

)

const

Dereferences the iterator to access the current node_t's pointer.

operator==()

template<hxhash_table_concept_ node_t_, typename deleter_t_ = hxdefault_delete, bool multi_t_ = false, uint32_t table_size_bits_ = hxallocator_dynamic_capacity>

bool hxhash_table< node_t_, deleter_t_, multi_t_, table_size_bits_ >::const_iterator::operator==

(

const const_iterator &

x_

)

const

Compares two iterators for equality.

• x : The iterator to compare against.

---

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

• include/hx/hxhash_table.hpp