The invertible_map iterator is really just a wrapper for the forward (key -> value) unordered_map iterator. More...

Inheritance diagram for meta::util::invertible_map< Key, Value >::Iterator:

Public Member Functions
	Iterator ()
	Constructor.

	Iterator (const InnerIterator &other)
	Copy constructor.

Iterator &	operator++ ()
	Pre-Increment.

Iterator	operator++ (int)
	Post-increment.

Iterator &	operator-- ()
	Pre-decrement.

Iterator	operator-- (int)
	Post-decrement.

bool	operator== (const Iterator &other)
	Iterator equality.

bool	operator!= (const Iterator &other)
	Iterator inequality.

const InnerIterator::value_type &	operator* ()
	Dereference operator. More...

const InnerIterator::value_type *	operator-> ()
	Arrow operator. More...

Private Attributes
InnerIterator	iter
	The iterator of the underlying unordered_map.

Detailed Description

The invertible_map iterator is really just a wrapper for the forward (key -> value) unordered_map iterator.

Use this iterator class the same way you'd use it on an unordered_map.

Member Function Documentation

template<class Key, class Value>

const InnerIterator::value_type& meta::util::invertible_map< Key, Value >::Iterator::operator* ( )

inline

Dereference operator.

Returns the underlying value_type, which will always be a std::pair<Key, Value>

template<class Key, class Value>

const InnerIterator::value_type* meta::util::invertible_map< Key, Value >::Iterator::operator-> ( )

inline

Arrow operator.

Returns a pointer to the underlying value_type, which will always be a std::pair<Key, Value>

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