0x1949 Team - FAZEMRX - MANAGER
Edit File: _core.cpython-310.pyc
o $#�[� � @ sH d Z ddlmZ dZG dd� de�ZG dd� de�ZG dd � d e�Zd S ) zp A core state-machine abstraction. Perhaps something that could be replaced with or integrated into machinist. � )�chainz <no state>c s e Zd ZdZ� fdd�Z� ZS )� 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 s( || _ || _tt| ��d�||�� d S )Nzno transition for {} in {})�state�symbol�super� Exception�__init__�format)�selfr r �� __class__� �//usr/lib/python3/dist-packages/automat/_core.pyr s �zNoTransition.__init__)�__name__� __module__� __qualname__�__doc__r � __classcell__r r r r r s r c @ sb e Zd ZdZdd� Zedd� �Zejdd� �Zdd� Zd d � Z d d � Z d d� Z dd� Z dd� Z dS )� Automatonzr A declaration of a finite state machine. Note that this is not the machine itself; it is immutable. c C s t | _t� | _dS )zJ Initialize the set of transitions and the initial state. N)� _NO_STATE� _initialState�set� _transitions�r r r r r ' s zAutomaton.__init__c C s | j S )z8 Return this automaton's initial state. )r r r r r � initialState/ s zAutomaton.initialStatec C s$ | j tur td�| j ���|| _ dS )z� Set this automaton's initial state. Raises a ValueError if this automaton already has an initial state. z initial state already set to {}N)r r � ValueErrorr )r r r r r r 7 s � c C sP | j D ]\}}}}||kr||krtd�||���q| j �|||t|�f� dS )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)r r r �add�tuple) r �inState� inputSymbol�outState� outputSymbols� anInState� anInputSymbol� anOutState�_r r r � addTransitionE s ���zAutomaton.addTransitionc C s t | j�S )z" All transitions. )� frozensetr r r r r �allTransitionsV s zAutomaton.allTransitionsc C s dd� | j D �S )zG The full set of symbols acceptable to this automaton. c S s h | ]\}}}}|�qS r r ��.0r r r � outputSymbolr r r � <setcomp>a s �z*Automaton.inputAlphabet.<locals>.<setcomp>)r r r r r � inputAlphabet] s �zAutomaton.inputAlphabetc C � t t�dd� | jD ���S )zR The full set of symbols which can be produced by this automaton. c s s � | ] \}}}}|V qd S �Nr )r* r r r r! r r r � <genexpr>j s � � �z+Automaton.outputAlphabet.<locals>.<genexpr>)r r � from_iterabler r r r r �outputAlphabete s ��zAutomaton.outputAlphabetc C r. )zc All valid states; "Q" in the mathematical description of a state machine. c s s � | ] \}}}}||fV qd S r/ r r) r r r r0 x s � � �z#Automaton.states.<locals>.<genexpr>)r' r r1 r r r r r �statesr s ��zAutomaton.statesc C s@ | j D ]\}}}}||f||fkr|t|�f S qt||d��)zI A 2-tuple of (outState, outputSymbols) for inputSymbol. )r r )r �listr )r r r r" r# r r! r r r �outputForInput� s �� zAutomaton.outputForInputN)r r r r r �propertyr �setterr& r( r- r2 r3 r5 r r r r r s r c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) � TransitionerzA The combination of a current state and an L{Automaton}. c C s || _ || _d | _d S r/ )� _automaton�_state�_tracer)r � automatonr r r r r � s zTransitioner.__init__c C s || _ d S r/ )r; )r �tracerr r r �setTrace� s zTransitioner.setTracec C sH | j �| j|�\}}d}| jr | �| j�� |�� |�� �}|| _||fS )zC Transition between states, returning any outputs. N)r9 r5 r: r; �_name)r r r r! � outTracerr r r � transition� s � �zTransitioner.transitionN)r r r r r r> rA r r r r r8 � s r8 N) r � itertoolsr r r r �objectr r8 r r r r �<module> s l