U ad\,@sdZddlZddlmZddlmZmZddlmZzddl m Z Wne k r\dZ YnXddd d d d gZ zdd l m Z Wn$e k rGdddeZ YnXGdddeZGdd d ZGdd d eZGdd d eZGdddZe dkreZ dS)z'A multi-producer, multi-consumer queue.N)deque)heappushheappop) monotonic) SimpleQueueEmptyFullQueue PriorityQueue LifoQueuer)rc@seZdZdZdS)rz4Exception raised by Queue.get(block=0)/get_nowait().N__name__ __module__ __qualname____doc__rr/usr/lib/python3.8/queue.pyrsc@seZdZdZdS)rz4Exception raised by Queue.put(block=0)/put_nowait().Nr rrrrrsc@seZdZdZd!ddZddZddZd d Zd d Zd dZ d"ddZ d#ddZ ddZ ddZ ddZddZddZdd ZdS)$r zjCreate a queue object with a given maximum size. If maxsize is <= 0, the queue size is infinite. rcCsN||_||t|_t|j|_t|j|_t|j|_d|_ dSNr) maxsize_init threadingZLockmutexZ Condition not_emptynot_fullall_tasks_doneunfinished_tasksselfrrrr__init__!s  zQueue.__init__c CsH|j8|jd}|dkr4|dkr*td|j||_W5QRXdS)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. rz!task_done() called too many timesN)rr ValueErrorZ notify_all)rZ unfinishedrrr task_done8s  zQueue.task_donec Cs(|j|jr|jqW5QRXdS)aBlocks 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 the item was retrieved and all work on it is complete. When the count of unfinished tasks drops to zero, join() unblocks. N)rrwaitrrrrjoinNs z Queue.joinc Cs&|j|W5QRSQRXdS)9Return the approximate size of the queue (not reliable!).Nr_qsizer#rrrqsize[sz Queue.qsizec Cs(|j| W5QRSQRXdS)aReturn True if the queue is empty, False otherwise (not reliable!). This method is likely to be removed at some point. Use qsize() == 0 as a direct substitute, but be aware that either approach risks a race condition where a queue can grow before the result of empty() or qsize() can be used. To create code that needs to wait for all queued tasks to be completed, the preferred technique is to use the join() method. Nr&r#rrrempty`s z Queue.emptyc Cs<|j,d|jko |knW5QRSQRXdS)aOReturn True if the queue is full, False otherwise (not reliable!). This method is likely to be removed at some point. Use qsize() >= n as a direct substitute, but be aware that either approach risks a race condition where a queue can shrink before the result of full() or qsize() can be used. rN)rrr'r#rrrfullnsz Queue.fullTNc Cs|j|jdkr|s*||jkrtnr|dkrN||jkr|jq2nN|dkr`tdnr#rrrr?/sz_PySimpleQueue.get_nowaitcCst|jdkS)zCReturn True if the queue is empty, False otherwise (not reliable!).rrCrKr#rrrr)7sz_PySimpleQueue.emptycCs t|jS)r%rOr#rrrr(;sz_PySimpleQueue.qsize)TN)TN) r rrrrr5r8r<r?r)r(rrrrrJs  rJ)rr collectionsrheapqrrr-rrKr ImportError__all__r Exceptionrr r r rJrrrrs*   BA