U ,Wj@sUdZddlmZddlZddlmZddlmZmZm Z m Z m Z m Z ej dkr^ddlmZn ddlmZdZe d e d Ze d e d Ze d e d ZGd ddeeeefZGdddeeeefZeegdfZdZded<GdddeeeefZdS)zp A core state-machine abstraction. Perhaps something that could be replaced with or integrated into machinist. ) annotationsN)chain)CallableGenericOptionalSequenceTypeVarHashable) ) TypeAliasz State)boundInputOutputcs(eZdZdZdddfdd ZZS) NoTransitionz A finite state machine in C{state} has no transition for C{symbol}. @ivar state: See C{state} init parameter. @ivar symbol: See C{symbol} init parameter. r rstatesymbolcs(||_||_tt|d||dS)z Construct a L{NoTransition}. @param state: the finite state machine's state at the time of the illegal transition. @param symbol: the input symbol for which no transition exists. zno transition for {} in {}N)rrsuper Exception__init__format)selfrr __class__Xc:\users\psant\downloads\hotstarbackend\school\venv38\Lib\site-packages\automat/_core.pyr"s   zNoTransition.__init__)__name__ __module__ __qualname____doc__r __classcell__rrrrrsrc@seZdZdZd'dddddZedd d d Zejddd d d ZdddddddZddddddZ dd ddZ dd ddZ dd ddZ d d d!d"Z ddd#d$d%d&ZdS)( Automatonzr A declaration of a finite state machine. Note that this is not the machine itself; it is immutable. Nz State | NoneNone)initialreturncCs0|dkr t}|dk st||_t|_d|_dS)zJ Initialize the set of transitions and the initial state. N) _NO_STATEAssertionError _initialStateset _transitions_unhandledTransition)rr%rrrr9s  zAutomaton.__init__r )r&cCs|jS)z8 Return this automaton's initial state. )r)rrrr initialStateDszAutomaton.initialState)rr&cCs$|jtk rtd|j||_dS)z Set this automaton's initial state. Raises a ValueError if this automaton already has an initial state. zinitial state already set to {}N)r)r' ValueErrorr)rrrrrr.Ks   rztuple[Output, ...])inState inputSymboloutState outputSymbolsc CsR|jD].\}}}}||kr||krtd|||q|j|||t|fdS)z Add the given transition to the outputSymbol. Raise ValueError if there is already a transition with the same inState and inputSymbol. z,already have transition from {} to {} via {}N)r+r/raddtuple) rr0r1r2r3 anInState anInputSymbolZ anOutState_rrr addTransitionYszAutomaton.addTransitionzSequence[Output])r2r3r&cCs|t|f|_dS)z All unhandled transitions will be handled by transitioning to the given error state and error-handling output symbols. N)r5r,)rr2r3rrrunhandledTransitionpszAutomaton.unhandledTransitionz7frozenset[tuple[State, Input, State, Sequence[Output]]]cCs t|jS)z" All transitions. ) frozensetr+r-rrrallTransitionsyszAutomaton.allTransitionsz set[Input]cCsdd|jDS)zG The full set of symbols acceptable to this automaton. cSsh|]\}}}}|qSrr.0r0r1r2Z outputSymbolrrr s z*Automaton.inputAlphabet..)r+r-rrr inputAlphabetszAutomaton.inputAlphabetz set[Output]cCsttdd|jDS)zR The full set of symbols which can be produced by this automaton. css|]\}}}}|VqdSNr)r>r0r1r2r3rrr s z+Automaton.outputAlphabet..)r*r from_iterabler+r-rrroutputAlphabets  zAutomaton.outputAlphabetzfrozenset[State]cCsttdd|jDS)zc All valid states; "Q" in the mathematical description of a state machine. css|]\}}}}||fVqdSrArr=rrrrBs z#Automaton.states..)r;rrCr+r-rrrstatess  zAutomaton.statesztuple[State, Sequence[Output]])r0r1r&cCsP|jD],\}}}}||f||fkr|t|fSq|jdkrJt||d|jS)zI A 2-tuple of (outState, outputSymbols) for inputSymbol. Nr)r+listr,r)rr0r1r6r7r2r3rrroutputForInputs   zAutomaton.outputForInput)N)rrr r!rpropertyr.setterr9r:r<r@rDrErGrrrrr#2s      r#zs         {