Concept
ForwardIteratorConcept
Iterator that allows passing over a linear sequence multiple times.
Concept Definition
Required Metafunctions
| Type of an object that stores the difference between two iterators. (IteratorAssociatedTypesConcept) | |
| Type for reading values. (IteratorAssociatedTypesConcept) | |
| Returns pointer to an object, required for operator->, for example. (IteratorAssociatedTypesConcept) | |
| Reference type. (IteratorAssociatedTypesConcept) | |
| Type of the items in the container or behind an iterator. (IteratorAssociatedTypesConcept) |
Required Functions
| Iterates to next position. | |
| C++ built-in multiplication operator. (InputIteratorConcept) | |
| C++ built-in prefix increment operator. (InputIteratorConcept) | |
| C++ built-in suffix increment operator. (InputIteratorConcept) | |
| C++ built-in structure dereference operator. (InputIteratorConcept) |
Refinements
| Iterator that can be both incremented and decremented. | |
| A Bidirectional Iterator that allows dereferenced assignment | |
| A Forward Iterator that allows dereferenced assignment. | |
| A Rooted Iterator that allows dereferenced assignment. | |
| Iterator that knows its container. |
Include Headers
seqan/basic.h
Remarks
The SeqAn iterators mirror the definitions from ConceptC++.
Implemented by
| Iterator of the annotation tree represented by a FragmentStore. (RootedIteratorConcept) | |
| Iterator for an efficient postorder depth-first search in a suffix tree. | |
| Allows to modify arbitrary iterators by specializing what differs from an origin. (RandomAccessIteratorConcept) | |
| String tree iterator that can go down, right, and up. Supports depth-first search. |
Functions
| Access to the value. (IteratorAssociatedTypesConcept) | |
| Reference to the value. (IteratorAssociatedTypesConcept) |
Examples
In the following, x is an iterator to type X .
The following expressions must be valid.
x++ // Postincrement.
SeqAn - Sequence Analysis Library - www.seqan.de