Concept
OrderedAlphabetConcept
Totally strict ordered alphabet.
| |||||||||||||||||||||||||||||||||||||||||||||||
![]() | ![]() | ||||||||||||||||||||||||||||||||||||||||||||||
OrderedAlphabetConcept | |||||||||||||||||||||||||||||||||||||||||||||||
![]() | ![]() | ||||||||||||||||||||||||||||||||||||||||||||||
Concept Definition
Refines
Required Metafunctions
| Number of bits needed to store a value. (AlphabetConcept) | |
| Supremum for a given type. | |
| Infimum for a given type. |
Required Functions
| Assigns one object to another object. (AssignableConcept) | |
| Implements minValue. | |
| Supremum for a given type. | |
| Infimum for a given type. | |
| 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. | |
| C++ built-in less-than-or-equal comparison operator. (ComparableConcept) | |
| C++ built-in Assignment operator. (AssignableConcept) | |
| Implements maxValue. |
Refinements
| An type that is of finite domain and totally ordered and thus has a minimum and maximum value. |
Include Headers
seqan/basic.h
Implemented by
| Implementation for "simple" types. (FiniteOrderedAlphabetConcept) |
Functions
| Implements minValue. | |
| Supremum for a given type. | |
| Infimum for a given type. | |
| Implements maxValue. |
Part of Concept
SeqAn - Sequence Analysis Library - www.seqan.de
