a
i, @ s d Z ddlZddlZddlmZ ddlmZmZ ddlm Z zddl
m Z W n e yb dZ Y n0 g dZ
zddl
mZ W n" e y G d d
d
eZY n0 G d d d eZG d
d dZG dd deZG dd deZG dd dZe du reZ dS )z'A multi-producer, multi-consumer queue. N)deque)heappushheappop) monotonic) SimpleQueue)EmptyFullQueue
PriorityQueue LifoQueuer )r c @ s e Zd ZdZdS )r z4Exception raised by Queue.get(block=0)/get_nowait().N__name__
__module__ __qualname____doc__ r r /usr/lib64/python3.9/queue.pyr s r c @ s e Zd ZdZdS )r z4Exception raised by Queue.put(block=0)/put_nowait().Nr r r r r r s r c @ s e Zd ZdZd!ddZdd Zdd Zd d
Zd d Zd
d Z d"ddZ
d#ddZ dd Z dd Z
dd Zdd Zd d Zd d ZeejZdS )$r zjCreate a queue object with a given maximum size.
If maxsize is <= 0, the queue size is infinite.
r c C sN || _ | | t | _t| j| _t| j| _t| j| _d| _ d S Nr )
maxsize_init threadingLockmutex Condition not_emptynot_fullall_tasks_doneunfinished_tasksselfr r r r __init__" s
zQueue.__init__c C s\ | j B | jd }|dkr4|dk r*td| j || _W d n1 sN0 Y dS )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.
r z!task_done() called too many timesN)r r
ValueError
notify_all)r
unfinishedr r r task_done9 s
zQueue.task_donec C s< | j " | jr| j qW d n1 s.0 Y dS )a Blocks 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)r r waitr r r r joinO s z
Queue.joinc C s2 | j | W d S 1 s$0 Y dS )9Return the approximate size of the queue (not reliable!).Nr _qsizer' r r r qsize\ s z Queue.qsizec C s4 | j | W d S 1 s&0 Y dS )a Return 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' r r r emptya s z Queue.emptyc C sH | j . d| j k o | kn W d S 1 s:0 Y dS )aO Return 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.
r N)r r r+ r' r r r fullo s z
Queue.fullTNc C s | j | jdkr|s*| | jkrtnr|du rN| | jkr| j q2nN|dk r`tdn