scala-automata/org.maraist.fa.full/UnindexedFA

UnindexedFA

trait UnindexedFA[S, T, -Z <: (AutomatonStyle)] extends UnindexedFA[S, T, Z]

Partial implementation of an indexed finite automaton using `IndexedSeq`s and Arrays.

Type Params
S

The type of all states of the automaton

T

The type of labels on (non-epsilon) transitions of the automaton

Z

Type of style options for Graphviz export

trait UnindexedFA[S, T, Z]
trait Pretty
trait Graphable[S, T, Z]
class Object
trait Matchable
class Any
trait FA[S, T, Z]
trait DFA[S, T, Z]
class DFA[S, T]
trait EdgeAnnotatedDFA[S, T, A, Z]
trait NFA[S, T, G, D, NZ, DZ]
class NFA[S, T]
trait EdgeAnnotatedNFA[S, T, NA, DA, G, D, NZ, DZ]
trait FABuilder[S, T, A, K, Z]
trait DFABuilder[S, T, D, K, Z]
class DFABuilder[S, T]
trait NFABuilder[S, T, G, D, N, K, NZ, DZ]
class NFABuilder[S, T]
trait EdgeAnnotatedNFABuilder[S, T, NA, DA, G, D, N, K, NZ, DZ]
trait UnindexedDFA[S, T, Z]
trait UnindexedPFA[S, T, Z]
trait PFA[S, T, Z]
class PFA[S, T]
trait PFABuilder[S, T, A, K, Z]
class PFABuilder[S, T]

Value members

Concrete methods

protected
def afterStatePlot(sb: StringBuilder, style: Z[S, T], stateList: IndexedSeq[S], stateMap: Map[S, Int]): Unit
protected
def assemblePrettyTransition(before: Doc, arrow: Doc, after: Doc): Doc
protected
def checkState: Unit
def dump(out: PrintStream): Unit
protected
def edgeText(style: Z[S, T], si0: Int, s0: S, ti0: Int, t: T, si1: Int, s1: S): String
protected
def edgeText(style: Z[S, T], si0: Int, s0: S, si1: Int, s1: S): String
protected
def finishPlot(sb: StringBuilder): Unit
override
def foreachFinalState(action: S => Unit { def apply(s: S): Unit; }): Unit
Definition Classes
override
def foreachInitialState(action: S => Unit { def apply(s: S): Unit; }): Unit
Definition Classes
override
def foreachState(action: S => Unit { def apply(s: S): Unit; }): Unit
Definition Classes
override
def foreachTransition(action: (S, T, S) => Unit { def apply(s1: S, t: T, s2: S): Unit; }): Unit
Definition Classes
protected
def initPlot(sb: StringBuilder, states: Int, labels: Int): Unit
protected
def internalsToDOT(stateList: IndexedSeq[S], stateMap: Map[S, Int], theLabels: IndexedSeq[T], sb: StringBuilder)(using style: Z[S, T]): Unit

Internal routine used by [[#toDOT]]. Subclesses may override, but still call super.internalsToDOT, to extend the Graphviz representation of a DFA.

Internal routine used by [[#toDOT]]. Subclesses may override, but still call super.internalsToDOT, to extend the Graphviz representation of a DFA.

protected
def plotInitialStateMarker(sb: StringBuilder, style: Z[S, T], s: S, idx: Int): Unit

Add decorations for an initial state.

Add decorations for an initial state.

protected
def plotPresentEdge(sb: StringBuilder, style: Z[S, T], stateList: IndexedSeq[S], stateMap: Map[S, Int], si0: Int, s0: S, ti0: Int, t: T, si1: Int, s1: S): Unit
protected
def plotPresentEdge(sb: StringBuilder, style: Z[S, T], stateList: IndexedSeq[S], stateMap: Map[S, Int], si0: Int, s0: S, si1: Int, s1: S): Unit
protected
def plotState(sb: StringBuilder, style: Z[S, T], si: Int, s: S, isInitial: Boolean, isFinal: Boolean): Unit
protected
def plotTransitions(stateList: IndexedSeq[S], stateMap: Map[S, Int], theLabels: IndexedSeq[T], sb: StringBuilder, style: Z[S, T]): Unit
def pretty: Doc
protected
def prettyETransition(src: S, dest: S): Doc
protected
def prettyETransitionArrow(src: S, dest: S): Doc
protected
def prettyFooter: Doc
protected
def prettyHeader: Doc
protected
def prettyState(s: S): Doc
protected
def prettyStateInTransition(state: S): Doc
protected
def prettyStateLeader(s: S): Doc
protected
def prettyStates: Doc
protected
def prettyTransition(src: S, label: T, dest: S): Doc
protected
def prettyTransitionArrow(src: S, label: T, dest: S): Doc
protected
def prettyTransitions: Doc
override
def toDOT(using Z[S, T]): String
Definition Classes
Graphable
override
def transitionTriples: Iterable[(S, T, S)]
Definition Classes

Inherited methods

def accepts(string: Seq[T]): Boolean

Returns true if this automaton accepts the given string.

Returns true if this automaton accepts the given string.

Inherited from
UnindexedFA
def eTransitionPairs: Iterable[(S, S)]

Return the pairs comprising all unlabelled transitions.

Return the pairs comprising all unlabelled transitions.

Inherited from
UnindexedFA
def finalStates: Set[S]

Returns the Set of final states in this automaton.

Returns the Set of final states in this automaton.

Inherited from
UnindexedFA
def foreachETransition(action: (S, S) => Unit { def apply(s1: S, s2: S): Unit; }): Unit

Perform some action for each epsilon transition in the automaton. Note that in many (deterministic) automata, this method is a no-op, but in included for an easy consistency.

Perform some action for each epsilon transition in the automaton. Note that in many (deterministic) automata, this method is a no-op, but in included for an easy consistency.

Inherited from
UnindexedFA
def graphviz(sourceFile: String, outputFile: String)(using options: Z[S, T]): Unit

Use Graphviz to render this object as specified.

Use Graphviz to render this object as specified.

Inherited from
Graphable
def graphviz(fileRoot: String)(using options: Z[S, T]): Unit

Use Graphviz to render this object (in the default format) to the given file.

Use Graphviz to render this object (in the default format) to the given file.

Inherited from
Graphable
def initialStates: Set[S]

Returns the Set of initial states in this automaton.

Returns the Set of initial states in this automaton.

Inherited from
UnindexedFA
def isFinalState(s: S): Boolean

Returns whether the given state s is final in this automaton.

Returns whether the given state s is final in this automaton.

Inherited from
UnindexedFA
def isInitialState(s: S): Boolean

Returns whether the given state s is initial in this automaton.

Returns whether the given state s is initial in this automaton.

Inherited from
UnindexedFA
def isState(s: S): Boolean

Returns true if s is used as a state

Returns true if s is used as a state

Inherited from
UnindexedFA
def labels: Iterable[T]

Set of automaton transition labels

Set of automaton transition labels

Inherited from
UnindexedFA
def map[S2, T2](stateMap: S => S2, transitionMap: T => T2): UnindexedFA[S2, T2, Z]

Derive a new isomorphic automaton from this one by applying transforms to the states and transitions. This method does not check that either map is injective: if they are not, then the result may be unpredictable.

Derive a new isomorphic automaton from this one by applying transforms to the states and transitions. This method does not check that either map is injective: if they are not, then the result may be unpredictable.

Inherited from
UnindexedFA
def mapStates[S2](stateMap: S => S2): UnindexedFA[S2, T, Z]

Derive a new isomorphic automaton from this one by applying transforms to the states. This method does not check that the stateMap is injective: if it is not, then the result may have separate states which cannot be distinguished.

Derive a new isomorphic automaton from this one by applying transforms to the states. This method does not check that the stateMap is injective: if it is not, then the result may have separate states which cannot be distinguished.

Inherited from
UnindexedFA
def mapTransitions[T2](transitionMap: T => T2): UnindexedFA[S, T2, Z]

Derive a new isomorphic automaton from this one by applying transforms to the transitions. This method does not check that the transitionMap is injective: if it is not, then the result may have separate transitions which cannot be distinguished.

Derive a new isomorphic automaton from this one by applying transforms to the transitions. This method does not check that the transitionMap is injective: if it is not, then the result may have separate transitions which cannot be distinguished.

Inherited from
UnindexedFA
def size: Int

Number of states in the automaton

Number of states in the automaton

Inherited from
UnindexedFA
def states: Iterable[S]

The states themselves

The states themselves

Inherited from
UnindexedFA
def transitions(s: S, t: T): Set[S]

Returns the (possibly empty, and in deterministic implementations at most singleton) set of states into which the automaton could transition starting from s via a transition labelled t.

Returns the (possibly empty, and in deterministic implementations at most singleton) set of states into which the automaton could transition starting from s via a transition labelled t.

Inherited from
UnindexedFA