State

open class State<ID, V : Value<ID, V, S>, S : State<ID, V, S>>(transitionsFn: () -> Set<S>, invariants: List<Invariant<ID, V, S>> = emptyList())

Constructors

constructor(transitionsFn: () -> Set<S>, invariants: List<Invariant<ID, V, S>> = emptyList())

all states that are reachable from this state

all states that can be transitioned to directly from this state

Whether this state can transition to the given other state.

Whether this state could directly or indirectly transition to the given state.

Finds the shortest path to a given state using a naive recursive algorithm.

fun validate(value: V): Result<V>

Ensure that the provided value meets all the declared invariants for this state.