| Concept CopyConstructibleConcept A type with a copy-constructor.
CopyConstructibleConcept
AlphabetConcept | BasicOutputIteratorConcept | ContainerConcept | InputIteratorConcept
AlphabetWithGapsConcept | AlphabetWithQualitiesConcept
AlphabetWithUnknownValueConcept | OrderedAlphabetConcept
FiniteOrderedAlphabetConcept
MutableForwardIteratorConcept
SequenceConcept
ForwardIteratorConcept
BidirectionalIteratorConcept | MutableBidirectionalIteratorConcept
MutableRandomAccessIteratorConcept
RandomAccessIteratorConcept
RootedRandomAccessIteratorConcept
MutableRootedRandomAccessIteratorConcept
MutableRootedRandomAccessIteratorConcept
MutableForwardIteratorConcept | MutableRootedIteratorConcept
RootedIteratorConcept
RootedRandomAccessIteratorConcept
MutableRootedRandomAccessIteratorConcept
Concept Definition Refinements
AlphabetConcept | Natural container value.
BasicOutputIteratorConcept | Iterator that allows dereferenced writing.
ContainerConcept | Concept for mutable containers.
InputIteratorConcept | Iterator that allows dereferenced reading.
CopyConstructible<T> Include Headers seqan/basic.h Implemented by
AnnotationTree Iterator | Iterator of the annotation tree represented by a FragmentStore. (RootedIteratorConcept)
BottomUp Iterator | Iterator for an efficient postorder depth-first search in a suffix tree. (ForwardIteratorConcept)
Dna5Q | Alphabet for DNA plus PHRED quality including 'N' character. (AlphabetWithQualitiesConcept)
DnaQ | Alphabet for DNA plus PHRED quality. (AlphabetWithQualitiesConcept)
Gaps | Efficient storage of gaps for a sequence. (SequenceConcept)
ModifiedIterator | Allows to modify arbitrary iterators by specializing what differs from an origin. (RandomAccessIteratorConcept)
ModifiedString | Allows to modify arbitrary strings by specializing what differs from an origin. (ContainerConcept)
SimpleType | Implementation for "simple" types. (FiniteOrderedAlphabetConcept)
String | A sequence container with generic alphabet and many specializations. (ContainerConcept)
TopDownHistory Iterator | String tree iterator that can go down, right, and up. Supports depth-first search. (ForwardIteratorConcept)
Examples Valid expressions: T a(b); // b is of type T See Also DefaultConstructibleConcept SeqAn - Sequence Analysis Library - www.seqan.de

Page built @2014/10/13 16:12:57