F\h%SrSSKrSSKrSSKrSSKrSSKrSSKJr SSKJ r J r SSKJ r J r /SQr "SS \ \R5r"S S \ \R 5r"S S \ \R$5rSrSr\R*R-S\5rSrSrSS\S.SjjrSr\R:"5r"SS5r\R@"\\\5 g)z+Cross-interpreter Queues High Level Module.N) _crossinterp) QueueErrorQueueNotFoundError) UNBOUND_ERRORUNBOUND_REMOVE) UNBOUNDrrcreatelist_allQueuerr QueueEmpty QueueFullItemInterpreterDestroyedc\rSrSrSrSrg)r zaRaised from get_nowait() when the queue is empty. It is also raised from get() if it times out. N__name__ __module__ __qualname____firstlineno____doc____static_attributes__r7/usr/lib/python3.13/test/support/interpreters/queues.pyr r rr c\rSrSrSrSrg)r"z`Raised from put_nowait() when the queue is full. It is also raised from put() if it times out. rNrrrrrr"rrrc\rSrSrSrSrg)r)z#Raised from get() and get_nowait().rNrrrrrr)s-rrqueuec`U[La[Rn[R"U5$N)r rserialize_unbound)unbounds r_serialize_unboundr&5s&'&&  ) )' 22rcn[R"U[5nU[RLa[nU$r#)rresolve_unboundrr )flagresolveds r_resolve_unboundr+;s-++D2JKH<''' OrF)syncobj unbounditemscU(a[O[n[U5nUun[R"XU5n[ XcUS9$)a=Return a new cross-interpreter queue. The queue may be used to pass data safely between interpreters. "syncobj" sets the default for Queue.put() and Queue.put_nowait(). "unbounditems" likewise sets the default. See Queue.put() for supported values. The default value is UNBOUND, which replaces the unbound item. _fmt_unbound) _SHARED_ONLY_PICKLEDr&_queuesr r )maxsizer,r-fmtr% unboundopqids rr r Bs;",xC .GJI ..y 1C  11rc |[R"5VVVs/sHupn[XU4S9PM snnn$s snnnf)z!Return a list of all open queues.r/)r4r r )r8r6r7s rr r Us@(/'7'7'9 ;'9#) #9, 7'9 ;; ;s7c^\rSrSrSrSSS.U4SjjrSrSrSrS r S r \ S 5r \ S 5r S rSrSrSSSSS.SjjrSSS.SjrSSS.SjjrSrSrU=r$)r ]zA cross-interpreter queue.Nr/c>[U[5(a [U5nO[SU<35eUc8Uc[R"U5up$U4nO7[R"U5up%OUc[R"U5upTU4n[ UnU$![ aD [TU]!U5nXl X&l X6l U[ U'[R"U5 U$f=f)Nzid must be an int, got ) isinstanceint TypeErrorr4get_queue_defaults _known_queuesKeyErrorsuper__new___idr0r1bind)clsidr0r1op_self __class__s rrD Queue.__new__`s b#  RB5bV<= = <"55b95!44R8a  ..r2EAuH  $D  7?3'DHI$M $M"  LL   s BA C%$C%c[R"UR5 [UR g![a Nf=f![ a gf=fr#)r4releaserErrArBrKs r__del__ Queue.__del__zsO  OODHH % dhh'"      s 5A AA AAcL[U5RSURS3$)N())typerrHrPs r__repr__Queue.__repr__s$t*%%&ay22rc,[UR5$r#)hashrErPs r__hash__Queue.__hash__sDHH~rcUR4$r#rErPs r__getnewargs__Queue.__getnewargs__s{rcgr#rrPs r __getstate__Queue.__getstate__srcUR$r#r^rPs rrHQueue.ids xxrcUR$![a4 [R"UR5UlURs$f=fr#)_maxsizeAttributeErrorr4 get_maxsizerErPs rr5 Queue.maxsizes@ !==  !#//9DM==  !s ;A  A c(UR5S:H$)Nr)qsizerPs rempty Queue.emptyszz|q  rcB[R"UR5$r#)r4is_fullrErPs rfull Queue.fullstxx((rcB[R"UR5$r#)r4 get_countrErPs rrl Queue.qsizes  **rg{Gz?)r,r%_delaycUc URnOU(a[O[nUcURunO [ U5unUb4[ U5nUS:a [ S5e[R"5U-nU[La[R"U5n[R"URXU5 g![a=n Ub[R"5W:ae[R"U5 Sn A OSn A ff=fMp)agAdd the object to the queue. This blocks while the queue is full. If "syncobj" is None (the default) then it uses the queue's default, set with create_queue(). If "syncobj" is false then all objects are supported, at the expense of worse performance. If "syncobj" is true then the object must be "shareable". Examples of "shareable" objects include the builtin singletons, str, and memoryview. One benefit is that such objects are passed through the queue efficiently. The key difference, though, is conceptual: the corresponding object returned from Queue.get() will be strictly equivalent to the given obj. In other words, the two objects will be effectively indistinguishable from each other, even if the object is mutable. The received object may actually be the same object, or a copy (immutable values only), or a proxy. Regardless, the received object should be treated as though the original has been shared directly, whether or not it actually is. That's a slightly different and stronger promise than just (initial) equality, which is all "syncobj=False" can promise. "unbound" controls the behavior of Queue.get() for the given object if the current interpreter (calling put()) is later destroyed. If "unbound" is None (the default) then it uses the queue's default, set with create_queue(), which is usually UNBOUND. If "unbound" is UNBOUND_ERROR then get() will raise an ItemInterpreterDestroyed exception if the original interpreter has been destroyed. This does not otherwise affect the queue; the next call to put() will work like normal, returning the next item in the queue. If "unbound" is UNBOUND_REMOVE then the item will be removed from the queue as soon as the original interpreter is destroyed. Be aware that this will introduce an imbalance between put() and get() calls. If "unbound" is UNBOUND then it is returned by get() in place of the unbound item. Nr"timeout value must be non-negative)r0r2r3r1r&r> ValueErrortimepickledumpsr4putrErsleep) rKobjtimeoutr,r%rvr6r7endexcs rr} Queue.putsl ?))C"),xC ?JI+G4JI  'lG{ #EGG))+'C (?,,s#C  DHHc :   #&499;#+= 6"" #s"B>> D3DD)r,r%c Uc URnOU(a[O[nUcURunO [ U5unU[La[ R "U5n[R"URXU5 gr#) r0r2r3r1r&r{r|r4r}rE)rKrr,r%r6r7s r put_nowaitQueue.put_nowaits^ ?))C"),xC ?JI+G4JI (?,,s#C DHHc 2r)rvcUb4[U5nUS:a [S5e[R"5U-n[R"UR 5upEnUbUb[U55e[U5$U[:Xa[R"U5nU$U[:XdeU$![ a=nUb[R"5W:ae[R"U5 SnAOSnAff=fM)zReturn the next object from the queue. This blocks while the queue is empty. If the next item's original interpreter has been destroyed then the "next object" is determined by the value of the "unbound" argument to put(). Nrrx)r>ryrzr4getrEr r~reprr+r3r{loadsr2)rKrrvrrr6r7rs rr Queue.gets  'lG{ #EGG))+'C &-kk$((&;#)   ; )S );#I. . (?,,s#C ,& &&  #&499;#+= 6"" #s#B// C693C11C6c[R"UR5upnUbUb[ U55e[ U5$U[ :Xa[R"U5nU$U[:XdeU$![aneSnAff=f)z}Return the next object from the channel. If the queue is empty then raise QueueEmpty. Otherwise this is the same as get(). N) r4rrEr rr+r3r{rr2)rKrr6r7rs r get_nowaitQueue.get_nowait%s  ")++dhh"7 Ci  ; )S );#I. . (?,,s#C ,& &&    s#A66 BBB)r0rErgr1r#)rrrrrrDrQrWr[r_rbpropertyrHr5rmrqrlr}rrrr __classcell__)rLs@rr r ]s$$(443!!!)+MM^*.t 3  Drr )r)!rr{r!rzweakref _interpqueuesr4rrrrr__all__Emptyr Fullrrr2r3 UnboundItem singletonrr r&r+r r WeakValueDictionaryrAr _register_heap_typesrrrrs1  U[[ EJJ.z+DD.    " " , ,Wh ?3 2W2&; ++- YYxUJ :r