40 for (
unsigned int j = 0; j < nbClasses; ++j)
A convenience partial implementation of the StateMap interface.
const Alphabet & alphabet() const override
std::vector< int > states_
virtual bool isGap(int state) const=0
virtual int getGapCharacterCode() const=0
virtual int getIntCodeAt(size_t stateIndex) const=0
virtual unsigned int getSize() const=0
CanonicalStateMap(std::shared_ptr< const Alphabet > alphabet, bool includeGaps)
MarkovModulatedStateMap(const StateMapInterface &unitMap, unsigned int nbClasses)
Map the states of a given alphabet which have a model state.
virtual std::shared_ptr< const Alphabet > getAlphabet() const =0
virtual size_t getNumberOfModelStates() const =0
virtual int getAlphabetStateAsInt(size_t index) const =0
Defines the basic types of data flow nodes.