MINI MINI MANI MO
3
\R
@ sP d Z ddlZddlZddlZddlZdZdZdZdZdZ dZ
d Z d
Z d Z
e e
e e e
gZe d e
d
e de de
diZejdZG dd deZG dd deZG dd deZG dd deZG dd deZG dd d eZG d d d eZG d d d eZd!d" Z d#d$ Z d/d%d&Z ej d'd(Z defd)d*Z!G d+d, d,eZ"G d-d. d.eZ#dS )0z"Brian Quinlan (brian@sweetapp.com) NFIRST_COMPLETEDFIRST_EXCEPTION
ALL_COMPLETED
_AS_COMPLETEDPENDINGRUNNING CANCELLEDCANCELLED_AND_NOTIFIEDFINISHEDpendingrunning cancelledfinishedzconcurrent.futuresc @ s e Zd ZdZdS )Errorz-Base class for all future-related exceptions.N)__name__
__module__ __qualname____doc__ r r 0/usr/lib64/python3.6/concurrent/futures/_base.pyr , s r c @ s e Zd ZdZdS )CancelledErrorzThe Future was cancelled.N)r r r r r r r r r 0 s r c @ s e Zd ZdZdS ) TimeoutErrorz*The operation exceeded the given deadline.N)r r r r r r r r r 4 s r c @ s0 e Zd ZdZdd Zdd Zdd Zdd Zd
S ) _Waiterz;Provides the event that wait() and as_completed() block on.c C s t j | _g | _d S )N) threadingZEventeventfinished_futures)selfr r r __init__: s
z_Waiter.__init__c C s | j j| d S )N)r append)r futurer r r
add_result> s z_Waiter.add_resultc C s | j j| d S )N)r r )r r r r r
add_exceptionA s z_Waiter.add_exceptionc C s | j j| d S )N)r r )r r r r r
add_cancelledD s z_Waiter.add_cancelledN)r r r r r r r! r" r r r r r 8 s
r c sD e Zd ZdZ fddZ fddZ fddZ fdd Z ZS )
_AsCompletedWaiterzUsed by as_completed().c s t t| j tj | _d S )N)superr# r r Locklock)r ) __class__r r r J s z_AsCompletedWaiter.__init__c
s0 | j tt| j| | jj W d Q R X d S )N)r& r$ r# r r set)r r )r' r r r N s z _AsCompletedWaiter.add_resultc
s0 | j tt| j| | jj W d Q R X d S )N)r& r$ r# r! r r( )r r )r' r r r! S s z _AsCompletedWaiter.add_exceptionc
s0 | j tt| j| | jj W d Q R X d S )N)r& r$ r# r" r r( )r r )r' r r r" X s z _AsCompletedWaiter.add_cancelled) r r r r r r r! r"
__classcell__r r )r' r r# G s
r# c s8 e Zd ZdZ fddZ fddZ fddZ ZS )_FirstCompletedWaiterz*Used by wait(return_when=FIRST_COMPLETED).c s t j| | jj d S )N)r$ r r r( )r r )r' r r r ` s z _FirstCompletedWaiter.add_resultc s t j| | jj d S )N)r$ r! r r( )r r )r' r r r! d s z#_FirstCompletedWaiter.add_exceptionc s t j| | jj d S )N)r$ r" r r( )r r )r' r r r" h s z#_FirstCompletedWaiter.add_cancelled)r r r r r r! r" r) r r )r' r r* ] s r* c sL e Zd ZdZ fddZdd Z fddZ fdd Z fd
d Z Z S ) _AllCompletedWaiterz<Used by wait(return_when=FIRST_EXCEPTION and ALL_COMPLETED).c s$ || _ || _tj | _t j d S )N)num_pending_callsstop_on_exceptionr r% r& r$ r )r r, r- )r' r r r o s
z _AllCompletedWaiter.__init__c
C s4 | j $ | jd8 _| js&| jj W d Q R X d S )N )r& r, r r( )r r r r _decrement_pending_callsu s z,_AllCompletedWaiter._decrement_pending_callsc s t j| | j d S )N)r$ r r/ )r r )r' r r r { s z _AllCompletedWaiter.add_resultc s* t j| | jr | jj n| j d S )N)r$ r! r- r r( r/ )r r )r' r r r! s z!_AllCompletedWaiter.add_exceptionc s t j| | j d S )N)r$ r" r/ )r r )r' r r r" s z!_AllCompletedWaiter.add_cancelled)
r r r r r r/ r r! r" r) r r )r' r r+ l s r+ c @ s( e Zd ZdZdd Zdd Zdd ZdS ) _AcquireFutureszDA context manager that does an ordered acquire of Future conditions.c C s t |td| _d S )N)key)sortedidfutures)r r4 r r r r s z_AcquireFutures.__init__c C s x| j D ]}|jj qW d S )N)r4
_conditionacquire)r r r r r __enter__ s z_AcquireFutures.__enter__c G s x| j D ]}|jj qW d S )N)r4 r5 release)r argsr r r r __exit__ s z_AcquireFutures.__exit__N)r r r r r r7 r: r r r r r0 s r0 c C s |t krt }nZ|tkr t }nJtdd | D }|tkrHt|dd}n"|tkr^t|dd}n td| x| D ]}|j j
| qpW |S )Nc s s | ]}|j ttgkV qd S )N)_stater r
).0fr r r <genexpr> s z._create_and_install_waiters.<locals>.<genexpr>T)r- Fz Invalid return condition: %r) r r# r r* sumr r+ r
ValueError_waitersr )fs return_whenwaiterZ
pending_countr= r r r _create_and_install_waiters s
rE c c sX xR| rR| d }x|D ]}|j | qW |j |jj | W dQ R X ~| j V qW dS )a~
Iterate on the list *fs*, yielding finished futures one by one in
reverse order.
Before yielding a future, *waiter* is removed from its waiters
and the future is removed from each set in the collection of sets
*ref_collect*.
The aim of this function is to avoid keeping stale references after
the future is yielded and before the iterator resumes.
r. N)remover5 rA pop)rB rD ref_collectr= Z futures_setr r r _yield_finished_futures s
rJ c c sJ |dk r|t j }t| } t| }t| * tdd | D }| | }t| t}W dQ R X t|}zt||| fdE dH x|r|dkrd}n(|t j }|dk rt dt||f |j
j | |j |j
}g |_
|j
j W dQ R X |j t||| |fdE dH q~W W dx,| D ]$}|j |jj| W dQ R X q W X dS )an An iterator over the given futures that yields each as it completes.
Args:
fs: The sequence of Futures (possibly created by different Executors) to
iterate over.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
Returns:
An iterator that yields the given Futures as they complete (finished or
cancelled). If any given Futures are duplicated, they will be returned
once.
Raises:
TimeoutError: If the entire result iterator could not be generated
before the given timeout.
Nc s s | ]}|j ttgkr|V qd S )N)r; r r
)r< r= r r r r> s z as_completed.<locals>.<genexpr>)rI r z %d (of %d) futures unfinished)time monotonicr( lenr0 rE r listrJ r r waitr& r clearreverser5 rA rG ) rB timeoutend_timeZ
total_futuresr r rD Z wait_timeoutr= r r r as_completed s@
rT DoneAndNotDoneFuturesz
done not_donec C s t | tdd | D }t| | }|tkr>|r>t||S |tkrf|rftdd |D rft||S t|t| krt||S t| |}W dQ R X |jj | x*| D ]"}|j
|j j | W dQ R X qW |j
|j t|t| | S )a Wait for the futures in the given sequence to complete.
Args:
fs: The sequence of Futures (possibly created by different Executors) to
wait upon.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
return_when: Indicates when this function should return. The options
are:
FIRST_COMPLETED - Return when any future finishes or is
cancelled.
FIRST_EXCEPTION - Return when any future finishes by raising an
exception. If no future raises an exception
then it is equivalent to ALL_COMPLETED.
ALL_COMPLETED - Return when all futures finish or are cancelled.
Returns:
A named 2-tuple of sets. The first set, named 'done', contains the
futures that completed (is finished or cancelled) before the wait
completed. The second set, named 'not_done', contains uncompleted
futures.
c s s | ]}|j ttgkr|V qd S )N)r; r r
)r< r= r r r r> s zwait.<locals>.<genexpr>c s s( | ] }|j r|j d k r|V qd S )N)r
exception)r< r= r r r r> $ s N)r0 r( r rU r anyrM rE r rO r5 rA rG updater )rB rR rC doneZnot_donerD r= r r r rO s"
rO c @ s e Zd ZdZdd Zdd Zdd Zdd Zd
d Zd d
Z dd Z
dd Z dd Z d ddZ
d ddZdd Zdd Zd d ZdS )!Futurez5Represents the result of an asynchronous computation.c C s, t j | _t| _d| _d| _g | _g | _dS )z8Initializes the future. Should not be called by clients.N) r Z Conditionr5 r r; _result
_exceptionrA _done_callbacks)r r r r r 8 s
zFuture.__init__c C sB x<| j D ]2}y || W q tk
r8 tjd| Y qX qW d S )Nz!exception calling callback for %r)r] ExceptionLOGGERrV )r callbackr r r _invoke_callbacksA s
zFuture._invoke_callbacksc C s | j v | jtkr`| jr<d| jjt| t| j | jjjf S d| jjt| t| j | jjjf S d| jjt| t| j f S Q R X d S )Nz <%s at %#x state=%s raised %s>z <%s at %#x state=%s returned %s>z<%s at %#x state=%s>) r5 r; r
r\ r' r r3 _STATE_TO_DESCRIPTION_MAPr[ )r r r r __repr__H s"
zFuture.__repr__c
C sR | j : | jttgkrdS | jttgkr,dS t| _| j j W dQ R X | j dS )zCancel the future if possible.
Returns True if the future was cancelled, False otherwise. A future
cannot be cancelled if it is running or has already completed.
FTN)r5 r; r r
r r
notify_allra )r r r r cancel\ s z
Future.cancelc
C s | j | jttgkS Q R X dS )z(Return True if the future was cancelled.N)r5 r; r r )r r r r r
o s zFuture.cancelledc C s | j | jtkS Q R X dS )z1Return True if the future is currently executing.N)r5 r; r )r r r r r t s zFuture.runningc C s" | j | jtttgkS Q R X dS )z>Return True of the future was cancelled or finished executing.N)r5 r; r r r
)r r r r rY y s z Future.donec C s | j r| j n| jS d S )N)r\ r[ )r r r r Z __get_result~ s zFuture.__get_resultc C s> | j & | jtttgkr(| jj| dS W dQ R X || dS )a% Attaches a callable that will be called when the future finishes.
Args:
fn: A callable that will be called with this future as its only
argument when the future completes or is cancelled. The callable
will always be called by a thread in the same process in which
it was added. If the future has already completed or been
cancelled then the callable will be called immediately. These
callables are called in the order that they were added.
N)r5 r; r r r
r] r )r fnr r r add_done_callback s
zFuture.add_done_callbackNc
C sx | j h | jttgkr t n| jtkr0| j S | j j| | jttgkrRt n| jtkrd| j S t W dQ R X dS )aB Return the result of the call that the future represents.
Args:
timeout: The number of seconds to wait for the result if the future
isn't done. If None, then there is no limit on the wait time.
Returns:
The result of the call that the future represents.
Raises:
CancelledError: If the future was cancelled.
TimeoutError: If the future didn't finish executing before the given
timeout.
Exception: If the call raised then that exception will be raised.
N) r5 r; r r r r
_Future__get_resultrO r )r rR r r r result s
z
Future.resultc
C st | j d | jttgkr t n| jtkr.| jS | j j| | jttgkrPt n| jtkr`| jS t W dQ R X dS )aU Return the exception raised by the call that the future represents.
Args:
timeout: The number of seconds to wait for the exception if the
future isn't done. If None, then there is no limit on the wait
time.
Returns:
The exception raised by the call that the future represents or None
if the call completed without raising.
Raises:
CancelledError: If the future was cancelled.
TimeoutError: If the future didn't finish executing before the given
timeout.
N) r5 r; r r r r
r\ rO r )r rR r r r rV s
zFuture.exceptionc C st | j d | jtkr6t| _x| jD ]}|j| q W dS | jtkrJt| _dS tj dt
| | j t dW dQ R X dS )a Mark the future as running or process any cancel notifications.
Should only be used by Executor implementations and unit tests.
If the future has been cancelled (cancel() was called and returned
True) then any threads waiting on the future completing (though calls
to as_completed() or wait()) are notified and False is returned.
If the future was not cancelled then it is put in the running state
(future calls to running() will return True) and True is returned.
This method should be called by Executor implementations before
executing the work associated with this future. If this method returns
False then the work should not be executed.
Returns:
False if the Future was cancelled, True otherwise.
Raises:
RuntimeError: if this method was already called or if set_result()
or set_exception() was called.
FTz!Future %s in unexpected state: %szFuture in unexpected stateN) r5 r; r r rA r" r r r_ Zcriticalr3 RuntimeError)r rD r r r set_running_or_notify_cancel s
z#Future.set_running_or_notify_cancelc
C sN | j 6 || _t| _x| jD ]}|j| q W | j j W dQ R X | j dS )zSets the return value of work associated with the future.
Should only be used by Executor implementations and unit tests.
N)r5 r[ r
r; rA r rd ra )r ri rD r r r
set_result s zFuture.set_resultc
C sN | j 6 || _t| _x| jD ]}|j| q W | j j W dQ R X | j dS )zSets the result of the future as being the given exception.
Should only be used by Executor implementations and unit tests.
N)r5 r\ r
r; rA r! rd ra )r rV rD r r r
set_exception s zFuture.set_exception)N)N)r r r r r ra rc re r
r rY rh rg ri rV rk rl rm r r r r rZ 5 s
"(
rZ c @ sB e Zd ZdZdd ZdddddZdd
d Zd d
Zdd ZdS )ExecutorzCThis is an abstract base class for concrete asynchronous executors.c O s
t dS )a Submits a callable to be executed with the given arguments.
Schedules the callable to be executed as fn(*args, **kwargs) and returns
a Future instance representing the execution of the callable.
Returns:
A Future representing the given call.
N)NotImplementedError)r rf r9 kwargsr r r submit s zExecutor.submitNr. )rR chunksizec sB dk rt j fddt| D fdd}| S )a} Returns an iterator equivalent to map(fn, iter).
Args:
fn: A callable that will take as many arguments as there are
passed iterables.
timeout: The maximum number of seconds to wait. If None, then there
is no limit on the wait time.
chunksize: The size of the chunks the iterable will be broken into
before being passed to a child process. This argument is only
used by ProcessPoolExecutor; it is ignored by
ThreadPoolExecutor.
Returns:
An iterator equivalent to: map(func, *iterables) but the calls may
be evaluated out-of-order.
Raises:
TimeoutError: If the entire result iterator could not be generated
before the given timeout.
Exception: If fn(*args) raises for any values.
Nc s g | ]}j f| qS r )rq )r< r9 )rf r r r
<listcomp>? s z Executor.map.<locals>.<listcomp>c 3 sd zFj x8rBd kr(j j V q j j tj V q W W d xD ] } | j qNW X d S )N)rQ rH ri rK rL re )r )rS rB rR r r result_iteratorC s
z%Executor.map.<locals>.result_iterator)rK rL zip)r rf rR rr iterablesrt r )rS rf rB r rR r map& s
z Executor.mapTc C s dS )a Clean-up the resources associated with the Executor.
It is safe to call this method several times. Otherwise, no other
methods can be called after this one.
Args:
wait: If True then shutdown will not return until all running
futures have finished executing and the resources used by the
executor have been reclaimed.
Nr )r rO r r r shutdownR s zExecutor.shutdownc C s | S )Nr )r r r r r7 _ s zExecutor.__enter__c C s | j dd dS )NT)rO F)rx )r exc_typeZexc_valZexc_tbr r r r: b s zExecutor.__exit__)T) r r r r rq rw rx r7 r: r r r r rn s ,
rn )N)$
__author__ collectionsZloggingr rK r r r r r r r r r
Z_FUTURE_STATESrb Z getLoggerr_ r^ r r r objectr r# r* r+ r0 rE rJ rT
namedtuplerU rO rZ rn r r r r <module> sR
>1 d
OHA YOOOO