Iterator which iterates of the elements of a nested sequence. More...
#include <shark/Core/utility/Iterators.h>
Public Types | |
typedef Traits::inner_iterator | inner_iterator |
Public Member Functions | |
MultiSequenceIterator () | |
template<class OuterIter , class InnerIter > | |
MultiSequenceIterator (OuterIter outerBegin, OuterIter outerEnd, OuterIter outerPosition, InnerIter innerPosition, std::size_t positionInSequence) | |
template<class S > | |
MultiSequenceIterator (MultiSequenceIterator< S > const &other) | |
std::size_t | index () const |
inner_iterator | getInnerIterator () const |
Friends | |
class | SHARK_ITERATOR_CORE_ACCESS |
template<class > | |
class | MultiSequenceIterator |
Iterator which iterates of the elements of a nested sequence.
Think about a sequence which is split in several parts. These parts are than stored into a new sequence. An example for this is std::deque or the Data class. This iterator let's you tierate over the elements of the sequence without having to care about that the sequence itself is splitted. The Sequences both have to be random access containers.
Definition at line 198 of file Iterators.h.
typedef Traits::inner_iterator shark::MultiSequenceIterator< SequenceContainer >::inner_iterator |
Definition at line 208 of file Iterators.h.
|
inline |
Definition at line 209 of file Iterators.h.
|
inline |
Definition at line 213 of file Iterators.h.
|
inline |
Definition at line 234 of file Iterators.h.
|
inline |
Definition at line 243 of file Iterators.h.
|
inline |
Definition at line 239 of file Iterators.h.
Definition at line 249 of file Iterators.h.
|
friend |
Definition at line 248 of file Iterators.h.