3 \@sdZdddddgZddlZddlZdd lmZdd lmZdd lmZdd lm Z Gd dde Z Gddde Z GdddZ Gddde ZGddde Zejse ZejddS)ZQueuesQueue PriorityQueue LifoQueue QueueFull QueueEmptyN)compat)events)locks) coroutinec@seZdZdZdS)rz]Exception raised when Queue.get_nowait() is called on a Queue object which is empty. N)__name__ __module__ __qualname____doc__rr/usr/lib64/python3.6/queues.pyrsc@seZdZdZdS)rzgException raised when the Queue.put_nowait() method is called on a Queue object which is full. N)r r rrrrrrrsc@seZdZdZd)ddddZddZd d Zd d Zd dZddZ ddZ ddZ ddZ e ddZddZddZeddZdd Zed!d"Zd#d$Zd%d&Zed'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. rN)loopcCsb|dkrtj|_n||_||_tj|_tj|_d|_t j |jd|_ |j j |j |dS)Nr)r)r Zget_event_loop_loop_maxsize collectionsdeque_getters_putters_unfinished_tasksr ZEvent _finishedset_init)selfmaxsizerrrr__init__(s    zQueue.__init__cCstj|_dS)N)rr_queue)rrrrrr:sz Queue._initcCs |jjS)N)r popleft)rrrr_get=sz Queue._getcCs|jj|dS)N)r append)ritemrrr_put@sz Queue._putcCs*x$|r$|j}|js|jdPqWdS)N)r!doneZ set_result)rwaitersZwaiterrrr _wakeup_nextEs  zQueue._wakeup_nextcCsdjt|jt||jS)Nz<{} at {:#x} {}>)formattyper id_format)rrrr__repr__MszQueue.__repr__cCsdjt|j|jS)Nz<{} {}>)r)r*r r,)rrrr__str__Qsz Queue.__str__cCszdj|j}t|ddr,|djt|j7}|jrF|djt|j7}|jr`|djt|j7}|jrv|dj|j7}|S)Nz maxsize={!r}r z _queue={!r}z _getters[{}]z _putters[{}]z tasks={}) r)rgetattrlistr rlenrr)rresultrrrr,Ts  z Queue._formatcCs t|jS)zNumber of items in the queue.)r1r )rrrrqsize`sz Queue.qsizecCs|jS)z%Number of items allowed in the queue.)r)rrrrrdsz Queue.maxsizecCs|j S)z3Return True if the queue is empty, False otherwise.)r )rrrremptyisz Queue.emptycCs |jdkrdS|j|jkSdS)zReturn 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)rr3)rrrrfullms z Queue.fullc cstxh|jrh|jj}|jj|y|EdHWq|j|j r^|j r^|j|jYqXqW|j|S)zPut an item into the queue. Put an item into the queue. If the queue is full, wait until a free slot is available before adding item. This method is a coroutine. N) r5r create_futurerr#cancel cancelledr( put_nowait)rr$Zputterrrrputxs     z Queue.putcCs>|jr t|j||jd7_|jj|j|jdS)zyPut an item into the queue without blocking. If no free slot is immediately available, raise QueueFull. rN)r5rr%rrclearr(r)rr$rrrr9s   zQueue.put_nowaitccsx|jr|jj}|jj|y|EdHWq|jy|jj|Wntk rbYnX|j r|j r|j |jYqXqW|j S)zRemove and return an item from the queue. If queue is empty, wait until an item is available. This method is a coroutine. N) r4rr6rr#r7remove ValueErrorr8r( get_nowait)rgetterrrrgets     z Queue.getcCs$|jr t|j}|j|j|S)zRemove and return an item from the queue. Return an item if one is immediately available, else raise QueueEmpty. )r4rr"r(r)rr$rrrr>s  zQueue.get_nowaitcCs8|jdkrtd|jd8_|jdkr4|jjdS)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)rr=rr)rrrr task_dones   zQueue.task_doneccs|jdkr|jjEdHdS)aBlock 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 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)rrwait)rrrrjoins z Queue.join)r)r r rrrrr"r%r(r-r.r,r3propertyrr4r5r r:r9r@r>rArCrrrrrs&      c@s4eZdZdZddZejfddZejfddZ dS) rzA 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 )rrrrrrszPriorityQueue._initcCs||j|dS)N)r )rr$heappushrrrr%szPriorityQueue._putcCs ||jS)N)r )rheappoprrrr"szPriorityQueue._getN) r r rrrheapqrEr%rFr"rrrrrsc@s(eZdZdZddZddZddZdS) rzEA subclass of Queue that retrieves most recently added entries first.cCs g|_dS)N)r )rrrrrrszLifoQueue._initcCs|jj|dS)N)r r#)rr$rrrr%szLifoQueue._putcCs |jjS)N)r pop)rrrrr"szLifoQueue._getN)r r rrrr%r"rrrrrs JoinableQueue)r__all__rrGrr r Z coroutinesr ExceptionrrrrrZPY35rIr#rrrrs     H