o X|j~@sdZddlmZmZddlZeeeZedZ ddZ ee Z [ gdZ dZ eed ZeeeZeeiZeeiZeeiZeegZeeegZeeedZeeed d >ZeeeZeed Z eed Z!eee"Z#eiZ$eiZ%eiZ&eej'Z(eddZ)ddZ*e*Z*ee*Z+e*,[*ddZ-e-Z-ee-Z.[-ddZ/GdddedZ0GdddedZ1Gddde1Z2e23e+GdddedZ4Gdd d e4Z5Gd!d"d"e5Z6e63e.Gd#d$d$edZ7Gd%d&d&e7Z8e83ee83ee83ee83ee83ee83ee83ee83ee83ee83ee83e e83e!e83e#Gd'd(d(e7Z9Gd)d*d*e8Z:e:3e)Gd+d,d,edZ;Gd-d.d.edZd3d4Z?d5d6Z@d7d8ZAGd9d:d:edZBGd;d<dd>eCZEeE3eGd?d@d@e=ZFeF3e(GdAdBdBe;ZGGdCdDdDeGeCZHeH3e$GdEdFdFeGeCZIeI3e&GdGdHdHeGe=ZJeJ3e%GdIdJdJeFZKeK3eLGdKdLdLe9e=ZMeM3eNeM3eOeM3eeM3ePGdMdNdNeMZQeQ3eReQ3eGdOdPdPeMZSeS3eeS3edS)QzjAbstract Base Classes (ABCs) for collections, according to PEP 3119. Unit tests are in test_collections. )ABCMetaabstractmethodN.cCsdSNrrr-/usr/local/lib/python3.10/_collections_abc.py_fsr) Awaitable Coroutine AsyncIterable AsyncIteratorAsyncGeneratorHashableIterableIterator Generator ReversibleSized ContainerCallable CollectionSet MutableSetMappingMutableMapping MappingViewKeysView ItemsView ValuesViewSequenceMutableSequence ByteStringzcollections.abcirccsdVSrrrrrr>sr$csdSrrrrrr_coro@sr%cCs dVdSrrrrrr_agFs r&cGsN|j}|D]}|D]}||jvr|j|durtSnq tSqdS)NT)__mro____dict__NotImplemented)CZmethodsmromethodBrrr_check_methodsNs  r.c@(eZdZdZeddZeddZdS)r rcCdSNrrselfrrr__hash__^zHashable.__hash__cC|tur t|dStS)Nr4)r r.r)clsr*rrr__subclasshook__b zHashable.__subclasshook__N)__name__ __module__ __qualname__ __slots__rr4 classmethodr9rrrrr Z  r ) metaclassc@0eZdZdZeddZeddZeeZ dS)rrccs dVdSrrr2rrr __await__ms zAwaitable.__await__cCr6)NrC)rr.r)r7rrrr9qr:zAwaitable.__subclasshook__N) r;r<r=r>rrCr?r9 GenericAlias__class_getitem__rrrrri   rc@s>eZdZdZeddZed ddZddZed d Z dS) r rcCt)zcSend a value into the coroutine. Return next yielded value or raise StopIteration.  StopIterationr3valuerrrsend~zCoroutine.sendNcC0|dur |dur ||}|dur||}|)zgRaise an exception in the coroutine. Return next yielded value or raise StopIteration. Nwith_tracebackr3ZtypZvaltbrrrthrow zCoroutine.throwc C.z |tWtdttfyYdSw).Raise GeneratorExit inside coroutine. zcoroutine ignored GeneratorExitNrS GeneratorExitrI RuntimeErrorr2rrrclose  zCoroutine.closecCs|tur t|ddddStS)NrCrLrSrZ)r r.r)r7rrrr9szCoroutine.__subclasshook__NN) r;r<r=r>rrLrSrZr?r9rrrrr zs    r c@rB)r rcCstSr)r r2rrr __aiter__szAsyncIterable.__aiter__cCr6)Nr])r r.r)r7rrrr9r:zAsyncIterable.__subclasshook__N) r;r<r=r>rr]r?r9rDrErrrrr rFr c@0eZdZdZeddZddZeddZdS) r rct)z@Return the next item or raise StopAsyncIteration when exhausted.StopAsyncIterationr2rrr __anext__szAsyncIterator.__anext__cC|Srrr2rrrr]zAsyncIterator.__aiter__cC|tur t|ddStS)Nrbr])r r.r)r7rrrr9 zAsyncIterator.__subclasshook__N) r;r<r=r>rrbr]r?r9rrrrr  r c@FeZdZdZddZeddZed ddZd d Ze d d Z dS)r rcs|dIdHS)zpReturn the next item from the asynchronous generator. When exhausted, raise StopAsyncIteration. N)asendr2rrrrbszAsyncGenerator.__anext__cr_)zuSend a value into the asynchronous generator. Return next yielded value or raise StopAsyncIteration. r`rJrrrriszAsyncGenerator.asendNcs2|dur|dur ||}|dur||}|)zyRaise an exception in the asynchronous generator. Return next yielded value or raise StopAsyncIteration. NrOrQrrrathrows zAsyncGenerator.athrowc s6z |tIdHWtdttfyYdSw)rVNz,asynchronous generator ignored GeneratorExit)rjrXrarYr2rrracloseszAsyncGenerator.aclosecC|tur t|dddddStS)Nr]rbrirjrk)r r.r)r7rrrr9 zAsyncGenerator.__subclasshook__r\) r;r<r=r>rbrrirjrkr?r9rrrrr     r c@rB)rrccdSrrr2rrr__iter__zIterable.__iter__cCr6)Nrp)rr.r)r7rrrr9r:zIterable.__subclasshook__N) r;r<r=r>rrpr?r9rDrErrrrrs   rc@r^) rrcCrG)zKReturn the next item from the iterator. When exhausted, raise StopIterationrHr2rrr__next__zIterator.__next__cCrcrrr2rrrrprdzIterator.__iter__cCre)Nrprr)rr.r)r7rrrr9rfzIterator.__subclasshook__N) r;r<r=r>rrrrpr?r9rrrrrrgrc@r/)rrccrorrr2rrr __reversed__6rqzReversible.__reversed__cCre)Nrtrp)rr.r)r7rrrr9;rfzReversible.__subclasshook__N)r;r<r=r>rrtr?r9rrrrr2s  rc@rh)rrcCs |dS)z^Return the next item from the generator. When exhausted, raise StopIteration. N)rLr2rrrrrFs zGenerator.__next__cCrG)zcSend a value into the generator. Return next yielded value or raise StopIteration. rHrJrrrrLLrMzGenerator.sendNcCrN)zgRaise an exception in the generator. Return next yielded value or raise StopIteration. NrOrQrrrrSSrTzGenerator.throwc CrU)z.Raise GeneratorExit inside generator. zgenerator ignored GeneratorExitNrWr2rrrrZ`r[zGenerator.closecCrl)NrprrrLrSrZ)rr.r)r7rrrr9jrmzGenerator.__subclasshook__r\) r;r<r=r>rrrrLrSrZr?r9rrrrrBrnrc@r/)rrcCr0r1rr2rrr__len__yr5z Sized.__len__cCr6)Nru)rr.r)r7rrrr9}r:zSized.__subclasshook__N)r;r<r=r>rrur?r9rrrrrur@rc@rB)rrcCr0NFr)r3xrrr __contains__r5zContainer.__contains__cCr6)Nrx)rr.r)r7rrrr9r:zContainer.__subclasshook__N) r;r<r=r>rrxr?r9rDrErrrrrrFrc@seZdZdZeddZdS)rrcCs|tur t|dddStS)Nrurprx)rr.r)r7rrrr9szCollection.__subclasshook__N)r;r<r=r>r?r9rrrrrsrcsLeZdZdZdZfddZeddZfddZd d Z d d Z Z S) _CallableGenericAliasz Represent `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)``. rcsft|tr t|dkstd|\}}t|tr g||R}n t|s+td|t|||S)Nz6Callable must be used as Callable[[arg, ...], result].FExpected a list of types, an ellipsis, ParamSpec, or Concatenate. Got ) isinstancetuplelen TypeErrorlist_is_param_exprsuper__new__)r8originargst_argst_result __class__rrrs z_CallableGenericAlias.__new__cCsjg}|jD](}t|trt|tsqt|dr$t|jtr$||jqt|r-| |qtt |S)N__parameters__) __args__r|typerDhasattrrr}extend_is_typevarlikeappenddictfromkeys)r3Zparamsargrrrrs  z$_CallableGenericAlias.__parameters__cs\t|jdkrt|jdrtSdddd|jddDdt|jdd S) Nrzrzcollections.abc.Callable[[z, cSsg|]}t|qSr) _type_repr).0arrr sz2_CallableGenericAlias.__repr__..z], ])r~rrr__repr__joinrr2rrrrs  z_CallableGenericAlias.__repr__cCsB|j}t|dkrt|dst|dd|df}tt|ffS)Nrzrr)rr~rrryr)r3rrrr __reduce__s z _CallableGenericAlias.__reduce__c st|j}|dkrt|dt|ts|f}|dkr0t|jdr0|r0t|ds0t|f}t|}||krNtd||kr@dndd|d|d |tt|j|g}|j D]^}t|t rmt|t sm| |q[t |rt|r|}t|std |n$|}nt|d rt|jtr|j}|rtfd d |D}||}t|tr||q[| |q[t|dts|d}|dd} | |f}ttt|S)Nrz is not a generic classr"zToo ZmanyZfewz arguments for z ; actual z , expected r{rc3s|]}|VqdSrr)rrwZsubstrr sz4_CallableGenericAlias.__getitem__..r)r~rrr|r}rrrziprrrDrrrrryr) r3itemZ param_lenZitem_lenZnew_argsrZ subparamsZsubargsrrrrr __getitem__s`           z!_CallableGenericAlias.__getitem__) r;r<r=__doc__r>rpropertyrrrr __classcell__rrrrrys   rycCst|}|jdko |jdvS)Ntyping>ZTypeVar ParamSpec)rr<r;)robjrrrr s rcsFturdSttr dStd}jdko"tfdd|DS)z|Checks if obj matches either a list of types, ``...``, ``ParamSpec`` or ``_ConcatenateGenericAlias`` from typing.py T)rZ_ConcatenateGenericAliasrc3s|]}j|kVqdSr)r;)rnamerrrrsz!_is_param_expr..)Ellipsisr|rrr<any)rnamesrrrrs  rcCsbt|tr t|St|tr|jdkr|jS|jd|jS|tur%dSt|tr-|jSt|S)zReturn the repr() of an object, special-casing types (internal helper). Copied from :mod:`typing` since collections.abc shouldn't depend on that module. builtins.z...) r|rDreprrr<r=r FunctionTyper;rrrrrs    rc@rB)rrcOr0rvr)r3rkwdsrrr__call__2r5zCallable.__call__cCr6)Nr)rr.r)r7rrrr96r:zCallable.__subclasshook__N) r;r<r=r>rrr?r9ryrErrrrr.rFrc@seZdZdZdZddZddZddZd d Zd d Z e d dZ ddZ e Z ddZddZeZddZddZddZeZddZdS)raZA 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. rcCs>t|tstSt|t|krdS|D] }||vrdSqdSNFTr|rr)r~r3otherZelemrrr__le__O z Set.__le__cCs(t|tstSt|t|ko||Srr|rr)r~rr3rrrr__lt__Y z Set.__lt__cCs(t|tstSt|t|ko||Sr)r|rr)r~__ge__rrrr__gt__^rz Set.__gt__cCs>t|tstSt|t|krdS|D] }||vrdSqdSrrrrrrrcrz Set.__ge__cCs(t|tstSt|t|ko||Srrrrrr__eq__mrz Set.__eq__cCs||S)zConstruct an instance of the class from any iterable input. Must override this method if the class constructor signature does not accept an iterable for an input. rr8itrrr_from_iterablerszSet._from_iterablecs&t|tstSfdd|DS)Nc3s|] }|vr|VqdSrrrrKr2rrr~szSet.__and__..r|rr)rrrr2r__and__{ z Set.__and__cCs|D] }||vr dSqdS)z1Return True if two sets have a null intersection.FTr)r3rrKrrr isdisjoints zSet.isdisjointcCs*t|tstSdd||fD}||S)Ncss|] }|D]}|VqqdSrr)rserrrrszSet.__or__..r)r3rZchainrrr__or__s  z Set.__or__cs:ttstts tS||fdd|DS)Nc3|] }|vr|VqdSrrrrrrr zSet.__sub__..r|rrr)rrrrr__sub__   z Set.__sub__cs:t|tst|ts tS|}fdd|DS)Nc3rrrrr2rrrrzSet.__rsub__..rrrr2r__rsub__rz Set.__rsub__cCs2t|tst|ts tS||}||||BSrrrrrr__xor__s   z Set.__xor__cCstj}d|d}t|}d|d}||M}|D]}t|}|||d>AdAdN}||M}q||d?|d?AN}|d d }||M}||krN||d8}|d krTd }|S) a+Compute 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. rzr"iMriM[l4~2 i i6ri8#)sysmaxsizer~hash)r3ZMAXZMASKnhrwZhxrrr_hashs"     z Set._hashN)r;r<r=rr>rrrrrr?rr__rand__rr__ror__rrr__rxor__rrrrrrBs(     rc@sdeZdZdZdZeddZeddZddZd d Z d d Z d dZ ddZ ddZ ddZdS)raA 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. rcCrG)zAdd an element.NotImplementedErrorrJrrraddrszMutableSet.addcCrG)z8Remove an element. Do not raise an exception if absent.rrJrrrdiscardrszMutableSet.discardcCs||vrt|||dS)z5Remove an element. If not a member, raise a KeyError.N)KeyErrorrrJrrrremoveszMutableSet.removecCs8t|}zt|}Wn tytdw|||S)z2Return the popped value. Raise KeyError if empty.N)iternextrIrrr3rrKrrrpops   zMutableSet.popcC"z |qtyYdSw)z6This is slow (creates N new iterators!) but effective.TN)rrr2rrrclear zMutableSet.clearcCs|D]}||q|Sr)rrrrr__ior__s zMutableSet.__ior__cCs||D]}||q|Sr)rrrrr__iand__s  zMutableSet.__iand__cCsT||ur ||St|ts||}|D]}||vr"||q||q|Sr)rr|rrrrrrrr__ixor__ s   zMutableSet.__ixor__cCs,||ur ||S|D]}||q |Sr)rrrrrr__isub__s  zMutableSet.__isub__N)r;r<r=rr>rrrrrrrrrrrrrrrs     rc@sZeZdZdZdZdZeddZdddZd d Z d d Z d dZ ddZ ddZ dZdS)rzA 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@cCrGrrr3keyrrrr1r5zMapping.__getitem__NcCs"z||WSty|YSw)z D[k] if k in D, else d. d defaults to None.rr3rdefaultrrrget5s   z Mapping.getcCs$z||WdStyYdSwrrrrrrrx<s   zMapping.__contains__cCt|S)z:D.keys() -> a set-like object providing a view on D's keys)rr2rrrkeysDz Mapping.keyscCr)z a set-like object providing a view on D's items)rr2rrritemsHrz Mapping.itemscCr)z6D.values() -> an object providing a view on D's values)rr2rrrvaluesLrzMapping.valuescCs&t|tstSt|t|kSr)r|rr)rrrrrrrPrzMapping.__eq__r)r;r<r=rr>__abc_tpflags__rrrrxrrrrrtrrrrr$s  rc@s0eZdZdZddZddZddZeeZ dS) r_mappingcCs ||_dSrr)r3mappingrrr__init__^ zMappingView.__init__cCs t|jSr)r~rr2rrrruarzMappingView.__len__cCs d|S)Nz&{0.__class__.__name__}({0._mapping!r}))formatr2rrrrdrzMappingView.__repr__N) r;r<r=r>rrurr?rDrErrrrrZs  rc@,eZdZdZeddZddZddZdS) rrcCt|SrsetrrrrrnrzKeysView._from_iterablecCs ||jvSrrrrrrrxrrzKeysView.__contains__ccs|jEdHdSrrr2rrrrpuszKeysView.__iter__Nr;r<r=r>r?rrxrprrrrrjs   rc@r) rrcCrrrrrrrrrzItemsView._from_iterablecCs<|\}}z|j|}Wn tyYdSw||up||kSrv)rr)r3rrrKvrrrrxs zItemsView.__contains__ccs"|jD] }||j|fVqdSrrrrrrrps zItemsView.__iter__Nrrrrrr|s   rc@s eZdZdZddZddZdS)rrcCs0|jD]}|j|}||us||krdSqdSNTFr)r3rKrrrrrrxs  zValuesView.__contains__ccs|jD]}|j|VqdSrrrrrrrps zValuesView.__iter__N)r;r<r=r>rxrprrrrrs rc@sbeZdZdZdZeddZeddZeZ e fddZ d d Z d d Z dd dZ dddZdS)rzA 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__. rcCrGrrr3rrKrrr __setitem__r5zMutableMapping.__setitem__cCrGrrrrrr __delitem__r5zMutableMapping.__delitem__cCs:z||}Wnty||jur|YSw||=|S)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. )r_MutableMapping__marker)r3rrrKrrrrs   zMutableMapping.popcCs<ztt|}Wn tytdw||}||=||fS)zD.popitem() -> (k, v), remove and return some (key, value) pair as a 2-tuple; but raise KeyError if D is empty. N)rrrIrr rrrpopitems zMutableMapping.popitemcCr)z,D.clear() -> None. Remove all items from D.TN)rrr2rrrrrzMutableMapping.clearcKs|t|tr|D]}||||<qnt|dr$|D]}||||<qn |D]\}}|||<q&|D]\}}|||<q3dS)aK 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: 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)r|rrrr)r3rrrrKrrrupdates      zMutableMapping.updateNcCs(z||WSty|||<Y|Sw)z@D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in Drrrrr setdefaults    zMutableMapping.setdefault)rr)r;r<r=rr>rr r objectr rrrrrrrrrrs    rc@sNeZdZdZdZdZeddZddZdd Z d d Z dddZ ddZ d S)rzAll the operations on a read-only sequence. Concrete subclasses must override __new__ or __init__, __getitem__, and __len__. r cCrGr IndexErrorr3indexrrrr r5zSequence.__getitem__ccs6d}z ||}|V|d7}qtyYdSw)NrTr"r)r3irrrrrps zSequence.__iter__cCs$|D] }||us ||krdSqdSr r)r3rKrrrrrxs zSequence.__contains__ccs&ttt|D]}||Vq dSr)reversedranger~)r3rrrrrts zSequence.__reversed__rNcCs|dur|dkrtt||d}|dur|dkr|t|7}|}|dus)||krQz||}||us6||kr9|WSWn tyDYtw|d7}|dus)||ks)t)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. Nrr")maxr~r ValueError)r3rKstartstoprrrrrr#s$  zSequence.indexcstfdd|DS)zBS.count(value) -> integer -- return number of occurrences of valuec3s$|] }|us |krdVqdS)r"Nr)rrrKrrr<s"z!Sequence.count..)sumrJrrrcount:szSequence.count)rN) r;r<r=rr>rrrrprxrtrr rrrrrs    rc@seZdZdZdZdS)r zMThis unifies bytes and bytearray. XXX Should add all their methods. rN)r;r<r=rr>rrrrr Dsr c@sreZdZdZdZeddZeddZeddZd d Z d d Z d dZ ddZ dddZ ddZddZdS)rzAll the operations on a read-write sequence. Concrete subclasses must provide __new__ or __init__, __getitem__, __setitem__, __delitem__, __len__, and insert(). rcCrGrrr3rrKrrrr Yr5zMutableSequence.__setitem__cCrGrrrrrrr ]r5zMutableSequence.__delitem__cCrG)z3S.insert(index, value) -- insert value before indexrr!rrrinsertarszMutableSequence.insertcCs|t||dS)z:S.append(value) -- append value to the end of the sequenceN)r"r~rJrrrrfszMutableSequence.appendcCr)z,S.clear() -> None -- remove all items from STN)rrr2rrrrjrzMutableSequence.clearcCsHt|}t|dD]}|||d||||<|||d<q dS)z!S.reverse() -- reverse *IN PLACE*rzr"N)r~r)r3rrrrrreversers,zMutableSequence.reversecCs(||urt|}|D]}||q dS)zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)rr)r3rrrrrrxs  zMutableSequence.extendrcCs||}||=|S)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)r3rrrrrrszMutableSequence.popcCs|||=dS)zvS.remove(value) -- remove first occurrence of value. Raise ValueError if the value is not present. N)rrJrrrrszMutableSequence.removecCs|||Sr)r)r3rrrr__iadd__s zMutableSequence.__iadd__N)r)r;r<r=rr>rr r r"rrr#rrrr$rrrrrPs      r)TrabcrrrrrintrDZ EllipsisTyperr__all__r;rZbytes_iterator bytearrayZbytearray_iteratorrZdict_keyiteratorrZdict_valueiteratorrZdict_itemiteratorZ list_iteratorrZlist_reverseiteratorrZrange_iteratorZlongrange_iteratorrZ set_iteratorZ str_iteratorZtuple_iteratorrZ zip_iteratorZ dict_keysZ dict_valuesZ dict_itemsr(Z mappingproxyZ generatorr%Z coroutinerZr&Zasync_generatorr.r rr registerr r r rrrrrrrryrrrrr frozensetrrrrrrrrrr}str memoryviewr bytesrrrrrs           ) 0              0 i   P 3    R ?      B