*j R S r SrSSKrSSKJr SSKJr SSKJr SSKJr SS .S
jr g) zFSupport for running coroutines in parallel with staggered start times.)staggered_race N )events)
exceptions)locks)tasks)loopc
^^^^ ^
^ ^ ^
^^^# T=( d [ R " 5 m[ U 5 mSmSm/ m/ m [ 5 m Sm
U
U U4S jm
SUUU UU U U
UU4 S jjm Sn [ R
" 5 nTR
T " US5 5 nT R U5 UR T
5 UR 5 SnT ( a& TR 5 m
T
I Sh vN Sm
T ( a M& T( a [ ST5 eUb UeTTT 4@ A@$ N/! [ R a. nUnT H nUR " UR 6 M SnANjSnAff = f! @ A@f = f7f)ai Run coroutines with staggered start times and take the first to finish.
This method takes an iterable of coroutine functions. The first one is
started immediately. From then on, whenever the immediately preceding one
fails (raises an exception), or when *delay* seconds has passed, the next
coroutine is started. This continues until one of the coroutines complete
successfully, in which case all others are cancelled, or until all
coroutines fail.
The coroutines provided should be well-behaved in the following way:
* They should only ``return`` if completed successfully.
* They should always raise an exception if they did not complete
successfully. In particular, if they handle cancellation, they should
probably reraise, like this::
try:
# do work
except asyncio.CancelledError:
# undo partially completed work
raise
Args:
coro_fns: an iterable of coroutine functions, i.e. callables that
return a coroutine object when called. Use ``functools.partial`` or
lambdas to pass arguments.
delay: amount of time, in seconds, between starting coroutines. If
``None``, the coroutines will run sequentially.
loop: the event loop to use.
Returns:
tuple *(winner_result, winner_index, exceptions)* where
- *winner_result*: the result of the winning coroutine, or ``None``
if no coroutines won.
- *winner_index*: the index of the winning coroutine in
``coro_fns``, or ``None`` if no coroutines won. If the winning
coroutine may return None on success, *winner_index* can be used
to definitively determine whether any coroutine won.
- *exceptions*: list of exceptions returned by the coroutines.
``len(exceptions)`` is equal to the number of coroutines actually
started, and the order is the same as in ``coro_fns``. The winning
coroutine's entry is ``None``.
Nc > TR U 5 Tb- TR 5 ( d T( d TR S 5 U R 5 ( a g U R 5 nUc g TR U5 g )N)discarddone
set_result cancelled exceptionappend)taskexcon_completed_fut
running_tasksunhandled_exceptionss 8/opt/alt/python313/lib64/python3.13/asyncio/staggered.py task_done!staggered_race..task_doneJ si d# ($))++! ' ' - >> nn ; ##C( c > # U R 5 I S h vN UbZ [ R " [ R 5 [
R " UR 5 T 5 I S h vN S S S 5 [ T 5 u p#[ R " 5 n[ R " 5 nTR T" XT5 5 nTR U5 UR T5 UR 5 T
R S 5 [! T
5 US- :X d e U" 5 I S h vN nTb eUmUm[
R" " T5 nT H n XLd M U R% 5 M g GNW GN! , ( d f GN
= f! [ a g f = f Nk! [& [( 4 a e [* a n
U
T
U' UR 5 S n
A
g S n
A
ff = f7f)Nr )wait
contextlibsuppressexceptions_mod TimeoutErrorr wait_fornext
StopIterationr Event create_taskaddadd_done_callbacksetr len current_taskcancel
SystemExitKeyboardInterrupt
BaseException) ok_to_startprevious_failed
this_indexcoro_fn this_failednext_ok_to_start next_taskresultr* tedelay
enum_coro_fnsr r run_one_coror r winner_index
winner_results r r; $staggered_race..run_one_coro[ s &$$^%@%@A
nn_%9%9%;UCCC B "&}"5 J kkm ;;=$$\2B%PQ )$##I. $ :*q.000 "9_F ' ''%L "M !--d3L"(HHJ #a ! D BA % -. %&Jz " OO s GE.+G)E4,E1-E41G:
F BG
F *F+F /&GG1E44
F>G
FGFGF G2G G GGzstaggered race failed)returnN)r get_running_loop enumerater( r r$ r% r& r'
create_futurer CancelledErrorr+ argsExceptionGroup)coro_fnsr9 r propagate_cancellation_errorr/
first_taskexr r: r r r; r r r r< r= s `` @@@@@@@@@r r r
s_ h ,6**,D h'MML JEM)"6 6 p $( Kkkm %%l;&EF
*%$$Y/'+$ # 1 1 3
*&&&
$ m . !!8:NO O ' 3. . lJ6 46J '!00
*/1, )DKK) *
*
46Jsa AE#&A8E D $D%D ) E 4 E E#D E*$EE EE E E#)
__doc____all__r r r r r r r r r rN s( L
* 37 aKr