VhFUdZddlmZddlZddlmZddlmZmZm Z m Z m Z m Z ejdk\rddlmZnddlmZdZe d e Ze d e Ze d e ZGd deeeefZGddeeeefZeegdfZdZded<GddeeeefZy)zp A core state-machine abstraction. Perhaps something that could be replaced with or integrated into machinist. ) annotationsN)chain)CallableGenericOptionalSequenceTypeVarHashable) ) TypeAliasz State)boundInputOutputc$eZdZdZdfd ZxZS) 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. ch||_||_tt|dj ||y)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)statesymbolsuper Exception__init__format)selfrr __class__s =/home/dcms/DCMS/lib/python3.12/site-packages/automat/_core.pyrzNoTransition.__init__"s2   i' ( / / > )rrrr)__name__ __module__ __qualname____doc__r __classcell__)rs@rrrs   rrceZdZdZd ddZeddZejddZ ddZ ddZ ddZ dd Z dd Z dd Z dd Zy) Automatonzr A declaration of a finite state machine. Note that this is not the machine itself; it is immutable. NcV|t}|J||_t|_d|_y)zJ Initialize the set of transitions and the initial state. N) _NO_STATE _initialStateset _transitions_unhandledTransition)rinitials rrzAutomaton.__init__9s4 ?G"""$+ORuNR!rc|jS)z8 Return this automaton's initial state. )r(rs r initialStatezAutomaton.initialStateDs !!!rc~|jtur$tdj|j||_y)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)rrs rr/zAutomaton.initialStateKs=   Y .1889K9KL #rc|jD].\}}}}||k(s||k(stdj||||jj|||t |fy)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*r1raddtuple) rinState inputSymboloutState outputSymbols anInState anInputSymbol anOutState_s r addTransitionzAutomaton.addTransitionYsw8<7H7H  3I}j!G# (D BII[  w Xu]?STUrc(|t|f|_y)z All unhandled transitions will be handled by transitioning to the given error state and error-handling output symbols. N)r4r+)rr7r8s runhandledTransitionzAutomaton.unhandledTransitionps&.u]/C$D!rc,t|jS)z" All transitions. ) frozensetr*r.s rallTransitionszAutomaton.allTransitionsys**++rc \|jDchc] \}}}}| c}}}}Scc}}}}w)zG The full set of symbols acceptable to this automaton. )r*)rr5r6r7 outputSymbols r inputAlphabetzAutomaton.inputAlphabets9 CGBSBS  >+x    s& c`ttjd|jDS)zR The full set of symbols which can be produced by this automaton. c3*K|] \}}}}| ywN).0r5r6r7r8s r z+Automaton.outputAlphabet..s  CWk8] s)r)r from_iterabler*r.s routputAlphabetzAutomaton.outputAlphabets2    GKGXGX    rc`ttjd|jDS)zc All valid states; "Q" in the mathematical description of a state machine. c3.K|] \}}}}||fywrHrI)rJr5r6r7rDs rrKz#Automaton.states..s% BWk8\(# s)rArrLr*r.s rstateszAutomaton.statess2     FJFWFW    rc|jD]\}}}}||f||fk(s|t|fcS|j t|||jS)zI A 2-tuple of (outState, outputSymbols) for inputSymbol. )rr)r*listr+r)rr5r6r9r:r7r8s routputForInputzAutomaton.outputForInputsm BFARAR 7 =I}h %)])CC $}"566 7  $ $ ,W[A A(((rrH)r,z State | NonereturnNone)rTr)rrrTrU)r5rr6rr7rr8ztuple[Output, ...])r7rr8zSequence[Output]rTrU)rTz7frozenset[tuple[State, Input, State, Sequence[Output]]])rTz set[Input])rTz set[Output])rTzfrozenset[State])r5rr6rrTztuple[State, Sequence[Output]])rr r!r"rpropertyr/setterr=r?rBrErMrPrSrIrrr%r%2s S""  # #VVV V * V.EE.>E E,       ) )+0 ) ' )rr%zrns # KKw +  x(x(  * 9geUl3 2x)uf,-x)v$' R R*75%/0*r