F\h~\ SrSSKJrJr SSKr\"\\5r\"S5r Sr \"\ 5r C /SQr Sr \"\"S55r\"\"\"555r\"\"0R%555r\"\"0R)555r\"\"0R-555r\"\"/55r\"\"\"/555r\"\"\"S555r\"\"\"S S -555r\"\"\"555r\"\"S 55r \"\"S 55r!\"\"\""555r#\"0R%55r$\"0R)55r%\"0R-55r&\"\RN5r(S r)\)"5r*C)\"S"55r+Sr,\,"5r,\"\,5r-\,R]5 C,Sr/\/"5r/\"\/5r0C/Sr1"SS\S9r2"SS\S9r3"SS\35r4\4Rk\-5 "SS\S9r6"SS\65r7"SS\75r8\8Rk\05 "SS \S9r9"S!S"\95r:\:Rk\5 \:Rk\5 \:Rk\5 \:Rk\5 \:Rk\5 \:Rk\5 \:Rk\5 \:Rk\5 \:Rk\5 \:Rk\5 \:Rk\ 5 \:Rk\!5 \:Rk\#5 "S#S$\95r;"S%S&\:5r<\"S+S,\=\9\>5r?"S-S.\S9r@"S/S0\5rAS1rBS2rC"S3S4\S9rD"S5S6\?5rE\ERk\F5 "S7S8\E5rG\GRk\5 "S9S:\?5rH\HRk\(5 \HRk\*5 "S;S<\=5rI"S=S>\I\E5rJ\JRk\$5 "S?S@\I\E5rK\KRk\&5 "SASB\I\?5rL\LRk\%5 "SCSD\H5rM\MRk\N5 "SESF\;\?5rO\ORk\P5 \ORk\Q5 \ORk\5 \ORk\R5 "SGSH\5rS"SISJ\O\SS9rT\TRk\U5 \TRk\5 "SKSL\O5rV\VRk\5 \VRk\5 g)MzjAbstract Base Classes (ABCs) for collections, according to PEP 3119. Unit tests are in test_collections. )ABCMetaabstractmethodN.cgNr'/usr/lib/python3.13/_collections_abc.py_fr (s$r) Awaitable Coroutine AsyncIterable AsyncIteratorAsyncGeneratorHashableIterableIterator Generator ReversibleSized ContainerCallable CollectionSet MutableSetMappingMutableMapping MappingViewKeysView ItemsView ValuesViewSequenceMutableSequence ByteStringBufferzcollections.abcrircR[[R"5R5$r)typesys _getframef_localsrrr _get_framelocalsproxyr,Xs  (( ))rc## Sv$rrrrr r.\s5rc # g7frrrrr _coror0^s4c# S7v g7frrrrr _agr3ds cURnUH>nUH/nX4R;dMURUc [s s $ M6 [s $ g)NT)__mro____dict__NotImplemented)CmethodsmromethodBs r _check_methodsr>lsN ))CA#::f%-))  " ! rc8\rSrSrSr\S5r\S5rSr g)rxrcgNrrselfs r __hash__Hashable.__hash__|rc8U[La [US5$[$)NrE)rr>r8clsr9s r __subclasshook__Hashable.__subclasshook__ (?!!Z0 0rN) __name__ __module__ __qualname____firstlineno__ __slots__rrE classmethodrK__static_attributes__rrr rrx-Irr) metaclasscH\rSrSrSr\S5r\S5r\"\ 5r Sr g)r rc## Sv g7frrrCs r __await__Awaitable.__await__s sc8U[La [US5$[$)NrZ)r r>r8rIs r rKAwaitable.__subclasshook__s ) !![1 1rN) rNrOrPrQrRrrZrSrK GenericAlias__class_getitem__rTrrr r r s:I $L1rr cR\rSrSrSr\S5r\SSj5rSr\ S5r Sr g) r rc[e)zSSend a value into the coroutine. Return next yielded value or raise StopIteration.  StopIterationrDvalues r sendCoroutine.send rNcLUc UcUeU"5nUbURU5nUe)zWRaise an exception in the coroutine. Return next yielded value or raise StopIteration. with_tracebackrDtypvaltbs r throwCoroutine.throw4 ;z %C >$$R(C rcpUR[5 [S5e![[4a gf=f).Raise GeneratorExit inside coroutine. zcoroutine ignored GeneratorExitNrq GeneratorExit RuntimeErrorrdrCs r closeCoroutine.close; B JJ} %@A A}-    "55c>U[La[USSSS5$[$)NrZrgrqry)r r>r8rIs r rKCoroutine.__subclasshook__s# ) !![&'7K KrNN) rNrOrPrQrRrrgrqryrSrKrTrrr r r sGI   Brr cH\rSrSrSr\S5r\S5r\"\ 5r Sr g)r rc[5$r)rrCs r __aiter__AsyncIterable.__aiter__s rc8U[La [US5$[$)Nr)r r>r8rIs r rKAsyncIterable.__subclasshook__s - !![1 1rN) rNrOrPrQrRrrrSrKr^r_rTrrr r r s:I $L1rr c>\rSrSrSr\S5rSr\S5r Sr g)rrc# [e7f)z@Return the next item or raise StopAsyncIteration when exhausted.StopAsyncIterationrCs r __anext__AsyncIterator.__anext__s ! r4cU$rrrCs r rAsyncIterator.__aiter__ rc:U[La [USS5$[$)Nrr)rr>r8rIs r rKAsyncIterator.__subclasshook__s - !![+> >rN) rNrOrPrQrRrrrrSrKrTrrr rrs2I!!rrcX\rSrSrSrSr\S5r\S Sj5rSr \ S5r Sr g) rrc@# URS5IShvN $N7f)z`Return the next item from the asynchronous generator. When exhausted, raise StopAsyncIteration. N)asendrCs r rAsyncGenerator.__anext__sZZ%%%%s c# [e7f)zeSend a value into the asynchronous generator. Return next yielded value or raise StopAsyncIteration. rres r rAsyncGenerator.asends ! r4NcT# Uc UcUeU"5nUbURU5nUe7f)ziRaise an exception in the asynchronous generator. Return next yielded value or raise StopAsyncIteration. rkrms r athrowAsyncGenerator.athrows7 ;z %C >$$R(C &(c# UR[5IShvN [S5eN![[4a gf=f7f)ruNz,asynchronous generator ignored GeneratorExit)rrwrxrrCs r acloseAsyncGenerator.aclosesG O++m, , ,MN N -12   s0A.,. A.AAAAc@U[La[USSSSS5$[$)Nrrrrr)rr>r8rIs r rKAsyncGenerator.__subclasshook__s* . !![+")8X? ?rr) rNrOrPrQrRrrrrrrSrKrTrrr rrsNI& !!   OrrcH\rSrSrSr\S5r\S5r\"\ 5r Sr g)rirc# # g7frrrCs r __iter__Iterable.__iter__r1c8U[La [US5$[$)Nr)rr>r8rIs r rKIterable.__subclasshook__$rMrN) rNrOrPrQrRrrrSrKr^r_rTrrr rrs:I $L1rrc>\rSrSrSr\S5rSr\S5r Sr g)ri-rc[e)zKReturn the next item from the iterator. When exhausted, raise StopIterationrcrCs r __next__Iterator.__next__1s rcU$rrrCs r rIterator.__iter__6rrc:U[La [USS5$[$)Nrr)rr>r8rIs r rKIterator.__subclasshook__9s (?!!Z< <rN) rNrOrPrQrRrrrrSrKrTrrr rr-s2Irrc8\rSrSrSr\S5r\S5rSr g)riPrc# # g7frrrCs r __reversed__Reversible.__reversed__Trr1c:U[La [USS5$[$)Nrr)rr>r8rIs r rKReversible.__subclasshook__Ys * !!^Z@ @rN) rNrOrPrQrRrrrSrKrTrrr rrPs-IrrcX\rSrSrSrSr\S5r\S Sj5rSr \ S5r Sr g) ri`rc$URS5$)zNReturn the next item from the generator. When exhausted, raise StopIteration. N)rgrCs r rGenerator.__next__dsyyrc[e)zSSend a value into the generator. Return next yielded value or raise StopIteration. rcres r rgGenerator.sendjrirNcLUc UcUeU"5nUbURU5nUe)zWRaise an exception in the generator. Return next yielded value or raise StopIteration. rkrms r rqGenerator.throwqrsrcpUR[5 [S5e![[4a gf=f)z.Raise GeneratorExit inside generator. zgenerator ignored GeneratorExitNrvrCs r ryGenerator.close~r{r|c@U[La[USSSSS5$[$)Nrrrgrqry)rr>r8rIs r rKGenerator.__subclasshook__s* ) !!Z"('7< <rr) rNrOrPrQrRrrrgrqryrSrKrTrrr rr`sNI    Brrc8\rSrSrSr\S5r\S5rSr g)rircgrBrrCs r __len__ Sized.__len__rGrc8U[La [US5$[$)Nr)rr>r8rIs r rKSized.__subclasshook__s %<!!Y/ /rN) rNrOrPrQrRrrrSrKrTrrr rrrUrrcH\rSrSrSr\S5r\S5r\"\ 5r Sr g)rircgNFr)rDxs r __contains__Container.__contains__rc8U[La [US5$[$)Nr)rr>r8rIs r rKContainer.__subclasshook__s ) !!^4 4rN) rNrOrPrQrRrrrSrKr^r_rTrrr rrs:I $L1rrc(\rSrSrSr\S5rSrg)rirc<U[La[USSS5$[$)Nrrr)rr>r8rIs r rKCollection.__subclasshook__s! * !!i^L LrN)rNrOrPrQrRrSrKrTrrr rrsIrrcD\rSrSrSr\S\S\4Sj5r\ S5r Sr g)r$irflagsreturnc[erNotImplementedError)rDrs r __buffer__Buffer.__buffer__s!!rc8U[La [US5$[$)Nr)r$r>r8rIs r rKBuffer.__subclasshook__s &=!!\2 2rN) rNrOrPrQrRrint memoryviewrrSrKrTrrr r$r$s;I"":""rr$cN^\rSrSrSrSrU4SjrU4SjrSrU4Sjr Sr U=r $)_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)``. rc >[U[5(a[U5S:Xd [S5eUup4[U[[45(a/UQUP7nO[ U5(d[SU35e[ TU]XU5$)Nz6Callable must be used as Callable[[arg, ...], result].zFExpected a list of types, an ellipsis, ParamSpec, or Concatenate. Got ) isinstancetuplelen TypeErrorlist_is_param_exprsuper__new__)rJoriginargst_argst_result __class__s r r_CallableGenericAlias.__new__s4''CINHJ J fudm , ,&V&X&D''>>DXGH HwsD11rc @>[UR5S:Xa+[URS5(a[TU]5$SSR URSSVs/sHn[ U5PM sn5S[ URS5S3$s snf)Nrrzcollections.abc.Callable[[z, z], ])r__args__rr__repr__join _type_repr)rDars r r_CallableGenericAlias.__repr__s t}}  "~dmmA6F'G'G7#% %YYt}}Sb7IJ7I! 1 7IJKLCdmmB/014 5Js#B cURn[U5S:Xa[US5(d[USS5US4n[[ U44$)Nrrr)rrrrrr)rDrs r __reduce__ _CallableGenericAlias.__reduce__sL}}D Q>$q'#:#:Sb ?DH,D$x&666rc>[U[5(dU4n[TU] U5Rn[US[[ 45(d USnUSSnXC4n[ [[U55$)Nrr)rrr __getitem__rrrr)rDitemnew_argsrrrs r r!_CallableGenericAlias.__getitem__sr $&&7D7&t,55(1+t}55|Hcr]F)H$XuX??r) rNrOrPrQ__doc__rRrrrrrT __classcell__rs@r rrs*I 257 @@rrc^T[Lag[T[5(ag[T5mSnTRS:H=(a [ U4SjU55$)ztChecks if obj matches either a list of types, ``...``, ``ParamSpec`` or ``_ConcatenateGenericAlias`` from typing.py T) ParamSpec_ConcatenateGenericAliastypingc3B># UHnTRU:Hv M g7fr)rN).0nameobjs r !_is_param_expr.. s-Uutclld.Bus)Ellipsisrrr(rOany)rnamess` r rrsL h#t s)C 5E >>X % U#-Uu-U*UUrc[U[5(a7URS:Xa UR$URSUR3$U[Lag[U[ 5(a UR $[U5$)zReturn the repr() of an object, special-casing types (internal helper). Copied from :mod:`typing` since collections.abc shouldn't depend on that module. (Keep this roughly in sync with the typing version.) builtins.z...)rr(rOrPr FunctionTyperNrepr)rs r rrsq#t >>Z '## #..!3#3#3"455 h#|$$|| 9rcH\rSrSrSr\S5r\S5r\"\ 5r Sr g)ri!rcgrr)rDrkwdss r __call__Callable.__call__%rrc8U[La [US5$[$)Nr)rr>r8rIs r rKCallable.__subclasshook__)rMrN) rNrOrPrQrRrrrSrKrr_rTrrr rr!s;I $$9:rrc\rSrSrSrSrSrSrSrSr Sr \ S 5r S r \ rS rS r\rS rSrSr\rSrSrg)ri5aBA 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. rc[U[5(d[$[U5[U5:agUH nX!;dM g gNFTrrr8rrDotherelems r __le__ Set.__le__Bs@%%%! ! t9s5z !D rc[U[5(d[$[U5[U5:=(a UR U5$rrrr8rr'rDr%s r __lt__ Set.__lt__L6%%%! !4y3u:%<$++e*<# UHoT;dM Uv M g7frrr rfrDs r rSet.__and__..qs"MeU}55es  rrr8r;r+s` r __and__ Set.__and__ns-%**! !"""Me"MMMrc$UH nX ;dM g g)z1Return True if two sets have a null intersection.FTr)rDr%rfs r isdisjointSet.isdisjointusE}rcn[U[5(d[$SX45nURU5$)Nc36# UHoHo"v M M g7frr)r ses r rSet.__or__..s5Mq1a1MsrA)rDr%chains r __or__ Set.__or__|s2%**! !5TM5""5))rc^[T[5(d,[T[5(d[$UR T5mUR U4SjU55$)Nc38># UHnUT;dM Uv M g7frr)r rfr%s r rSet.__sub__..s #:dU&+5&8$)5d  rrrr8r;r+s `r __sub__ Set.__sub__sR%%%eX..%%''.E""#:d#:: :rc^[U[5(d,[U[5(d[$TR U5nTR U4SjU55$)Nc38># UHnUT;dM Uv M g7frrr?s r rSet.__rsub__..s #9eU&+4&7$)5erRrSr+s` r __rsub__ Set.__rsub__sR%%%eX..%%''.E""#9e#99 9rc[U[5(d,[U[5(d[$UR U5nX- X- -$rrSr+s r __xor__ Set.__xor__sA%%%eX..%%''.E ..rc[RnSU-S-n[U5nSUS--nXB-nUH"n[U5nXFUS-- S- S--nXB-nM$ XDS- US- - -nUS -S -nXB-nXA:aXBS--nUS :XaS nU$) 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. rr%iMriM[l4~2 i i6ri8#)r)maxsizerhash)rDMAXMASKnhrhxs r _hash Set._hashskk3w{ I !a%  AaB b/H,; ;A IA 2g!r' "" I !  7 MA 7ArN)rNrOrPrQrrRr'r,r1r0r6rSr;rB__rand__rErM__ror__rTrYr\__rxor__rirTrrr rr5stI= = > N H* G:9/Hrrcf\rSrSrSrSr\S5r\S5rSr Sr Sr S r S r S rS rSrg )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. rc[e)zAdd an element.rres r addMutableSet.add "!rc[e)z8Remove an element. Do not raise an exception if absent.rres r discardMutableSet.discardrrrcFX;a [U5eURU5 g)z5Remove an element. If not a member, raise a KeyError.N)KeyErrorrtres r removeMutableSet.removes  5/ ! Urc[U5n[U5nUR U5 U$![a [Sef=f)z2Return the popped value. Raise KeyError if empty.N)iternextrdrwrtrDr:rfs r popMutableSet.popsE $Z %HE U  % $ %s +=cJUR5 M![a gf=f)z6This is slow (creates N new iterators!) but effective.N)r~rwrCs r clearMutableSet.clears*       ""c:UHnURU5 M U$r)rpr}s r __ior__MutableSet.__ior__sE HHUO rc>X- HnURU5 M U$r)rtr}s r __iand__MutableSet.__iand__siE LL   rcXLaUR5 U$[U[5(dURU5nUH,nX ;aUR U5 MUR U5 M. U$r)rrrr;rtrpr}s r __ixor__MutableSet.__ixor__sc : JJL b#&&((,=LL'HHUO   rcfXLaUR5 U$UHnURU5 M U$r)rrtr}s r __isub__MutableSet.__isub__ s4 : JJL  U# rN)rNrOrPrQrrRrrprtrxr~rrrrrrTrrr rrsW I""""   rrc\\rSrSrSrSrSr\S5rS Sjr Sr S r S r S r S rSrSrg)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__. r@c[errwrDkeys r rMapping.__getitem__$rNc0X$![a Us$f=f)z D[k] if k in D, else d. d defaults to None.rrDrdefaults r get Mapping.get(s# 9  N s  c.X g![a gf=fNTFrrs r rMapping.__contains__/s%  I  s  c[U5$)z:D.keys() -> a set-like object providing a view on D's keys)rrCs r keys Mapping.keys7s ~rc[U5$)z a set-like object providing a view on D's items)rrCs r items Mapping.items;s rc[U5$)z6D.values() -> an object providing a view on D's values)r rCs r valuesMapping.values?s $rc[U[5(d[$[UR 55[UR 55:H$r)rrr8dictrr+s r r6Mapping.__eq__Cs6%))! !DJJL!T%++-%888rr)rNrOrPrQrrR__abc_tpflags__rrrrrrrr6rrTrrr rrsLIO 9 Lrrc:\rSrSrSrSrSrSr\"\ 5r Sr g)riN_mappingcXlgrr)rDmappings r __init__MappingView.__init__Rs rc,[UR5$r)rrrCs r rMappingView.__len__Us4==!!rc$SRU5$)Nz&{0.__class__.__name__}({0._mapping!r}))formatrCs r rMappingView.__repr__Xs7>>tDDrN) rNrOrPrQrRrrrrSr^r_rTrrr rrNs$I "E$L1rrc4\rSrSrSr\S5rSrSrSr g)ri^rc[U5$rsetr9s r r;KeysView._from_iterableb 2wrcXR;$rrrs r rKeysView.__contains__fsmm##rc#8# URShvN gN7frrrCs r rKeysView.__iter__is==  s N rNrOrPrQrRrSr;rrrTrrr rr^s#I$!rrc4\rSrSrSr\S5rSrSrSr g)riprc[U5$rrr9s r r;ItemsView._from_iterabletrrcfUup#URUnXCL=(d XC:H$![a gf=fr)rrw)rDrrrfvs r rItemsView.__contains__xsA  , c"A:+ +  s # 00c#V# URHnXRU4v M g7frrrs r rItemsView.__iter__s%==C c*+ +!s')Nrrrr rrps#I,,rrc$\rSrSrSrSrSrSrg)r irc^URHnURUnX1LdX1:XdM g grr)rDrfrrs r rValuesView.__contains__s/==C c"AzQZ!rc#T# URHnURUv M g7frrrs r rValuesView.__iter__s"==C--$ $!rN)rNrOrPrQrRrrrTrrr r r sI%rr cv\rSrSrSrSr\S5r\S5r\ "5r \ 4Sjr Sr Sr S S jrS S jrSrg )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__. rc[errrDrrfs r __setitem__MutableMapping.__setitem__rrc[errrs r __delitem__MutableMapping.__delitem__rrcVXnX U$![a X RLaeUs$f=f)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. )rw_MutableMapping__marker)rDrrrfs r r~MutableMapping.pops= IE  L  --'N s  ((ch[[U55nXnX X4$![a [Sef=f)zpD.popitem() -> (k, v), remove and return some (key, value) pair as a 2-tuple; but raise KeyError if D is empty. N)r|r{rdrwrs r popitemMutableMapping.popitemsD %tDz"C  Iz  % $ %s1cJUR5 M![a gf=f)z,D.clear() -> None. Remove all items from D.N)rrwrCs r rMutableMapping.clears*     rc [U[5(aUH nXX'M O>[US5(aUR5H nXX'M OUH up4X@U'M UR 5H up4X@U'M g)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)rDr%rrrfs r updateMutableMapping.updatesx eW % %!J  UF # #zz|!J $$ !S $**,JCI'rNc6X$![a X U'U$f=f)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 )rr)rNrOrPrQrrRrrrobjectrr~rrrrrTrrr rrsYIxH'  $rrcR\rSrSrSrSrSr\S5rSr Sr Sr S S jr S r Srg ) r!iz~All the operations on a read-only sequence. Concrete subclasses must override __new__ or __init__, __getitem__, and __len__. r c[er IndexErrorrDindexs r rSequence.__getitem__rc#P# SnXnUv US- nM![a gf=f7f)Nrr%r)rDirs r rSequence.__iter__s?  GQ   s& #&#&c,UHnX!LdX!:XdM g grr)rDrfrs r rSequence.__contains__ sAzQZrc#`# [[[U555H nXv M g7fr)reversedranger)rDrs r rSequence.__reversed__s$%D *+A'M,s,.NcUbUS:a[[U5U-S5nUbUS:aU[U5- nUnUbXC:a!XnXQLdXQ:XaU$US- nUcMXC:aM![e![a [ef=f)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. rr%)maxrr ValueError)rDrfstartstoprrs r rSequence.indexs  D E)1-E  q CI D lah GzQZ FAlah    sA** A<;A<c.^[U4SjU55$)zBS.count(value) -> integer -- return number of occurrences of valuec3@># UHoTLdUT:XdMSv M g7f)r%Nr)r rrfs r r!Sequence.count..0s?d5jAJ11ds )sumres `r countSequence.count.s?d???r)rN)rNrOrPrQrrRrrrrrrrrrTrrr r!r!sA IO .@rr!c4^\rSrSrU4SjrU4SjrSrU=r$)_DeprecateByteStringMetai7c \>US:waSSKnURSSS9 [TU] "XX#40UD6$)Nr#rcollections.abc.ByteStringrx)warnings _deprecatedrr)rJr bases namespacekwargsrrs r r _DeprecateByteStringMeta.__new__8s? <    , ! ws%EfEErcJ>SSKnURSSS9 [TU] U5$)Nrr r r)rrr__instancecheck__)rJinstancerrs r r*_DeprecateByteStringMeta.__instancecheck__Bs1 (  w(22rr)rNrOrPrQrrrTrrs@r rr7sF33rrc\rSrSrSrSrSrg)r#iKzEThis unifies bytes and bytearray. XXX Should add all their methods. rN)rNrOrPrQrrRrTrrr r#r#Ks Irr#cz\rSrSrSrSr\S5r\S5r\S5r Sr Sr S r S r SS jrS rS rSrg)r"iWzAll the operations on a read-write sequence. Concrete subclasses must provide __new__ or __init__, __getitem__, __setitem__, __delitem__, __len__, and insert(). rc[errrDrrfs r rMutableSequence.__setitem__`rrc[errrs r rMutableSequence.__delitem__drrc[e)z3S.insert(index, value) -- insert value before indexrrs r insertMutableSequence.inserths rc:UR[U5U5 g)z:S.append(value) -- append value to the end of the sequenceN)r!rres r appendMutableSequence.appendms CIu%rcJUR5 M![a gf=f)z,S.clear() -> None -- remove all items from SN)r~rrCs r rMutableSequence.clearqs*     rcv[U5n[US-5HnXU- S- XsX'XU- S- 'M g)z!S.reverse() -- reverse *IN PLACE*rr%N)rr)rDrfrs r reverseMutableSequence.reverseysA Iq!tA#'!A; DGTA#a%[rcVXLa [U5nUHnURU5 M g)zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)rr$)rDrrs r extendMutableSequence.extends% >&\FA KKNrcXnX U$)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)rDrrs r r~MutableSequence.pops K Krc&XRU5 g)zcS.remove(value) -- remove first occurrence of value. Raise ValueError if the value is not present. N)rres r rxMutableSequence.removes E" #rc(URU5 U$r)r,)rDrs r __iadd__MutableSequence.__iadd__s F rN)r)rNrOrPrQrrRrrrr!r$rr)r,r~rxr3rTrrr r"r"Wsk I&8 $ rr")Wrabcrrr)r(rrr^ EllipsisTyper r__all__rNr{bytes_iterator bytearraybytearray_iteratorrdict_keyiteratorrdict_valueiteratorrdict_itemiterator list_iteratorrlist_reverseiteratorrrange_iteratorlongrange_iteratorr set_iterator str_iteratortuple_iteratorzip zip_iterator dict_keys dict_values dict_itemsr7 mappingproxyr,framelocalsproxy generatorr0 coroutineryr3async_generatorr>rr r registerr rrrrrrrrrr$rrrrr frozensetrrrrrr rrr!rstrrrr#bytesr"rrr rSs!>( 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 4@L4@l V$;;(G*GT YMM` C 1j1f!" 2% 2 !{C ! ), S,, : %j %  K OWOd =@z:=@~ %#%*3w3(%= E I?h?D#r