grthtrhthjhtyjytjytkergtrhtrjytjerhrfh4:24 29/09/2026  f"@sdZyddlZWnek r6ddlZYnXddlmZddlmZmZyddl m Z Wn"ek rddl m Z YnXddd d d gZ Gd dde Z Gd dde ZGdd d ZGdd d eZGdd d eZdS)z'A multi-producer, multi-consumer queue.N)deque)heappushheappop) monotonic)timeEmptyFullQueue PriorityQueue LifoQueuec@seZdZdZdS)rz4Exception raised by Queue.get(block=0)/get_nowait().N)__name__ __module__ __qualname____doc__rr*/opt/alt/python34/lib64/python3.4/queue.pyrs c@seZdZdZdS)rz4Exception raised by Queue.put(block=0)/put_nowait().N)r r rrrrrrrs c@seZdZdZdddZddZddZd d Zd d Zd dZ ddddZ ddddZ ddZ ddZ ddZddZddZdd ZdS)!r zjCreate a queue object with a given maximum size. If maxsize is <= 0, the queue size is infinite. rcCsq||_|j|tj|_tj|j|_tj|j|_tj|j|_d|_ dS)Nr) maxsize_init threadingZLockmutexZ Condition not_emptynot_fullall_tasks_doneunfinished_tasks)selfrrrr__init__s  zQueue.__init__c Csa|jR|jd}|dkrN|dkr>tdn|jjn||_WdQXdS)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_done5s    zQueue.task_donecCs1|j"x|jr&|jjq WWdQXdS)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)rrwait)rrrrjoinKs  z Queue.joincCs|j|jSWdQXdS)z9Return the approximate size of the queue (not reliable!).N)r_qsize)rrrrqsizeXs z Queue.qsizecCs|j|j SWdQXdS)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. N)rr!)rrrrempty]s z Queue.emptyc Cs5|j&d|jko(|jkSSWdQXdS)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!)rrrrfullks z Queue.fullTNc Cs$|j|jdkr|s@|j|jkrtqq|dkrxx|j|jkrt|jjqOWq|dkrtdqt|}xN|j|jkr|t}|dkrtn|jj|qWn|j||jd7_|j j WdQXdS)aPut an item into the queue. If optional args 'block' is true and 'timeout' is None (the default), block if necessary until a free slot is available. If 'timeout' is a non-negative number, it blocks at most 'timeout' seconds and raises the Full exception if no free slot was available within that time. Otherwise ('block' is false), put an item on the queue if a free slot is immediately available, else raise the Full exception ('timeout' is ignored in that case). rNz''timeout' must be a non-negative numbergr) rrr!rrrr_putrrnotify)ritemblocktimeoutendtime remainingrrrputvs&         z Queue.putc Cs|j|s(|jstqn|dkrWx|jsS|jjq7Wnm|dkrrtdnRt|}xB|js|t}|dkrtn|jj|qW|j}|jj|SWdQXdS)aRemove and return an item from the queue. If optional args 'block' is true and 'timeout' is None (the default), block if necessary until an item is available. If 'timeout' is a non-negative number, it blocks at most 'timeout' seconds and raises the Empty exception if no item was available within that time. Otherwise ('block' is false), return an item if one is immediately available, else raise the Empty exception ('timeout' is ignored in that case). Nrz''timeout' must be a non-negative numberg) rr!rrrr_getrr&)rr(r)r*r+r'rrrgets$           z Queue.getcCs|j|ddS)zPut an item into the queue without blocking. Only enqueue the item if a free slot is immediately available. Otherwise raise the Full exception. r(F)r,)rr'rrr put_nowaitszQueue.put_nowaitcCs|jddS)zRemove and return an item from the queue without blocking. Only get an item if one is immediately available. Otherwise raise the Empty exception. r(F)r.)rrrr get_nowaitszQueue.get_nowaitcCst|_dS)N)rqueue)rrrrrrsz Queue._initcCs t|jS)N)lenr1)rrrrr!sz Queue._qsizecCs|jj|dS)N)r1append)rr'rrrr%sz Queue._putcCs |jjS)N)r1popleft)rrrrr-sz Queue._get)r r rrrrr r"r#r$r,r.r/r0rr!r%r-rrrrr s          c@sFeZdZdZddZddZddZdd Zd S) r zVariant of Queue that retrieves open entries in priority order (lowest first). Entries are typically tuples of the form: (priority number, data). cCs g|_dS)N)r1)rrrrrrszPriorityQueue._initcCs t|jS)N)r2r1)rrrrr!szPriorityQueue._qsizecCst|j|dS)N)rr1)rr'rrrr%szPriorityQueue._putcCs t|jS)N)rr1)rrrrr-szPriorityQueue._getN)r r rrrr!r%r-rrrrr s    c@sFeZdZdZddZddZddZdd Zd S) r zBVariant of Queue that retrieves most recently added entries first.cCs g|_dS)N)r1)rrrrrrszLifoQueue._initcCs t|jS)N)r2r1)rrrrr!szLifoQueue._qsizecCs|jj|dS)N)r1r3)rr'rrrr%szLifoQueue._putcCs |jjS)N)r1pop)rrrrr-szLifoQueue._getN)r r rrrr!r%r-rrrrr s    )rr ImportErrorZdummy_threading collectionsrheapqrrrr__all__ Exceptionrrr r r rrrrs