Concept
FiniteOrderedAlphabetConcept
An type that is of finite domain and totally ordered and thus has a minimum and maximum value.
| |||||||||||||||||||||||||||||||||||||||||||||||||||||
![]() | ![]() | ||||||||||||||||||||||||||||||||||||||||||||||||||||
FiniteOrderedAlphabetConcept | |||||||||||||||||||||||||||||||||||||||||||||||||||||
Concept Definition
Refines
Required Metafunctions
| Number of bits needed to store a value. (AlphabetConcept) | |
| Supremum for a given type. (OrderedAlphabetConcept) | |
| Infimum for a given type. (OrderedAlphabetConcept) | |
| Number of different values a value type object can have. |
Required Functions
| Assigns one object to another object. (AssignableConcept) | |
| Implements minValue. (OrderedAlphabetConcept) | |
| Supremum for a given type. (OrderedAlphabetConcept) | |
| Infimum for a given type. (OrderedAlphabetConcept) | |
| C++ built-in greater-than comparison operator. (ComparableConcept) | |
| C++ built-in greather-than-or-equal comparison operator. (ComparableConcept) | |
| C++ built-in less-than comparison operator. (OrderedAlphabetConcept) | |
| C++ built-in less-than-or-equal comparison operator. (ComparableConcept) | |
| C++ built-in Assignment operator. (AssignableConcept) | |
| Maps an alphabet 1-to-1 to the interval [0..ValueSize). | |
| Implements maxValue. (OrderedAlphabetConcept) | |
| Returns size of an alphabet. |
Include Headers
seqan/basic.h
Implemented by
| Implementation for "simple" types. |
Metafunctions
| Number of different values a value type object can have. |
SeqAn - Sequence Analysis Library - www.seqan.de
