public static ComputationState createState( final String currentState, final NodeId previousEntry, final DeweyNumber version, final long startTimestamp, final EventId startEventID) { return new ComputationState(currentState, previousEntry, version, startEventID, startTimestamp); } }
public static ComputationState createState( final String currentState, final NodeId previousEntry, final DeweyNumber version, final long startTimestamp, final EventId startEventID) { return new ComputationState(currentState, previousEntry, version, startEventID, startTimestamp); } }
public static <T> ComputationState<T> createState( final NFA<T> nfa, final State<T> currentState, final State<T> previousState, final T event, final int counter, final long timestamp, final DeweyNumber version, final long startTimestamp) { return new ComputationState<>(nfa, currentState, previousState, event, counter, timestamp, version, startTimestamp); }
public static ComputationState createState( final String currentState, final NodeId previousEntry, final DeweyNumber version, final long startTimestamp, final EventId startEventID) { return new ComputationState(currentState, previousEntry, version, startEventID, startTimestamp); } }
public static <T> ComputationState<T> createStartState(final NFA<T> nfa, final State<T> state, final DeweyNumber version) { Preconditions.checkArgument(state.isStart()); return new ComputationState<>(nfa, state, null, null, 0, -1L, version, -1L); }
public static <T> ComputationState<T> createStartState(final NFA<T> nfa, final State<T> state) { Preconditions.checkArgument(state.isStart()); return new ComputationState<>(nfa, state, null, null, 0, -1L, new DeweyNumber(1), -1L); }