Current path: lib64/python3.6/__pycache__/
β¬οΈ Go up: /lib64/python3.6
3
\L" οΏ½
@ sοΏ½ d Z y ddlZW n ek
r, ddlZY nX ddlmZ ddlmZmZ ddl m
Z dddd d
gZ G d dοΏ½ de οΏ½Z
G d dοΏ½ de οΏ½ZG d
dοΏ½ dοΏ½ZG dd οΏ½ d eοΏ½ZG dd
οΏ½ d
eοΏ½ZdS )z'A multi-producer, multi-consumer queue.οΏ½ N)οΏ½deque)οΏ½heappushοΏ½heappop)οΏ½ monotonicοΏ½EmptyοΏ½FullοΏ½QueueοΏ½
PriorityQueueοΏ½ LifoQueuec @ s e Zd ZdZdS )r z4Exception raised by Queue.get(block=0)/get_nowait().N)οΏ½__name__οΏ½
__module__οΏ½ __qualname__οΏ½__doc__οΏ½ r r οΏ½ /usr/lib64/python3.6/queue.pyr
s c @ s e Zd ZdZdS )r z4Exception raised by Queue.put(block=0)/put_nowait().N)r r r
r r r r r r s c @ sοΏ½ e Zd ZdZd!ddοΏ½ZddοΏ½ ZddοΏ½ Zd d
οΏ½ Zd d οΏ½ Zd
dοΏ½ Z d"ddοΏ½Z
d#ddοΏ½Z ddοΏ½ Z ddοΏ½ Z
ddοΏ½ Zdd οΏ½ Zd d οΏ½ Zd d οΏ½ ZdS )$r zjCreate a queue object with a given maximum size.
If maxsize is <= 0, the queue size is infinite.
r c C sN || _ | j|οΏ½ tjοΏ½ | _tj| jοΏ½| _tj| jοΏ½| _tj| jοΏ½| _d| _ d S )Nr )
οΏ½maxsizeοΏ½_initοΏ½ threadingZLockοΏ½mutexZ ConditionοΏ½ not_emptyοΏ½not_fullοΏ½all_tasks_doneοΏ½unfinished_tasks)οΏ½selfr r r r οΏ½__init__ s
zQueue.__init__c C sH | j οΏ½8 | jd }|dkr4|dk r*tdοΏ½οΏ½| j jοΏ½ || _W dQ R X 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 οΏ½
ValueErrorZ
notify_all)r Z
unfinishedr r r οΏ½ task_done2 s
zQueue.task_donec C s, | j οΏ½ x| jr | j jοΏ½ q
W W dQ R X 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 οΏ½wait)r r r r οΏ½joinH s z
Queue.joinc C s | j οΏ½
| jοΏ½ S Q R X dS )z9Return the approximate size of the queue (not reliable!).N)r οΏ½_qsize)r r r r οΏ½qsizeU s z Queue.qsizec C s | j οΏ½ | jοΏ½ S Q R X 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.
N)r r )r r r r οΏ½emptyZ s z Queue.emptyc
C s0 | j οΏ½ d| j k o | jοΏ½ kS S Q R X 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 οΏ½fullh s z
Queue.fullTNc
C sοΏ½ | j οΏ½οΏ½ | jdkrοΏ½|s*| jοΏ½ | jkrοΏ½tοΏ½nz|dkrRxp| jοΏ½ | jkrN| j jοΏ½ q4W nR|dk rdtdοΏ½οΏ½n@tοΏ½ | }x4| jοΏ½ | jkrοΏ½|tοΏ½ }|dkrοΏ½tοΏ½| j j|οΏ½ qpW | j|οΏ½ | jd7 _| j j
οΏ½ W dQ R X dS )a Put 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).
r Nz''timeout' must be a non-negative numberg r ) r r r r r r οΏ½timeοΏ½_putr r οΏ½notify)r οΏ½itemοΏ½blockοΏ½timeoutοΏ½endtimeοΏ½ remainingr r r οΏ½puts s&
z Queue.putc C sοΏ½ | j οΏ½οΏ½ |s| jοΏ½ sοΏ½tοΏ½nn|dkr<xd| jοΏ½ s8| j jοΏ½ q$W nL|dk rNtdοΏ½οΏ½n:tοΏ½ | }x.| jοΏ½ sοΏ½|tοΏ½ }|dkrxtοΏ½| j j|οΏ½ qZW | jοΏ½ }| jjοΏ½ |S Q R X dS )a Remove 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).
Nr z''timeout' must be a non-negative numberg ) r r r r r r$ οΏ½_getr r& )r r( r) r* r+ r' r r r οΏ½getοΏ½ s$
z Queue.getc C s | j |ddοΏ½S )zοΏ½Put an item into the queue without blocking.
Only enqueue the item if a free slot is immediately available.
Otherwise raise the Full exception.
F)r( )r, )r r' r r r οΏ½
put_nowaitοΏ½ s zQueue.put_nowaitc C s | j ddοΏ½S )zοΏ½Remove and return an item from the queue without blocking.
Only get an item if one is immediately available. Otherwise
raise the Empty exception.
F)r( )r. )r r r r οΏ½
get_nowaitοΏ½ s zQueue.get_nowaitc C s t οΏ½ | _d S )N)r οΏ½queue)r r r r r r οΏ½ s z Queue._initc C s
t | jοΏ½S )N)οΏ½lenr1 )r r r r r οΏ½ s z Queue._qsizec C s | j j|οΏ½ d S )N)r1 οΏ½append)r r' r r r r% οΏ½ s z
Queue._putc C s
| j jοΏ½ S )N)r1 οΏ½popleft)r r r r r- οΏ½ s z
Queue._get)r )TN)TN)r r r
r r r r r! r" r# r, r. r/ r0 r r r% r- r r r r r s
c @ s0 e Zd ZdZddοΏ½ ZddοΏ½ ZddοΏ½ Zdd οΏ½ Zd
S ) r zοΏ½Variant of Queue that retrieves open entries in priority order (lowest first).
Entries are typically tuples of the form: (priority number, data).
c C s
g | _ d S )N)r1 )r r r r r r οΏ½ s zPriorityQueue._initc C s
t | jοΏ½S )N)r2 r1 )r r r r r οΏ½ s zPriorityQueue._qsizec C s t | j|οΏ½ d S )N)r r1 )r r' r r r r% οΏ½ s zPriorityQueue._putc C s
t | jοΏ½S )N)r r1 )r r r r r- οΏ½ s zPriorityQueue._getN)r r r
r r r r% r- r r r r r οΏ½ s
c @ s0 e Zd ZdZddοΏ½ ZddοΏ½ ZddοΏ½ Zdd οΏ½ Zd
S ) r
zBVariant of Queue that retrieves most recently added entries first.c C s
g | _ d S )N)r1 )r r r r r r οΏ½ s zLifoQueue._initc C s
t | jοΏ½S )N)r2 r1 )r r r r r οΏ½ s zLifoQueue._qsizec C s | j j|οΏ½ d S )N)r1 r3 )r r' r r r r% οΏ½ s zLifoQueue._putc C s
| j jοΏ½ S )N)r1 οΏ½pop)r r r r r- οΏ½ s zLifoQueue._getN)r r r
r r r r% r- r r r r r
οΏ½ s
)r r οΏ½ ImportErrorZdummy_threadingοΏ½ collectionsr οΏ½heapqr r r$ r οΏ½__all__οΏ½ Exceptionr r r r r
r r r r οΏ½<module> s B