o i@sUdZddlmZddlZddlmZddlmZmZm Z m Z m Z m Z ej dkr/ddlmZnddlmZdZe 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"eZdZdZdfdd 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. stater symbolrcs(||_||_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__SC:\Users\psant\Downloads\PAF backend\school\venv\Lib\site-packages\automat/_core.pyr"s    zNoTransition.__init__)rr rr)__name__ __module__ __qualname____doc__r __classcell__rrrrrsrc@seZdZdZd(d)ddZed*d d Zejd+d d Zd,ddZd-ddZ d.ddZ d/ddZ d0d d!Z d1d#d$Z d2d&d'ZdS)3 Automatonzr A declaration of a finite state machine. Note that this is not the machine itself; it is immutable. Ninitial State | NonereturnNonecCs0|durt}|dus J||_t|_d|_dS)zJ Initialize the set of transitions and the initial state. N) _NO_STATE _initialStateset _transitions_unhandledTransition)rr#rrrr9s   zAutomaton.__init__r cCs|jS)z8 Return this automaton's initial state. N)r(rrrr initialStateDszAutomaton.initialStatercCs$|jtur td|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   inState inputSymbolroutState outputSymbolstuple[Output, ...]c 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) rr/r0r1r2 anInState anInputSymbolZ anOutState_rrr addTransitionYszAutomaton.addTransitionSequence[Output]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+)rr1r2rrrunhandledTransitionpszAutomaton.unhandledTransition7frozenset[tuple[State, Input, State, Sequence[Output]]]cCs t|jS)z" All transitions. N) frozensetr*r,rrrallTransitionsys zAutomaton.allTransitions set[Input]cCsdd|jDS)zG The full set of symbols acceptable to this automaton. cSsh|]\}}}}|qSrr.0r/r0r1Z outputSymbolrrr s z*Automaton.inputAlphabet..N)r*r,rrr inputAlphabetszAutomaton.inputAlphabet set[Output]cCttdd|jDS)zR The full set of symbols which can be produced by this automaton. css|] \}}}}|VqdSNr)rAr/r0r1r2rrr s   z+Automaton.outputAlphabet..N)r)r from_iterabler*r,rrroutputAlphabets  zAutomaton.outputAlphabetfrozenset[State]cCrE)zc All valid states; "Q" in the mathematical description of a state machine. css |] \}}}}||fVqdSrFrr@rrrrGs   z#Automaton.states..N)r=rrHr*r,rrrstatess  zAutomaton.statestuple[State, Sequence[Output]]cCsP|jD]\}}}}||f||fkr|t|fSq|jdur%t||d|jS)zI A 2-tuple of (outState, outputSymbols) for inputSymbol. N)rr)r*listr+r)rr/r0r6r7r1r2rrroutputForInputs  zAutomaton.outputForInputrF)r#r$r%r&)r%r )rr r%r&)r/r r0rr1r r2r3)r1r r2r:r%r&)r%r<)r%r?)r%rD)r%rJ)r/r r0rr%rL)rrrr rpropertyr-setterr9r;r>rCrIrKrNrrrrr"2s       r"zs"        {