Class Specialization
BottomUp Iterator
Iterator for an efficient postorder depth-first search in a suffix tree.
Iterator<TContainer, BottomUp<TSpec> >::Type
Iter<TContainer, VSTree< BottomUp<TSpec> > >
Include Headers
seqan/index.h
Parameters
TContainer
Type of the container that can be iterated.
Metafunctions: Container
Types: IndexEsa
TSpec
The specialization type.
Specialization of
Specializations
MaxRepeats IteratorIterator to search for all maximal repeats.
MultiMems IteratorIterator to search for MultiMems.
Mums IteratorIterator to search for all maximum unique matches.
SuperMaxRepeats IteratorIterator to search for all supermaximal repeats.
SuperMaxRepeatsFast IteratorIterator to search for all supermaximal repeats (for enh. suffix arrays only).
Metafunctions
ContainerType of the container given an iterator. (Iter)
DifferenceType of an object that stores the difference between two iterators. (Iter)
GetValueType for reading values. (Iter)
IteratorType of iterator objects that are used to traverse the container. (Iter)
PositionType of an object that represents a position in a container. (Iter)
ReferenceReference type. (Iter)
SpecThe spec of a class. (Iter)
ValueType of the items in the container or behind an iterator. (Iter)
Member Functions
IteratorConstructor
Functions
alignmentReturns an alignment of the occurrences of the representative substring in the index text. (VSTree Iterator)
assignValueAssigns value to item. (Iter)
atBeginDetermines whether an iterator is at the beginning position. (Iter)
atEndDetermines whether an iterator is at the end position.
atEndOfSequenceReturns true if the iterator is at the end of a sequence. (Iter)
childrenAreLeavesTest whether iterator points to a node with only leaf-children. (VSTree Iterator)
containerContainer of an iterator. (VSTree Iterator)
countChildrenCount the number of children of a tree node. (VSTree Iterator)
countOccurrencesReturns the number of occurrences of representative substring or a q-gram in the index text. (VSTree Iterator)
differenceThe difference between two iterators. (Iter)
getFrequencyReturns the number of sequences, which contain the representative as a substring. (VSTree Iterator)
getOccurrenceReturns an occurrence of the representative substring or a q-gram in the index text. (VSTree Iterator)
getOccurrencesReturns all occurrences of the representative substring or a q-gram in the index text. (VSTree Iterator)
getOccurrencesBwtReturns the characters left beside all occurrence of the representative substring in the index text. (VSTree Iterator)
getValueAccess to the value. (Iter)
goBeginIterates to the first position of a container.
goEndIterates to the last position of a container.
goFurtherIterates some steps further. (Iter)
goNextIterates to next position.
goPreviousIterates to pevious position. (Iter)
isLeafTest whether a tree iterator points to a leaf. (VSTree Iterator)
isLeftMaximalTest whether the occurrences of an iterator's representative mutually differ in the character left of the hits. (VSTree Iterator)
isPartiallyLeftExtensibleTest whether the characters left of the two occurrences of representative are equal. (VSTree Iterator)
isRightTerminalTest whether iterator points to a suffix. (VSTree Iterator)
isRootTest whether a tree iterator points to the root node. (VSTree Iterator)
isUniqueTest whether the representative occurs only once in every sequence. (VSTree Iterator)
moveValueAssigns value to item. (Iter)
nodeHullPredicateIf false this node and its subtree is concealed. (VSTree Iterator)
nodePredicateIf false this node will be skipped during the bottom-up traversal. (VSTree Iterator)
positionPosition of an iterator. (Iter)
rangeReturns the suffix array interval borders of occurrences of representative substring or a q-gram in the index text. (VSTree Iterator)
repLengthReturns the length of the substring representing the path from root to iterator node. (VSTree Iterator)
representativeReturns a substring representing the path from root to iterator node. (VSTree Iterator)
valueReference to the value. (VSTree Iterator)
SeqAn - Sequence Analysis Library - www.seqan.de
 

Page built @2013/07/11 09:12:19