python (3.11.7)
e& d Z ddlZddlZddlmZ ddlmZ ddlmZ G d de Z G d d
e Z
G d d ej Z G d
de Z
G d de ZdS ))Queue
PriorityQueue LifoQueue QueueFull
QueueEmpty N) GenericAlias )locks)mixinsc e Zd ZdZdS )r z;Raised when Queue.get_nowait() is called on an empty Queue.N__name__
__module__ __qualname____doc__ B/BuggyBox/python/3.11.7/bootstrap/lib/python3.11/asyncio/queues.pyr r s EEDr r c e Zd ZdZdS )r zDRaised when the Queue.put_nowait() method is called on a full Queue.Nr
r r r r r s NNDr r c e Zd ZdZddZd Zd Zd Zd Zd Z d Z
e e Z
d
Zd Zed Zd
Zd Zd Zd Zd Zd Zd Zd ZdS )r a 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 "await 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.
r c || _ t j | _ t j | _ d| _ t
j | _ | j |
| d S )Nr ) _maxsize collectionsdeque_getters_putters_unfinished_tasksr
Event _finishedset_initselfmaxsizes r __init__zQueue.__init__! sl
$)++
#)++
!"
7r c 6 t j | _ d S N)r r _queuer" s r r! z Queue._init/ s !')) r c 4 | j S r' )r( popleftr# s r _getz
Queue._get2 s {""$$$r c : | j | d S r' r( appendr# items r _putz
Queue._put5 4 r c |rC| }| s| d d S |Ad S d S r' )r* done
set_result)r# waiterswaiters r _wakeup_nextzQueue._wakeup_next: s` __&&F;;==
!!$''' r c ~ dt | j dt | dd| dS )N<z at z#x >)typer id_formatr+ s r __repr__zQueue.__repr__B s= K4::&KKBtHHKKK$,,..KKKKr c \ dt | j d| dS )Nr; r< r= )r> r r@ r+ s r __str__z
Queue.__str__E s, :4::&:: ::::r c d| j }t | dd r|dt | j z
}| j r|dt | j dz
}| j r|dt | j dz
}| j r
|d| j z
}|S )Nzmaxsize=r( z _queue=z
_getters[]z
_putters[z tasks=)r getattrlistr( r lenr r )r# results r r@ z
Queue._formatJ s -DM-- 44 ( ( 7 6dk!2!266 6F = 9 83t}#5#5888 8F = 9 83t}#5#5888 8F ! 9 8 688 8F
r c * t | j S )z Number of items in the queue.)rH r( r+ s r qsizez Queue.qsizeV s 4; r c | j S )z%Number of items allowed in the queue.)r r+ s r r$ z
Queue.maxsizeZ s } r c | j S )z3Return True if the queue is empty, False otherwise.r( r+ s r emptyz Queue.empty_ s ; r c V | j dk rdS | | j k S )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.
r F)r rK r+ s r fullz
Queue.fullc s+ =A 5::<<4=0 0r c $ K | r| }| j | | d{V n# | | j | n# t $ r Y nw xY w| s.| s| | j xY w| |
| 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.
N) rQ _get_loop
create_futurer r/ cancelremove
ValueError cancelledr9
put_nowait)r# r1 putters r putz Queue.putn s iikk ^^%%3355F M ( ( (
M((0000! D yy{{ 56+;+;+=+= 5 %%dm444% iikk & t$$$1 A! !C&8BC&
B C& B AC&c | rt | | | xj dz
c_ | j | | j dS )zyPut an item into the queue without blocking.
If no free slot is immediately available, raise QueueFull.
r N)rQ r r2 r r clearr9 r r0 s r rY zQueue.put_nowait sl
99;; O $ !# $-(((((r c " K | r| }| j | | d{V n# | | j | n# t $ r Y nw xY w| s.| s| | j xY w| |
S )zoRemove and return an item from the queue.
If queue is empty, wait until an item is available.
N) rO rS rT r r/ rU rV rW rX r9
get_nowait)r# getters r getz Queue.get s
jjll ^^%%3355F M ( ( (
M((0000! D zz|| 5F,<,<,>,> 5 %%dm444% jjll & r\ c | rt | }| | j |S )zRemove and return an item from the queue.
Return an item if one is immediately available, else raise QueueEmpty.
)rO r r, r9 r r0 s r r` zQueue.get_nowait sB
::<< yy{{ $-((( r c | j dk rt d | xj dz c_ | j dk r| j dS dS )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.
r z!task_done() called too many timesr N)r rW r r r+ s r task_donezQueue.task_done se !Q & & @AA A !# !Q & & N ' &r c b K | j dk r!| j d{V dS dS )a Block 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.
r N)r r waitr+ s r joinz
Queue.join sJ !A % %.%%'' ' ' ' ' ' ' ' ' ' & %r N)r )r r r r r% r! r, r2 r9 rA rC classmethodr __class_getitem__r@ rK propertyr$ rO rQ r[ rY rb r` re rh r r r r r sR
* * *% % %! ! !
L L L; ; ; $ L11
X 1 1 1% % %6
)
)
)! ! !4 ! ! !( ( ( ( ( (r r c @ e Zd ZdZd Zej fdZej fdZ dS )r zA subclass of Queue; retrieves entries in priority order (lowest first).
Entries are typically tuples of the form: (priority number, data).
c g | _ d S r' rN r" s r r! zPriorityQueue._init
r c ( || j | d S r' rN )r# r1 heappushs r r2 zPriorityQueue._put s d#####r c " || j S r' rN )r# heappops r r, zPriorityQueue._get s wt{###r N)
r r r r r! heapqrp r2 rr r, r r r r r sc
#(. $ $ $ $ != $ $ $ $ $ $r r c $ e Zd ZdZd Zd Zd ZdS )r zEA subclass of Queue that retrieves most recently added entries first.c g | _ d S r' rN r" s r r! zLifoQueue._init rn r c : | j | d S r' r. r0 s r r2 zLifoQueue._put r3 r c 4 | j S r' )r( popr+ s r r, zLifoQueue._get s { r N)r r r r r! r2 r, r r r r r sG OO ! ! !! ! ! ! !r r )__all__r rs typesr r
r Exceptionr r _LoopBoundMixinr r r r r r <module>r~ s=
L
B( B( B( B( B(F " B( B( B(J
$
$
$
$
$E
$
$
$
!
!
!
!
!
!
!
!
!
!r 
Browse
Usage
Versions