Package owl.automaton
Interface EdgeMapAutomatonMixin<S,A extends OmegaAcceptance>
-
- Type Parameters:
S
- the type of the states of the automatonA
- the type of the omega-acceptance condition of the automaton
- All Superinterfaces:
Automaton<S,A>
public interface EdgeMapAutomatonMixin<S,A extends OmegaAcceptance> extends Automaton<S,A>
Mixin interface for implementing an automaton byAutomaton.edgeMap(Object)
.It is impossible to implement the incompatible sister interface
EdgesAutomatonMixin
and the compiler will reject the code, since there are conflicting defaults forAutomaton.preferredEdgeAccess()
.
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from interface owl.automaton.Automaton
Automaton.EdgeMapVisitor<S>, Automaton.EdgeTreeVisitor<S>, Automaton.EdgeVisitor<S>, Automaton.PreferredEdgeAccess, Automaton.Property, Automaton.Visitor<S>
-
-
Field Summary
Fields Modifier and Type Field Description static List<Automaton.PreferredEdgeAccess>
ACCESS_MODES
-
Method Summary
All Methods Instance Methods Default Methods Modifier and Type Method Description default Set<Edge<S>>
edges(S state)
Returns all successor edges of the specifiedstate
under any valuation.default Set<Edge<S>>
edges(S state, BitSet valuation)
Returns the successor edges of the specifiedstate
under the givenvaluation
.default ValuationTree<Edge<S>>
edgeTree(S state)
Returns a decision-tree with nodes labelled by literals and sets of edges as leaves.default List<Automaton.PreferredEdgeAccess>
preferredEdgeAccess()
Indicate if the automaton implements a fast (e.g.-
Methods inherited from interface owl.automaton.Automaton
accept, accept, accept, accept, acceptance, edge, edgeMap, factory, initialStates, is, name, onlyInitialState, predecessors, size, states, successor, successors, successors
-
-
-
-
Field Detail
-
ACCESS_MODES
static final List<Automaton.PreferredEdgeAccess> ACCESS_MODES
-
-
Method Detail
-
edges
default Set<Edge<S>> edges(S state)
Description copied from interface:Automaton
Returns all successor edges of the specifiedstate
under any valuation.- Specified by:
edges
in interfaceAutomaton<S,A extends OmegaAcceptance>
- Parameters:
state
- The starting state of the edges.- Returns:
- The set of edges originating from
state
-
edges
default Set<Edge<S>> edges(S state, BitSet valuation)
Description copied from interface:Automaton
Returns the successor edges of the specifiedstate
under the givenvaluation
.- Specified by:
edges
in interfaceAutomaton<S,A extends OmegaAcceptance>
- Parameters:
state
- The starting state of the transition.valuation
- The valuation.- Returns:
- The successor edges, possibly empty.
-
edgeTree
default ValuationTree<Edge<S>> edgeTree(S state)
Description copied from interface:Automaton
Returns a decision-tree with nodes labelled by literals and sets of edges as leaves.- Specified by:
edgeTree
in interfaceAutomaton<S,A extends OmegaAcceptance>
- Parameters:
state
- The state.- Returns:
- A tree.
-
preferredEdgeAccess
default List<Automaton.PreferredEdgeAccess> preferredEdgeAccess()
Description copied from interface:Automaton
Indicate if the automaton implements a fast (e.g. symbolic) computation of edges. Returns aList
containing all supportedPreferredEdgeAccess
ordered by their preference. Meaning the element at first position (index 0) is the most preferred. Accordingly algorithms can change the use ofAutomaton.edges(Object, BitSet)
,Automaton.edgeMap(Object)
, orAutomaton.edgeTree(Object)
for accessing all outgoing edges of a state. This information is also used to dispatch to the right visitor style.- Specified by:
preferredEdgeAccess
in interfaceAutomaton<S,A extends OmegaAcceptance>
- Returns:
- An ordered list of the traversal methods. It always contains a complete list
-
-