*j' S r SSKrSSKrSSKJr SSKJr SSKJr " S S\5 r " S S
\5 r
" S S \5 r " S
S\R 5 r
" S S\
5 r " S S\
5 rg))Queue
PriorityQueue LifoQueue QueueFull
QueueEmpty
QueueShutDown N) GenericAlias )locks)mixinsc \ rS rSrSrSrg)r z;Raised when Queue.get_nowait() is called on an empty Queue. N__name__
__module__ __qualname____firstlineno____doc____static_attributes__r 5/opt/alt/python313/lib64/python3.13/asyncio/queues.pyr r s Er r c \ rS rSrSrSrg)r zDRaised when the Queue.put_nowait() method is called on a full Queue.r Nr r r r r r s Nr r c \ rS rSrSrSrg)r z)typer id_formatr6 s r __repr__Queue.__repr__O s5 4:&&'tBtHR=$,,.9IKKr c V S[ U 5 R SU R 5 S3$ )NrI rJ rK )rL r rN r6 s r __str__
Queue.__str__R s) 4:&&'q (8::r c SU R < 3n[ U SS 5 ( a US[ U R 5 < 3-
nU R ( a US[ U R 5 S3-
nU R ( a US[ U R 5 S3-
nU R ( a USU R 3-
nU R ( a US-
nU$ ) Nzmaxsize=r2 z _queue=z
_getters[]z
_putters[z tasks=z shutdown) r getattrlistr2 r# lenr$ r% r* )r, results r rN
Queue._formatW s DMM,- 44 ( ( dkk!2 56 6F ==
3t}}#5"6a8 8F ==
3t}}#5"6a8 8F ! ! 6 6 78 8F k !F
r c , [ U R 5 $ )z Number of items in the queue.)rX r2 r6 s r qsize Queue.qsizee s 4;; r c U R $ )z%Number of items allowed in the queue.)r r6 s r r-
Queue.maxsizei s }} r c $ U R ( + $ )z3Return True if the queue is empty, False otherwise.r2 r6 s r empty Queue.emptyn s ;; r c ^ U R S:: a gU R 5 U R : $ )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 r\ r6 s r full
Queue.fullr s( ==A ::<4==0 0r c N # U R 5 ( ar U R ( a [ eU R 5 R 5 nU R
R
U5 UI Sh vN U R 5 ( a Mr U R U5 $ N,! UR 5 U R
R U5 O! [ a Of = fU R 5 ( d0 UR 5 ( d U R U R
5 e = f7f)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.
Raises QueueShutDown if the queue has been shut down.
N)
re r* r _get_loop
create_futurer$ r; cancelremove
ValueError cancelledrF
put_nowait)r, r= putters r put Queue.put} s iikk ##^^%335F MM (
iikk* t$$
MM((0! yy{{6+;+;+=+= %%dmm4s[ A&D%)B .B/B 3D%
D%B D"0C D"
CD"CA D""D%c U R ( a [ eU R 5 ( a [ eU R U5 U =R
S-
sl U R R 5 U R U R 5 g)zPut an item into the queue without blocking.
If no free slot is immediately available, raise QueueFull.
Raises QueueShutDown if the queue has been shut down.
r
N)
r* r re r r> r% r' clearrF r# r< s r rn Queue.put_nowait sa 99;;O $ !# $--(r c v # U R 5 ( a U R ( a U R 5 ( a [ eU R 5 R 5 nU R
R
U5 UI Sh vN U R 5 ( a M U R 5 $ N+! UR 5 U R
R U5 O! [ a Of = fU R 5 ( d0 UR 5 ( d U R U R
5 e = f7f)zRemove and return an item from the queue.
If queue is empty, wait until an item is available.
Raises QueueShutDown if the queue has been shut down and is empty,
or if the queue has been shut down immediately.
N)
rb r* r rh ri r# r; rj rk rl rm rF
get_nowait)r, getters r get Queue.get s jjll TZZ\\##^^%335F MM (
jjll*
MM((0! zz||F,<,<,>,> %%dmm4s[ A;D9>B1 B/B1 D9 D9/B1 1D6C D6
C-*D6,C--A D66D9c U R 5 ( a U R ( a [ e[ eU R 5 nU R U R 5 U$ )zRemove and return an item from the queue.
Return an item if one is immediately available, else raise
QueueEmpty.
Raises QueueShutDown if the queue has been shut down and is empty,
or if the queue has been shut down immediately.
)rb r* r r r7 rF r$ r< s r rv Queue.get_nowait sF ::<< ## yy{ $--( r c U R S:: a [ S5 eU =R S- sl U R S:X a U R R 5 gg)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% rl r' r( r6 s r task_doneQueue.task_done sR ! !Q & @A A !# ! !Q & NN 'r c v # U R S: a# U R R 5 I Sh vN gg N7f)aY 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' waitr6 s r join
Queue.join s3 ! !A %..%%' ' ' & 's .979c SU l U( a U R 5 ( dL U R 5 U R S: a U =R S- sl U R 5 ( d ML U R S:X a U R R 5 U R ( aS U R R 5 nUR 5 ( d UR S5 U R ( a MS U R ( aT U R R 5 nUR 5 ( d UR S5 U R ( a MS gg)a Shut-down the queue, making queue gets and puts raise QueueShutDown.
By default, gets will only raise once the queue is empty. Set
'immediate' to True to make gets raise immediately instead.
All blocked callers of put() and get() will be unblocked.
If 'immediate', the queue is drained and unfinished tasks
is reduced by the number of drained tasks. If unfinished tasks
is reduced to zero, callers of Queue.join are unblocked.
Tr r
N) r* rb r7 r% r' r( r# r5 rB rC r$ )r, immediaterw ro s r shutdownQueue.shutdown s ! jjll ))A-**a/* jjll %%*""$mm]]**,F;;==!!$' mmm mm]]**,F;;==!!$' mmmr )r' r# r* r r$ r2 r% N)r )F) r r r r r r. r) r7 r> rF rO rR classmethodr __class_getitem__rN r\ propertyr- rb re rp rn rx rv r} r r r r r r r r ! s " *%!
L; $L1 1 %>) !>"!(
( (r r c ^ \ rS rSrSrS r\R 4S jr\R 4S jr
Sr g)r i zA subclass of Queue; retrieves entries in priority order (lowest first).
Entries are typically tuples of the form: (priority number, data).
c / U l g r1 ra r+ s r r) PriorityQueue._init! r c * U" U R U5 g r1 ra )r, r= heappushs r r> PriorityQueue._put$ s d#r c & U" U R 5 $ r1 ra )r, heappops r r7 PriorityQueue._get' s t{{##r ra N) r r r r r r) heapqr r> r r7 r r r r r r s(
#(.. $ !== $r r c * \ rS rSrSrS rS rS rSrg)r i+ zEA subclass of Queue that retrieves most recently added entries first.c / U l g r1 ra r+ s r r) LifoQueue._init. r r c : U R R U5 g r1 r: r< s r r> LifoQueue._put1 r@ r c 6 U R R 5 $ r1 )r2 popr6 s r r7 LifoQueue._get4 s {{ r ra N) r r r r r r) r> r7 r r r r r r + s O!!r r )__all__r! r typesr r r Exceptionr r r _LoopBoundMixinr r r r r r r sn
I
w(F " " w(t
$E
$
!
!r