Λh6%SrSSKJr SSKrSSKJr SSKJrJrJ r J r J r J r \RS:aSSKJr OSSKJr Sr\ "S \ S 9r\ "S \ S 9r\ "S \ S 9r"S S\\\\45r"SS\\\\45r\\/S4rSrS\S'"SS\\\\45rg)zp A core state-machine abstraction. Perhaps something that could be replaced with or integrated into machinist. ) annotationsN)chain)CallableGenericOptionalSequenceTypeVarHashable) ) TypeAliasz State)boundInputOutputc0^\rSrSrSrSU4SjjrSrU=r$) 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. cb>XlX l[[U]SR X!55 g)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 QC:\Users\psant\Downloads\Noiseback\school\venv\Lib\site-packages\automat/_core.pyrNoTransition.__init__"s,   i' ( / / > rr)rrrr)__name__ __module__ __qualname____firstlineno____doc__r__static_attributes__ __classcell__)rs@rrrs   r rc\rSrSrSrSSSjjr\SSj5r\RSSj5rSSjr SSjr SS jr SS jr SS jr SS jrSS jrSrg) Automaton2zf A declaration of a finite state machine. Note that this is not the machine itself; it is immutable. NcXUc[nUceXl[5UlSUlg)z: Initialize the set of transitions and the initial state. N) _NO_STATE _initialStateset _transitions_unhandledTransition)rinitials rrAutomaton.__init__9s2 ?G"""$+ORuNR!r cUR$)z( Return this automaton's initial state. )r.rs r initialStateAutomaton.initialStateDs !!!r c~UR[La$[SRUR55eXlg)zj 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 rr6r7Ks;   Y .1889K9KL #r cURH-upVpxXQ:XdM Xb:XdM[SRXU55e URRXU[ U545 g)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)r0r9raddtuple) rinState inputSymboloutState outputSymbols anInState anInputSymbol anOutState_s r addTransitionAutomaton.addTransitionYsg8<7H7H 3Ij# (D BII[8I wXu]?STUr c(U[U54Ulg)zx All unhandled transitions will be handled by transitioning to the given error state and error-handling output symbols. N)r<r1)rr?r@s runhandledTransitionAutomaton.unhandledTransitionps&.u]/C$D!r c,[UR5$)z All transitions. ) frozensetr0r5s rallTransitionsAutomaton.allTransitionsys**++r c ^URVVVVs1sHupp4UiM snnnn$s snnnnf)z7 The full set of symbols acceptable to this automaton. )r0)rr=r>r? outputSymbols r inputAlphabetAutomaton.inputAlphabets6 CGBSBS BS>x BS   s' cb[[R"SUR555$)zB The full set of symbols which can be produced by this automaton. c3,# UH upp4Uv M g7fN).0r=r>r?r@s r +Automaton.outputAlphabet..s GXCW8GXs)r/r from_iterabler0r5s routputAlphabetAutomaton.outputAlphabets2    GKGXGX    r cb[[R"SUR555$)zK All valid states; "Q" in the mathematical description of a state machine. c3.# UH upp4X4v M g7frTrU)rVr=r>r?rOs rrW#Automaton.states..s FWBW8#FWs)rKrrYr0r5s rstatesAutomaton.statess2     FJFWFW    r cURHup4pVX4X44:XdMU[U54s $ URc [XS9eUR$)z9 A 2-tuple of (outState, outputSymbols) for inputSymbol. r!)r0listr1r)rr=r>rArBr?r@s routputForInputAutomaton.outputForInputs` BFARAR =Ih%))CC $}"566BS  $ $ ,WA A(((r )r.r0r1rT)r2z State | NonereturnNone)rer)rrrerf)r=rr>rr?rr@ztuple[Output, ...])r?rr@zSequence[Output]rerf)rez7frozenset[tuple[State, Input, State, Sequence[Output]]])rez set[Input])rez set[Output])rezfrozenset[State])r=rr>rreztuple[State, Sequence[Output]])r"r#r$r%r&rpropertyr6setterrErHrLrPrZr_rcr'rUr rr*r*2s S""  # #VVV V * V.EE.>E E,       ) )+0 ) ' )r r*z\rSrSrSrSSjrS SjrS SjrSrg) Transitionerz9 The combination of a current state and an L{Automaton}. c*XlX lSUlgrT _automaton_state_tracer)r automatonr6s rrTransitioner.__init__s;D) <@ r cXlgrT)rq)rtracers rsetTraceTransitioner.setTraces r cURRURU5up#SnUR(aURURX5nX lX44$)z3 Transition between states, returning any outputs. N)rorcrprq)rr>r?r@ outTracers r transitionTransitioner.transitionsT #'//"@"@ KK#  << T[[+HI ))r rnN)rrzAutomaton[State, Input, Output]r6r)ruz#Tracer[State, Input, Output] | Nonererf)r>rrez4tuple[Sequence[Output], OutputTracer[Output] | None]) r"r#r$r%r&rrvrzr'rUr rrkrks'A  *  * = *r rk)r& __future__rsys itertoolsrtypingrrrrr r version_infor typing_extensionsr-rrrrrr* OutputTracerri__annotations__rkrUr rrs # KKw +  x(x(  * 9geUl3 2x)uf,-x)v$' R R*75%/0*r