Concept
MutableRootedRandomAccessIteratorConcept
A Rooted Iterator that allows dereferenced assignment.
Concept Definition
Required Metafunctions
Type of the container given an iterator. (RootedIteratorConcept) | |
Type of an object that stores the difference between two iterators. (RandomAccessIteratorConcept) | |
Type for reading values. (IteratorAssociatedTypesConcept) | |
Returns pointer to an object, required for operator->, for example. (IteratorAssociatedTypesConcept) | |
Type of an object that represents a position in a container. (RootedRandomAccessIteratorConcept) | |
Reference type. (IteratorAssociatedTypesConcept) | |
Type of the items in the container or behind an iterator. (IteratorAssociatedTypesConcept) |
Required Functions
Determines whether an iterator is at the beginning position. (RootedIteratorConcept) | |
Determines whether an iterator is at the end position. (RootedIteratorConcept) | |
Tests whether iterator is at nil position. (RandomAccessIteratorConcept) | |
Container of an iterator. (RootedIteratorConcept) | |
The difference between two iterators. (RandomAccessIteratorConcept) | |
Iterates to the first position of a container. (RootedRandomAccessIteratorConcept) | |
Iterates to the last position of a container. (RootedRandomAccessIteratorConcept) | |
Iterates some steps further. (RandomAccessIteratorConcept) | |
Iterates to next position. (ForwardIteratorConcept) | |
Moves iterator to nil position. (RandomAccessIteratorConcept) | |
Iterates to pevious position. (BidirectionalIteratorConcept) | |
C++ built-in greater-than comparison operator. (RandomAccessIteratorConcept) | |
C++ built-in greather-than-or-equal comparison operator. (RandomAccessIteratorConcept) | |
C++ built-in less-than comparison operator. (LessThanComparableConcept) | |
C++ built-in less-than-or-equal comparison operator. (RandomAccessIteratorConcept) | |
C++ built-in multiplication operator. (InputIteratorConcept) | |
C++ built-in addition operator. (RandomAccessIteratorConcept) | |
C++ built-in prefix increment operator. (InputIteratorConcept) | |
C++ built-in suffix increment operator. (InputIteratorConcept) | |
C++ built-in addition assignment operator. (RandomAccessIteratorConcept) | |
C++ built-in subtraction operator. (RandomAccessIteratorConcept) | |
C++ built-in structure dereference operator. (InputIteratorConcept) | |
C++ built-in prefix decrement operator. (BidirectionalIteratorConcept) | |
C++ built-in suffix decrement operator. (BidirectionalIteratorConcept) | |
C++ built-in subtraction assignment operator. (RandomAccessIteratorConcept) | |
C++ built-in array subscript operator. (RandomAccessIteratorConcept) | |
Position of an iterator. (RootedRandomAccessIteratorConcept) | |
Sets the position of a finder. (RootedRandomAccessIteratorConcept) |
Include Headers
seqan/basic.h
Used By Function
Functions
Determines whether an iterator is at the beginning position. (RootedIteratorConcept) | |
Determines whether an iterator is at the end position. (RootedIteratorConcept) | |
Container of an iterator. (RootedIteratorConcept) | |
The difference between two iterators. (RandomAccessIteratorConcept) | |
Access to the value. (IteratorAssociatedTypesConcept) | |
Iterates to the first position of a container. (RootedIteratorConcept) | |
Iterates to the last position of a container. (RootedIteratorConcept) | |
Iterates some steps further. (RandomAccessIteratorConcept) | |
Iterates to next position. (ForwardIteratorConcept) | |
Iterates to pevious position. (BidirectionalIteratorConcept) | |
Position of an iterator. (RootedRandomAccessIteratorConcept) | |
Reference to the value. (IteratorAssociatedTypesConcept) |
SeqAn - Sequence Analysis Library - www.seqan.de