o $#[@sHdZddlmZdZGdddeZGdddeZGdd d eZd S) zp A core state-machine abstraction. Perhaps something that could be replaced with or integrated into machinist. )chainz cs eZdZdZfddZZS) 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. cs(||_||_tt|d||dS)Nzno transition for {} in {})statesymbolsuper Exception__init__format)selfrr __class__//usr/lib/python3/dist-packages/automat/_core.pyrs   zNoTransition.__init__)__name__ __module__ __qualname____doc__r __classcell__r r r rrs rc@sbeZdZdZddZeddZejddZddZd d Z d d Z d dZ ddZ ddZ dS) Automatonzr A declaration of a finite state machine. Note that this is not the machine itself; it is immutable. cCst|_t|_dS)zJ Initialize the set of transitions and the initial state. N) _NO_STATE _initialStateset _transitionsr r r rr's zAutomaton.__init__cCs|jS)z8 Return this automaton's initial state. )rrr r r initialState/szAutomaton.initialStatecCs$|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 rr r rr7s   c CsP|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 {} via {}N)rrr addtuple) r inState inputSymboloutState outputSymbols anInState anInputSymbol anOutState_r r r addTransitionEs zAutomaton.addTransitioncCs t|jS)z" All transitions. ) frozensetrrr r rallTransitionsVs zAutomaton.allTransitionscCsdd|jDS)zG The full set of symbols acceptable to this automaton. cSsh|]\}}}}|qSr r .0rrr outputSymbolr r r asz*Automaton.inputAlphabet..)rrr r r inputAlphabet]szAutomaton.inputAlphabetcCttdd|jDS)zR The full set of symbols which can be produced by this automaton. css|] \}}}}|VqdSNr )r*rrr r!r r r js   z+Automaton.outputAlphabet..)rr from_iterablerrr r routputAlphabetes  zAutomaton.outputAlphabetcCr.)zc All valid states; "Q" in the mathematical description of a state machine. css |] \}}}}||fVqdSr/r r)r r rr0xs   z#Automaton.states..)r'rr1rrr r rstatesrs  zAutomaton.statescCs@|jD]\}}}}||f||fkr|t|fSqt||d)zI A 2-tuple of (outState, outputSymbols) for inputSymbol. )rr)rlistr)r rrr"r#r r!r r routputForInputs  zAutomaton.outputForInputN)rrrrrpropertyrsetterr&r(r-r2r3r5r r r rr s    rc@s(eZdZdZddZddZddZdS) TransitionerzA The combination of a current state and an L{Automaton}. cCs||_||_d|_dSr/) _automaton_state_tracer)r automatonrr r rrs zTransitioner.__init__cCs ||_dSr/)r;)r tracerr r rsetTraces zTransitioner.setTracecCsH|j|j|\}}d}|jr||j||}||_||fS)zC Transition between states, returning any outputs. N)r9r5r:r;_name)r rr r! outTracerr r r transitions  zTransitioner.transitionN)rrrrrr>rAr r r rr8s  r8N) r itertoolsrrrrobjectrr8r r r rs  l