~bZdZddlmZdZGddeZGddeZGdd eZy ) 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. ch||_||_tt|dj ||y)Nzno transition for {} in {})statesymbolsuper Exception__init__format)selfrr __class__s //usr/lib/python3/dist-packages/automat/_core.pyr zNoTransition.__init__s0   i' ( / / > )__name__ __module__ __qualname____doc__r __classcell__)rs@rrrs  rrcneZdZdZdZedZejdZdZdZ dZ dZ d Z d Z y ) Automatonzr A declaration of a finite state machine. Note that this is not the machine itself; it is immutable. c8t|_t|_y)zJ Initialize the set of transitions and the initial state. N) _NO_STATE _initialStateset _transitionsr s rr zAutomaton.__init__'s'Erc|jS)z8 Return this automaton's initial state. )rrs r initialStatezAutomaton.initialState/s !!!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)rr ValueErrorr )r rs rrzAutomaton.initialState7s?   Y .1889K9KLN N#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 {} via {}N)rr!r addtuple) r inState inputSymboloutState outputSymbols anInState anInputSymbol anOutState_s r addTransitionzAutomaton.addTransitionEsy:>9J9J [ 5Y z1W$+)E <CCG[Y[[ [  k8U=-A B rc,t|jS)z" All transitions. ) frozensetrrs rallTransitionszAutomaton.allTransitionsVs**++rc \|jDchc] \}}}}| c}}}}Scc}}}}w)zG The full set of symbols acceptable to this automaton. )r)r r%r&r' outputSymbols r inputAlphabetzAutomaton.inputAlphabet]s? 372C2CEE!/+x!-E EEs& c`ttjd|jDS)zR The full set of symbols which can be produced by this automaton. c3*K|] \}}}}| ywN).0r%r&r'r(s r z+Automaton.outputAlphabet..js  ?+x s)rr from_iterablerrs routputAlphabetzAutomaton.outputAlphabetes4    $$    rc`ttjd|jDS)zc All valid states; "Q" in the mathematical description of a state machine. c3.K|] \}}}}||fywr6r7)r8r%r&r'r2s rr9z#Automaton.states..xs' ?+x(# s)r/rr:rrs rstateszAutomaton.statesrs4     $$     rcx|jD]\}}}}||f||fk(s|t|fcSt||)zI A 2-tuple of (outState, outputSymbols) for inputSymbol. )rr)rlistr)r r%r&r)r*r'r(s routputForInputzAutomaton.outputForInputsV *.):): 7 &Y }%)])CC $}"566 7==rN)rrrrr propertyrsetterr-r0r3r;r>rAr7rrrr sY """ # # ",E    >rrc"eZdZdZdZdZdZy) TransitionerzA The combination of a current state and an L{Automaton}. c.||_||_d|_yr6) _automaton_state_tracer)r automatonrs rr zTransitioner.__init__s#"  rc||_yr6)rI)r tracers rsetTracezTransitioner.setTraces  rc|jj|j|\}}d}|jrG|j|jj |j |j }||_||fS)zC Transition between states, returning any outputs. N)rGrArHrI_name)r r&r'r( outTracers r transitionzTransitioner.transitionsz#'//"@"@AL#N- << T[[%6%6%8%0%6%6%8%-^^%57I y))rN)rrrrr rMrQr7rrrErEs  *rrEN) r itertoolsrrr robjectrrEr7rrrTs;    9 $i>i>X*6*r