Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/automat/_test/__pycache__/test_methodical.cpython-39.pyc
Ðазад
a k�h�Q � @ sd d Z ddlmZ ddlmZ ddlmZmZmZm Z ddl m Z m Z ddl m Z G dd � d e�Zd S ) z, Tests for the public interface of Automat. � )�reduce)�TestCase)�ArgSpec� _getArgNames� _getArgSpec� _filterArgs� )�MethodicalMachine� NoTransition)� _methodicalc @ s� e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd d � Z dd� Z dd� Z dd� Z dd� Z dd� Zdd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd(d)� Zd*S )+�MethodicalTestsz) Tests for L{MethodicalMachine}. c C s> G dd� dt �}|� }| �|�� dg� | �|�� dg� dS )a! L{MethodicalMachine} provides a way for you to declare a state machine with inputs, outputs, and states as methods. When you have declared an input, an output, and a state, calling the input method in that state will produce the specified output. c @ s� e Zd Ze� Ze�� dd� �Ze�� dd� �Ze�� dd� �Z ej dd�d d � �Z e� � d d � �Z e j ee egd � e j ee e gd � dS )z7MethodicalTests.test_oneTransition.<locals>.Machinationc S s dS �zan inputN� ��selfr r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/automat/_test/test_methodical.py�anInput s z?MethodicalTests.test_oneTransition.<locals>.Machination.anInputc S s dS )z an output�an-output-valuer r r r r �anOutput! s z@MethodicalTests.test_oneTransition.<locals>.Machination.anOutputc S s dS )zanother output�another-output-valuer r r r r � anotherOutput& s zEMethodicalTests.test_oneTransition.<locals>.Machination.anotherOutputT��initialc S s dS �za stateNr r r r r �anState+ s z?MethodicalTests.test_oneTransition.<locals>.Machination.anStatec S s dS )z another stateNr r r r r � anotherState/ s zDMethodicalTests.test_oneTransition.<locals>.Machination.anotherState��enter�outputsN)�__name__� __module__� __qualname__r �machine�inputr �outputr r �stater r �uponr r r r � Machination s r' r r N)�object� assertEqualr )r r' �mr r r �test_oneTransition s z"MethodicalTests.test_oneTransitionc st t � � G � fdd�dt�}|� }| �t��}|j W d � n1 sF0 Y | �dt|j�� | �|j� � dS )a4 L{MethodicalMachine} is an implementation detail. If you attempt to access it on an instance of your class, you will get an exception. However, since tools may need to access it for the purposes of, for example, visualization, you may access it on the class itself. c s e Zd Z� ZdS )z@MethodicalTests.test_machineItselfIsPrivate.<locals>.MachinationN)r r r! r" r �ZexpectedMachiner r r' C s r' Nz-MethodicalMachine is an implementation detail) r r( � assertRaises�AttributeErrorr" �assertIn�str� exception�assertIs)r r' Z machination�cmr r, r �test_machineItselfIsPrivate: s $ �z+MethodicalTests.test_machineItselfIsPrivatec C s� G dd� dt �}|� }|�� | �|jd� |� }| �t��}|j W d � n1 sX0 Y | �|jd� | �dt|j �� dS )au One of the benefits of using a state machine is that your output method implementations don't need to take invalid state transitions into account - the methods simply won't be called. This property would be broken if client code called output methods directly, so output methods are not directly visible under their names. c @ s\ e Zd Ze� ZdZe�� dd� �Ze�� dd� �Z ej dd�dd � �Z e j ee e gd � d S ) z;MethodicalTests.test_outputsArePrivate.<locals>.Machinationr c S s dS r r r r r r r [ s zCMethodicalTests.test_outputsArePrivate.<locals>.Machination.anInputc S s | j d7 _ d S �N� )�counterr r r r r _ s zDMethodicalTests.test_outputsArePrivate.<locals>.Machination.anOutputTr c S s dS )za machine stateNr r r r r r% c s zAMethodicalTests.test_outputsArePrivate.<locals>.Machination.stater N) r r r! r r" r7 r# r r$ r r% r& r r r r r' W s r' r6 Nr zlMachination.anOutput is a state-machine output method; to produce this output, call an input method instead.) r( r r) r7 r- r. r r/ r0 r1 )r r' Zmach1Zmach2r3 r r r �test_outputsArePrivateN s $�z&MethodicalTests.test_outputsArePrivatec C s> G dd� dt �}|� }| �|�� dg� | �|�� dg� dS )zw Two machines may co-exist happily on the same instance; they don't interfere with each other. c @ s� e Zd Ze� Ze� Ze�� dd� �Ze�� dd� �Zej dd�dd� �Z ej dd�d d � �Z e� � d d � �Z e� � d d� �Ze �ee e g� e �ee eg� dS )z8MethodicalTests.test_multipleMachines.<locals>.MultiMachc S s dS )zinput ANr r r r r �inputA� s z?MethodicalTests.test_multipleMachines.<locals>.MultiMach.inputAc S s dS )zinput BNr r r r r �inputB� s z?MethodicalTests.test_multipleMachines.<locals>.MultiMach.inputBTr c S s dS )z initial ANr r r r r �initialA� s zAMethodicalTests.test_multipleMachines.<locals>.MultiMach.initialAc S s dS )z initial BNr r r r r �initialB� s zAMethodicalTests.test_multipleMachines.<locals>.MultiMach.initialBc S s dS �N�Ar r r r r �outputA� s z@MethodicalTests.test_multipleMachines.<locals>.MultiMach.outputAc S s dS �N�Br r r r r �outputB� s z@MethodicalTests.test_multipleMachines.<locals>.MultiMach.outputBN)r r r! r �a�br# r9 r: r% r; r< r$ r? rB r& r r r r � MultiMach} s rE r> rA N)r( r) r9 r: )r rE �mmr r r �test_multipleMachinesw s z%MethodicalTests.test_multipleMachinesc s6 ddl � G � fdd�dt�}|� }| �|�� d� dS )zR Outputs can be combined with the "collector" argument to "upon". r Nc st e Zd Ze� Ze�� dd� �Ze�� dd� �Ze�� dd� �Zej dd�d d � �Z e j ee eeg� fd d �d � dS )z4MethodicalTests.test_collectOutputs.<locals>.Machinec S s dS r r r r r r r# � s z:MethodicalTests.test_collectOutputs.<locals>.Machine.inputc S s dS r= r r r r r r? � s z<MethodicalTests.test_collectOutputs.<locals>.Machine.outputAc S s dS r@ r r r r r rB � s z<MethodicalTests.test_collectOutputs.<locals>.Machine.outputBTr c S s dS r r r r r r r% � s z:MethodicalTests.test_collectOutputs.<locals>.Machine.statec s t � j| �S �N)r �add��x��operatorr r �<lambda>� � z=MethodicalTests.test_collectOutputs.<locals>.Machine.<lambda>�� collectorN) r r r! r r* r# r$ r? rB r% r& r rL r r �Machine� s �rR ZAB)rM r( r) r# )r rR r* r rL r �test_collectOutputs� s z#MethodicalTests.test_collectOutputsc C sd G dd� dt �}|� }| �t�� }|�ddd� W d � n1 sD0 Y | �dt|j�� dS )z> Input methods preserve their declared names. c @ s6 e Zd Ze� Ze�� dd� �Zejdd�dd� �ZdS )z-MethodicalTests.test_methodName.<locals>.Mechc S s dS r r r r r r �declaredInputName� s z?MethodicalTests.test_methodName.<locals>.Mech.declaredInputNameTr c S s dS )r% Nr r r r r �aState� s z4MethodicalTests.test_methodName.<locals>.Mech.aStateN) r r r! r r* r# rT r% rU r r r r �Mech� s rV Ztoo�many� argumentsNrT )r( r- � TypeErrorrT r/ r0 r1 )r rV r* r3 r r r �test_methodName� s ,z MethodicalTests.test_methodNamec C s< G dd� dt �}|� }| �|�d�dg� | �|jd� dS )zW If an input takes an argument, it will pass that along to its output. c @ sZ e Zd Ze� Ze�� d dd��Zejdd�dd� �Ze�� d dd ��Ze�eeeg� d S ) z:MethodicalTests.test_inputWithArguments.<locals>.Mechanismr6 c S s dS r r �r rK �yr r r r# � s z@MethodicalTests.test_inputWithArguments.<locals>.Mechanism.inputTr c S s dS r r r r r r r% � s z@MethodicalTests.test_inputWithArguments.<locals>.Mechanism.statec S s || _ || S rH ��_xr[ r r r r$ � s zAMethodicalTests.test_inputWithArguments.<locals>.Mechanism.outputN)r6 )r6 ) r r r! r r* r# r% r$ r& r r r r � Mechanism� s r_ � � N)r( r) r# r^ �r r_ r* r r r �test_inputWithArguments� s z'MethodicalTests.test_inputWithArgumentsc C s� G dd� dt �}|� }| �|�d�g d�� | �|jd� | �|jd� | �|jdd�g d�� | �|jd� | �|jd� | �|�d d�g d �� | �|jd � | �|jd� | �|jd d d �g d�� | �|jd � | �|jd � dS )z@ Inputs pass arguments that output will accept. c @ s| e Zd Ze� Ze�� ddd��Zejdd�dd� �Ze�� dd � �Ze�� d d � �Z e�� d d � �Z e� eeee e g� dS )zCMethodicalTests.test_outputWithSubsetOfArguments.<locals>.Mechanismr6 c S s dS r r r[ r r r r# � s zIMethodicalTests.test_outputWithSubsetOfArguments.<locals>.Mechanism.inputTr c S s dS r r r r r r r% � s zIMethodicalTests.test_outputWithSubsetOfArguments.<locals>.Mechanism.statec S s || _ |S rH r] )r rK r r r �outputX s zKMethodicalTests.test_outputWithSubsetOfArguments.<locals>.Mechanism.outputXc S s || _ |S rH )�_y)r r\ r r r �outputY s zKMethodicalTests.test_outputWithSubsetOfArguments.<locals>.Mechanism.outputYc S s d S rH r r r r r � outputNoArgs s zPMethodicalTests.test_outputWithSubsetOfArguments.<locals>.Mechanism.outputNoArgsN)r6 ) r r r! r r* r# r% r$ rd rf rg r& r r r r r_ � s r_ r` )r` r6 Nr6 ra rJ )ra r6 N� )rh r` N� r )r\ )ri r NN)r( r) r# r^ re rb r r r � test_outputWithSubsetOfArguments� s z0MethodicalTests.test_outputWithSubsetOfArgumentsc s� t �� t �� G � fdd�dt�}G dd� dt�}|� �� G dd� dt�}|� �� G dd� dt�}|� �� G d d � d t�}|� �� G d d � d t�}|� �� d S )zE The wrapped input function must have an empty body. c s^ e Zd Ze� Z� �e�� Ze�� dd� �ZW d � n1 s>0 Y � � e ej �d� dS )zAMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.Mechanismc S s t � dS r ��listr r r r r# 7 s zGMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.Mechanism.inputNzfunction body must be empty) r r r! r r* r- � ValueErrorr3 r# r) r0 r1 r r r r r_ 3 s (r_ c @ sF e Zd Ze� Ze�� dd� �Zejdd�dd� �Zejeeg d� dS ) zNMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismWithDocstringc S s dS r r r r r r r# D s zTMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismWithDocstring.inputTr c S s dS �zstarting stateNr r r r r �startH s zTMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismWithDocstring.startr N� r r r! r r* r# r% ro r& r r r r �MechanismWithDocstringA s rq c @ sF e Zd Ze� Ze�� dd� �Zejdd�dd� �Zejeeg d� dS ) zIMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismWithPassc S s d S rH r r r r r r# S s zOMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismWithPass.inputTr c S s dS rn r r r r r ro W s zOMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismWithPass.startr Nrp r r r r �MechanismWithPassP s rr c @ sF e Zd Ze� Ze�� dd� �Zejdd�dd� �Zejeeg d� dS ) zUMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismWithDocstringAndPassc S s dS r r r r r r r# b s z[MethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismWithDocstringAndPass.inputTr c S s dS rn r r r r r ro g s z[MethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismWithDocstringAndPass.startr Nrp r r r r � MechanismWithDocstringAndPass_ s rs c @ sF e Zd Ze� Ze�� dd� �Zejdd�dd� �Zejeeg d� dS ) zLMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismReturnsNonec S s d S rH r r r r r r# r s zRMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismReturnsNone.inputTr c S s dS rn r r r r r ro v s zRMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismReturnsNone.startr Nrp r r r r �MechanismReturnsNoneo s rt c @ sF e Zd Ze� Ze�� dd� �Zejdd�dd� �Zejeeg d� dS ) z\MethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismWithDocstringAndReturnsNonec S s dS r r r r r r r# � s zbMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismWithDocstringAndReturnsNone.inputTr c S s dS rn r r r r r ro � s zbMethodicalTests.test_inputFunctionsMustBeEmpty.<locals>.MechanismWithDocstringAndReturnsNone.startr Nrp r r r r �$MechanismWithDocstringAndReturnsNone~ s ru N)r �_emptyZ _docstringr( r# )r r_ rq rr rs rt ru r r r � test_inputFunctionsMustBeEmpty) s z.MethodicalTests.test_inputFunctionsMustBeEmptyc s G � fdd�dt �}dS )z� All the argument lists of the outputs for a given input must match; if one does not the call to C{upon} will raise a C{TypeError}. c s� e Zd Ze� Ze�� dd� �Ze�� dd� �Ze�� dd� �Z e� � dd� �Z � � e ��"Z e �ee ee g� W d � n1 s�0 Y � �d ee j�� � �d ee j�� d S ) z;MethodicalTests.test_inputOutputMismatch.<locals>.Mechanismc S s dS r r �r rC r r r � nameOfInput� s zGMethodicalTests.test_inputOutputMismatch.<locals>.Mechanism.nameOfInputc S s dS )zan output that matchesNr rx r r r �outputThatMatches� s zMMethodicalTests.test_inputOutputMismatch.<locals>.Mechanism.outputThatMatchesc S s dS )z an output that doesn't matchNr )r rD r r r �outputThatDoesntMatch� s zQMethodicalTests.test_inputOutputMismatch.<locals>.Mechanism.outputThatDoesntMatchc S s dS r r r r r r r% � s zAMethodicalTests.test_inputOutputMismatch.<locals>.Mechanism.stateNry r{ )r r r! r r* r# ry r$ rz r{ r% r- rY r3 r& r/ r0 r1 r r r r r_ � s �"r_ N�r( �r r_ r r r �test_inputOutputMismatch� s z(MethodicalTests.test_inputOutputMismatchc C s0 G dd� dt �}|� }|�� \}| �|d� dS )zI It is possible to write a self-loop by omitting "enter" c @ s| e Zd Ze� Ze�� dd� �Ze�� dd� �Ze�� dd� �Zej dd�d d � �Z d d � Z e j eg d � e j eegd � dS )z1MethodicalTests.test_stateLoop.<locals>.Mechanismc S s dS r r r r r r r# � s z7MethodicalTests.test_stateLoop.<locals>.Mechanism.inputc S s dS r r r r r r �say_hi� s z8MethodicalTests.test_stateLoop.<locals>.Mechanism.say_hic S s dS )N�hir r r r r � _start_say_hi� s z?MethodicalTests.test_stateLoop.<locals>.Mechanism._start_say_hiTr c S s dS r r r r r r ro � s z7MethodicalTests.test_stateLoop.<locals>.Mechanism.startc S s dS )za state with no inputsNr r r r r �said_hi� s z9MethodicalTests.test_stateLoop.<locals>.Mechanism.said_hi)r N) r r r! r r* r# r r$ r� r% ro r� r& r r r r r_ � s r_ r� N)r( r r) )r r_ Z a_mechanismZ a_greetingr r r �test_stateLoop� s z MethodicalTests.test_stateLoopc C s G dd� dt �}|� �� dS )zF It is possible to write a transition with no outputs c @ sT e Zd Ze� Ze�� dd� �Zejdd�dd� �Ze�� dd� �Z ej ee d � d S ) z6MethodicalTests.test_defaultOutputs.<locals>.Mechanismc S s dS )zfinal transitionNr r r r r �finish� s z=MethodicalTests.test_defaultOutputs.<locals>.Mechanism.finishTr c S s dS )z a start stateNr r r r r ro � s z<MethodicalTests.test_defaultOutputs.<locals>.Mechanism.startc S s dS )z a final stateNr r r r r �finished� s z?MethodicalTests.test_defaultOutputs.<locals>.Mechanism.finished)r N) r r r! r r* r# r� r% ro r� r& r r r r r_ � s r_ N)r( r� r} r r r �test_defaultOutputs� s z#MethodicalTests.test_defaultOutputsc C sF t dddddddtfdtffd�}| �t|�dddtfdtfh� dS )zC Type annotations should be included in the set of )rC rD Nr rC rD )�args�varargs�varkw�defaults� kwonlyargs�kwonlydefaults� annotations)r �intr0 r) r )r �specr r r �test_getArgNames� s � �z MethodicalTests.test_getArgNamesc C s> t dd� �}t dd� �}d}t|i ||�\}}| �||� dS )zl filterArgs() should not filter the `args` parameter if outputSpec accepts `*args`. c _ s d S rH r �r� �kwargsr r r rN � rO z1MethodicalTests.test_filterArgs.<locals>.<lambda>c _ s d S rH r r� r r r rN rO r N)r r r2 )r Z inputSpecZ outputSpecZargsInZargsOut�_r r r �test_filterArgs� s z MethodicalTests.test_filterArgsc s G � fdd�dt �}dS )zI A L{MethodicalMachine} can only have one initial state. c sd e Zd Ze� Zejdd�dd� �Z� �e��$ ejdd�dd� �Z W d � n1 sV0 Y dS )zCMethodicalTests.test_multipleInitialStatesFailure.<locals>.WillFailTr c S s dS )z&The first initial state -- this is OK.Nr r r r r �firstInitialState s zUMethodicalTests.test_multipleInitialStatesFailure.<locals>.WillFail.firstInitialStatec S s dS )z4The second initial state -- results in a ValueError.Nr r r r r �secondInitialState s zVMethodicalTests.test_multipleInitialStatesFailure.<locals>.WillFail.secondInitialStateN) r r r! r r* r% r� r- rm r� r r r r �WillFail s r� Nr| �r r� r r r �!test_multipleInitialStatesFailure s z1MethodicalTests.test_multipleInitialStatesFailurec s G � fdd�dt �}dS )zc A L{MethodicalMachine} can only have one transition per start/event pair. c s� e Zd Ze� Zejdd�dd� �Ze�� dd� �Ze�� dd� �Z ej e eg d � � � e �� ej e eg d � W d � n1 s�0 Y d S ) zAMethodicalTests.test_multipleTransitionsFailure.<locals>.WillFailTr c S s dS )zWe start here.Nr r r r r ro s zGMethodicalTests.test_multipleTransitionsFailure.<locals>.WillFail.startc S s dS )z Rainbows end.Nr r r r r �end$ s zEMethodicalTests.test_multipleTransitionsFailure.<locals>.WillFail.endc S s dS )z An event.Nr r r r r �event( s zGMethodicalTests.test_multipleTransitionsFailure.<locals>.WillFail.eventr N) r r r! r r* r% ro r� r# r� r& r- rm r r r r r� s r� Nr| r� r r r � test_multipleTransitionsFailure s z/MethodicalTests.test_multipleTransitionsFailurec C s� G dd� dt �}|� }| �t��}|�� W d � n1 s>0 Y | �dt|j�� | �dt|j�� |�� | �t��}|�� W d � n1 s�0 Y | �dt|j�� | �dt|j�� dS )z� Calling any input method that lacks a transition for the machine's current state raises an informative L{NoTransition}. c @ sd e Zd Ze� Zejdd�dd� �Ze�� dd� �Ze�� dd� �Z e�� d d � �Z e� e eg � d S ) zFMethodicalTests.test_badTransitionForCurrentState.<locals>.OnlyOnePathTr c S s dS )z Start state.Nr r r r r ro 9 s zLMethodicalTests.test_badTransitionForCurrentState.<locals>.OnlyOnePath.startc S s dS )z End state.Nr r r r r r� = s zJMethodicalTests.test_badTransitionForCurrentState.<locals>.OnlyOnePath.endc S s dS )zMove from start to end.Nr r r r r �advanceA s zNMethodicalTests.test_badTransitionForCurrentState.<locals>.OnlyOnePath.advancec S s dS )z%A transition from nowhere to nowhere.Nr r r r r �deadEndE s zNMethodicalTests.test_badTransitionForCurrentState.<locals>.OnlyOnePath.deadEndN) r r r! r r* r% ro r� r# r� r� r& r r r r � OnlyOnePath6 s r� Nr� ro r� )r( r- r r� r/ r0 r1 r� )r r� r" r3 r r r �!test_badTransitionForCurrentState0 s & &z1MethodicalTests.test_badTransitionForCurrentStatec C s, G dd� dt �}| �|� �� ddd�� dS )a L{MethodicalMachine.serializer} is a decorator that modifies its decoratee's signature to take a "state" object as its first argument, which is the "serialized" argument to the L{MethodicalMachine.state} decorator. c @ sT e Zd Ze� Zdd� Zejddd�dd� �Zejdd �d d � �Ze� � d d � �Z dS )z1MethodicalTests.test_saveState.<locals>.Mechanismc S s d| _ d S r5 ��valuer r r r �__init__a s z:MethodicalTests.test_saveState.<locals>.Mechanism.__init__� first-stateT�� serializedr c S s dS �z First state.Nr r r r r �firstd s z7MethodicalTests.test_saveState.<locals>.Mechanism.first� second-state�r� c S s dS �z Second state.Nr r r r r �secondh s z8MethodicalTests.test_saveState.<locals>.Mechanism.secondc S s || j d�S �N�� machine-state� some-valuer� �r r% r r r �savel s �z6MethodicalTests.test_saveState.<locals>.Mechanism.saveN) r r r! r r* r� r% r� r� � serializerr� r r r r r_ ^ s r_ r� r6 r� N)r( r) r� r} r r r �test_saveStateV s ��z MethodicalTests.test_saveStatec C sh G dd� dt �}|� }|�� |�� }|�|�}| �|jd� | �|�� d� | �|�� ddd�� dS )a/ L{MethodicalMachine.unserializer} decorates a function that becomes a machine-state unserializer; its return value is mapped to the C{serialized} parameter to C{state}, and the L{MethodicalMachine} associated with that instance's state is updated to that state. c @ s� e Zd Ze� Zdd� Zejddd�dd� �Zejdd �d d � �Ze� � d d � �Z e� � dd� �Z e� � dd� �Z ej e ee gdd� d� ej e ee gdd� d� e� � dd� �Ze�� dd� �Zedd� �Zd S ) z4MethodicalTests.test_restoreState.<locals>.Mechanismc S s d| _ d| _d S )Nr6 F�r� � ranOutputr r r r r� � s z=MethodicalTests.test_restoreState.<locals>.Mechanism.__init__r� Tr� c S s dS r� r r r r r r� � s z:MethodicalTests.test_restoreState.<locals>.Mechanism.firstr� r� c S s dS r� r r r r r r� � s z;MethodicalTests.test_restoreState.<locals>.Mechanism.secondc S s dS r r r r r r r# � s z:MethodicalTests.test_restoreState.<locals>.Mechanism.inputc S s d| _ d| _dS )Nr Tr6 r� r r r r r$ � s z;MethodicalTests.test_restoreState.<locals>.Mechanism.outputc S s dS )Nr r r r r r �output2� s z<MethodicalTests.test_restoreState.<locals>.Mechanism.output2c S s t | �d S �Nr rk rJ r r r rN � rO z=MethodicalTests.test_restoreState.<locals>.Mechanism.<lambda>rP c S s t | �d S r� rk rJ r r r rN � rO c S s || j d�S r� r� r� r r r r� � s �z9MethodicalTests.test_restoreState.<locals>.Mechanism.savec S s |d | _ |d S )Nr� r� r� )r �blobr r r �_restore� s z=MethodicalTests.test_restoreState.<locals>.Mechanism._restorec S s | � }|� |� |S rH )r� )�clsr� r r r r �fromBlob� s z=MethodicalTests.test_restoreState.<locals>.Mechanism.fromBlobN)r r r! r r* r� r% r� r� r# r$ r� r& r� r� Z unserializerr� � classmethodr� r r r r r_ � s( r_ Fr r� r� N)r( r# r� r� r) r� )r r_ �m1r� �m2r r r �test_restoreState{ s 2 ��z!MethodicalTests.test_restoreStatec C s. G dd� dt �}|� }|�d�dgks*J �dS )z_ L{MethodicalMachine} can operate with type annotations on inputs and outputs. c @ sf e Zd Ze� Ze�� ed�dd��Ze�� eed�dd��Z ej dd�d d � �Z e j ee e gd � d S ) zAMethodicalTests.test_allowBasicTypeAnnotations.<locals>.Mechanism)�argc S s dS )zAn inputNr �r r� r r r �an_input� s zJMethodicalTests.test_allowBasicTypeAnnotations.<locals>.Mechanism.an_input)r� �returnc S s |d S r5 r r� r r r � an_output� s zKMethodicalTests.test_allowBasicTypeAnnotations.<locals>.Mechanism.an_outputTr c S s dS )zA stateNr r r r r r% � s zGMethodicalTests.test_allowBasicTypeAnnotations.<locals>.Mechanism.stater N) r r r! r r* r# r� r� r$ r� r% r& r r r r r_ � s r_ r r` N)r( r� )r r_ Z mechanismr r r � test_allowBasicTypeAnnotations� s z.MethodicalTests.test_allowBasicTypeAnnotationsN)r r r! �__doc__r+ r4 r8 rG rS rZ rc rj rw r~ r� r� r� r� r� r� r� r� r� r� r r r r r s* ())#6e " &%Hr N)r� � functoolsr Zunittestr Zautomat._methodicalr r r r � r r r r r r r r �<module> s
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка