i dZddlmZddlmZddlmZddlmZgdZ ej egd\Z Z Z dd ZGd d eZGd d eZGddeZdS)z A small selection of primitives that always work with native threads. This has very limited utility and is targeted only for the use of gevent's threadpool. )absolute_import)deque)monkey)thread_mod_name)LockQueue EmptyTimeout)start_new_thread allocate_lock get_identctt|jtd<||S)Nacquire_with_timeout)timeout)typeacquireglobals)lockrs d|jt|jfzS)Nz)rlenrr"s r__repr__z_Condition.__repr__Cs$ C 4F4F'GGGrr cd}||j||j |||}|jn#|jwxYw|s|d}|s/|j||n||S)NTF)rrappendrreleaseremove)r wait_lockr_wait_for_notifygevent_threadpool_worker_idlenotifieds rwaitz_Condition.waitFs)-%  Y'''  !(' 7;;H J   DJ    0 !((//H M  + + +             s A11B c |j}|dS#t$rYdSwxYwr)rpopr- IndexError)rwaiters r notify_onez_Condition.notify_onemsV ]&&((F NN         DD s 1 ??N) __name__ __module__ __qualname__ __slots__rr!r$r*rr3r8rrrr's I &&&---HHH');O%%%%N     rrceZdZdZdS)r zERaised from :meth:`Queue.get` if no item is available in the timeout.N)r9r:r;__doc__r=rrr r zsOOOOrr cReZdZdZdZdZdZefdZdZ dZ dZ dd Z d Z d Zd S)rzH Create a queue object. The queue is always infinite size. _queue_mutex _not_emptyunfinished_tasksct|_t|_t |j|_d|_dS)Nr)rrBrrCrrDrEr"s rrzQueue.__init__s;gg ff %T[11 !rc|j5|jdz }|dkr|dkrtd|jz||_ddddS#1swxYwYdS)a.Indicate that a formerly enqueued task is complete. Used by Queue consumer threads. For each get() used to fetch a task, a subsequent call to task_done() tells the queue that the processing on the task is complete. If a join() is currently blocking, it will resume when all items have been processed (meaning that a task_done() call was received for every item that had been put() into the queue). Raises a ValueError if called more times than there were items placed in the queue. rz5task_done() called too many times; %s remaining tasksN)rCrE ValueError)r unfinisheds r task_donezQueue.task_dones[ / /.2JQ>>$O 1 %/D ! / / / / / / / / / / / / / / / / / /s5A  AAc"||jS)z9Return the approximate size of the queue (not reliable!).)rB)rr)s rqsizez Queue.qsizess4;rc,| S)zCReturn True if the queue is empty, False otherwise (not reliable!).)rMr"s remptyz Queue.emptys::<<rcdS)zBReturn True if the queue is full, False otherwise (not reliable!).Fr=r"s rfullz Queue.fullsurc|j5|j||xjdz c_|jddddS#1swxYwYdS)z$Put an item into the queue. rHN)rCrBr,rErDr8)ritems rputz Queue.puts[ ) ) K  t $ $ $  ! !Q & ! ! O & & ( ( ( ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) )sAAA Ar c|j5|js2|j||}|s|jst|j2|j}|cdddS#1swxYwYdS)a" Remove and return an item from the queue. If *timeout* is given, and is not -1, then we will attempt to wait for only that many seconds to get an item. If those seconds elapse and no item has become available, raises :class:`EmptyTimeout`. N)rCrBrDr3r popleft)rcookierr2rSs rgetz Queue.gets[  k ' ?//@@ ' '&&k ';&&((D                  sAA))A-0A-ctS)z Create and return the *cookie* to pass to `get()`. Each thread that will use `get` needs a distinct cookie. )rr"s rallocate_cookiezQueue.allocate_cookies vv rc>d|_d|_d|_d|_dS)z Call to destroy this object. Use this when it's not possible to safely drain the queue, e.g., after a fork when the locks are in an uncertain state. NrAr"s rkillz Queue.kills'   $rNr )r9r:r;r?r<rrKr)rMrOrQrTrXrZr\r=rrrr~s GI " " "///2       ))). % % % % %rrNr])r? __future__r collectionsrgeventrgevent._compatr__all__ get_originalr rget_thread_identrobjectr Exceptionr rr=rrrgsU '&&&&&******   -@F,?RRR--)$()))) QQQQQQQQfPPPPP9PPPl%l%l%l%l%Fl%l%l%l%l%r