+ BiY} Rt^RIHtHt^RIt]!]],4t]!R4t Rt ]!] 4t A .RHOt Rt ]!]!R 44t]!]!]!444t]!]!/P%444t]!]!/P)444t]!]!/P-444t]!]!.44t]!]!]!.444t]!]!]!^444t]!]!]!^R!,444t]!]!]!444t]!]!R"44t ]!]!RI44t!]!]!]"!444t#]!/P%44t$]!/P)44t%]!/P-44t&]!]PN4t(R#t)])!4t*A)]!R$!44t+R%t,],!4t,]!],4t-],P]4A,R&t/]/!4t/]!]/4t0A/R't1!R(R ]R)7t2!R*R]R)7t3!R+R]34t4]4Pk]-4!R,R]R)7t6!R-R]64t7!R.R ]74t8]8Pk]04!R/R ]R)7t9!R0R ]94t:]:Pk]4]:Pk]4]:Pk]4]:Pk]4]:Pk]4]:Pk]4]:Pk]4]:Pk]4]:Pk]4]:Pk]4]:Pk] 4]:Pk]!4]:Pk]#4!R1R]94t;!R2R ]:4t<]!R5R]=]9]>4t?!R6R]R)7t@!R7R8]4tAR9tB!R:R]R)7tC!R;R]?4tD]DPk]E4!R<R]D4tF]FPk]4!R=R]?4tG]GPk](4]GPk]*4!R>R]=4tH!R?R]H]D4tI]IPk]$4!R@R]H]D4tJ]JPk]&4!RAR]H]?4tK]KPk]%4!RBR]G4tL]LPk]M4!RCR];]?4tN]NPk]O4]NPk]P4]NPk]Q4]NPk]4]NPk]R4!RDRE]4tS!RFR]N]SR)7tT]TPk]Q4]TPk]4!RGR]N4tU]UPk]4]UPk]4R#)JzjAbstract Base Classes (ABCs) for collections, according to PEP 3119. Unit tests are in test_collections. )ABCMetaabstractmethodN.cR#Nr'/usr/lib/python3.14/_collections_abc.py_fr (s$r Awaitable Coroutine AsyncIterable AsyncIteratorAsyncGeneratorHashableIterableIterator Generator ReversibleSized ContainerCallable CollectionSet MutableSetMappingMutableMapping MappingViewKeysView ItemsView ValuesViewSequenceMutableSequence ByteStringBufferzcollections.abcricR\\P!4P4#r)typesys _getframef_localsrrr_get_framelocalsproxyr*Xs  (( ))rc#"Rx#rrrrrr,\s5rc"R#5irrrrr_coror.^s4c"R5xR#5irrrrr_agr1dss cVPpVFDpVF5pW4P9gKVPV,f \uu#K< \u# R#)NT)__mro____dict__NotImplemented)CmethodsmromethodBs&* r_check_methodsr;lsN ))CA#::f%-))  " ! rcDa]tRt^xtoRt]R4t]R4tRt Vt R#)rc^#rselfs&r__hash__Hashable.__hash__|rc:V\Jd \VR4#\#)rB)rr;r5clsr6s&&r__subclasshook__Hashable.__subclasshook__ (?!!Z0 0rrN) __name__ __module__ __qualname____firstlineno__ __slots__rrB classmethodrH__static_attributes____classdictcell__ __classdict__s@rrrx0Ir) metaclasscTa]tRt^toRt]R4t]R4t]!] 4t Rt Vt R#)r c#"RxR#5irrr@s&r __await__Awaitable.__await__s  c:V\Jd \VR4#\#)rY)r r;r5rFs&&rrHAwaitable.__subclasshook__s ) !![1 1rrN) rKrLrMrNrOrrYrPrH GenericAlias__class_getitem__rQrRrSs@rr r s=I $L1rc^a]tRt^toRt]R4t]RRl4tRt] R4t Rt Vt R#)r c \h)zSSend a value into the coroutine. Return next yielded value or raise StopIteration.  StopIterationrAvalues&&rsendCoroutine.send rNc RVfVfVhV!4pVeVPV4pVh)zWRaise an exception in the coroutine. Return next yielded value or raise StopIteration. with_tracebackrAtypvaltbs&&&&rthrowCoroutine.throw4 ;z %C >$$R(C rc tVP\4\R4h \\3dR#i;i).Raise GeneratorExit inside coroutine. zcoroutine ignored GeneratorExitNrp GeneratorExit RuntimeErrorrcr@s&rcloseCoroutine.close; B JJ} %@A A}-    "77c@V\Jd\VRRRR4#\#)rYrfrprx)r r;r5rFs&&rrHCoroutine.__subclasshook__s# ) !![&'7K KrrNN) rKrLrMrNrOrrfrprxrPrHrQrRrSs@rr r sJI   BrcTa]tRt^toRt]R4t]R4t]!] 4t Rt Vt R#)r c\4#r)r r@s&r __aiter__AsyncIterable.__aiter__s rc:V\Jd \VR4#\#)r)r r;r5rFs&&rrHAsyncIterable.__subclasshook__s - !![1 1rrN) rKrLrMrNrOrrrPrHr^r_rQrRrSs@rr r s=I $L1rcJa]tRt^toRt]R4tRt]R4t Rt Vt R#)r c "\h5i)z@Return the next item or raise StopAsyncIteration when exhausted.StopAsyncIterationr@s&r __anext__AsyncIterator.__anext__s ! r[cV#rrr@s&rrAsyncIterator.__aiter__ rc<V\Jd\VRR4#\#)rr)r r;r5rFs&&rrHAsyncIterator.__subclasshook__s - !![+> >rrN) rKrLrMrNrOrrrrPrHrQrRrSs@rr r s5I!!rcda]tRt^toRtRt]R4t]RRl4tRt ] R4t Rt Vt R#) rc @"VPR4GRjxL #L5i)z`Return the next item from the asynchronous generator. When exhausted, raise StopAsyncIteration. N)asendr@s&rrAsyncGenerator.__anext__sZZ%%%%s c "\h5i)zeSend a value into the asynchronous generator. Return next yielded value or raise StopAsyncIteration. rrds&&rrAsyncGenerator.asends ! r[Nc Z"VfVfVhV!4pVeVPV4pVh5i)ziRaise an exception in the asynchronous generator. Return next yielded value or raise StopAsyncIteration. rjrls&&&&rathrowAsyncGenerator.athrows7 ;z %C >$$R(C s)+c "VP\4GRjxL \R4hL \\3dR#i;i5i)rtNz,asynchronous generator ignored GeneratorExit)rrvrwrr@s&racloseAsyncGenerator.aclosesG O++m, , ,MN N -12   s0A.,. A.AAAAcBV\Jd\VRRRRR4#\#)rrrrr)rr;r5rFs&&rrHAsyncGenerator.__subclasshook__s* . !![+")8X? ?rrr~)rKrLrMrNrOrrrrrrPrHrQrRrSs@rrrsQI& !!   OrcTa]tRtRtoRt]R4t]R4t]!] 4t Rt Vt R#)ric#"R#5iFNrr@s&r__iter__Iterable.__iter__r/c:V\Jd \VR4#\#)r)rr;r5rFs&&rrHIterable.__subclasshook__$rJrrN) rKrLrMrNrOrrrPrHr^r_rQrRrSs@rrrs=I $L1rcJa]tRtRtoRt]R4tRt]R4t Rt Vt R#)ri-c \h)zKReturn the next item from the iterator. When exhausted, raise StopIterationrbr@s&r__next__Iterator.__next__1s rcV#rrr@s&rrIterator.__iter__6rrc<V\Jd\VRR4#\#)rr)rr;r5rFs&&rrHIterator.__subclasshook__9s (?!!Z< <rrN) rKrLrMrNrOrrrrPrHrQrRrSs@rrr-s5IrcDa]tRtRtoRt]R4t]R4tRt Vt R#)riPc#"R#5irrr@s&r __reversed__Reversible.__reversed__Trr/c<V\Jd\VRR4#\#)rr)rr;r5rFs&&rrHReversible.__subclasshook__Ys * !!^Z@ @rrN) rKrLrMrNrOrrrPrHrQrRrSs@rrrPs0Ircda]tRtRtoRtRt]R4t]R Rl4tRt ] R4t Rt Vt R#) ri`c $VPR4#)zNReturn the next item from the generator. When exhausted, raise StopIteration. N)rfr@s&rrGenerator.__next__dsyyrc \h)zSSend a value into the generator. Return next yielded value or raise StopIteration. rbrds&&rrfGenerator.sendjrhrNc RVfVfVhV!4pVeVPV4pVh)zWRaise an exception in the generator. Return next yielded value or raise StopIteration. rjrls&&&&rrpGenerator.throwqrrrc tVP\4\R4h \\3dR#i;i)z.Raise GeneratorExit inside generator. zgenerator ignored GeneratorExitNrur@s&rrxGenerator.close~rzr{cBV\Jd\VRRRRR4#\#)rrrfrprx)rr;r5rFs&&rrHGenerator.__subclasshook__s* ) !!Z"('7< <rrr~)rKrLrMrNrOrrrfrprxrPrHrQrRrSs@rrr`sQI    BrcDa]tRtRtoRt]R4t]R4tRt Vt R#)ric^#r>rr@s&r__len__ Sized.__len__rDrc:V\Jd \VR4#\#)r)rr;r5rFs&&rrHSized.__subclasshook__s %<!!Y/ /rrN) rKrLrMrNrOrrrPrHrQrRrSs@rrrrUrcTa]tRtRtoRt]R4t]R4t]!] 4t Rt Vt R#)ricR#Fr)rAxs&&r __contains__Container.__contains__rc:V\Jd \VR4#\#)r)rr;r5rFs&&rrHContainer.__subclasshook__s ) !!^4 4rrN) rKrLrMrNrOrrrPrHr^r_rQrRrSs@rrrs=I $L1rc4a]tRtRtoRt]R4tRtVtR#)ric>V\Jd\VRRR4#\#)rrr)rr;r5rFs&&rrHCollection.__subclasshook__s! * !!i^L LrrN) rKrLrMrNrOrPrHrQrRrSs@rrrsIrcPa]tRtRtoRt]V3RlRl4t]R4tRt Vt R#)r#ic&<V^8dQhRS[RS[/#)flagsreturn)int memoryview)formatrTs"r __annotate__Buffer.__annotate__s""":"rc\hrNotImplementedError)rArs""r __buffer__Buffer.__buffer__s!!rc:V\Jd \VR4#\#)r)r#r;r5rFs&&rrHBuffer.__subclasshook__s &=!!\2 2rrN) rKrLrMrNrOrrrPrHrQrRrSs@rr#r#s0I""rcXaa]tRtRtoRtRtV3RltV3RltRtV3Rlt Rt Vt V;t #)_CallableGenericAliasizRepresent `Callable[argtypes, resulttype]`. This sets ``__args__`` to a tuple containing the flattened ``argtypes`` followed by ``resulttype``. Example: ``Callable[[int, str], float]`` sets ``__args__`` to ``(int, str, float)``. c<\V\4'd\V4^8Xg \R4hVwr4\V\\34'd .VOVN5pM\ V4'g\RV 24h\ SV`WV4#)rz6Callable must be used as Callable[[arg, ...], result].zFExpected a list of types, an ellipsis, ParamSpec, or Concatenate. Got ) isinstancetuplelen TypeErrorlist_is_param_exprsuper__new__)rGoriginargst_argst_result __class__s&&& rr_CallableGenericAlias.__new__s4''CINHJ J fudm , ,&V&X&D''>>DXGH HwsD11rc P<\VP4^8Xd1\VP^,4'd\SV`4#^RIHpRRPVPRRUu.uF q!!V4NK up4 RV!VPR,4 R2#uupi)r) type_reprzcollections.abc.Callable[[z, Nz], ])r__args__rr__repr__ annotationlibrjoin)rArars& rr_CallableGenericAlias.__repr__s t}}  "~dmmA6F'G'G7#% %+YYdmmCR6HI6H ! 6HIJK3T]]2./03 4Is/B# cVPp\V4^8Xd\V^,4'g\VRR4VR,3p\\ V33#)rNr)rrrrrr)rArs& r __reduce__ _CallableGenericAlias.__reduce__sL}}D Q>$q'#:#:Sb ?DH,D$x&666rc<\V\4'gV3p\SV` V4Pp\V^,\\ 34'gVR,pVRRpWC3p\ \\V44#)r?Nr)rrr __getitem__rrrr)rAitemnew_argsrrrs&& rr!_CallableGenericAlias.__getitem__sr $&&7D7&t,55(1+t}55|Hcr]F)H$XuX??rr) rKrLrMrN__doc__rOrrrrrQrR __classcell__rrTs@@rrrs,I 247 @@rrcaS\JdR#\S\4'dR#\S4oRpSPR8H;'d;\ ;QJdV3RlV4F 'gK R# R#!V3RlV44#)ztChecks if obj matches either a list of types, ``...``, ``ParamSpec`` or ``_ConcatenateGenericAlias`` from typing.py Ttypingc3B<"TFpSPV8HxK R#5ir)rK).0nameobjs& r !_is_param_expr..s-Uutclld.BusF) ParamSpec_ConcatenateGenericAlias)Ellipsisrrr&rLany)r namessf rrrsg h#t s)C 5E >>X % U U##-Uu-U##U#U#-Uu-U*UUrcTa]tRtRtoRt]R4t]R4t]!] 4t Rt Vt R#)ricR#rr)rArkwdss&*,r__call__Callable.__call__rrc:V\Jd \VR4#\#)r)rr;r5rFs&&rrHCallable.__subclasshook__rJrrN) rKrLrMrNrOrrrPrHrr_rQrRrSs@rrrs>I $$9:rca]tRtRtoRtRtRtRtRtRt Rt ] R4t R t ] tR tR t]tR tR tRt]tRtRtVtR#)ri%aBA set is a finite, iterable container. This class provides concrete generic implementations of all methods except for __contains__, __iter__ and __len__. To override the comparisons (presumably for speed, as the semantics are fixed), redefine __le__ and __ge__, then the other operations will automatically follow suit. c\V\4'g\#\V4\V48dR#VF pW!9gK R# R#FTrrr5rrAotherelems&& r__le__ Set.__le__2s@%%%! ! t9s5z !D rc\V\4'g\#\V4\V48;'dVP V4#rrrr5rr#rAr!s&&r__lt__ Set.__lt__<9%%%! !4y3u:%<<$++e*<.as"MeU}55es rrr5r7r'sf&r__and__ Set.__and__^s-%**! !"""Me"MMMrc *VF pW 9gK R# R#)z1Return True if two sets have a null intersection.FTr)rAr!res&& r isdisjointSet.isdisjointesE}rcp\V\4'g\#RW34pVPV4#)c34"TFqFq"xK K R#5irr)r ses& rrSet.__or__..os5Mq1a1Msr=)rAr!chains&& r__or__ Set.__or__ls2%**! !5TM5""5))rca\S\4'g.\S\4'g\#VP S4oVP V3RlV44#)c3:<"TFpVS9gK VxK R#5irr)r rer!s& rrSet.__sub__..ys #:dU&+5&8$)5d  rrrr5r7r's&fr__sub__ Set.__sub__tsR%%%eX..%%''.E""#:d#:: :rca\V\4'g.\V\4'g\#SP V4pSP V3RlV44#)c3:<"TFpVS9gK VxK R#5irrr;s& rrSet.__rsub__..s #9eU&+4&7$)5erNrOr'sf&r__rsub__ Set.__rsub__|sR%%%eX..%%''.E""#9e#99 9rc\V\4'g.\V\4'g\#VP V4pW, W, ,#rrOr's&&r__xor__ Set.__xor__sA%%%eX..%%''.E ..rc \Pp^V,^,p\V4pRV^,,pWB,pVF:p\V4pWFV^,, R, R,,pWB,pK< WD^ , V^, , ,pVR,R,pWB,pWA8dWB^,,pVR8XdRpV#)aCompute the hash value of a set. Note that we don't define __hash__: not all sets are hashable. But if you define a hashable set type, its __hash__ should call this function. This must be compatible __eq__. All sets ought to compare equal if they contain the same elements, regardless of how they are implemented, and regardless of the order of the elements; so there's not much freedom for __eq__ or __hash__. We match the algorithm used by the built-in frozenset type. iMriM[l4~2i i6i8#r)r'maxsizerhash)rAMAXMASKnhrhxs& r_hash Set._hashskk3w{ I !a%  AaB b/H,; ;A IA 2g!r' "" I !  7 MA 7ArrN)rKrLrMrNrrOr#r(r-r,r2rPr7r>__rand__rArI__ror__rPrUrX__rxor__rbrQrRrSs@rrr%s|I= = > N H* G:9/Hrcra]tRtRtoRtR t]R4t]R4tRt Rt Rt Rt R t R tR tR tVtR #)riakA mutable set is a finite, iterable container. This class provides concrete generic implementations of all methods except for __contains__, __iter__, __len__, add(), and discard(). To override the comparisons (presumably for speed, as the semantics are fixed), all you have to do is redefine __le__ and then the other operations will automatically follow suit. c \h)zAdd an element.rrds&&raddMutableSet.add "!rc \h)z8Remove an element. Do not raise an exception if absent.rrds&&rdiscardMutableSet.discardrkrc JW9d \V4hVPV4R#)z5Remove an element. If not a member, raise a KeyError.N)KeyErrorrmrds&&rremoveMutableSet.removes  5/ ! Urc \V4p\V4pTP T4T# \d \Rhi;i)z2Return the popped value. Raise KeyError if empty.N)iternextrcrprmrAr6res& rpopMutableSet.popsE $Z %HE U  % $ %s +>c NVP4K \dR#i;i)z6This is slow (creates N new iterators!) but effective.N)rwrpr@s&rclearMutableSet.clears%       $$c:VFpVPV4K V#r)rirvs&& r__ior__MutableSet.__ior__sE HHUO rcFW, FpVPV4K V#r)rmrvs&& r__iand__MutableSet.__iand__s!iiE LL   rcWJdVP4V#\V\4'gVPV4pVF-pW 9dVP V4KVP V4K/ V#r)rzrrr7rmrirvs&& r__ixor__MutableSet.__ixor__sc : JJL b#&&((,=LL'HHUO   rchWJdVP4V#VFpVPV4K V#r)rzrmrvs&& r__isub__MutableSet.__isub__s4 : JJL  U# rrN)rKrLrMrNrrOrrirmrqrwrzr~rrrrQrRrSs@rrrs_ I""""   rcha]tRtRtoRtR t^@t]R4tR Rlt Rt Rt Rt R t R tRtR tVtR#) rizA Mapping is a generic container for associating key/value pairs. This class provides concrete generic implementations of all methods except for __getitem__, __iter__, and __len__. c\hrrprAkeys&&rrMapping.__getitem__rNc :W,# \dTu#i;i)z D[k] if k in D, else d. d defaults to None.rrArdefaults&&&rget Mapping.gets# 9  N s  c<W,R# \dR#i;iTFrrs&&rrMapping.__contains__s%  I  s  c \V4#)z:D.keys() -> a set-like object providing a view on D's keys)rr@s&rkeys Mapping.keys's ~rc \V4#)z a set-like object providing a view on D's items)rr@s&ritems Mapping.items+s rc \V4#)z6D.values() -> an object providing a view on D's values)rr@s&rvaluesMapping.values/s $rc\V\4'g\#\VP 44\VP 448H#r)rrr5dictrr's&&rr2Mapping.__eq__3s6%))! !DJJL!T%++-%888rrr)rKrLrMrNrrO__abc_tpflags__rrrrrrrr2rrQrRrSs@rrrsOIO 9 LrcFa]tRtRtoRtRtRtRt]!] 4t Rt Vt R#)ri>cWnR#r_mapping)rAmappings&&r__init__MappingView.__init__Bs rc,\VP4#r)rrr@s&rrMappingView.__len__Es4==!!rc$RPV4#)z&{0.__class__.__name__}({0._mapping!r}))rr@s&rrMappingView.__repr__Hs7>>tDDrrN) rKrLrMrNrOrrrrPr^r_rQrRrSs@rrr>s'I "E$L1rc@a]tRtRtoRt]R4tRtRtRt Vt R#)riNc\V4#rsetr5s&&rr7KeysView._from_iterableR 2wrcWP9#rrrs&&rrKeysView.__contains__Vsmm##rc#:"VPRjxL R#L5irrr@s&rrKeysView.__iter__Ys==  s rN rKrLrMrNrOrPr7rrrQrRrSs@rrrNs+I$!!rc@a]tRtRtoRt]R4tRtRtRt Vt R#)ri`c\V4#rrr5s&&rr7ItemsView._from_iterabledrrctVwr#VPV,pWCJ;'gWC8H# \dR#i;ir)rrp)rArrrevs&& rrItemsView.__contains__hsD  , c"A:++ +  s ( 77c#`"VPFpWPV,3xK R#5irrrs& rrItemsView.__iter__qs%==C c*+ +!s,.rNrrSs@rrr`s+I,,,rc0a]tRtRtoRtRtRtRtVtR#)riycnVPF$pVPV,pW1Jg W18XgK#R# R#rr)rArerrs&& rrValuesView.__contains__}s/==C c"AzQZ!rc#^"VPFpVPV,xK R#5irrrs& rrValuesView.__iter__s"==C--$ $!s+-rN) rKrLrMrNrOrrrQrRrSs@rrrysI%%rca]tRtRtoRtR t]R4t]R4t] !4t ] 3Rlt Rt Rt R RltR R ltR tVtR #)rizA MutableMapping is a generic container for associating key/value pairs. This class provides concrete generic implementations of all methods except for __getitem__, __setitem__, __delitem__, __iter__, and __len__. c\hrrrArres&&&r __setitem__MutableMapping.__setitem__rrc\hrrrs&&r __delitem__MutableMapping.__delitem__rrc bW,pWV# \dY PJdhTu#i;i)zD.pop(k[,d]) -> v, remove specified key and return the corresponding value. If key is not found, d is returned if given, otherwise KeyError is raised. )rp_MutableMapping__marker)rArrres&&& rrwMutableMapping.pops= IE  L  --'N s ..c r\\V44pY,pYY3# \d \Rhi;i)zpD.popitem() -> (k, v), remove and return some (key, value) pair as a 2-tuple; but raise KeyError if D is empty. N)rurtrcrprs& rpopitemMutableMapping.popitemsD %tDz"C  Iz  % $ %s#6c NVP4K \dR#i;i)z,D.clear() -> None. Remove all items from D.N)rrpr@s&rrzMutableMapping.clears%     r|c \V\4'dVF pW,W&K MC\VR4'd#VP4F pW,W&K MVF wr4W@V&K VP 4F wr4W@V&K R#)a%D.update([E, ]**F) -> None. Update D from mapping/iterable E and F. If E present and has a .keys() method, does: for k in E.keys(): D[k] = E[k] If E present and lacks .keys() method, does: for (k, v) in E: D[k] = v In either case, this is followed by: for k, v in F.items(): D[k] = v rN)rrhasattrrr)rAr!rrres"", rupdateMutableMapping.updatesx eW % %!J  UF # #zz|!J $$ !S $**,JCI'rNc @W,# \d Y T&T#i;i)z@D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in Drrs&&&r setdefaultMutableMapping.setdefaults* 9  I s  r)rr)rKrLrMrNrrOrrrobjectrrwrrzrrrQrRrSs@rrrsaIxH'  $rc^a]tRtRtoRtR t^ t]R4tRt Rt Rt R Rlt R t R tVtR#) r iz~All the operations on a read-only sequence. Concrete subclasses must override __new__ or __init__, __getitem__, and __len__. c\hr IndexErrorrAindexs&&rrSequence.__getitem__rc#d"^pW,pVxV^, pK \dR#i;i5ir?Nr)rAirs& rrSequence.__iter__s8  GQ   s0 -0-0c4VFpW!Jg W!8XgKR# R#rr)rArers&& rrSequence.__contains__sAzQZrc#j"\\\V444F pW,xK R#5ir)reversedranger)rArs& rrSequence.__reversed__s$%D *+A'M,s13Nc Ve$V^8d\\V4V,^4pVeV^8dV\V4, pTpVeWC8d"W,pYQJgYQ8XdT#T^, pK+\h \d \hi;i)zS.index(value, [start, [stop]]) -> integer -- return first index of value. Raises ValueError if the value is not present. Supporting start and stop arguments is optional, but recommended. )maxrr ValueError)rArestartstoprrs&&&& rrSequence.indexs  D E)1-E  q CI D lah GzQZ FA    sA88 B  B c .a\V3RlV44#)zBS.count(value) -> integer -- return number of occurrences of valuec3D<"TFqSJg VS8XgK^xK R#5i)Nr)r rres& rr!Sequence.count.. s?d5jAJ11ds  )sumrds&frcountSequence.counts?d???rrr)rKrLrMrNrrOrrrrrrrrrQrRrSs@rr r sJ IO .@@rc>aa]tRtRtoV3RltV3RltRtVtV;t#)_DeprecateByteStringMetai(c d<VR8wd^RIpVPRRR7\SV` !WW#3/VB#)r"Ncollections.abc.ByteStringrq)warnings _deprecatedrr)rGr bases namespacekwargsrrs&&&&, rr _DeprecateByteStringMeta.__new__)s? <    , ! ws%EfEErcP<^RIpVPRRR7\SV` V4#)r?Nrrr)rrr__instancecheck__)rGinstancerrs&& rr*_DeprecateByteStringMeta.__instancecheck__3s1 (  w(22rr) rKrLrMrNrrrQrRrrs@@rrr(sF33rrc]tRtRtRtRtRtR#)r"i<aDeprecated ABC serving as a common supertype of ``bytes`` and ``bytearray``. This ABC is scheduled for removal in Python 3.17. Use ``isinstance(obj, collections.abc.Buffer)`` to test if ``obj`` implements the buffer protocol at runtime. For use in type annotations, either use ``Buffer`` or a union that explicitly specifies the types your code supports (e.g., ``bytes | bytearray | memoryview``). rN)rKrLrMrNrrOrQrrrr"r"<sIrca]tRtRtoRtR t]R4t]R4t]R4t Rt Rt Rt R t RR ltR tR tR tVtR#)r!iLzAll the operations on a read-write sequence. Concrete subclasses must provide __new__ or __init__, __getitem__, __setitem__, __delitem__, __len__, and insert(). c\hrrrArres&&&rrMutableSequence.__setitem__Urrc\hrrrs&&rrMutableSequence.__delitem__Yrrc \h)z3S.insert(index, value) -- insert value before indexrrs&&&rinsertMutableSequence.insert]s rc <VP\V4V4R#)z:S.append(value) -- append value to the end of the sequenceN)rrrds&&rappendMutableSequence.appendbs CIu%rc NVP4K \dR#i;i)z,S.clear() -> None -- remove all items from SN)rwrr@s&rrzMutableSequence.clearfs%     r|c \V4p\V^,4F4pWV, ^, ,W,uW&WV, ^, &K6 R#)z!S.reverse() -- reverse *IN PLACE*N)rr)rAr_rs& rreverseMutableSequence.reversensA Iq!tA#'!A; DGTA#a%[rc ZWJd \V4pVFpVPV4K R#)zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)rr)rArrs&& rextendMutableSequence.extendts% >&\FA KKNrc W,pWV#)zS.pop([index]) -> item -- remove and return item at index (default last). Raise IndexError if list is empty or index is out of range. r)rArrs&& rrwMutableSequence.pop{s K Krc (WPV4R#)zcS.remove(value) -- remove first occurrence of value. Raise ValueError if the value is not present. N)rrds&&rrqMutableSequence.removes E" #rc(VPV4V#r)r$)rArs&&r__iadd__MutableSequence.__iadd__s F rrN)r)rKrLrMrNrrOrrrrrrzr!r$rwrqr+rQrRrSs@rr!r!Lss I&8 $ r)r r r r rrrrrrrrrrrrrrrrrrr r!r"r#r)Vrabcrrr'r&rrr^ EllipsisTyper FunctionType__all__rKrtbytes_iterator bytearraybytearray_iteratorrdict_keyiteratorrdict_valueiteratorrdict_itemiterator list_iteratorrlist_reverseiteratorrrange_iteratorlongrange_iteratorr set_iterator str_iteratortuple_iteratorzip zip_iterator dict_keys dict_values dict_itemsr4 mappingproxyr*framelocalsproxy generatorr. coroutinerxr1async_generatorr;rr r registerr r rrrrrrrrr#rrrr frozensetrrrrrrrrr rstrbytesrrr"r!rrrrLs*>( DI Cy Bx   d3i$y{+,RWWY($ryy{+,bhhj)*T"X D"./d58n%$uQ$Y/01DK DH~ d2hDK O 299; "((*  DMM" *(* /$ %   K    es)   2'2"& &R 92g2"M&-]-`(22$x& .!$%"#$%#$- &'.!$%,,.!,   --` 9 g 2'2") w 5@L5@n V;;(G*GT YMM` C 1j1f!" 2% 2 !{C ! ), S,, : %j %  K OWOd =@z:=@~ %#%%*3w3( %=  E I?h?D#r