tfndZddlmZdZGddeZGddeZGdd eZd S) zp A core state-machine abstraction. Perhaps something that could be replaced with or integrated into machinist. )chainz c"eZdZdZfdZxZS) NoTransitionz A finite state machine in C{state} has no transition for C{symbol}. @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. c||_||_tt|d||dS)Nzno transition for {} in {})statesymbolsuper Exception__init__format)selfrr __class__s L/var/www/surfInsights/venv3-11/lib/python3.11/site-packages/automat/_core.pyr zNoTransition.__init__sP   i'' ( / / > >     )__name__ __module__ __qualname____doc__r __classcell__)rs@rrrsB         rrcreZdZdZdZedZejdZdZdZ dZ dZ d Z d Z d S) Automatonzr A declaration of a finite state machine. Note that this is not the machine itself; it is immutable. cDt|_t|_dS)zJ Initialize the set of transitions and the initial state. N) _NO_STATE _initialStateset _transitionsr s rr zAutomaton.__init__'s'EErc|jS)z8 Return this automaton's initial state. )rrs r initialStatezAutomaton.initialState/s !!rc~|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)rr ValueErrorr )r rs rrzAutomaton.initialState7sK  Y . .1889KLLNN N#rc|jD]6\}}}}||kr)||kr#td||7|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 {} via {}N)rr!r addtuple) r inState inputSymboloutState outputSymbols anInState anInputSymbol anOutState_s r addTransitionzAutomaton.addTransitionEs:>9J [ [ 5Y z1W$$+)E)E <CCG[YY[[[  k8U=-A-A B     rc*t|jS)z" All transitions. ) frozensetrrs rallTransitionszAutomaton.allTransitionsVs*+++rc$d|jDS)zG The full set of symbols acceptable to this automaton. ch|] \}}}}| Sr3.0r%r&r' outputSymbols r z*Automaton.inputAlphabet..as9EEE!/+x!-EEEr)rrs r inputAlphabetzAutomaton.inputAlphabet]s,EE262CEEE Ercbttjd|jDS)zR The full set of symbols which can be produced by this automaton. c3$K|] \}}}}|V dSNr3)r5r%r&r'r(s r z+Automaton.outputAlphabet..js>  ?+x      r)rr from_iterablerrs routputAlphabetzAutomaton.outputAlphabetesG    $        rcbttjd|jDS)zc All valid states; "Q" in the mathematical description of a state machine. c3(K|] \}}}}||fVdSr;r3r4s rr<z#Automaton.states..xsE  ?+x(#      r)r/rr=rrs rstateszAutomaton.statesrsG     $         rc||jD]$\}}}}||f||fkr|t|fcS%t||)zI A 2-tuple of (outState, outputSymbols) for inputSymbol. )rr)rlistr)r r%r&r)r*r'r(s routputForInputzAutomaton.outputForInputsi *.): 7 7 &Y }%)])CCC $}"5"56666D====rN)rrrrr propertyrsetterr-r0r8r>rArDr3rrrr s """""X" # # #   ",,,EEE        >>>>>rrc$eZdZdZdZdZdZdS) TransitionerzA The combination of a current state and an L{Automaton}. c0||_||_d|_dSr;) _automaton_state_tracer)r automatonrs rr zTransitioner.__init__s#"  rc||_dSr;)rL)r tracers rsetTracezTransitioner.setTraces  rc|j|j|\}}d}|jrR||j||}||_||fS)zC Transition between states, returning any outputs. N)rJrDrKrL_name)r r&r'r( outTracers r transitionzTransitioner.transitions#'/"@"@AL#N#N- < 7 T[%6%6%8%8%0%6%6%8%8%-^^%5%577I y))rN)rrrrr rPrTr3rrrHrHsK  * * * * *rrHN) r itertoolsrrr robjectrrHr3rrrWs        9   $i>i>i>i>i>i>i>i>X*****6*****r