Class Specialization
RightArrayBinaryTree Iterator
An iterator for RightArrayBinaryTree.
| |||||||||||||
 | | ||||||||||||
RightArrayBinaryTree Iterator | |||||||||||||
Include Headers
seqan/index.h
Parameters
The RightArrayBinaryTree. Types: RightArrayBinaryTree | |
Specialisation Tag. Types: TopDown Iterator |
Specialization of
Implements
Metafunctions
| Type of the container given an iterator. (Iter) | |
| Type of an object that stores the difference between two iterators. (Iter) | |
| Type for reading values. (Iter) | |
| Type of iterator objects that are used to traverse the container. (Iter) | |
| Type of an object that represents a position in a container. (Iter) | |
| Reference type. (Iter) | |
| The spec of a class. (Iter) | |
| Type of the items in the container or behind an iterator. (Iter) |
Functions
| Assigns value to item. (Iter) | |
| Determines whether an iterator is at the beginning position. (Iter) | |
| Determines whether an iterator is at the end position. (Iter) | |
| Returns true if the iterator is at the end of a sequence. (Iter) | |
| Container of an iterator. (Iter) | |
| The difference between two iterators. (Iter) | |
| This function returns the pivot character of the node the iterator currently points to. | |
| Returns the position in RightArrayBinaryTree of the left child vertex. | |
| Returns the position of the iterator in the host. | |
| Returns the position in RightArrayBinaryTree of the right child vertex. | |
| Returns the number of vertices in the subtree starting at the position an iterator points to. | |
| Access to the value. (Iter) | |
| Iterates to the first position of a container. (Iter) | |
| Iterates down one edge or a path in a tree. | |
| Iterates to the last position of a container. (Iter) | |
| Iterates some steps further. (Iter) | |
| Sets the iterator to the left child of the current node if it exists and returns true, otherwise the iterator does not change position and the function returns false. | |
| Iterates to next position. (Iter) | |
| Iterates to pevious position. (Iter) | |
| Iterates to the next sibling in a tree. | |
| Sets the iterator to the right child of the current node if it exists and returns true, otherwise the iterator does not change position and the function returns false. | |
| Test whether a tree iterator points to a leaf. | |
| Test whether a tree iterator points to the root node. | |
| Assigns value to item. (Iter) | |
| Position of an iterator. (Iter) | |
| Reference to the value. (Iter) |
SeqAn - Sequence Analysis Library - www.seqan.de