| Server IP : 178.105.222.151 / Your IP : 216.73.216.38 Web Server : nginx/1.28.3 System : Linux MNK 7.0.0-15-generic #15-Ubuntu SMP PREEMPT_DYNAMIC Wed Apr 22 16:06:43 UTC 2026 x86_64 User : www-data ( 33) PHP Version : 8.5.4 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : ON | Pkexec : OFF Directory : /lib/python3/dist-packages/twisted/internet/__pycache__/ |
Upload File : |
+
Dfj�� � �h � R t ^ RIt^ RIt^ RIt^ RIHtHtHtHtH t H
t
H t H t H
t
HtHt ^ RIHt ^ RIHt ^ RIHt ^ RIHtHtHt ^ RIHt ^ RI H t H t H t ^ R I H!t!H"t" ^ R
I#H$t$ ^ R I%H&t& ]
! R 4 t' ! R
R4 t( ! R R])4 t* ! R R]*4 t+ ! R R]*4 t, ! R R],4 t- ! R R],4 t. ! R R],4 t/ ! R R ]*4 t0 ! R R 4 t1R t2R R! lt3]
! R"4 t4 ! R# R$4 t5 ! R% R&4 t6]6! 4 t7R' R( lt8R) R* lt9]! ] 4 ! R+ R,4 4 t:R1R- R. llt;R2R/ R0 llt<. R3Ot=R# )4z)
Scheduling utility methods and classes.
N) �Callable� Coroutine�Iterable�Iterator�List�NoReturn�Optional�Sequence�TypeVar�Union�cast)� implementer)�Version)� DelayedCall)�Deferred�ensureDeferred�
maybeDeferred)�ReactorNotRunning)� IDelayedCall� IReactorCore� IReactorTime)�log�reflect)� _getDeprecationWarningString��Failure�_Tc � a � ] tR t^*t o RtRtRtRtRtRt Rt
Rt V 3R lR lt ]
V 3R lR l4 t]V 3R lR l4 tV 3R
lR ltRV 3R lR
lltV 3R lR ltV 3R lR ltV 3R lR ltV 3R lR ltV 3R lR ltV 3R ltRtV tR# )� LoopingCallaM Call a function repeatedly.
If C{f} returns a deferred, rescheduling will not take place until the
deferred has fired. The result value is ignored.
@ivar f: The function to call.
@ivar a: A tuple of arguments to pass the function.
@ivar kw: A dictionary of keyword arguments to pass to the function.
@ivar clock: A provider of
L{twisted.internet.interfaces.IReactorTime}. The default is
L{twisted.internet.reactor}. Feel free to set this to
something else, but it probably ought to be set *before*
calling L{start}.
@ivar running: A flag which is C{True} while C{f} is scheduled to be called
(or is currently being called). It is set to C{True} when L{start} is
called and set to C{False} when L{stop} is called or if C{f} raises an
exception. In either case, it will be C{False} by the time the
C{Deferred} returned by L{start} fires its callback or errback.
@ivar _realLastTime: When counting skips, the time at which the skip
counter was last invoked.
@ivar _runAtStart: A flag indicating whether the 'now' argument was passed
to L{LoopingCall.start}.
NFc �D <� V ^8� d QhRS[ RS[3, RS[RS[RR/# )� �f.�a�kw�returnN)r �object)�format�
__classdict__s "��7/usr/lib/python3/dist-packages/twisted/internet/task.py� __annotate__�LoopingCall.__annotate__N s2 �� � 1� 1�(�3��;�/� 1�V� 1�6� 1�d� 1� c �` � Wn W n W0n ^ RIHp \ \ V4 V n R# )� ��reactorN)r! r" r# �twisted.internetr/ r r �clock)�selfr! r" r# r/ s &&*, r( �__init__�LoopingCall.__init__N s" � �������,��,��0��
r+ c �> <� V ^8� d QhRS[ S[R, , /# )r r$ r )r r )r& r' s "�r( r) r* W s �� �
�
�(�8�M�#:�;�
r+ c � � \ R\ R^^ ^ 4 RR7 p\ P ! V\ ^R7 V P
# )zp
DEPRECATED. L{Deferred} fired when loop stops or fails.
Use the L{Deferred} returned by L{LoopingCall.start}.
z*twisted.internet.task.LoopingCall.deferred�Twistedz the deferred returned by start())� replacement)�
stacklevel)r r �warnings�warn�DeprecationWarning� _deferred)r2 �
warningStrings & r( �deferred�LoopingCall.deferredV s? � � 5� 8� �I�r�1�a� (�:�
�
�
�
�
�m�%7�A�F��~�~� r+ c �< <� V ^8� d QhRS[ S[.S[3, RR/# )r �
countCallabler$ r )r �intr% )r& r' s "�r( r) r* g s& �� � 9� 9�h��u�f�}�&=� 9�-� 9r+ c �. aa� R VV3R llpV ! V4 oS# )aW
An alternate constructor for L{LoopingCall} that makes available the
number of calls which should have occurred since it was last invoked.
Note that this number is an C{int} value; It represents the discrete
number of calls that should have been made. For example, if you are
using a looping call to display an animation with discrete frames, this
number would be the number of frames to advance.
The count is normally 1, but can be higher. For example, if the reactor
is blocked and takes too long to invoke the L{LoopingCall}, a Deferred
returned from a previous call is not fired before an interval has
elapsed, or if the callable itself blocks for longer than an interval,
preventing I{itself} from being called.
When running with an interval of 0, count will be always 1.
@param countCallable: A callable that will be invoked each time the
resulting LoopingCall is run, with an integer specifying the number
of calls that should have been invoked.
@return: An instance of L{LoopingCall} with call counting enabled,
which provides the count as the first positional argument.
@since: 9.0
c �$ � V ^8� d QhR\ /# �r r$ �r% )r& s "r( r) �+LoopingCall.withCount.<locals>.__annotate__� s � � � �� r+ c �� <� SP P 4 p SP ^ 8X d V Sn S! ^4 # SP pVf\ SP f Q R4 hSP pSP
' d) SP f Q R4 hVSP , pSP
V4 pSP
V 4 pW2,
pV^ 8� d V Sn S! V4 # R# )r- Nz(LoopingCall called before it was startedz&Looping call called with None interval)r1 �seconds�interval�
_realLastTime� starttime� _runAtStart� _intervalOf)�now�lastTime� lastInterval� thisInterval�countrB r2 s ��r( �counter�&LoopingCall.withCount.<locals>.counter� s� �� ��*�*�$�$�&�C��}�}��!�%(��"�$�Q�'�'��)�)�H�� ��N�N�.�>�=�>�.� �>�>���#�#�#� �
�
�1�@�?�@�1� ��
�
�-�H� �+�+�H�5�L� �+�+�C�0�L� �/�E��q�y�%(��"�$�U�+�+�r+ � )�clsrB rU r2 s &f @r( � withCount�LoopingCall.withCountf s �� �: � �6 �7�|��� r+ c �& <� V ^8� d QhRS[ RS[/# )r �tr$ )�floatrC )r& r' s "�r( r) r* � s �� � � �U� �s� r+ c � � V P f Q hV P f Q hWP ,
p\ W P , 4 pV# )a
Determine the number of intervals passed as of the given point in
time.
@param t: The specified time (from the start of the L{LoopingCall}) to
be measured in intervals
@return: The C{int} number of intervals which have passed as of the
given point in time.
)rM rK rC )r2 r\ � elapsedTime� intervalNums && r( rO �LoopingCall._intervalOf� sG � � �~�~�)�)�)��}�}�(�(�(��.�.�(� ��+�
�
�5�6� ��r+ c �: <� V ^8� d QhRS[ RS[RS[R, /# )r rK rP r$ r )r] �boolr )r& r' s "�r( r) r* � s' �� � � �e� �$� �(�=�:Q� r+ c �8 � V P ' d Q R4 hV^ 8 d \ R4 hRV n \ 4 ;q0n V P P 4 V n Wn W n V' d
V ! 4 V# V P V P 4 V# )a0
Start running function every interval seconds.
@param interval: The number of seconds between calls. May be
less than one. Precision will depend on the underlying
platform, the available hardware, and the load on the system.
@param now: If True, run this call right now. Otherwise, wait
until the interval has elapsed before beginning.
@return: A Deferred whose callback will be invoked with
C{self} when C{self.stop} is called, or whose errback will be
invoked when the function raises an exception or returned a
deferred that has its errback invoked.
z.Tried to start an already running LoopingCall.zinterval must be >= 0T)
�running�
ValueErrorr r= r1 rJ rM rK rN �
_scheduleFrom)r2 rK rP r? s &&& r( �start�LoopingCall.start� s� � � �<�<�<�T�!T�T� � �a�<� � 4�5� 5��� � %-�J�.��>� ���+�+�-��� �
� �� � �F� ��
� � �t�~�~� .��r+ c � <� V ^8� d QhRR/# �r r$ NrW )r& r' s "�r( r) r* � s �� � � �d� r+ c � � V P ' g Q R4 hRV n V P eN V P P 4 RV n V P Ruqn Vf Q hVP V 4 R# R# )zStop running function.z1Tried to stop a LoopingCall that was not running.FN)re �call�cancelr= �callback�r2 �ds & r( �stop�LoopingCall.stop� si � ��|�|�|�S� S�S�|� �� � �9�9� � �I�I� � � � �D�I� $���� �A�~��=� �=�
�J�J�t� � !r+ c � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) r* � s �� � /� /�t� /r+ c � � V P ' g Q R4 hV P e^ V P P 4 RV n V P P 4 V n V P
V P
4 R# R# )z<
Skip the next iteration and reset the timer.
@since: 11.1
z2Tried to reset a LoopingCall that was not running.N)re rm rn r1 rJ rM rg �r2 s &r( �reset�LoopingCall.reset� sd � � �|�|�|�T� T�T�|� �9�9� � �I�I� � � � �D�I� !�Z�Z� /� /� 1�D�N� � � �t�~�~� .� !r+ c � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) r* � s �� � � �$� r+ c �� a � R V 3R llpR V 3R llpRS n \ S P .S P O5/ S P B pVP V4 VP
V4 R# )c �( � V ^8� d QhR\ RR/# �r �resultr$ NrG )r& s "r( r) �*LoopingCall.__call__.<locals>.__annotate__� s � � !� !�v� !�$� !r+ c �� <� SP ' d, SP SP P 4 4 R # SP R upSn Vf Q hVP S4 R # �N)re rg r1 rJ r= ro )r} rq r2 s & �r( �cb� LoopingCall.__call__.<locals>.cb� sO �� ��|�|�|��"�"�4�:�:�#5�#5�#7�8�$(�N�N�D�!��4�>��}�$�}��
�
�4� r+ c �( � V ^8� d QhR\ RR/# �r �failurer$ Nr )r& s "r( r) r~ � s � � � �� �D� r+ c �l <� R Sn SP RupSn Vf Q hVP V 4 R# )FN)re r= �errback)r� rq r2 s & �r( �eb� LoopingCall.__call__.<locals>.eb� s2 �� � �D�L� $���� �A�t�~��=� �=�
�I�I�g� r+ N)rm r r! r" r# � addCallback�
addErrback)r2 r� r� rq s f r( �__call__�LoopingCall.__call__� sX �� � !� !� � � �� � �$�&�&� 5�4�6�6� 5�T�W�W� 5�� �
�
�b�� � � �R�r+ c �$ <� V ^8� d QhRS[ RR/# )r �whenr$ N�r] )r& r' s "�r( r) r* � s �� � $:� $:�%� $:�D� $:r+ c �j a a� R V V3R llpS P P V! 4 S 4 S n R# )zu
Schedule the next iteration of this looping call.
@param when: The present time from whence the call is scheduled.
c �$ � V ^8� d QhR\ /# rF r� )r& s "r( r) �/LoopingCall._scheduleFrom.<locals>.__annotate__ s � � %� %�� %r+ c � <� SP ^ 8X d ^ # SP f Q hSSP ,
p SP f Q hSP V SP , ,
pSSV, 8X d
SP # V# )r- )rK rM )�
runningFor�untilNextIntervalr2 r� s ��r( �howLong�*LoopingCall._scheduleFrom.<locals>.howLong s� �� � �}�}��!� � �>�>�-� -�-� ����.�J��=�=�,� ,�,� $�
�
��d�m�m�1K� L� � �t� /�/�/� �}�}�$� %� $r+ N)r1 � callLaterrm )r2 r� r� s ff r( rg �LoopingCall._scheduleFrom� s) �� � %� %�: �J�J�(�(���D�9�� r+ c � <� V ^8� d QhRS[ /# rF )�str)r& r' s "�r( r) r* % s �� �
�
�#�
r+ c � � \ V P R R4 pVf> \ V P RR4 pVe# \ V P RR4 pVe V RV 2pVf! \ P ! V P 4 pRP V P
V\ P ! V P 4 \ P ! V P 4 4 # )� __qualname__N�__name__�im_class�.z LoopingCall<{!r}>({}, *{}, **{}))�getattrr! r � safe_reprr& rK r" r# )r2 �func�imClasss & r( �__repr__�LoopingCall.__repr__% s� � � �t�v�v�~�t�4�� �<��4�6�6�:�t�4�D�� �!�$�&�&�*�d�;���&� %�Y�a��v�.�D� �<��$�$�T�V�V�,�D�1�8�8� �M�M� � � � �d�f�f� %� � � �d�g�g� &�
�
r+ c � <� V ^8� d Qh/ S[ S[, ;R& S[ S[R, , ;R& S[ S[, ;R& S[ S[, ;R& S[ S[, ;R& # )r rm r r= rK rM rL )r r r r] )r& r' s "�r( r) r* * se �� � �8 �<�
�'�9 �< �� �/�0�7�= �> �u�o�$�? �B ���%�C �D �E�?�)�E r+ ) r= rL rN r" rm r1 r! rK r# re rM )T)r� �
__module__r� �__firstlineno__�__doc__rm re r= rK rN rM rL r3 �propertyr? � classmethodrY rO rh rr rw r� rg r� �__annotate_func__�__static_attributes__�__classdictcell__�r' s @r( r r * s� �� � ��6 $(�D��G�37�I� $�H��K�!%�I�%)�M�1� 1� �
� �
� �9� �9�v� �" � �@ � � /� /�� �($:� $:�L
�
�w � r+ r c � � ] tR tRtRtRtR# )�SchedulerErrori: z�
The operation could not be completed because the scheduler or one of its
tasks was in an invalid state. This exception should not be raised
directly, but is a superclass of various scheduler-state-related
exceptions.
rW N�r� r� r� r� r� r� rW r+ r( r� r� : s � �r+ r� c � � ] tR tRtRtRtR# )�SchedulerStoppediC zh
The operation could not complete because the scheduler was stopped in
progress or was already stopped.
rW Nr� rW r+ r( r� r� C � � �r+ r� c � � ] tR tRtRtRtR# )� TaskFinishediJ z�
The operation could not complete because the task was already completed,
stopped, encountered an error or otherwise permanently stopped running.
rW Nr� rW r+ r( r� r� J r� r+ r� c � � ] tR tRtRtRtR# )�TaskDoneiQ zJ
The operation could not complete because the task was already completed.
rW Nr� rW r+ r( r� r� Q � � �r+ r� c � � ] tR tRtRtRtR# )� TaskStoppediW z@
The operation could not complete because the task was stopped.
rW Nr� rW r+ r( r� r� W r� r+ r� c � � ] tR tRtRtRtR# )�
TaskFailedi] zQ
The operation could not complete because the task died with an unhandled
error.
rW Nr� rW r+ r( r� r� ] r� r+ r� c � � ] tR tRtRtRtR# )� NotPausedid zR
This exception is raised when a task is resumed which was not previously
paused.
rW Nr� rW r+ r( r� r� d r� r+ r� c �H a � ] tR tRt o RtV 3R lR ltV 3R lR ltRtV tR# ) �_Timerik g{�G�z�?c � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) �_Timer.__annotate__n s �� � 0� 0�$� 0r+ c �\ � \ P ! 4 V P , V n R # r� )�time� MAX_SLICE�endrv s &r( r3 �_Timer.__init__n s � ��9�9�;�� � �/��r+ c � <� V ^8� d QhRS[ /# rF �rc )r& r' s "�r( r) r� q s �� � '� '�$� 'r+ c �F � \ P ! 4 V P 8� # r� )r� r� rv s &r( r� �_Timer.__call__q s � ��y�y�{�d�h�h�&�&r+ )r� N) r� r� r� r� r� r3 r� r� r� r� s @r( r� r� k s �� � ��I�0� 0�'� 'r+ r� g:�0�yE>c �B � V ^8� d QhR\ . R3, R\ /# )r �callableNr$ )r r )r& s "r( r) r) x s' � � E� E���T�� 2� E�|� Er+ c �V � ^ RI Hp \ \ V4 P \
V 4 # )r- r. )r0 r/ r r r� �_EPSILON)r� r/ s & r( �_defaultSchedulerr� x s � �(� � �g� &� 0� 0��8� D�Dr+ � _TaskResultTc � a � ] tR tRt o RtV 3R lR ltV 3R lR ltV 3R lR ltV 3R lR
ltV 3R lR lt V 3R
lR lt
V 3R lR lt V 3R lR lt Rt
V tR# )�CooperativeTaski� a
A L{CooperativeTask} is a task object inside a L{Cooperator}, which can be
paused, resumed, and stopped. It can also have its completion (or
termination) monitored.
@see: L{Cooperator.cooperate}
@ivar _iterator: the iterator to iterate when this L{CooperativeTask} is
asked to do work.
@ivar _cooperator: the L{Cooperator} that this L{CooperativeTask}
participates in, which is used to re-insert it upon resume.
@ivar _deferreds: the list of L{Deferred}s to fire when this task
completes, fails, or finishes.
@ivar _pauseCount: the number of times that this L{CooperativeTask} has
been paused; if 0, it is running.
@ivar _completionState: The completion-state of this L{CooperativeTask}.
L{None} if the task is not yet completed, an instance of L{TaskStopped}
if C{stop} was called to stop this task early, of L{TaskFailed} if the
application code in the iterator raised an exception which caused it to
terminate, and of L{TaskDone} if it terminated normally via raising
C{StopIteration}.
c �8 <� V ^8� d QhRS[ S[, RRRR/# )r �iterator�
cooperator�
Cooperatorr$ N)r r� )r& r' s "�r( r) � CooperativeTask.__annotate__� s* �� �
"�
"� � �.�
"�<H�
"�
�
"r+ c �x � Wn W n . V n ^ V n RV n RV n VP
V 4 R# )zY
A private constructor: to create a new L{CooperativeTask}, see
L{Cooperator.cooperate}.
N)� _iterator� _cooperator�
_deferreds� _pauseCount�_completionState�_completionResult�_addTask)r2 r� r� s &&&r( r3 �CooperativeTask.__init__� s< � � "��%��BD��� ���:>�� �SW�� ����D�!r+ c �@ <� V ^8� d QhRS[ S[S[, , /# rF )r r r� )r& r' s "�r( r) r� � s �� � � �(�8�L�#9�:� r+ c �� � \ 4 pV P f V P P V4 V# V P f Q hVP V P 4 V# )aw
Get a L{Deferred} notification of when this task is complete.
@return: a L{Deferred} that fires with the C{iterator} that this
L{CooperativeTask} was created with when the iterator has been
exhausted (i.e. its C{next} method has raised C{StopIteration}), or
fails with the exception raised by C{next} if it raises some other
exception.
@rtype: L{Deferred}
)r r� r� �appendr� ro rp s & r( �whenDone�CooperativeTask.whenDone� s[ � � /7�j�� � � � (� �O�O� "� "�1� %� �� �)�)�5� 5�5�
�J�J�t�-�-� .��r+ c � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) r� � s �� � /� /�t� /r+ c � � V P 4 V ;P ^,
un V P ^8X d V P P V 4 R# R# )a
Pause this L{CooperativeTask}. Stop doing work until
L{CooperativeTask.resume} is called. If C{pause} is called more than
once, C{resume} must be called an equal number of times to resume this
task.
@raise TaskFinished: if this task has already finished or completed.
N)� _checkFinishr� r� � _removeTaskrv s &r( �pause�CooperativeTask.pause� sH � �
���� ���A� �� � � �q� � � � � (� (�� .� !r+ c � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) r� � s �� �
,�
,��
,r+ c �� � V P ^ 8X d \ 4 hV ;P ^, un V P ^ 8X d. V P f V P P V 4 R# R# R# )zp
Resume processing of a paused L{CooperativeTask}.
@raise NotPaused: if this L{CooperativeTask} is not paused.
N)r� r� r� r� r� rv s &r( �resume�CooperativeTask.resume� sa � � � � �q� ��+� � ���A� �� � � �q� �T�%:�%:�%B� � � � %� %�d� +� &C� r+ c �P <� V ^8� d QhRS[ RS[S[S[, S[3, RR/# )r �completionState�deferredResultr$ N)r� r r r� r )r& r' s "�r( r) r� � s8 �� � '� '�'�'� �h�|� 4�g� =�>�'�
� 'r+ c � � Wn W n V P ' g V P P V 4 V P
F pVP
V4 K R# )z�
@param completionState: a L{SchedulerError} exception or a subclass
thereof, indicating what exception should be raised when subsequent
operations are performed.
@param deferredResult: the result to fire all the deferreds with.
N)r� r� r� r� r� r� ro )r2 r� r� rq s &&& r( �
_completeWith� CooperativeTask._completeWith� sL � � !0� �!/� �� � � � � � � (� (�� .� � � �A�
�J�J�~� &� !r+ c � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) r� � s �� � B� B�d� Br+ c �| � V P 4 V P \ 4 \ \ 4 4 4 R# )z�
Stop further processing of this task.
@raise TaskFinished: if this L{CooperativeTask} has previously
completed, via C{stop}, completion, or failure.
N)r� r� r� r rv s &r( rr �CooperativeTask.stop� s) � �
���� ���;�=�'�+�-�*@�Ar+ c � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) r� � s �� � (� (�d� (r+ c �: � V P e
V P hR# )zS
If this task has been stopped, raise the appropriate subclass of
L{TaskFinished}.
N)r� rv s &r( r� � CooperativeTask._checkFinish� s! � �
� � � ,��'�'� '� -r+ c � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) r� s �� � M� M�d� Mr+ c � a � \ S P 4 p\ V\ 4 ' d2 S P 4 R V 3R llpVP V 3R lV4 R# R# \ d) S P \ 4 S P 4 R# \ d' S P \ 4 \ 4 4 R# i ; i)z�
Perform one unit of work for this task, retrieving one item from its
iterator, stopping if there are no further items in the iterator, and
pausing if the result was a L{Deferred}.
c �( � V ^8� d QhR\ RR/# r� r )r& s "r( r) �2CooperativeTask._oneWorkUnit.<locals>.__annotate__ s � � >� >�w� >�4� >r+ c �< <� SP \ 4 V 4 R # r� )r� r� )r� r2 s &�r( � failLater�/CooperativeTask._oneWorkUnit.<locals>.failLater s �� ��&�&�z�|�W�=r+ c �$ <� SP 4 # r� )r� )r} r2 s &�r( �<lambda>�.CooperativeTask._oneWorkUnit.<locals>.<lambda> s �� �4�;�;�=r+ N) �nextr� �
isinstancer r� � addCallbacks�
StopIterationr� r� �
BaseExceptionr� r )r2 r} r s f r( � _oneWorkUnit� CooperativeTask._oneWorkUnit s� �� �
M��$�.�.�)�F� �&�(�+�+��
�
� �>� >� �#�#�$@�)�L�
,�� � ;� � � �x�z�4�>�>� :� � 8� � � �z�|�W�Y� 7� 8�s �A! �!/C�C� #C�C)r� r� r� r� r� r� N)r� r� r� r� r� r3 r� r� r� r� rr r� r r� r� r� s @r( r� r� � s^ �� � ��6
"�
"� � �( /� /�
,�
,�'� '�6B� B�(� (�M� Mr+ r� c � a � ] tR tRt o Rt]]R3V 3R lR lltR V 3R lR lltV 3R lR
lt V 3R lR lt
V 3R
lR lt V 3R lR lt V 3R lR lt
RtV 3R lR ltV 3R lR ltV 3R lR lt]V 3R lR l4 tR tV tR# ) r� i a0
Cooperative task scheduler.
A cooperative task is an iterator where each iteration represents an
atomic unit of work. When the iterator yields, it allows the
L{Cooperator} to decide which of its tasks to execute next. If the
iterator yields a L{Deferred} then work will pause until the
L{Deferred} fires and completes its callback chain.
When a L{Cooperator} has more than one task, it distributes work between
all tasks.
There are two ways to add tasks to a L{Cooperator}, L{cooperate} and
L{coiterate}. L{cooperate} is the more useful of the two, as it returns a
L{CooperativeTask}, which can be L{paused<CooperativeTask.pause>},
L{resumed<CooperativeTask.resume>} and L{waited
on<CooperativeTask.whenDone>}. L{coiterate} has the same effect, but
returns only a L{Deferred} that fires when the task is done.
L{Cooperator} can be used for many things, including but not limited to:
- running one or more computationally intensive tasks without blocking
- limiting parallelism by running a subset of the total tasks
simultaneously
- doing one thing, waiting for a L{Deferred} to fire,
doing the next thing, repeat (i.e. serializing a sequence of
asynchronous tasks)
Multiple L{Cooperator}s do not cooperate with each other, so for most
cases you should use the L{global cooperator<task.cooperate>}.
Tc �~ <� V ^8� d QhRS[ . S[ . S[3, 3, RS[ S[ . R3, .S[3, RS[/# )r �terminationPredicateFactory� schedulerN�started)r rc r )r& r' s "�r( r) �Cooperator.__annotate__> sR �� � � �%-�b�(�2�t�8�2D�.D�%E� � �X�b�$�h� /� 0�,� >�?� � � r+ c �t � . V n \ R4 V n Wn W n RV n RV n W0n R# )a�
Create a scheduler-like object to which iterators may be added.
@param terminationPredicateFactory: A no-argument callable which will
be invoked at the beginning of each step and should return a
no-argument callable which will return True when the step should be
terminated. The default factory is time-based and allows iterators to
run for 1/100th of a second at a time.
@param scheduler: A one-argument callable which takes a no-argument
callable and should invoke it at some future point. This will be used
to schedule each step of this Cooperator.
@param started: A boolean which indicates whether iterators should be
stepped as soon as they are added, or if they will be queued up until
L{Cooperator.start} is called.
NFrW )�_tasks�iter�
_metarator� _terminationPredicateFactory�
_scheduler� _delayedCall�_stopped�_started)r2 r r r s &&&&r( r3 �Cooperator.__init__> s5 � �. .0�� �59�"�X���,G�)�#��48��� ��
� �
r+ Nc � <� V ^8� d QhRS[ S[, RS[S[S[ S[, , , RS[S[ S[, , /# )r r� � doneDeferredr$ )r r� r r )r& r' s "�r( r) r ] sG �� � � ��<�(� � �x�� �(>� ?�@� �
�(�<�(� )� r+ c �v � Vf \ 4 p\ W4 P 4 pVP V4 V# )a�
Add an iterator to the list of iterators this L{Cooperator} is
currently running.
Equivalent to L{cooperate}, but returns a L{Deferred} that will
be fired when the task is done.
@param doneDeferred: If specified, this will be the Deferred used as
the completion deferred. It is suggested that you use the default,
which creates a new Deferred for you.
@return: a Deferred that will fire when the iterator finishes.
)r r� r� �
chainDeferred)r2 r� r# r� s &&& r( � coiterate�Cooperator.coiterate] s> � �$ � �#�:�L�5D� �6
�
�(�*� � � � �|�,��r+ c �6 <� V ^8� d QhRS[ S[, RS[/# �r r� r$ )r r� r� )r& r' s "�r( r) r w s �� � /� /�(�<�"8� /�_� /r+ c � � \ W4 # )z�
Start running the given iterator as a long-running cooperative task, by
calling next() on it as a periodic timed event.
@param iterator: the iterator to invoke.
@return: a L{CooperativeTask} object representing this task.
�r� )r2 r� s &&r( � cooperate�Cooperator.cooperatew s � � �x�.�.r+ c �$ <� V ^8� d QhRS[ RR/# �r �taskr$ Nr+ )r& r' s "�r( r) r � s �� �
�
�_�
��
r+ c � � V P ' dI V P P V4 VP \ 4 \ \ 4 4 4 R# V P P V4 V P
4 R# )z8
Add a L{CooperativeTask} object to this L{Cooperator}.
N)r r r� r� r� r � _reschedule�r2 r0 s &&r( r� �Cooperator._addTask� sZ � � �=�=�=� �K�K� � �t� $� � � � /� 1�7�;K�;M�3N� O� �K�K� � �t� $� � � � r+ c �$ <� V ^8� d QhRS[ RR/# r/ r+ )r& r' s "�r( r) r � s �� � %� %�� %�D� %r+ c �� � V P P V4 V P ' g8 V P ' d$ V P P 4 RV n R# R# R# )z6
Remove a L{CooperativeTask} from this L{Cooperator}.
N)r �remover rn r3 s &&r( r� �Cooperator._removeTask� sK � �
� � ���4� ��{�{�{�t� 0� 0� 0� � � � $� $� &� $�D� � 1�{r+ c �0 <� V ^8� d QhRS[ S[, /# rF )r r� )r& r' s "�r( r) r � s �� � 0� 0�x��'@� 0r+ c # �� " � V P 4 pV P ' dD V P F pVx � V! 4 ' g K R# \ V P 4 V n KU R# 5i)zx
Yield all L{CooperativeTask} objects in a loop as long as this
L{Cooperator}'s termination condition has not been met.
N)r r r r )r2 �
terminatorr\ s & r( �_tasksWhileNotStopped� Cooperator._tasksWhileNotStopped� sR � � �
�6�6�8�
��k�k�k��_�_���� �<�<�� %� #�4�;�;� /�D�O� �s �"A*� A*�#A*c � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) r � s �� � � �t� r+ c � � RV n V P 4 F pVP 4 K V P 4 R# )z
Run one scheduler tick.
N)r r< r r2 �r2 �taskObjs & r( �_tick�Cooperator._tick� s7 � � !����1�1�3�G� � � � "� 4� ���r+ Fc � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) r � s �� � <� <�T� <r+ c �� � V P ' g
R V n R# V P f7 V P ' d# V P V P
4 V n R# R# R# �TN)r �_mustScheduleOnStartr r r rB rv s &r( r2 �Cooperator._reschedule� sG � ��}�}�}�(,�D� %� � � � � $����� $����
�
� ;�D� � *5� $r+ c � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) r � s �� � � �t� r+ c �n � RV n RV n V P ' d V =V P 4 R# R# )z
Begin scheduling steps.
FTN)r r rG r2 rv s &r( rh �Cooperator.start� s5 � � ��
� ��
� � $� $� $��)� � � � � %r+ c � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) r � s �� � %� %�d� %r+ c � � RV n V P F. pVP \ 4 \ \ 4 4 4 K0 . V n V P
e$ V P
P
4 RV n R# R# )zx
Stop scheduling steps. Errback the completion Deferreds of all
iterators which have been added and forget about them.
TN)r r r� r� r r rn r@ s & r( rr �Cooperator.stop� sh � �
��
��{�{�G� � !� !�"2�"4�g�>N�>P�6Q� R� #��� � � � � (� � � � $� $� &� $�D� � )r+ c � <� V ^8� d QhRS[ /# rF r� )r& r' s "�r( r) r � s �� � 3� 3�� 3r+ c �L � V P ;' d V P ' * # )z�
Is this L{Cooperator} is currently running?
@return: C{True} if the L{Cooperator} is running, C{False} otherwise.
@rtype: C{bool}
)r r rv s &r( re �Cooperator.running� s � � �}�}�2�2�T�]�]�!2�2r+ )r r rG r r r r r r� )r� r� r� r� r� r� r� r3 r& r, r� r� r< rB rG r2 rh rr r� re r� r� r� s @r( r� r� s� �� � � �D IO�BS� � � �> � �4 /� /�
�
�%� %� 0� 0�� � !��<� <� � � %� %� �3� �3r+ r� c �r � V ^8� d QhR\ \ , R\ \ \ , , /# r) )r r r )r& s "r( r) r) � s' � �
.�
.��� �
.��(�2�,�)?�
.r+ c �, � \ P V 4 # )a
Cooperatively iterate over the given iterator, dividing runtime between it
and all other iterators which have been passed to this function and not yet
exhausted.
@param iterator: the iterator to invoke.
@return: a Deferred that will fire when the iterator finishes.
)�_theCooperatorr& �r� s &r( r& r& � s � � � #� #�H� -�-r+ c �F � V ^8� d QhR\ \ , R\ /# r) )r r r� )r& s "r( r) r) � s � � .� .��� � .� � .r+ c �, � \ P V 4 # )a+
Start running the given iterator as a long-running cooperative task, by
calling next() on it as a periodic timed event.
This is very useful if you have computationally expensive tasks that you
want to run without blocking the reactor. Just break each task up so that
it yields frequently, pass it in here and the global L{Cooperator} will
make sure work is distributed between them without blocking longer than a
single iteration of a single task.
@param iterator: the iterator to invoke.
@return: a L{CooperativeTask} object representing this task.
)rT r, rU s &r( r, r, � s � � � #� #�H� -�-r+ c � a � ] tR tRt o RtRtV 3R lR ltV 3R lR ltV 3R lR ltV 3R
lR lt V 3R lR
lt
V 3R lR lt V 3R lR lt Rt
V tR# )�Clocki� z�
Provide a deterministic, easily-controlled implementation of
L{IReactorTime.callLater}. This is commonly useful for writing
deterministic unit tests for code which schedules events using this API.
g c � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) �Clock.__annotate__ s �� � +� +�$� +r+ c � � . V n R # r� ��callsrv s &r( r3 �Clock.__init__ s � �(*��
r+ c � <� V ^8� d QhRS[ /# rF r� )r& r' s "�r( r) r[ s �� � � �� r+ c � � V P # )z�
Pretend to be time.time(). This is used internally when an operation
such as L{IDelayedCall.reset} needs to determine a time value
relative to the current time.
@return: The time which should be considered the current time.
)�rightNowrv s &r( rJ �
Clock.seconds s � � �}�}� r+ c � <� V ^8� d QhRR/# rk rW )r& r' s "�r( r) r[ s �� � 3� 3�D� 3r+ c �@ � V P P R R7 R# )zB
Sort the pending calls according to the time they are scheduled.
c �" � V P 4 # r� )�getTime)r" s &r( r �"Clock._sortCalls.<locals>.<lambda> s
� �a�i�i�kr+ )�keyN)r^ �sortrv s &r( �
_sortCalls�Clock._sortCalls s � �
�
�
��� 1��2r+ c
�L <� V ^8� d QhRS[ RS[RS[3, RS[RS[RS[/# )r �delayr� .�argsr# r$ )r] r r% r )r& r' s "�r( r) r[ s> �� � � ���&.�s�F�{�&;��DJ��RX�� �r+ c �� � \ V P 4 V, VVVV P P R V P 4 pV P P V4 V P 4 V# )z<
See L{twisted.internet.interfaces.IReactorTime.callLater}.
c � � R # r� rW )�cs &r( r �!Clock.callLater.<locals>.<lambda>$ s � �dr+ )r rJ r^ r7 r� rk )r2 rn r� ro r# �dcs &&&*, r( r� �Clock.callLater s_ � � � �L�L�N�U� "� � � � �J�J� � � � �L�L�
��
�
�
���"� � ����� r+ c �0 <� V ^8� d QhRS[ S[, /# rF )r r )r& r' s "�r( r) r[ + s �� � � ��,�!7� r+ c � � V P # )zA
See L{twisted.internet.interfaces.IReactorTime.getDelayedCalls}
r] rv s &r( �getDelayedCalls�Clock.getDelayedCalls+ s � � �z�z�r+ c �$ <� V ^8� d QhRS[ RR/# )r �amountr$ Nr� )r& r' s "�r( r) r[ 1 s �� � � �e� �� r+ c � � V ;P V,
un V P 4 V P ' d� V P ^ , P 4 V P 4 8: d[ V P P ^ 4 p^Vn VP ! VP / VP B V P 4 K� R# R# )z�
Move time on this clock forward by the given amount and run whatever
pending calls should be run.
@param amount: The number of seconds which to advance this clock's
time.
N)
rb rk r^ rg rJ �pop�calledr� ro r# )r2 r{ rm s && r( �advance�
Clock.advance1 s� � �
�
�
�� �
� �����j�j�j�T�Z�Z��]� 2� 2� 4�� � �� F��:�:�>�>�!�$�D��D�K� �I�I�t�y�y� ,�D�G�G� ,� �O�O� � G�jr+ c �4 <� V ^8� d QhRS[ S[, RR/# )r �timingsr$ N)r r] )r& r' s "�r( r) r[ A s �� � !� !�H�U�O� !�� !r+ c �: � V F pV P V4 K R# )z2
Advance incrementally by the given set of times.
N)r )r2 r� r{ s && r( �pump�
Clock.pumpA s � � �F� �L�L�� � r+ r] N)r� r� r� r� r� rb r3 rJ rk r� rx r r� r� r� r� s @r( rY rY � sW �� � �� �H�+� +� � �3� 3� � �&� � � � !� !r+ rY c
� � V ^8� d QhR\ R\ R\ \ R\ 3, , R\
R\
R\ \ , /# )r r1 rn r� .ro r# r$ )r r] r r r r% r )r& s "r( r) r) I sV � � $
� $
� �$
� �$
� �x��R��(�)�$
� � $
�
� $
� �b�\�
$
r+ c � aaaa� R V3R llpR VVV3R llp\ V4 pVP V4 V P WP R4 oV# )a
Call the given function after a certain period of time has passed.
@param clock: The object which will be used to schedule the delayed
call.
@param delay: The number of seconds to wait before calling the function.
@param callable: The callable to call after the delay, or C{None}.
@param args: The positional arguments to pass to C{callable}.
@param kw: The keyword arguments to pass to C{callable}.
@return: A deferred that fires with the result of the callable when the
specified time has elapsed.
c �> � V ^8� d QhR\ \ , RR/# )r r? r$ N)r r% )r& s "r( r) � deferLater.<locals>.__annotate__b s � � � �8�F�#3� �� r+ c �( <� SP 4 R # r� )rn )r? � delayedCalls &�r( �deferLaterCancel�$deferLater.<locals>.deferLaterCancelb s �� ���� r+ c �0 � V ^8� d QhR\ R\ /# )r r} r$ )r% r )r& s "r( r) r� e s � � %� %�6� %�b� %r+ c � <� Sf R # S! S/ SB # r� rW )r} ro r� r# s &���r( r� �deferLater.<locals>.cbe s �� � � ����$��$�$r+ N)r r� r� ro ) r1 rn r� ro r# r� r� rq r� s &&fjl @r( �
deferLaterr� I sI �� �2 � �%� %�
� /�0�A��M�M�"���/�/�%���T�:�K� �Hr+ c �� � V ^8� d QhR\ R\ \ \ , \ R\
\ 3, 3, 3, R\ \
, R\ \ , R\ /# )r �main.z Deferred[_T]�argv�_reactorr$ )
r r r r r r% r r r r )r& s "r( r) r) p sm � � U� U�
� �
�h�r�l�I�n�f�b�&@� A�A�B� D� �U�
�6�
� U� �|�$�
U� �Ur+ c �@ aaaa � Sf ^ RI Hp \ \ V4 o\ V ! S.VO5! 4 p^ oRo R V 3R llpSP RRV4 R VV3R lloR
VVV 3R llpVP
V4 SP 4 \ P ! S4 R# ) a
Call C{main} and run the reactor until the L{Deferred} it returns fires or
the coroutine it returns completes.
This is intended as the way to start up an application with a well-defined
completion condition. Use it to write clients or one-off asynchronous
operations. Prefer this to calling C{reactor.run} directly, as this
function will also:
- Take care to call C{reactor.stop} once and only once, and at the right
time.
- Log any failures from the C{Deferred} returned by C{main}.
- Exit the application when done, with exit code 0 in case of success and
1 in case of failure. If C{main} fails with a C{SystemExit} error, the
code returned is used.
The following demonstrates the signature of a C{main} function which can be
used with L{react}::
async def main(reactor, username, password):
return "ok"
task.react(main, ("alice", "secret"))
@param main: A callable which returns a L{Deferred} or
coroutine. It should take the reactor as its first
parameter, followed by the elements of C{argv}.
@param argv: A list of arguments to pass to C{main}. If omitted the
callable will be invoked with no additional arguments.
@param _reactor: An implementation detail to allow easier unit testing. Do
not supply this parameter.
@since: 12.3
Nr. Fc � � V ^8� d QhRR/# rk rW )r& s "r( r) �react.<locals>.__annotate__� s � � � �� r+ c � <� R o R# rF rW )�stoppings �r( �
onShutdown�react.<locals>.onShutdown� s �� ��r+ �before�shutdownc �4 � V ^8� d QhR\ R\ RR/# )r r} � stopReactorr$ N)r% rc )r& s "r( r) r� � s! � � � �V� �$� �4� r+ c �( <� V' d Sf Q h SP 4 \ V \ 4 ' dK V P \
4 e V P P oR # \ P ! V R4 ^oR # R # \ d Loi ; i)Nz main function encountered error)
rr r r r �check�
SystemExit�value�coder �err)r} r� r� r� s &&��r( rr �react.<locals>.stop� sz �� � ��'� '�'�
��
�
�� �f�g� &� &��|�|�J�'�3� �|�|�(�(������ A�B���
'�� %�
��
�s �B � B�Bc �( � V ^8� d QhR\ RR/# r| rG )r& s "r( r) r� � s � � 9� 9�� 9�D� 9r+ c �` <� S' d S! V R 4 R# Sf Q hSP SV R4 R# )FNT)�callWhenRunning)r} r� rr r� s &���r( �cbFinish�react.<locals>.cbFinish� s. �� � � ��� ��'� '�'� � $� $�T�6�4� 8r+ )
r0 r/ r r r �addSystemEventTrigger�addBoth�run�sys�exit)
r� r� r� r/ �finishedr� r� r� rr r� s
&&f @@@r( �reactr� p s� �� �X ��,�� �g�.�� �d�8� 3�d� 3�4�H� �D��H�� �
�"�"�8�Z��D�� � 9� 9�
���X� � �L�L�N��H�H�T�Nr+ r� )rW N)r rY r� r� r& r� r� )>r� r� r� r: �typingr r r r r r r r r
r r �zope.interfacer
� incrementalr �twisted.internet.baser �twisted.internet.deferr r r �twisted.internet.errorr �twisted.internet.interfacesr r r �twisted.pythonr r �twisted.python.deprecater �twisted.python.failurer r r � Exceptionr� r� r� r� r� r� r� r� r� r� r� r� r� rT r& r, rY r� r� �__all__rW r+ r( �<module>r� s> ��
�
� � � � � � � '� � -� J� J� 4� P� P� '� A� *� �T�]��M
� M
�`�Y� ��~� ��>� ��|� � �,� � � � ��� �'� '� ��E� �~�&� �YM� YM�xy3� y3�x � ��
.�.�$
�\��J!� J!� �J!�Z$
�NU�p �r+