Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
core::ElementConstraint< automaton::EpsilonNFA< SymbolType, StateType >, StateType, automaton::InitialState > Class Template Reference

#include <EpsilonNFA.h>

Static Public Member Functions

static bool available (const automaton::EpsilonNFA< SymbolType, StateType > &automaton, const StateType &state)
 
static void valid (const automaton::EpsilonNFA< SymbolType, StateType > &, const StateType &)
 

Detailed Description

template<class SymbolType, class StateType>
class core::ElementConstraint< automaton::EpsilonNFA< SymbolType, StateType >, StateType, automaton::InitialState >

Helper class specifying constraints for the automaton's internal initial state element.

Template Parameters
SymbolTypeused for the terminal alphabet of the automaton.
StateTypeused for the terminal alphabet of the automaton.

Member Function Documentation

◆ available()

template<class SymbolType , class StateType >
static bool core::ElementConstraint< automaton::EpsilonNFA< SymbolType, StateType >, StateType, automaton::InitialState >::available ( const automaton::EpsilonNFA< SymbolType, StateType > &  automaton,
const StateType &  state 
)
inlinestatic

Determines whether the state is available in the automaton's states set.

Parameters
automatonthe tested automaton
statethe tested state
Returns
true if the state is already in the set of states of the automaton

◆ valid()

template<class SymbolType , class StateType >
static void core::ElementConstraint< automaton::EpsilonNFA< SymbolType, StateType >, StateType, automaton::InitialState >::valid ( const automaton::EpsilonNFA< SymbolType, StateType > &  ,
const StateType &   
)
inlinestatic

All states are valid as an initial state of the automaton.

Parameters
automatonthe tested automaton
statethe tested state

The documentation for this class was generated from the following file: