Concept
RandomAccessIteratorConcept
An iterator allowing random access.
Concept Definition
Required Metafunctions
Type of an object that stores the difference between two iterators. | |
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
Tests whether iterator is at nil position. | |
The difference between two iterators. | |
Iterates some steps further. | |
Iterates to next position. (ForwardIteratorConcept) | |
Moves iterator to nil position. | |
Iterates to pevious position. (BidirectionalIteratorConcept) | |
C++ built-in greater-than comparison operator. | |
C++ built-in greather-than-or-equal comparison operator. | |
C++ built-in less-than comparison operator. (LessThanComparableConcept) | |
C++ built-in less-than-or-equal comparison operator. | |
C++ built-in multiplication operator. (InputIteratorConcept) | |
C++ built-in addition operator. | |
C++ built-in prefix increment operator. (InputIteratorConcept) | |
C++ built-in suffix increment operator. (InputIteratorConcept) | |
C++ built-in addition assignment operator. | |
C++ built-in subtraction operator. | |
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. | |
C++ built-in array subscript operator. |
Refinements
An iterator that is both rooted and random access, allowing to implement position. |
Include Headers
seqan/basic.h
Remarks
The SeqAn iterators mirror the definitions from ConceptC++.
Implemented by
Allows to modify arbitrary iterators by specializing what differs from an origin. |
Used By Function
Functions
Counts the number of times each residue of a fixed sequence alphabet occurs in a given sequence. | |
Counts the number of times each residue of a fixed sequence alphabet occurs in a given set of sequences. | |
Tests whether iterator is at nil position. | |
Determines the background letter frequencies in a given dataset | |
Converts a pattern into a profile which consists of a set of frequency distributions. | |
Represents the EM algorithm as used by MEME. | |
Access to the value. (IteratorAssociatedTypesConcept) | |
Iterates to next position. (ForwardIteratorConcept) | |
Moves iterator to nil position. | |
Iterates to pevious position. (BidirectionalIteratorConcept) | |
Determines the Hamming distance between two sequences. | |
Reference to the value. (IteratorAssociatedTypesConcept) |
Examples
In the following, x is an iterator to type X , t is a valid rvalue of type X , n is a distance type.
The following expressions must be valid.
x + n // Iterator addition.
n + i // Iterator addition.
x -= n // Iterator subtraction assignment.
x - n // Iterator subtraction.
x - a // Difference.
x[n] // Element operator.
SeqAn - Sequence Analysis Library - www.seqan.de