Concept
Iterator
Object that iterates through container.
Iterator | |||||||
![]() | ![]() | ||||||
Concept Definition
Required Metafunctions
Type of an object that stores the difference between two iterators. | |
Type for reading values. | |
Reference type. | |
Type of an object that is suitable to hold size information. | |
Type of the items in the container. |
Required Functions
Assigns one object to another object. | |
Assigns value to item. | |
Access to the value. | |
Iterates to next position. | |
Assigns value to item. | |
Reference to the value. |
Refinements
Iterator that knows its container. |
Implemented by
Iterator for an efficient postorder depth-first search in a suffix tree. | |
Iterator that is used to traverse containers. | |
Allows to modify arbitrary iterators by specializing what differs from an origin. | |
Iterator for suffix trees that can go down, right, and up. Supports depth-first search. |
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 sequence. | |
Counts the number of times each residue of a fixed sequence alphabet occurs in a given set of sequences. | |
Counts the number of times each residue of a fixed sequence alphabet occurs in a given set of sequences. | |
Determines the background letter frequencies in a given dataset | |
Determines the background letter frequencies in a given dataset | |
Converts a pattern into a profile which consists of a set of frequency distributions. | |
Converts a pattern into a profile which consists of a set of frequency distributions. | |
Represents the EM algorithm as used by MEME. | |
Determines the Hamming distance between two sequences. | |
Determines the Hamming distance between two sequences. | |
Determines the Hamming distance between two sequences. |
See Also
SeqAn - Sequence Analysis Library - www.seqan.de