Description

template<class T, class Alloc = DefaultAllocator>
class Sawyer::Container::IndexedList< T, Alloc >::ValueIterator

List value bidirectional iterator.

This iterator traverse the elements of the list in the order they are stored in the list and returns a reference to the user-defined value when dereferenced. If one wants to traverse elements in the order of the ID numbers instead, just use a "for" loop to iterate from zero to the number of items in the list and make use of the constant-time lookup-by-ID feature.

Iterators are stable across insertion and erasure. In other words, an iterator is guaranteed to not become invalid when other elements are added to or removed from the container. Added elements will become part of any existing iterator traversals when they are inserted between that iterator's current and ending position.

Definition at line 260 of file IndexedList.h.

#include <Sawyer/IndexedList.h>

Inheritance diagram for Sawyer::Container::IndexedList< T, Alloc >::ValueIterator:

[legend]

Collaboration diagram for Sawyer::Container::IndexedList< T, Alloc >::ValueIterator:

[legend]

Public Member Functions
	ValueIterator (const ValueIterator &other)

	ValueIterator (const NodeIterator &other)

ValueIterator &	operator= (const ValueIterator &other)

Value &	operator* () const

Value *	operator-> () const