U e5dЇeу@stdZddlmZmZddlZdddddd d ddd dddddddddddddddgZdZeedГГZ eee ГГГZeeiабГГZ eeiабГГZeeiабГГZeegГГZeeegГГГZeeedГГГZeeedd >ГГГZeeeГГГZeed!ГГZeed"ГГZeeeГГГZeiабГZeiабГZeiабГZ eej!ГZ"ed#d$ДГГZ#d%d&ДZ$e$ГZ$ee$ГZ%e$а&б[$d'd(ДZ'e'ГZ'ee'ГZ(['d)d*ДZ)Gd+d Дd ed,НZ*Gd-dДded,НZ+Gd.dДde+ГZ,e,а-e%бGd/dДded,НZ.Gd0dДde.ГZ/Gd1dДde/ГZ0e0а-e(бGd2d Дd ed,НZ1Gd3dДde1ГZ2e2а-e бe2а-eбe2а-e бe2а-eбe2а-eбe2а-eбe2а-eбe2а-eбe2а-eбe2а-eбe2а-eбe2а-eбe2а-eбGd4d Дd e1ГZ3Gd5dДde2ГZ4e4а-e#бGd6dДded,НZ5Gd7dДded,НZ6Gd8dДde5e1e6ГZ7Gd9dДded,НZ8Gd:dДde7ГZ9e9а-e:бGd;dДde9ГZ;e;а-eбGddДde=e9ГZ>e>а-eбGd?dДde=e9ГZ?e?а-e бGd@dДde=e7ГZ@e@а-eбGdAdДde<ГZAeAа-eBбGdBdДde3e7ГZCeCа-eDбeCа-eEбeCа-eбeCа-eFбGdCdДdeCГZGeGа-eHбeGа-e бGdDdДdeCГZIeIа-eJбeIа-e бdS)EzjAbstract Base Classes (ABCs) for collections, according to PEP 3119. Unit tests are in test_collections. щ)┌ABCMeta┌abstractmethodN┌ Awaitable┌ Coroutine┌ AsyncIterable┌ AsyncIterator┌AsyncGenerator┌Hashable┌Iterable┌Iterator┌ Generator┌ Reversible┌Sized┌ Container┌Callable┌ Collection┌Set┌ MutableSet┌Mapping┌MutableMapping┌MappingView┌KeysView┌ ItemsView┌ ValuesView┌Sequence┌MutableSequence┌ ByteStringzcollections.abcєщiш┌йccsdVSйNr r r r ·(/usr/lib64/python3.8/_collections_abc.py┌8rr#c├sdSr!r r r r r"┌_coro:rr$cCs dVdSr!r r r r r"┌_ag@rr%cGsN|j}|D]>}|D],}||jkr|j|dkr:tSq qtSq dS)NT)┌__mro__┌__dict__┌NotImplemented)┌C┌methods┌mro┌method┌Br r r"┌_check_methodsHs r.c@s(eZdZdZeddДГZeddДГZdS)r r cCsdSйNrr й┌selfr r r"┌__hash__XszHashable.__hash__cCs|tkrt|dГStS)Nr2)r r.r(й┌clsr)r r r"┌__subclasshook__\s zHashable.__subclasshook__N)┌__name__┌ __module__┌__qualname__┌ __slots__rr2┌classmethodr5r r r r"r Ts )┌ metaclassc@s(eZdZdZeddДГZeddДГZdS)rr ccs dVdSr!r r0r r r"┌ __await__gszAwaitable.__await__cCs|tkrt|dГStS)Nr<)rr.r(r3r r r"r5ks zAwaitable.__subclasshook__N)r6r7r8r9rr<r:r5r r r r"rcs c@s>eZdZdZeddДГZedddДГZddДZed d ДГZ dS)rr cCstВdS)zcSend a value into the coroutine. Return next yielded value or raise StopIteration. Nй┌ StopIterationйr1┌valuer r r"┌sendvszCoroutine.sendNcCs4|dkr|dkr|В|Г}|dk r,|а|б}|ВdS)zgRaise an exception in the coroutine. Return next yielded value or raise StopIteration. Nй┌with_tracebackйr1┌typ┌val┌tbr r r"┌throw}s zCoroutine.throwc Cs4z|аtбWnttfk r&Yn XtdГВdS)·.Raise GeneratorExit inside coroutine. zcoroutine ignored GeneratorExitNйrH┌ GeneratorExitr>┌RuntimeErrorr0r r r"┌closeКs zCoroutine.closecCs|tkrt|ddddГStS)Nr<rArHrM)rr.r(r3r r r"r5ФszCoroutine.__subclasshook__)NN) r6r7r8r9rrArHrMr:r5r r r r"rrs c@s(eZdZdZeddДГZeddДГZdS)rr cCstГSr!)rr0r r r"┌ __aiter__вszAsyncIterable.__aiter__cCs|tkrt|dГStS)NrN)rr.r(r3r r r"r5жs zAsyncIterable.__subclasshook__N)r6r7r8r9rrNr:r5r r r r"rЮs c@s0eZdZdZeddДГZddДZeddДГZdS) rr c├stВdS)z@Return the next item or raise StopAsyncIteration when exhausted.Nй┌StopAsyncIterationr0r r r"┌ __anext__▒szAsyncIterator.__anext__cCs|Sr!r r0r r r"rN╢szAsyncIterator.__aiter__cCs|tkrt|ddГStS)NrQrN)rr.r(r3r r r"r5╣szAsyncIterator.__subclasshook__N) r6r7r8r9rrQrNr:r5r r r r"rнs c@sFeZdZdZddДZeddДГZed ddДГZd d ДZe ddДГZ dS)rr c├s|аdбIdHS)zpReturn the next item from the asynchronous generator. When exhausted, raise StopAsyncIteration. N)┌asendr0r r r"rQ─szAsyncGenerator.__anext__c├stВdS)zuSend a value into the asynchronous generator. Return next yielded value or raise StopAsyncIteration. NrOr?r r r"rR╩szAsyncGenerator.asendNc├s4|dkr|dkr|В|Г}|dk r,|а|б}|ВdS)zyRaise an exception in the asynchronous generator. Return next yielded value or raise StopAsyncIteration. NrBrDr r r"┌athrow╤s zAsyncGenerator.athrowc ├s:z|аtбIdHWnttfk r,Yn XtdГВdS)rINz,asynchronous generator ignored GeneratorExit)rSrKrPrLr0r r r"┌aclose▐s zAsyncGenerator.aclosecCs|tkrt|dddddГStS)NrNrQrRrSrT)rr.r(r3r r r"r5шs zAsyncGenerator.__subclasshook__)NN)r6r7r8r9rQrrRrSrTr:r5r r r r"r└s c@s(eZdZdZeddДГZeddДГZdS)r r ccsdSr!r r0r r r"┌__iter__ўszIterable.__iter__cCs|tkrt|dГStS)NrU)r r.r(r3r r r"r5№s zIterable.__subclasshook__N)r6r7r8r9rrUr:r5r r r r"r єs c@s0eZdZdZeddДГZddДZeddДГZdS) rr cCstВdS)zKReturn the next item from the iterator. When exhausted, raise StopIterationNr=r0r r r"┌__next__szIterator.__next__cCs|Sr!r r0r r r"rUszIterator.__iter__cCs|tkrt|ddГStS)NrUrV)rr.r(r3r r r"r5szIterator.__subclasshook__N) r6r7r8r9rrVrUr:r5r r r r"rs c@s(eZdZdZeddДГZeddДГZdS)r r ccsdSr!r r0r r r"┌__reversed__)szReversible.__reversed__cCs|tkrt|ddГStS)NrWrU)r r.r(r3r r r"r5.szReversible.__subclasshook__N)r6r7r8r9rrWr:r5r r r r"r %s c@sFeZdZdZddДZeddДГZed ddДГZd d ДZe ddДГZ dS)rr cCs |аdбS)z^Return the next item from the generator. When exhausted, raise StopIteration. N)rAr0r r r"rV9szGenerator.__next__cCstВdS)zcSend a value into the generator. Return next yielded value or raise StopIteration. Nr=r?r r r"rA?szGenerator.sendNcCs4|dkr|dkr|В|Г}|dk r,|а|б}|ВdS)zgRaise an exception in the generator. Return next yielded value or raise StopIteration. NrBrDr r r"rHFs zGenerator.throwc Cs4z|аtбWnttfk r&Yn XtdГВdS)z.Raise GeneratorExit inside generator. zgenerator ignored GeneratorExitNrJr0r r r"rMSs zGenerator.closecCs|tkrt|dddddГStS)NrUrVrArHrM)rr.r(r3r r r"r5]s zGenerator.__subclasshook__)NN)r6r7r8r9rVrrArHrMr:r5r r r r"r5s c@s(eZdZdZeddДГZeddДГZdS)rr cCsdSr/r r0r r r"┌__len__ksz Sized.__len__cCs|tkrt|dГStS)NrX)rr.r(r3r r r"r5os zSized.__subclasshook__N)r6r7r8r9rrXr:r5r r r r"rgs c@s(eZdZdZeddДГZeddДГZdS)rr cCsdSйNFr )r1┌xr r r"┌__contains__zszContainer.__contains__cCs|tkrt|dГStS)Nr[)rr.r(r3r r r"r5~s zContainer.__subclasshook__N)r6r7r8r9rr[r:r5r r r r"rvs c@seZdZdZeddДГZdS)rr cCs|tkrt|dddГStS)NrXrUr[)rr.r(r3r r r"r5ИszCollection.__subclasshook__N)r6r7r8r9r:r5r r r r"rДsc@s(eZdZdZeddДГZeddДГZdS)rr cOsdSrYr )r1┌args┌kwdsr r r"┌__call__ТszCallable.__call__cCs|tkrt|dГStS)Nr^)rr.r(r3r r r"r5Цs zCallable.__subclasshook__N)r6r7r8r9rr^r:r5r r r r"rОs c@sМeZdZdZdZddДZddДZddДZd d ДZddДZ e d dДГZddДZeZ ddДZddДZeZddДZddДZddДZeZddДZdS)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|tГstSt|Гt|Гkr"dS|D]}||kr&dSq&dSйNFTй┌ isinstancerr(┌lenйr1┌other┌elemr r r"┌__le__оs z Set.__le__cCs(t|tГstSt|Гt|Гko&|а|бSr!йrarr(rbrfйr1rdr r r"┌__lt__╕s z Set.__lt__cCs(t|tГstSt|Гt|Гko&|а|бSr!)rarr(rb┌__ge__rhr r r"┌__gt__╜s z Set.__gt__cCs>t|tГstSt|Гt|Гkr"dS|D]}||kr&dSq&dSr_r`rcr r r"rj┬s z Set.__ge__cCs(t|tГstSt|Гt|Гko&|а|бSr!rgrhr r r"┌__eq__╠s z Set.__eq__cCs||ГS)z╝Construct 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 )r4┌itr r r"┌_from_iterable╤szSet._from_iterablecs&t|tГstSИаЗfddД|DГбS)Nc3s|]}|Иkr|VqdSr!r й┌.0r@r0r r"┌ ▌szSet.__and__..йrar r(rnrhr r0r"┌__and__┌s zSet.__and__cCs|D]}||krdSqdS)z1Return True if two sets have a null intersection.FTr )r1rdr@r r r"┌ isdisjointсszSet.isdisjointcCs*t|tГstSddД||fDГ}|а|бS)Ncss|]}|D] }|Vq qdSr!r )rp┌s┌er r r"rqыszSet.__or__..rr)r1rd┌chainr r r"┌__or__шs z Set.__or__cs:tИtГs"tИtГstS|аИбЙ|аЗfddД|DГбS)Nc3s|]}|Иkr|VqdSr!r roйrdr r"rqїs zSet.__sub__..йrarr r(rnrhr ryr"┌__sub__Ёs zSet.__sub__cs:t|tГs"t|tГstSИа|б}ИаЗfddД|DГбS)Nc3s|]}|Иkr|VqdSr!r ror0r r"rq¤s zSet.__rsub__..rzrhr r0r"┌__rsub__°s zSet.__rsub__cCs2t|tГs"t|tГstS|а|б}||||BSr!rzrhr r r"┌__xor__s zSet.__xor__cCsШtj}d|d}t|Г}d|d}||M}|D],}t|Г}|||d>AdAdN}||M}q2|dd}||M}||krИ||d8}|d krФd }|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. щriMяшrщi│M[l╫4~2i═ iу├6щ i┴╟8#)┌sys┌maxsizerb┌hash)r1┌MAX┌MASK┌n┌hrZ┌hxr r r"┌_hash s z Set._hashN)r6r7r8┌__doc__r9rfrirkrjrlr:rnrs┌__rand__rtrx┌__ror__r{r|r}┌__rxor__rЙr r r r"rаs& c@sdeZdZdZdZeddДГZeddДГZddДZd d ДZ ddДZ d dДZddДZddДZ ddДZdS)raЗA 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 cCstВdS)zAdd an element.Nй┌NotImplementedErrorr?r r r"┌add:szMutableSet.addcCstВdS)z8Remove an element. Do not raise an exception if absent.NrОr?r r r"┌discard?szMutableSet.discardcCs||krt|ГВ|а|бdS)z5Remove an element. If not a member, raise a KeyError.N)┌KeyErrorrСr?r r r"┌removeDszMutableSet.removecCs>t|Г}zt|Г}Wntk r.tdВYnX|а|б|S)z2Return the popped value. Raise KeyError if empty.N)┌iter┌nextr>rТrСйr1rmr@r r r"┌popJs zMutableSet.popcCs(z|абqWntk r"YnXdS)z6This is slow (creates N new iterators!) but effective.N)rЧrТr0r r r"┌clearTszMutableSet.clearcCs|D]}|а|бq|Sr!)rРrЦr r r"┌__ior__\szMutableSet.__ior__cCs||D]}|а|бq|Sr!)rСrЦr r r"┌__iand__aszMutableSet.__iand__cCsR||kr|абn D[k] if k in D, else d. d defaults to None.NrЭйr1rЯ┌defaultr r r"┌getСs zMapping.getcCs,z||Wntk r"YdSXdSdSr_rЭrЮr 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"┌keysаszMapping.keyscCst|ГS)z a set-like object providing a view on D's items)rr0r r r"┌itemsдsz Mapping.itemscCst|ГS)z6D.values() -> an object providing a view on D's values)rr0r r r"┌valuesиszMapping.valuescCs&t|tГstSt|абГt|абГkSr!)rarr(┌dictrеrhr r r"rlмs zMapping.__eq__)N) r6r7r8r9rrаrгr[rдrеrжrlrWr r r r"rБs c@s(eZdZdZddДZddДZddДZdS) rй┌_mappingcCs ||_dSr!rи)r1┌mappingr r r"┌__init__║szMappingView.__init__cCs t|jГSr!)rbrйr0r r r"rX╜szMappingView.__len__cCs dа|бS)Nz&{0.__class__.__name__}({0._mapping!r}))┌formatr0r r r"┌__repr__└szMappingView.__repr__N)r6r7r8r9rлrXrнr r r r"r╢sc@s,eZdZdZeddДГZddДZddДZdS) rr cCst|ГSr!й┌setйr1rmr r r"rn╚szKeysView._from_iterablecCs ||jkSr!rиrЮr r r"r[╠szKeysView.__contains__ccs|jEdHdSr!rиr0r r r"rU╧szKeysView.__iter__Nйr6r7r8r9r:rnr[rUr r r r"r─s c@s,eZdZdZeddДГZddДZddДZdS) rr cCst|ГSr!rоr░r r r"rn┘szItemsView._from_iterablecCsB|\}}z|j|}Wntk r,YdSX||kp<||kSdSrY)rйrТ)r1┌itemrЯr@┌vr r r"r[▌szItemsView.__contains__ccs |jD]}||j|fVqdSr!rиrЮr r r"rUцs zItemsView.__iter__Nr▒r r r r"r╒s c@s eZdZdZddДZddДZdS)rr cCs0|jD]$}|j|}||ks$||krdSqdSйNTFrи)r1r@rЯr│r r r"r[ёs zValuesView.__contains__ccs|jD]}|j|VqdSr!rиrЮr r r"rU°s zValuesView.__iter__N)r6r7r8r9r[rUr r r r"rэsc@s^eZdZdZeddДГZeddДГZeГZefddДZ dd ДZ d dДZddd ДZdddДZ dS)rr cCstВdSr!rЭйr1rЯr@r r r"┌__setitem__szMutableMapping.__setitem__cCstВdSr!rЭrЮr r r"┌__delitem__szMutableMapping.__delitem__cCs@z||}Wn$tk r0||jkr(В|YSX||=|SdS)zйD.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)r1rЯrвr@r r r"rЧs zMutableMapping.popcCsBztt|ГГ}Wntk r*tdВYnX||}||=||fS)zГD.popitem() -> (k, v), remove and return some (key, value) pair as a 2-tuple; but raise KeyError if D is empty. N)rХrФr>rТr╡r r r"┌popitem$szMutableMapping.popitemcCs(z|абqWntk r"YnXdS)z,D.clear() -> None. Remove all items from D.N)r╣rТr0r r r"rШ0szMutableMapping.clearcKs|t|tГr"|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 rдN)rar┌hasattrrдrе)r1rdr]rЯr@r r r"┌update8s zMutableMapping.updateNcCs,z ||WStk r&|||<YnX|S)z@D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in DrЭrбr r r"┌ setdefaultJs zMutableMapping.setdefault)r )N)r6r7r8r9rr╢r╖┌objectr╕rЧr╣rШr╗r╝r r r r"r s c@sJeZdZdZdZeddДГZddДZddДZd d ДZ dd dДZ ddДZdS)rzКAll the operations on a read-only sequence. Concrete subclasses must override __new__ or __init__, __getitem__, and __len__. r cCstВdSr!й┌ IndexErrorйr1┌indexr r r"rаbszSequence.__getitem__ccs<d}z||}|V|d7}qWntk r6YdSXdS)Nrrr╛)r1┌ir│r r r"rUfszSequence.__iter__cCs$|D]}||ks||krdSqdSr┤r )r1r@r│r r r"r[pszSequence.__contains__ccs$ttt|ГГГD]}||VqdSr!)┌reversed┌rangerb)r1r┬r r r"rWvszSequence.__reversed__rNcCsа|dk r"|dkr"tt|Г|dГ}|dk r>|dkr>|t|Г7}|}|dksR||krШz"||}||ksl||krr|WSWntk rМYqШYnX|d7}qBtВdS)zцS.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)┌maxrbr┐┌ ValueError)r1r@┌start┌stopr┬r│r r r"r┴zs zSequence.indexcstЗfddД|DГГS)zBS.count(value) -> integer -- return number of occurrences of valuec3s"|]}|Иks|ИkrdVqdS)rNr )rpr│йr@r r"rqУsz!Sequence.count..)┌sumr?r r╔r"┌countСszSequence.count)rN)r6r7r8rКr9rrаrUr[rWr┴r╦r r r r"rXs c@seZdZdZdZdS)rzMThis unifies bytes and bytearray. XXX Should add all their methods. r N)r6r7r8rКr9r r r r"rЫsc@sneZdZdZeddДГZeddДГZeddДГZdd ДZd dДZ dd ДZ ddДZdddДZddДZ ddДZdS)rr cCstВdSr!r╛йr1r┴r@r r r"r╢│szMutableSequence.__setitem__cCstВdSr!r╛r└r r r"r╖╖szMutableSequence.__delitem__cCstВdS)z3S.insert(index, value) -- insert value before indexNr╛r╠r r r"┌insert╗szMutableSequence.insertcCs|аt|Г|бdS)z:S.append(value) -- append value to the end of the sequenceN)r═rbr?r r r"┌append└szMutableSequence.appendcCs(z|абqWntk r"YnXdS)z,S.clear() -> None -- remove all items from SN)rЧr┐r0r r r"rШ─szMutableSequence.clearcCsHt|Г}t|dГD].}|||d||||<|||d<qdS)z!S.reverse() -- reverse *IN PLACE*r~rN)rbr─)r1rЖr┬r r r"┌reverse╠szMutableSequence.reversecCs(||krt|Г}|D]}|а|бqdS)zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)┌listr╬)r1rжr│r r r"┌extend╥szMutableSequence.extendrАcCs||}||=|S)zЩS.pop([index]) -> item -- remove and return item at index (default last). Raise IndexError if list is empty or index is out of range. r )r1r┴r│r r r"rЧ┘szMutableSequence.popcCs||а|б=dS)zvS.remove(value) -- remove first occurrence of value. Raise ValueError if the value is not present. N)r┴r?r r r"rУсszMutableSequence.removecCs|а|б|Sr!)r╤)r1rжr r r"┌__iadd__чs zMutableSequence.__iadd__N)rА)r6r7r8r9rr╢r╖r═r╬rШr╧r╤rЧrУr╥r r r r"rиs )KrК┌abcrrrБ┌__all__r6┌typerФ┌bytes_iterator┌ bytearray┌bytearray_iteratorrд┌dict_keyiteratorrж┌dict_valueiteratorrе┌dict_itemiterator┌ list_iteratorr├┌list_reverseiteratorr─┌range_iterator┌longrange_iteratorrп┌set_iterator┌str_iterator┌tuple_iterator┌zip┌zip_iterator┌ dict_keys┌dict_values┌ dict_itemsr'┌mappingproxy┌ generatorr$┌ coroutinerMr%┌async_generatorr.r rr┌registerrrrr rr rrrrrr┌ frozensetrrrrrrrrзr┌tuple┌str┌ memoryviewr┌bytesrr╨r r r r"┌sт° ) 0 / O 2 S = C