Base class for all iterators. More...

#include <Set.h>

Public Types
using	iterator_category = std::forward_iterator_tag

using	value_type = IteratorBase<REVERSE>

using	difference_type = std::ptrdiff_t

using	pointer = IteratorBase<REVERSE>*

using	reference = IteratorBase<REVERSE>&

Public Member Functions
	PL_DECLARE_POD_TYPE ()

PL_ALWAYS_INLINE	IteratorBase ()
	Constructs an invalid iterator.

PL_ALWAYS_INLINE bool	IsValid () const
	Checks whether this iterator points to a valid element.

PL_ALWAYS_INLINE bool	operator== (const typename plSetBase< KeyType, Comparer >::IteratorBase< REVERSE > &it2) const
	Checks whether the two iterators point to the same element.

	PL_ADD_DEFAULT_OPERATOR_NOTEQUAL (const typename plSetBase< KeyType, Comparer >::IteratorBase< REVERSE > &)

PL_FORCE_INLINE const KeyType &	Key () const
	Returns the 'key' of the element that this iterator points to.

PL_ALWAYS_INLINE const KeyType &	operator* () const
	Returns the 'key' of the element that this iterator points to.

void	Next ()
	Advances the iterator to the next element in the set. The iterator will not be valid anymore, if the end is reached.

void	Prev ()
	Advances the iterator to the previous element in the set. The iterator will not be valid anymore, if the end is reached.

PL_ALWAYS_INLINE void	operator++ ()
	Shorthand for 'Next'.

PL_ALWAYS_INLINE void	operator-- ()
	Shorthand for 'Prev'.

Detailed Description

template<typename KeyType, typename Comparer>
template<bool REVERSE>
struct plSetBase< KeyType, Comparer >::IteratorBase< REVERSE >

Base class for all iterators.

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

Public Types