F\h'SrSSKrSSKrSSKJr SSKJr SSKJr "SS\5r "S S \5r "S S \5r "S S\R5r "SS\ 5r"SS\ 5rg))Queue PriorityQueue LifoQueue QueueFull QueueEmpty QueueShutDownN) GenericAlias)locks)mixinsc\rSrSrSrSrg)rz;Raised when Queue.get_nowait() is called on an empty Queue.N__name__ __module__ __qualname____firstlineno____doc____static_attributes__r%/usr/lib/python3.13/asyncio/queues.pyrrsErrc\rSrSrSrSrg)rzDRaised when the Queue.put_nowait() method is called on a full Queue.rNrrrrrrsNrrc\rSrSrSrSrg)rz)typerid_formatr6s r__repr__Queue.__repr__Os54:&&'tBtHR=$,,.9IKKrcVS[U5RSUR5S3$)NrIrJrK)rLrrNr6s r__str__ Queue.__str__Rs)4:&&'q(8::rcSUR<3n[USS5(aUS[UR5<3- nUR(aUS[ UR5S3- nUR (aUS[ UR 5S3- nUR(aUSUR3- nUR(aUS- nU$) Nzmaxsize=r2z _queue=z _getters[]z _putters[z tasks=z shutdown) r getattrlistr2r#lenr$r%r*)r,results rrN Queue._formatWsDMM,- 44 ( ( dkk!2 56 6F ==  3t}}#5"6a8 8F ==  3t}}#5"6a8 8F  ! !  6 678 8F    k !F rc,[UR5$)zNumber of items in the queue.)rXr2r6s rqsize Queue.qsizees4;;rcUR$)z%Number of items allowed in the queue.)r r6s rr- Queue.maxsizeis}}rc$UR(+$)z3Return True if the queue is empty, False otherwise.r2r6s rempty Queue.emptyns;;rc^URS::agUR5UR:$)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. rF)r r\r6s rfull Queue.fullrs( ==A ::<4==0 0rcN# UR5(arUR(a[eUR5R 5nUR R U5 UIShvN UR5(aMrURU5$N,! UR5 UR RU5 O![a Of=fUR5(d0UR5(dURUR 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) rer*r _get_loop create_futurer$r;cancelremove ValueError cancelledrF put_nowait)r,r=putters rput Queue.put}siikk  ##^^%335F MM  (  iikk*t$$  MM((0!yy{{6+;+;+=+=%%dmm4s[A&D%)B.B/B3D% D%BD"0C  D" CD"CA D""D%cUR(a[eUR5(a[eUR U5 U=R S- slUR R5 URUR5 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*rrerr>r%r'clearrFr#r<s rrnQueue.put_nowaitsa     99;;O $ !#  $--(rcv# UR5(aUR(aUR5(a[eUR5R 5nUR R U5 UIShvN UR5(aMUR5$N+! UR5 UR RU5 O![a Of=fUR5(d0UR5(dURUR 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) rbr*rrhrir#r;rjrkrlrmrF get_nowait)r,getters rget Queue.getsjjll  TZZ\\##^^%335F MM  (  jjll*    MM((0!zz||F,<,<,>,>%%dmm4s[A;D9>B1B/B1D9D9/B11D6C D6 C-*D6,C--A D66D9cUR5(aUR(a[e[eUR 5nUR UR 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. )rbr*rrr7rFr$r<s rrvQueue.get_nowaitsF ::<<  ## yy{ $--( rcURS::a [S5eU=RS-slURS:XaURR5 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). shutdown(immediate=True) calls task_done() for each remaining item in the queue. Raises ValueError if called more times than there were items placed in the queue. rz!task_done() called too many timesr N)r%rlr'r(r6s r task_doneQueue.task_donesR"  ! !Q &@A A !#  ! !Q & NN    'rcv# URS:a#URR5IShvN ggN7f)aWBlock 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. rN)r%r'waitr6s rjoin Queue.joins3  ! !A %..%%' ' ' & 's .979cSUlU(aUR5(dLUR5 URS:aU=RS-slUR5(dMLURS:XaURR 5 UR (aSUR R5nUR5(dURS5 UR (aMSUR(aTURR5nUR5(dURS5 UR(aMSgg)aoShut-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', a task is marked as done for each item remaining in the queue, which may unblock callers of join(). Trr N) r*rbr7r%r'r(r#r5rBrCr$)r, immediaterwros rshutdownQueue.shutdowns! jjll ))A-**a/*jjll%%*""$mm]]**,F;;==!!$'mmmmm]]**,F;;==!!$'mmmr)r'r#r*r r$r2r%N)r)F)rrrrrr.r)r7r>rFrOrR classmethodr __class_getitem__rNr\propertyr-rbrerprnrxrvr}rrrrrrrr!s  "*%! L;$L1   1%>) !> !. ((rrc^\rSrSrSrSr\R4Sjr\R4Sjr Sr g)rizA subclass of Queue; retrieves entries in priority order (lowest first). Entries are typically tuples of the form: (priority number, data). c/Ulgr1rar+s rr)PriorityQueue._init   rc*U"URU5 gr1ra)r,r=heappushs rr>PriorityQueue._put#sd#rc&U"UR5$r1ra)r,heappops rr7PriorityQueue._get&st{{##rraN) rrrrrr)heapqrr>rr7rrrrrrs( #(..$!==$rrc*\rSrSrSrSrSrSrSrg)ri*zEA subclass of Queue that retrieves most recently added entries first.c/Ulgr1rar+s rr)LifoQueue._init-rrc:URRU5 gr1r:r<s rr>LifoQueue._put0r@rc6URR5$r1)r2popr6s rr7LifoQueue._get3s{{  rraN) rrrrrr)r>r7rrrrrr*sO!!rr)__all__r!rtypesr r r Exceptionrrr_LoopBoundMixinrrrrrrrsn       I v(F " "v(r $E $ ! !r