- All Known Implementing Classes:
public interface StateA State is a dynamic state of the finite state machine. It may either be a static (non-counting) AutomatonState, or a dynamically-created CountingState, which represents the combination of an AutomatonState and a counter value
All Methods Instance Methods Abstract Methods Modifier and Type Method Description
getEdges()Get an iterator over all the transitions (edges) allowed from this state
getTransition(int token, UserComplexType type)Find the edge representing the transition from this state to another state, that is triggered by a given input token
getWildcardEdges()Get an array of the wildcard transitions (edges) allowed from this state.
isFinalState()Ask whether this state is a valid final state, that is, no further transitions are needed to complete a successful path through the finite state machine
listAllowedElements()Construct a human-readable message explaining what elements are permitted as transitions from this state
Edge getTransition(int token, UserComplexType type)
token- the input token, specifically the fingerprint of an element name
type- the complex type whose content model we are validating against
- the Edge representing the selected transition of the finite state machine, or null if this token is not accepted when in this State (which implies a validation error).
- true if this is a valid final state
- A message indicating what elements may come next
Edge getWildcardEdges()Get an array of the wildcard transitions (edges) allowed from this state.
- an array containing all the edges that represent element wildcards.