A refinement of seqan3::semialphabet that adds assignability. More...
#include <seqan3/alphabet/concept.hpp>
Inheritance diagram for writable_semialphabet:Related Functions | |
(Note that these are not member functions.) | |
Requirements for std::totally_ordered | |
You can expect these functions on all types that implement std::totally_ordered. | |
| bool | operator< (type const &lhs, type const &rhs) |
| Less-than, greater-than and -or-equal comparisons. More... | |
| bool | operator<= (type const &lhs, type const &rhs) |
| Less-than, greater-than and -or-equal comparisons. More... | |
| bool | operator> (type const &lhs, type const &rhs) |
| Less-than, greater-than and -or-equal comparisons. More... | |
| bool | operator>= (type const &lhs, type const &rhs) |
| Less-than, greater-than and -or-equal comparisons. More... | |
Requirements for std::equality_comparable | |
You can expect these functions on all types that implement std::Equality_comparable. | |
| bool | operator== (type const &lhs, type const &rhs) |
| (In-)Equality comparison. More... | |
| bool | operator!= (type const &lhs, type const &rhs) |
| (In-)Equality comparison. More... | |
A refinement of seqan3::semialphabet that adds assignability.
This concept refines seqan3::semialphabet and adds the requirement to be able to change the value by assigning a value of the rank representation.
For a detailed overview of how the different alphabet concepts are related, see Alphabet module.
t shall model seqan3::semialphabettSee the documentation pages for the respective requirements.
If a given type t models this concept, the following types typically do so, as well:
t &const-qualified types on the other hand are not assignable.
Types that model the concept (and all refinements) can be serialised via SeqAn serialisation support. The rank value is (de-)serialised, types need not provide any overloads themselves.