UT::ArraySet< Key, MULTI, MAX_LOAD_FACTOR_256, Clearer, Hash, KeyEqual >::const_iterator Class Reference

#include <UT_ArraySet.h>

Inheritance diagram for UT::ArraySet< Key, MULTI, MAX_LOAD_FACTOR_256, Clearer, Hash, KeyEqual >::const_iterator:

Public Member Functions
	const_iterator ()=default
	const_iterator (const iterator &non_const_it)
Public Member Functions inherited from UT::ArraySet< Key, MULTI, MAX_LOAD_FACTOR_256, Clearer, Hash, KeyEqual >::iterator_t< true >
	iterator_t ()=default
	iterator_t (pointer current, const_pointer end, bool scan=true)
	iterator_t (const iterator_t &)=default
	iterator_t (iterator_t &&)=default
iterator_t &	operator= (const iterator_t &)=default
iterator_t &	operator= (iterator_t &&)=default
bool	operator== (const iterator_t &that) const
bool	operator!= (const iterator_t &that) const
bool	atEnd () const
iterator_t< constant_type > &	operator++ ()
iterator_t< constant_type >	operator++ (int)
reference	operator* () const
pointer	operator-> () const
	operator pointer () const
pointer	getCurrent () const
const_pointer	getEnd () const

Additional Inherited Members
Public Types inherited from UT::ArraySet< Key, MULTI, MAX_LOAD_FACTOR_256, Clearer, Hash, KeyEqual >::iterator_t< true >
typedef std::forward_iterator_tag	iterator_category
typedef std::ptrdiff_t	difference_type
typedef std::conditional < constant_type, const typename ArraySet::value_type, typename ArraySet::value_type > ::type	value_type
typedef std::conditional < constant_type, const value_type, value_type >::type &	reference
typedef std::conditional < constant_type, typename set_type::const_pointer, typename set_type::pointer > ::type	pointer

Detailed Description

template<typename Key, bool MULTI = false, std::size_t MAX_LOAD_FACTOR_256 = 128, typename Clearer = DefaultClearer<Key>, class Hash = hboost::hash<Key>, class KeyEqual = std::equal_to<Key>>
class UT::ArraySet< Key, MULTI, MAX_LOAD_FACTOR_256, Clearer, Hash, KeyEqual >::const_iterator

Iterator type for iterating over constant elements. It may be useful to convert an iterator to a const_iterator, so making this a subclass lets us add a constructor for that.

Definition at line 649 of file UT_ArraySet.h.

Constructor & Destructor Documentation

template<typename Key, bool MULTI = false, std::size_t MAX_LOAD_FACTOR_256 = 128, typename Clearer = DefaultClearer<Key>, class Hash = hboost::hash<Key>, class KeyEqual = std::equal_to<Key>>

UT::ArraySet< Key, MULTI, MAX_LOAD_FACTOR_256, Clearer, Hash, KeyEqual >::const_iterator::const_iterator ( )

default

template<typename Key, bool MULTI = false, std::size_t MAX_LOAD_FACTOR_256 = 128, typename Clearer = DefaultClearer<Key>, class Hash = hboost::hash<Key>, class KeyEqual = std::equal_to<Key>>

UT::ArraySet< Key, MULTI, MAX_LOAD_FACTOR_256, Clearer, Hash, KeyEqual >::const_iterator::const_iterator ( const iterator &  non_const_it )

inline

Definition at line 655 of file UT_ArraySet.h.

---

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

• UT/UT_ArraySet.h