grthtrhthjhtyjytjytkergtrhtrjytjerhrfh4:24 29/09/2026+ ?/54DRt^RIt^RIt^RIHt^RIHtHt^RIH t^RI H t .ROt ^R I Ht!RR]4t!RR]4t!RR 4t!RR ]4t!RR ]4t!RR4t] f]t R#R# ] dRt L`i;i ] d!R R]4tLmi;i)z'A multi-producer, multi-consumer queue.N)deque)heappushheappop) monotonic) SimpleQueueEmptyFullShutDownQueue PriorityQueue LifoQueue)rc]tRt^tRtRtR#)rz4Exception raised by Queue.get(block=0)/get_nowait().N__name__ __module__ __qualname____firstlineno____doc____static_attributes__r,/opt/alt/python314/lib64/python3.14/queue.pyrrs> rc]tRt^tRtRtR#)rz4Exception raised by Queue.put(block=0)/put_nowait().rNrrrrrrs:rc]tRt^$tRtRtR#)r z)Raised when put/get with shut-down queue.rNrrrrr r $s3rca]tRt^(toRtRRltRtRtRtRt Rt RR lt RR lt R t R tRR ltRtRtRtRt]!]P,4tRtVtR#)r zbCreate a queue object with a given maximum size. If maxsize is <= 0, the queue size is infinite. cbWnVPV4\P!4Vn\P !VP4Vn\P !VP4Vn\P !VP4Vn^Vn RVn R#)FN) maxsize_init threadingLockmutex Condition not_emptynot_fullall_tasks_doneunfinished_tasks is_shutdownselfrs&&r__init__Queue.__init__.s~  7 ^^% #,,TZZ8"++DJJ7 (11$**= !!rc VP;_uu_4VP^, pV^8:d-V^8d \R4hVPP4WnRRR4R# +'giR#;i)aIndicate 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. z!task_done() called too many timesN)r%r& ValueError notify_all)r) unfinisheds& r task_doneQueue.task_doneHsa ..2JQ>$%HII##..0$. ! ! s A A,, A= c VP;_uu_4VP'dVPP4K.RRR4R# +'giR#;i)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)s&rjoin Queue.join^sB '''##((*(! sAA A c VP;_uu_4VP4uuRRR4# +'giR#;i)9Return the approximate size of the queue (not reliable!).Nr!_qsizer4s&rqsize Queue.qsizeks ZZZ;;=ZZZs 0 A c VP;_uu_4VP4'*uuRRR4# +'giR#;i)aReturn 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. Nr9r4s&rempty Queue.emptyps%ZZZ{{}$ZZZs 5 A c VP;_uu_4^VPu;8;'dVP48*MuuuRRR4# +'giR#;i)a'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. N)r!rr:r4s&rfull Queue.full~s3ZZZt||44t{{}4ZZZs .A A Nc zVP;_uu_4VP'd\hVP^8EdV'g'VP 4VP8d\ hMVfUVP 4VP8d5VPP 4VP'gKM\hMV^8d \R4h\4V,pVP 4VP8dTV\4, pVR8:d\ hVPP V4VP'gKl\hVPV4V;P^, un VPP4RRR4R# +'giR#;i)aPut 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). Raises ShutDown if the queue has been shut down. N''timeout' must be a non-negative number) r$r'r rr:rr3r-time_putr&r#notify)r)itemblocktimeoutendtime remainings&&&& rput Queue.puts-]]]||a{{} 4" 5_++-4<<7 **,+++"*N8q[$%NOO"fw.G++-4<<7$+df$4 $+"&J **95+++"*N IIdO  ! !Q & ! NN ! ! #3]]]s 2F)A2F)?BF)A F)) F: c ~VP;_uu_4VP'dVP4'g\hV'gVP4'g\hEM VfdVP4'gMVPP 4VP'gKDVP4'dK\\hMV^8d \ R4h\4V,pVP4'glV\4, pVR8:d\hVPP V4VP'gKcVP4'dK{\hVP4pVPP4VuuRRR4# +'giR#;i)a6Remove 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). Raises ShutDown if the queue has been shut down and is empty, or if the queue has been shut down immediately. NrDrE) r#r'r:r rr3r-rF_getr$rH)r)rJrKrLrMrIs&&& rget Queue.gets^^^ {{}}K%++--NN'')''' &(1 !JKK&7*++-- '$& 0I C'# NN'' 2''' &99;D MM "1^^^sA(F+ F+ F+"!F+)F+2F+ ?F+ AF+F+/1F++ F< c (VPVRR7#)zPut an item into the queue without blocking. Only enqueue the item if a free slot is immediately available. Otherwise raise the Full exception. FrJrNr)rIs&&r put_nowaitQueue.put_nowait xxEx**rc &VPRR7#zRemove and return an item from the queue without blocking. Only get an item if one is immediately available. Otherwise raise the Empty exception. FrUrRr4s&r get_nowaitQueue.get_nowait xxex$$rc VP;_uu_4RVnV'doVP4'd?VP4VP^8gK9V;P^,unKTVP P 4VPP 4VPP 4RRR4R# +'giR#;i)aShut-down the queue, making queue gets and puts raise ShutDown. 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. TN) r!r'r:rQr&r%r.r#r$)r) immediates&&rshutdownQueue.shutdownsZZZ#D kkmmIIK,,q0--2-##..0 NN % % ' MM $ $ &ZZZs%CCA)C C" c$\4VnR#N)rqueuer(s&&rr Queue._inits W rc,\VP4#rflenrgr4s&rr: Queue._qsize 4::rc<VPPV4R#rfrgappendrWs&&rrG Queue._put $rc6VPP4#rf)rgpopleftr4s&rrQ Queue._getszz!!##r)r%r'rr!r#r$rgr&)rTN)F)rrrrrr*r0r5r;r>rArNrRrXr^rcrr:rGrQ classmethodtypes GenericAlias__class_getitem__r__classdictcell__ __classdict__s@rr r (sj !4/, +! % 5&$P&P+%'< $$E$6$67rc<a]tRtRtoRtRtRtRtRtRt Vt R#) r izVariant of Queue that retrieves open entries in priority order (lowest first). Entries are typically tuples of the form: (priority number, data). c.VnR#rfrgr(s&&rrPriorityQueue._init  rc,\VP4#rfrjr4s&rr:PriorityQueue._qsize!rmrc2\VPV4R#rf)rrgrWs&&rrGPriorityQueue._put$sT"rc,\VP4#rf)rrgr4s&rrQPriorityQueue._get'stzz""rrN rrrrrrr:rGrQrr{r|s@rr r s# ###rc<a]tRtRtoRtRtRtRtRtRt Vt R#) r i+zBVariant of Queue that retrieves most recently added entries first.c.VnR#rfrr(s&&rrLifoQueue._init.rrc,\VP4#rfrjr4s&rr:LifoQueue._qsize1rmrc<VPPV4R#rfrorWs&&rrGLifoQueue._put4rrrc6VPP4#rf)rgpopr4s&rrQLifoQueue._get7szz~~rrNrr|s@rr r +s!L   rcza]tRtRtoRtRtR RltR RltRtRt R t R t ] !] P4tR tVtR#) _PySimpleQueuei;zQSimple, unbounded FIFO queue. This pure Python implementation is not reentrant. cZ\4Vn\P!^4VnR#)rN)r_queuer Semaphore_countr4s&rr*_PySimpleQueue.__init__Esg ))!, rNc pVPPV4VPP4R#)zPut the item on the queue. The optional 'block' and 'timeout' arguments are ignored, as this method never blocks. They are provided for compatibility with the Queue class. N)rrprrelease)r)rIrJrKs&&&&rrN_PySimpleQueue.putIs& 4  rc VeV^8d \R4hVPPW4'g\hVPP 4#)aRemove 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). rD)r-racquirerrrt)r)rJrKs&&&rrR_PySimpleQueue.getRsI  7Q;FG G{{""522K{{""$$rc (VPVRR7#)zPut an item into the queue without blocking. This is exactly equivalent to `put(item, block=False)` and is only provided for compatibility with the Queue class. FrUrVrWs&&rrX_PySimpleQueue.put_nowaitcrZrc &VPRR7#r\r]r4s&rr^_PySimpleQueue.get_nowaitkr`rc 2\VP4^8H#)zCReturn True if the queue is empty, False otherwise (not reliable!).rkrr4s&rr>_PySimpleQueue.emptyss4;;1$$rc ,\VP4#)r8rr4s&rr;_PySimpleQueue.qsizews4;;r)rrrv)rrrrrr*rNrRrXr^r>r;rwrxryrzrr{r|s@rrr;s@-%"+%% $E$6$67rr)rrr r r r r)rrrx collectionsrheapqrrrFrrr ImportError__all__r Exceptionrr r r r rrrrrs- #""    9 4y4m8m8`#E#&    @8@8F Ki K     s"A;B ; BB BB