î \á[\;#ã@sûdZddddddgZddlZddlZd d lmZd d lmZd d lmZd d lm Z Gdd„de ƒZ Gdd„de ƒZ Gdd„dƒZ Gdd„de ƒZGdd„de ƒZGdd„de ƒZdS)ZQueuesÚQueueÚ PriorityQueueÚ LifoQueueÚ JoinableQueueÚ QueueFullÚ QueueEmptyéNé)Úevents)Úfutures)Úlocks)Ú coroutinec@seZdZdZdS)rz4Exception raised by Queue.get(block=0)/get_nowait().N)Ú__name__Ú __module__Ú __qualname__Ú__doc__©rrú$/usr/lib/python3.4/asyncio/queues.pyrs c@seZdZdZdS)rz4Exception raised by Queue.put(block=0)/put_nowait().N)r rrrrrrrrs c@sýeZdZdZddddd„Zdd„Zd d „Zd d „Zd d„Zdd„Z dd„Z dd„Z dd„Z dd„Z edd„ƒZdd„Zdd„Zedd „ƒZd!d"„Zed#d$„ƒZd%d&„ZdS)'ra A queue, useful for coordinating producer and consumer coroutines. If maxsize is less than or equal to zero, the queue size is infinite. If it is an integer greater than 0, then "yield from put()" will block when the queue reaches maxsize, until an item is removed by get(). Unlike the standard library Queue, you can reliably know this Queue's size with qsize(), since your single-threaded asyncio application won't be interrupted between calling qsize() and doing an operation on the Queue. rÚloopNcCs_|dkrtjƒ|_n ||_||_tjƒ|_tjƒ|_|j|ƒdS)N) r Zget_event_loopÚ_loopÚ_maxsizeÚ collectionsÚdequeÚ_gettersÚ_puttersÚ_init)ÚselfÚmaxsizerrrrÚ__init__%s   zQueue.__init__cCstjƒ|_dS)N)rrÚ_queue)rrrrrr2sz Queue._initcCs |jjƒS)N)rÚpopleft)rrrrÚ_get5sz Queue._getcCs|jj|ƒdS)N)rÚappend)rÚitemrrrÚ_put8sz Queue._putcCs(djt|ƒjt|ƒ|jƒƒS)Nz<{} at {:#x} {}>)ÚformatÚtyper ÚidÚ_format)rrrrÚ__repr__;szQueue.__repr__cCsdjt|ƒj|jƒƒS)Nz<{} {}>)r$r%r r')rrrrÚ__str__?sz Queue.__str__cCs—dj|jƒ}t|ddƒrC|djt|jƒƒ7}n|jrk|djt|jƒƒ7}n|jr“|djt|jƒƒ7}n|S)Nz maxsize={!r}rz _queue={!r}z _getters[{}]z _putters[{}])r$rÚgetattrÚlistrrÚlenr)rÚresultrrrr'Bs  z Queue._formatcCs4x-|jr/|jdjƒr/|jjƒqWdS)Nr)rÚdoner)rrrrÚ_consume_done_gettersLszQueue._consume_done_getterscCs8x1|jr3|jddjƒr3|jjƒqWdS)Nrr)rr.r)rrrrÚ_consume_done_puttersQs#zQueue._consume_done_putterscCs t|jƒS)zNumber of items in the queue.)r,r)rrrrÚqsizeVsz Queue.qsizecCs|jS)z%Number of items allowed in the queue.)r)rrrrrZsz Queue.maxsizecCs|j S)z3Return True if the queue is empty, False otherwise.)r)rrrrÚempty_sz Queue.emptycCs*|jdkrdS|jƒ|jkSdS)zªReturn True if there are maxsize items in the queue. Note: if the Queue was initialized with maxsize=0 (the default), then full() is never True. rFN)rr1)rrrrÚfullcsz Queue.fullccsÇ|jƒ|jr[|j s)tdƒ‚|jjƒ}|j|ƒ|j|jƒƒnh|jdkr¶|j|j ƒkr¶t j d|j ƒ}|j j||fƒ|DdHn |j|ƒdS)z†Put an item into the queue. If you yield from put(), wait until a free slot is available before adding item. z)queue non-empty, why are getters waiting?rrN)r/rrÚAssertionErrorrr#Ú set_resultr rr1r ÚFuturerrr!)rr"ÚgetterÚwaiterrrrÚputns     $ z Queue.putcCs™|jƒ|jr[|j s)tdƒ‚|jjƒ}|j|ƒ|j|jƒƒn:|jdkrˆ|j|j ƒkrˆt ‚n |j|ƒdS)zyPut an item into the queue without blocking. If no free slot is immediately available, raise QueueFull. z)queue non-empty, why are getters waiting?rN) r/rrr4rr#r5r rr1r)rr"r7rrrÚ put_nowaitŠs     $ zQueue.put_nowaitccsµ|jƒ|jrm|jƒs+tdƒ‚|jjƒ\}}|j|ƒ|jj|jdƒ|j ƒS|j ƒrƒ|j ƒSt j d|jƒ}|j j|ƒ|DdHSdS)ztRemove and return an item from the queue. If you yield from get(), wait until a item is available. z(queue not full, why are putters waiting?Nr)r0rr3r4rr#rZ call_soonZ_set_result_unless_cancelledr r1r r6rr!)rr"Úputterr8rrrÚget s      z Queue.getcCs„|jƒ|jrd|jƒs+tdƒ‚|jjƒ\}}|j|ƒ|jdƒ|jƒS|jƒrz|jƒSt ‚dS)z‚Remove and return an item from the queue. Return an item if one is immediately available, else raise QueueEmpty. z(queue not full, why are putters waiting?N) r0rr3r4rr#r5r r1r)rr"r;rrrÚ get_nowait¼s       zQueue.get_nowait)r rrrrrr r#r(r)r'r/r0r1Úpropertyrr2r3r r9r:r<r=rrrrrs$            c@sFeZdZdZdd„Zejdd„Zejdd„Z dS) rz•A subclass of Queue; retrieves entries in priority order (lowest first). Entries are typically tuples of the form: (priority number, data). cCs g|_dS)N)r)rrrrrr×szPriorityQueue._initcCs||j|ƒdS)N)r)rr"Úheappushrrrr#ÚszPriorityQueue._putcCs ||jƒS)N)r)rÚheappoprrrr ÝszPriorityQueue._getN) r rrrrÚheapqr?r#r@r rrrrrÑs  c@s:eZdZdZdd„Zdd„Zdd„ZdS) rzEA subclass of Queue that retrieves most recently added entries first.cCs g|_dS)N)r)rrrrrräszLifoQueue._initcCs|jj|ƒdS)N)rr!)rr"rrrr#çszLifoQueue._putcCs |jjƒS)N)rÚpop)rrrrr êszLifoQueue._getN)r rrrrr#r rrrrrás   csmeZdZdZddd‡fdd†Zdd„Z‡fd d †Zd d „Zed d„ƒZ ‡S)rz8A subclass of Queue with task_done() and join() methods.rrNcsKtƒjd|d|ƒd|_tjd|jƒ|_|jjƒdS)Nrrr)ÚsuperrÚ_unfinished_tasksr ZEventrÚ _finishedÚset)rrr)Ú __class__rrrñs zJoinableQueue.__init__cCs5tj|ƒ}|jr1|dj|jƒ7}n|S)Nz tasks={})rr'rDr$)rr-rrrr'÷s zJoinableQueue._formatcs0tƒj|ƒ|jd7_|jjƒdS)Nr)rCr#rDrEÚclear)rr")rGrrr#ýszJoinableQueue._putcCsP|jdkrtdƒ‚n|jd8_|jdkrL|jjƒndS)a$Indicate that a formerly enqueued task is complete. Used by queue consumers. 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 ValueError if called more times than there were items placed in the queue. rz!task_done() called too many timesrN)rDÚ ValueErrorrErF)rrrrÚ task_dones zJoinableQueue.task_doneccs(|jdkr$|jjƒDdHndS)a†Block until all items in the queue have been gotten and processed. The count of unfinished tasks goes up whenever an item is added to the queue. The count goes down whenever a consumer thread calls task_done() to indicate that the item was retrieved and all work on it is complete. When the count of unfinished tasks drops to zero, join() unblocks. rN)rDrEÚwait)rrrrÚjoins zJoinableQueue.join) r rrrrr'r#rJr rLrr)rGrrîs   )rÚ__all__rrAÚr r r Ztasksr Ú ExceptionrrrrrrrrrrÚs    ¸