a c_Sg@sRdZddlmZmZddlZeeeZgdZ dZ ee dZ ee e Zee iZee iZee iZee gZee egZee edZee edd>Zee eZee d Zee d Zee eZ eiZ!eiZ"eiZ#eej$Z%ed d Z&d dZ'e'Z'ee'Z(e')['ddZ*e*Z*ee*Z+[*ddZ,GdddedZ-GdddedZ.Gddde.Z/e/0e(GdddedZ1Gddde1Z2Gddde2Z3e30e+Gd d!d!edZ4Gd"d#d#e4Z5e50e e50ee50ee50ee50ee50ee50ee50ee50ee50ee50ee50ee50e Gd$d%d%e4Z6Gd&d'd'e5Z7e70e&Gd(d)d)edZ8Gd*d+d+edZ9Gd,d-d-e8e4e9Z:Gd.d/d/edZ;Gd0d1d1e:Ze>0eGd4d5d5e:Z?e?0e%Gd6d7d7e8Z@Gd8d9d9e@e<ZAeA0e!Gd:d;d;e@e<ZBeB0e#Gdd?d?e?ZDeD0eEGd@dAdAe6e:ZFeF0eGeF0eHeF0eeF0eIGdBdCdCeFZJeJ0eKeJ0e GdDdEdEeFZLeL0eeL0e dS)FzjAbstract Base Classes (ABCs) for collections, according to PEP 3119. Unit tests are in test_collections. )ABCMetaabstractmethodN) Awaitable Coroutine AsyncIterable AsyncIteratorAsyncGeneratorHashableIterableIterator Generator ReversibleSized ContainerCallable CollectionSet MutableSetMappingMutableMapping MappingViewKeysView ItemsView ValuesViewSequenceMutableSequence ByteStringzcollections.abciccsdVSNr r r r !lib/python3.9/_collections_abc.py:rr#csdSr!r r r r r"_coro<rr$cCs dVdSr!r r r r r"_agBrr%cGsN|j}|D]>}|D],}||jvr|j|dur:tSq qtSq dS)NT)__mro____dict__NotImplemented)CmethodsmromethodBr r r"_check_methodsJs   r.c@s(eZdZdZeddZeddZdS)r r cCsdSNrr selfr r r"__hash__ZszHashable.__hash__cCs|turt|dStS)Nr2)r r.r(clsr)r r r"__subclasshook__^s zHashable.__subclasshook__N)__name__ __module__ __qualname__ __slots__rr2 classmethodr5r r r r"r Vs  r ) metaclassc@s0eZdZdZeddZeddZeeZ dS)rr ccs dVdSr!r r0r r r" __await__iszAwaitable.__await__cCs|turt|dStS)Nr<)rr.r(r3r r r"r5ms zAwaitable.__subclasshook__N) r6r7r8r9rr<r:r5 GenericAlias__class_getitem__r r r r"res   rc@s>eZdZdZeddZed ddZddZed d Z dS) rr cCstdS)zcSend a value into the coroutine. Return next yielded value or raise StopIteration. N StopIterationr1valuer r r"sendzszCoroutine.sendNcCs4|dur|dur||}|dur,||}|dS)zgRaise an exception in the coroutine. Return next yielded value or raise StopIteration. Nwith_tracebackr1typvaltbr r r"throws zCoroutine.throwc Cs2z|tWnttfy$Yn 0tddS).Raise GeneratorExit inside coroutine. zcoroutine ignored GeneratorExitNrJ GeneratorExitr@ RuntimeErrorr0r r r"closes zCoroutine.closecCs|turt|ddddStS)Nr<rCrJrO)rr.r(r3r r r"r5szCoroutine.__subclasshook__)NN) r6r7r8r9rrCrJrOr:r5r r r r"rvs   rc@s0eZdZdZeddZeddZeeZ dS)rr cCstSr!)rr0r r r" __aiter__szAsyncIterable.__aiter__cCs|turt|dStS)NrP)rr.r(r3r r r"r5s zAsyncIterable.__subclasshook__N) r6r7r8r9rrPr:r5r=r>r r r r"rs   rc@s0eZdZdZeddZddZeddZdS) rr cstdS)z@Return the next item or raise StopAsyncIteration when exhausted.NStopAsyncIterationr0r r r" __anext__szAsyncIterator.__anext__cCs|Sr!r r0r r r"rPszAsyncIterator.__aiter__cCs|turt|ddStS)NrSrP)rr.r(r3r r r"r5s zAsyncIterator.__subclasshook__N) r6r7r8r9rrSrPr:r5r r r r"rs  rc@sFeZdZdZddZeddZed ddZd d Ze d d Z dS)rr cs|dIdHS)zpReturn the next item from the asynchronous generator. When exhausted, raise StopAsyncIteration. N)asendr0r r r"rSszAsyncGenerator.__anext__cstdS)zuSend a value into the asynchronous generator. Return next yielded value or raise StopAsyncIteration. NrQrAr r r"rTszAsyncGenerator.asendNcs4|dur|dur||}|dur,||}|dS)zyRaise an exception in the asynchronous generator. Return next yielded value or raise StopAsyncIteration. NrDrFr r r"athrows zAsyncGenerator.athrowc s8z|tIdHWnttfy*Yn 0tddS)rKNz,asynchronous generator ignored GeneratorExit)rUrMrRrNr0r r r"acloses zAsyncGenerator.aclosecCs|turt|dddddStS)NrPrSrTrUrV)rr.r(r3r r r"r5s zAsyncGenerator.__subclasshook__)NN) r6r7r8r9rSrrTrUrVr:r5r r r r"rs   rc@s0eZdZdZeddZeddZeeZ dS)r r ccsdSr!r r0r r r"__iter__szIterable.__iter__cCs|turt|dStS)NrW)r r.r(r3r r r"r5s zIterable.__subclasshook__N) r6r7r8r9rrWr:r5r=r>r r r r"r s   r c@s0eZdZdZeddZddZeddZdS) r r cCstdS)zKReturn the next item from the iterator. When exhausted, raise StopIterationNr?r0r r r"__next__szIterator.__next__cCs|Sr!r r0r r r"rWszIterator.__iter__cCs|turt|ddStS)NrWrX)r r.r(r3r r r"r5s zIterator.__subclasshook__N) r6r7r8r9rrXrWr:r5r r r r"r s  r c@s(eZdZdZeddZeddZdS)r r ccsdSr!r r0r r r" __reversed__2szReversible.__reversed__cCs|turt|ddStS)NrYrW)r r.r(r3r r r"r57s zReversible.__subclasshook__N)r6r7r8r9rrYr:r5r r r r"r .s  r c@sFeZdZdZddZeddZed ddZd d Ze d d Z dS)r r cCs |dS)z^Return the next item from the generator. When exhausted, raise StopIteration. N)rCr0r r r"rXBszGenerator.__next__cCstdS)zcSend a value into the generator. Return next yielded value or raise StopIteration. Nr?rAr r r"rCHszGenerator.sendNcCs4|dur|dur||}|dur,||}|dS)zgRaise an exception in the generator. Return next yielded value or raise StopIteration. NrDrFr r r"rJOs zGenerator.throwc Cs2z|tWnttfy$Yn 0tddS)z.Raise GeneratorExit inside generator. zgenerator ignored GeneratorExitNrLr0r r r"rO\s zGenerator.closecCs|turt|dddddStS)NrWrXrCrJrO)r r.r(r3r r r"r5fs zGenerator.__subclasshook__)NN) r6r7r8r9rXrrCrJrOr:r5r r r r"r >s   r c@s(eZdZdZeddZeddZdS)rr cCsdSr/r r0r r r"__len__usz Sized.__len__cCs|turt|dStS)NrZ)rr.r(r3r r r"r5ys zSized.__subclasshook__N)r6r7r8r9rrZr:r5r r r r"rqs  rc@s0eZdZdZeddZeddZeeZ dS)rr cCsdSNFr )r1xr r r" __contains__szContainer.__contains__cCs|turt|dStS)Nr])rr.r(r3r r r"r5s zContainer.__subclasshook__N) r6r7r8r9rr]r:r5r=r>r r r r"rs   rc@seZdZdZeddZdS)rr cCs|turt|dddStS)NrZrWr])rr.r(r3r r r"r5szCollection.__subclasshook__N)r6r7r8r9r:r5r r r r"rsrc@s0eZdZdZeddZeddZeeZ dS)rr cOsdSr[r )r1argskwdsr r r"__call__szCallable.__call__cCs|turt|dStS)Nr`)rr.r(r3r r r"r5s zCallable.__subclasshook__N) r6r7r8r9rr`r:r5r=r>r r r r"rs   rc@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. r cCs>t|tstSt|t|kr"dS|D]}||vr&dSq&dSNFT isinstancerr(lenr1otherelemr r r"__le__s z Set.__le__cCs(t|tstSt|t|ko&||Sr!rcrr(rdrhr1rfr r r"__lt__s z Set.__lt__cCs(t|tstSt|t|ko&||Sr!)rcrr(rd__ge__rjr r r"__gt__s z Set.__gt__cCs>t|tstSt|t|kr"dS|D]}||vr&dSq&dSrarbrer r r"rls z Set.__ge__cCs(t|tstSt|t|ko&||Sr!rirjr r r"__eq__s z 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. r )r4itr r r"_from_iterableszSet._from_iterablecs&t|tstSfdd|DS)Nc3s|]}|vr|VqdSr!r .0rBr0r r" rzSet.__and__..rcr r(rprjr r0r"__and__s z Set.__and__cCs|D]}||vrdSqdS)z1Return True if two sets have a null intersection.FTr )r1rfrBr r r" isdisjointszSet.isdisjointcCs*t|tstSdd||fD}||S)Ncss|]}|D] }|Vq qdSr!r )rrser r r"rsrzSet.__or__..rt)r1rfchainr r r"__or__s z Set.__or__cs:tts"ttstS||fdd|DS)Nc3s|]}|vr|VqdSr!r rqrfr r"rsszSet.__sub__..rcrr r(rprjr r{r"__sub__s    z Set.__sub__cs:t|ts"t|tstS|}fdd|DS)Nc3s|]}|vr|VqdSr!r rqr0r r"rs szSet.__rsub__..r|rjr r0r"__rsub__s    z Set.__rsub__cCs2t|ts"t|tstS||}||||BSr!r|rjr r r"__xor__s    z Set.__xor__cCstj}d|d}t|}d|d}||M}|D],}t|}|||d>AdAdN}||M}q2|dd}||M}||kr||d8}|d krd }|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. riMriM[l4~2i i6i8#)sysmaxsizerdhash)r1MAXMASKnhr\hxr r r"_hashs      z Set._hashN)r6r7r8__doc__r9rhrkrmrlrnr:rpru__rand__rvrz__ror__r}r~r__rxor__rr r r r"rs&    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. r cCstdS)zAdd an element.NNotImplementedErrorrAr r r"addKszMutableSet.addcCstdS)z8Remove an element. Do not raise an exception if absent.NrrAr r r"discardPszMutableSet.discardcCs||vrt|||dS)z5Remove an element. If not a member, raise a KeyError.N)KeyErrorrrAr r r"removeUszMutableSet.removecCs<t|}z t|}Wnty,tdYn0|||S)z2Return the popped value. Raise KeyError if empty.N)iternextr@rrr1rorBr r r"pop[s    zMutableSet.popcCs&z|qWnty Yn0dS)z6This is slow (creates N new iterators!) but effective.N)rrr0r r r"cleares zMutableSet.clearcCs|D]}||q|Sr!)rrr r r"__ior__ms zMutableSet.__ior__cCs||D]}||q|Sr!)rrr r r"__iand__rs  zMutableSet.__iand__cCsR||ur|n D[k] if k in D, else d. d defaults to None.Nrr1rdefaultr r r"gets  z Mapping.getcCs*z ||Wnty YdS0dSdSrarrr r r"r]s   zMapping.__contains__cCst|S)z:D.keys() -> a set-like object providing a view on D's keys)rr0r r r"keyssz Mapping.keyscCst|S)z a set-like object providing a view on D's items)rr0r r r"itemssz Mapping.itemscCst|S)z6D.values() -> an object providing a view on D's values)rr0r r r"valuesszMapping.valuescCs&t|tstSt|t|kSr!)rcrr(dictrrjr r r"rns zMapping.__eq__)N) r6r7r8r9rrrr]rrrrnrYr r r r"rs   rc@s0eZdZdZddZddZddZeeZ dS) r_mappingcCs ||_dSr!r)r1mappingr r r"__init__szMappingView.__init__cCs t|jSr!)rdrr0r r r"rZszMappingView.__len__cCs d|S)Nz&{0.__class__.__name__}({0._mapping!r}))formatr0r r r"__repr__szMappingView.__repr__N) r6r7r8r9rrZrr:r=r>r r r r"rs rc@s,eZdZdZeddZddZddZdS) rr cCst|Sr!setr1ror r r"rpszKeysView._from_iterablecCs ||jvSr!rrr r r"r]szKeysView.__contains__ccs|jEdHdSr!rr0r r r"rWszKeysView.__iter__Nr6r7r8r9r:rpr]rWr r r r"rs  rc@s,eZdZdZeddZddZddZdS) rr cCst|Sr!rrr r r"rpszItemsView._from_iterablecCs@|\}}z|j|}Wnty*YdS0||up:||kSdSr[)rr)r1itemrrBvr r r"r]s  zItemsView.__contains__ccs |jD]}||j|fVqdSr!rrr r r"rWs zItemsView.__iter__Nrr r r r"rs   rc@s eZdZdZddZddZdS)rr cCs0|jD]$}|j|}||us$||krdSqdSNTFr)r1rBrrr r r"r]s   zValuesView.__contains__ccs|jD]}|j|VqdSr!rrr r r"rWs zValuesView.__iter__N)r6r7r8r9r]rWr r r r"rsrc@s^eZdZdZeddZeddZeZefddZ dd Z d d Z dd d Z dddZ dS)rr cCstdSr!rr1rrBr r r" __setitem__$szMutableMapping.__setitem__cCstdSr!rrr r r" __delitem__(szMutableMapping.__delitem__cCs>z ||}Wn"ty.||jur&|YS0||=|SdS)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. N)r_MutableMapping__marker)r1rrrBr r r"r.s    zMutableMapping.popcCs@ztt|}Wnty(tdYn0||}||=||fS)zD.popitem() -> (k, v), remove and return some (key, value) pair as a 2-tuple; but raise KeyError if D is empty. N)rrr@rrr r r"popitem<s  zMutableMapping.popitemcCs&z|qWnty Yn0dS)z,D.clear() -> None. Remove all items from D.N)rrr0r r r"rHs zMutableMapping.clearcKs|t|tr"|D]}||||<qn 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)rcrhasattrrr)r1rfr_rrBr r r"updatePs     zMutableMapping.updateNcCs*z ||WSty$|||<Yn0|S)z@D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in Drrr r r" setdefaultbs   zMutableMapping.setdefault)r )N)r6r7r8r9rrrobjectrrrrrrr r r r"rs      rc@sJeZdZdZdZeddZddZddZd d Z dd dZ ddZ d S)rzAll the operations on a read-only sequence. Concrete subclasses must override __new__ or __init__, __getitem__, and __len__. r cCstdSr! IndexErrorr1indexr r r"r{szSequence.__getitem__ccs:d}z||}|V|d7}qWnty4YdS0dS)Nrrr)r1irr r r"rWs zSequence.__iter__cCs$|D]}||us||krdSqdSrr )r1rBrr r r"r]szSequence.__contains__ccs$ttt|D]}||VqdSr!)reversedrangerd)r1rr r r"rYszSequence.__reversed__rNcCs|dur"|dkr"tt||d}|dur>|dkr>|t|7}|}|dusR||krz"||}||usl||krr|WSWntyYqYn0|d7}qBtdS)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)maxrdr ValueError)r1rBstartstoprrr r r"rs     zSequence.indexcstfdd|DS)zBS.count(value) -> integer -- return number of occurrences of valuec3s"|]}|us|krdVqdS)rNr )rrrrBr r"rsrz!Sequence.count..)sumrAr rr"countszSequence.count)rN) r6r7r8rr9rrrWr]rYrrr r r r"rqs   rc@seZdZdZdZdS)rzMThis unifies bytes and bytearray. XXX Should add all their methods. r N)r6r7r8rr9r r r r"rsrc@sneZdZdZeddZeddZeddZdd Zd d Z d d Z ddZ dddZ ddZ ddZdS)rr cCstdSr!rr1rrBr r r"rszMutableSequence.__setitem__cCstdSr!rrr r r"rszMutableSequence.__delitem__cCstdS)z3S.insert(index, value) -- insert value before indexNrrr r r"insertszMutableSequence.insertcCs|t||dS)z:S.append(value) -- append value to the end of the sequenceN)rrdrAr r r"appendszMutableSequence.appendcCs&z|qWnty Yn0dS)z,S.clear() -> None -- remove all items from SN)rrr0r r r"rs zMutableSequence.clearcCsHt|}t|dD].}|||d||||<|||d<qdS)z!S.reverse() -- reverse *IN PLACE*rrN)rdr)r1rrr r r"reverseszMutableSequence.reversecCs(||urt|}|D]}||qdS)zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)listr)r1rrr r r"extendszMutableSequence.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 )r1rrr r r"rszMutableSequence.popcCs|||=dS)zvS.remove(value) -- remove first occurrence of value. Raise ValueError if the value is not present. N)rrAr r r"rszMutableSequence.removecCs|||Sr!)r)r1rr r r"__iadd__s zMutableSequence.__iadd__N)r)r6r7r8r9rrrrrrrrrrrr r r r"rs     r)Mrabcrrrtyperintr=__all__r6rbytes_iterator bytearraybytearray_iteratorrdict_keyiteratorrdict_valueiteratorrdict_itemiterator list_iteratorrlist_reverseiteratorrrange_iteratorlongrange_iteratorr set_iterator str_iteratortuple_iteratorzip zip_iterator dict_keys dict_values dict_itemsr' mappingproxy generatorr$ coroutinerOr%async_generatorr.r rrregisterrrrr r r r rrrrr frozensetrrrrrrrrrtuplestr memoryviewrbytesrr r r r"s          ) 0              0   P 3    T >      D