芝麻web文件管理V1.00
编辑当前文件:/home/conskgoa/doughi.co.uk/_collections_abc.cpython-38.opt-1.pyc.tar
usr/lib64/python3.8/__pycache__/_collections_abc.cpython-38.opt-1.pyc 0000644 00000070107 15220154432 0021133 0 ustar 00 U e5de @ st d Z ddlmZmZ ddlZdddddd d d d d ddddddddddddddd gZd Zeed Z eee Z eei Z eei Zeei Zeeg Zeeeg ZeeedZeeed d > Zeee Zeed!Zeed"Zeee Z ei Z ei Z ei Z eej!Z"ed#d$ Z#d%d& Z$e$ Z$ee$Z%e$& [$d'd( Z'e' Z'ee'Z(['d)d* Z)G d+d d ed,Z*G d-d ded,Z+G d.d de+Z,e,-e% G d/d ded,Z.G d0d de.Z/G d1d de/Z0e0-e( G d2d d ed,Z1G d3d d e1Z2e2-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 G d4d d e1Z3G d5d d e2Z4e4-e# G d6d ded,Z5G d7d ded,Z6G d8d de5e1e6Z7G d9d ded,Z8G d:d de7Z9e9-e: G d;d de9Z;e;-e G d<d de7Z<e<-e" G d=d de5Z=G d>d de=e9Z>e>-e G d?d de=e9Z?e?-e G d@d de=e7Z@e@-e G dAd de<ZAeA-eB G dBd de3e7ZCeC-eD eC-eE eC-e eC-eF G dCd d eCZGeG-eH eG-e G dDd deCZIeI-eJ eI-e dS )EzjAbstract 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.abc i c c s d V S Nr r r r (/usr/lib64/python3.8/_collections_abc.py<lambda>8 r r# c s d S r! r r r r r" _coro: r r$ c C s d V d S r! r r r r r" _ag@ r r% c G sN | j }|D ]>}|D ],}||jkr|j| d kr:t S q qt S q dS )NT)__mro____dict__NotImplemented)CmethodsmromethodBr r r" _check_methodsH s r. c @ s( e Zd ZdZedd Zedd ZdS )r r c C s dS Nr r selfr r r" __hash__X s zHashable.__hash__c C s | t krt|dS tS )Nr2 )r r. r( clsr) r r r" __subclasshook__\ s zHashable.__subclasshook__N)__name__ __module__ __qualname__ __slots__r r2 classmethodr5 r r r r" r T s ) metaclassc @ s( e Zd ZdZedd Zedd ZdS )r r c c s d V d S r! r r0 r r r" __await__g s zAwaitable.__await__c C s | t krt|dS tS )Nr< )r r. r( r3 r r r" r5 k s zAwaitable.__subclasshook__N)r6 r7 r8 r9 r r< r: r5 r r r r" r c s c @ s> e Zd ZdZedd Zed ddZdd Zed d Z dS ) r r c C s t dS )zcSend a value into the coroutine. Return next yielded value or raise StopIteration. N StopIterationr1 valuer r r" sendv s zCoroutine.sendNc C s4 |dkr|dkr|| }|dk r,| |}|dS )zgRaise an exception in the coroutine. Return next yielded value or raise StopIteration. Nwith_tracebackr1 typvaltbr r r" throw} s zCoroutine.throwc C s4 z| t W n ttfk r& Y n X tddS ).Raise GeneratorExit inside coroutine. z coroutine ignored GeneratorExitNrH GeneratorExitr> RuntimeErrorr0 r r r" close s zCoroutine.closec C s | t krt|ddddS tS )Nr< rA rH rM )r r. r( r3 r r r" r5 s zCoroutine.__subclasshook__)NN) r6 r7 r8 r9 r rA rH rM r: r5 r r r r" r r s c @ s( e Zd ZdZedd Zedd ZdS )r r c C s t S r! )r r0 r r r" __aiter__ s zAsyncIterable.__aiter__c C s | t krt|dS tS )NrN )r r. r( r3 r r r" r5 s z AsyncIterable.__subclasshook__N)r6 r7 r8 r9 r rN r: r5 r r r r" r s c @ s0 e Zd ZdZedd Zdd Zedd ZdS ) r r c s t dS )z@Return the next item or raise StopAsyncIteration when exhausted.NStopAsyncIterationr0 r r r" __anext__ s zAsyncIterator.__anext__c C s | S r! r r0 r r r" rN s zAsyncIterator.__aiter__c C s | t krt|ddS tS )NrQ rN )r r. r( r3 r r r" r5 s z AsyncIterator.__subclasshook__N) r6 r7 r8 r9 r rQ rN r: r5 r r r r" r s c @ sF e Zd ZdZdd Zedd Zed ddZd d Ze d d Z dS )r r c s | dI dH S )zpReturn the next item from the asynchronous generator. When exhausted, raise StopAsyncIteration. N)asendr0 r r r" rQ s zAsyncGenerator.__anext__c s t dS )zuSend a value into the asynchronous generator. Return next yielded value or raise StopAsyncIteration. NrO r? r r r" rR s zAsyncGenerator.asendNc s4 |dkr|dkr|| }|dk r,| |}|dS )zyRaise an exception in the asynchronous generator. Return next yielded value or raise StopAsyncIteration. NrB rD r r r" athrow s zAsyncGenerator.athrowc s: z| tI dH W n ttfk r, Y n X tddS )rI Nz,asynchronous generator ignored GeneratorExit)rS rK rP rL r0 r r r" aclose s zAsyncGenerator.aclosec C s | t krt|dddddS tS )NrN rQ rR rS rT )r r. r( r3 r r r" r5 s z AsyncGenerator.__subclasshook__)NN) r6 r7 r8 r9 rQ r rR rS rT r: r5 r r r r" r s c @ s( e Zd ZdZedd Zedd ZdS )r r c c s d S r! r r0 r r r" __iter__ s zIterable.__iter__c C s | t krt|dS tS )NrU )r r. r( r3 r r r" r5 s zIterable.__subclasshook__N)r6 r7 r8 r9 r rU r: r5 r r r r" r s c @ s0 e Zd ZdZedd Zdd Zedd ZdS ) r r c C s t dS )zKReturn the next item from the iterator. When exhausted, raise StopIterationNr= r0 r r r" __next__ s zIterator.__next__c C s | S r! r r0 r r r" rU s zIterator.__iter__c C s | t krt|ddS tS )NrU rV )r r. r( r3 r r r" r5 s zIterator.__subclasshook__N) r6 r7 r8 r9 r rV rU r: r5 r r r r" r s c @ s( e Zd ZdZedd Zedd ZdS )r r c c s d S r! r r0 r r r" __reversed__) s zReversible.__reversed__c C s | t krt|ddS tS )NrW rU )r r. r( r3 r r r" r5 . s zReversible.__subclasshook__N)r6 r7 r8 r9 r rW r: r5 r r r r" r % s c @ sF e Zd ZdZdd Zedd Zed ddZd d Ze d d Z dS )r r c C s | dS )z^Return the next item from the generator. When exhausted, raise StopIteration. N)rA r0 r r r" rV 9 s zGenerator.__next__c C s t dS )zcSend a value into the generator. Return next yielded value or raise StopIteration. Nr= r? r r r" rA ? s zGenerator.sendNc C s4 |dkr|dkr|| }|dk r,| |}|dS )zgRaise an exception in the generator. Return next yielded value or raise StopIteration. NrB rD r r r" rH F s zGenerator.throwc C s4 z| t W n ttfk r& Y n X tddS )z.Raise GeneratorExit inside generator. z generator ignored GeneratorExitNrJ r0 r r r" rM S s zGenerator.closec C s | t krt|dddddS tS )NrU rV rA rH rM )r r. r( r3 r r r" r5 ] s zGenerator.__subclasshook__)NN) r6 r7 r8 r9 rV r rA rH rM r: r5 r r r r" r 5 s c @ s( e Zd ZdZedd Zedd ZdS )r r c C s dS r/ r r0 r r r" __len__k s z Sized.__len__c C s | t krt|dS tS )NrX )r r. r( r3 r r r" r5 o s zSized.__subclasshook__N)r6 r7 r8 r9 r rX r: r5 r r r r" r g s c @ s( e Zd ZdZedd Zedd ZdS )r r c C s dS NFr )r1 xr r r" __contains__z s zContainer.__contains__c C s | t krt|dS tS )Nr[ )r r. r( r3 r r r" r5 ~ s zContainer.__subclasshook__N)r6 r7 r8 r9 r r[ r: r5 r r r r" r v s c @ s e Zd ZdZedd ZdS )r r c C s | t krt|dddS tS )NrX rU r[ )r r. r( r3 r r r" r5 s zCollection.__subclasshook__N)r6 r7 r8 r9 r: r5 r r r r" r s c @ s( e Zd ZdZedd Zedd ZdS )r r c O s dS rY r )r1 argskwdsr r r" __call__ s zCallable.__call__c C s | t krt|dS tS )Nr^ )r r. r( r3 r r r" r5 s zCallable.__subclasshook__N)r6 r7 r8 r9 r r^ r: r5 r r r r" r s c @ s e Zd ZdZdZdd Zdd Zdd Zd d Zd d Z e d d Z dd Z e Z dd Zdd ZeZdd Zdd Zdd ZeZdd Zd S ) r aZ A 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 c C s> t |tstS t| t|kr"dS | D ]}||kr& dS q&dS NFT isinstancer r( lenr1 otherelemr r r" __le__ s z Set.__le__c C s( t |tstS t| t|k o&| |S r! ra r r( rb rf r1 rd r r r" __lt__ s z Set.__lt__c C s( t |tstS t| t|ko&| |S r! )ra r r( rb __ge__rh r r r" __gt__ s z Set.__gt__c C s> t |tstS t| t|k r"dS |D ]}|| kr& dS q&dS r_ r` rc r r r" rj s z Set.__ge__c C s( t |tstS t| t|ko&| |S r! rg rh r r r" __eq__ s z Set.__eq__c C s | |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 )r4 itr r r" _from_iterable s zSet._from_iterablec s& t |tstS fdd|D S )Nc 3 s | ]}| kr|V qd S r! r .0r@ r0 r r" <genexpr> s z Set.__and__.<locals>.<genexpr>ra r r( rn rh r r0 r" __and__ s z Set.__and__c C s |D ]}|| kr dS qdS )z1Return True if two sets have a null intersection.FTr )r1 rd r@ r r r" isdisjoint s zSet.isdisjointc C s* t |tstS dd | |fD }| |S )Nc s s | ]}|D ] }|V q qd S r! r )rp ser r r" rq s z Set.__or__.<locals>.<genexpr>rr )r1 rd chainr r r" __or__ s z Set.__or__c s: t ts"t tstS | | fdd| D S )Nc 3 s | ]}| kr|V qd S r! r ro rd r r" rq s z Set.__sub__.<locals>.<genexpr>ra r r r( rn rh r ry r" __sub__ s z Set.__sub__c s: t |ts"t |tstS |} fdd|D S )Nc 3 s | ]}| kr|V qd S r! r ro r0 r r" rq s z Set.__rsub__.<locals>.<genexpr>rz rh r r0 r" __rsub__ s z Set.__rsub__c C s2 t |ts"t |tstS | |}| | || B S r! rz rh r r r" __xor__ s z Set.__xor__c C s t j}d| d }t| }d|d }||M }| D ],}t|}|||d> A dA d N }||M }q2|d d }||M }||kr||d 8 }|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. r iMr iM[l 4~2 i i6i8#)sysmaxsizerb hash)r1 MAXMASKnhrZ hxr r r" _hash s z Set._hashN)r6 r7 r8 __doc__r9 rf ri rk rj rl r: rn rs __rand__rt rx __ror__r{ r| r} __rxor__r r r r r" r s& c @ sd e Zd ZdZdZedd Zedd Zdd Zd d Z d d Z d d Z dd Z dd Z dd ZdS )r a 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 c C s t dS )zAdd an element.NNotImplementedErrorr? r r r" add: s zMutableSet.addc C s t dS )z8Remove an element. Do not raise an exception if absent.Nr r? r r r" discard? s zMutableSet.discardc C s || krt || | dS )z5Remove an element. If not a member, raise a KeyError.N)KeyErrorr r? r r r" removeD s zMutableSet.removec C s> t | }z t|}W n tk r. tdY nX | | |S )z2Return the popped value. Raise KeyError if empty.N)iternextr> r r r1 rm r@ r r r" popJ s zMutableSet.popc C s( z| qW n tk r" Y nX dS )z6This is slow (creates N new iterators!) but effective.N)r r r0 r r r" clearT s zMutableSet.clearc C s |D ]}| | q| S r! )r r r r r" __ior__\ s zMutableSet.__ior__c C s | | D ]}| | q| S r! )r r r r r" __iand__a s zMutableSet.__iand__c C sR || kr| n<t|ts&| |}|D ]"}|| krB| | q*| | q*| S r! )r ra r rn r r r r r r" __ixor__f s zMutableSet.__ixor__c C s* || kr| n|D ]}| | q| S r! )r r r r r r" __isub__s s zMutableSet.__isub__N)r6 r7 r8 r r9 r r r r r r r r r r r r r r" r , s c @ sR e Zd ZdZedd ZdddZdd Zd d Zd d Z d d Z dd Z dZ dS )r r c C s t d S r! r r1 keyr r r" __getitem__ s zMapping.__getitem__Nc C s( z | | W S t k r" | Y S X dS )z<D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.Nr r1 r defaultr r r" get s z Mapping.getc C s, z | | W n t k r" Y dS X dS d S r_ r r r r r" r[ s zMapping.__contains__c C s t | S )z:D.keys() -> a set-like object providing a view on D's keys)r r0 r r r" keys s z Mapping.keysc C s t | S )z<D.items() -> a set-like object providing a view on D's items)r r0 r r r" items s z Mapping.itemsc C s t | S )z6D.values() -> an object providing a view on D's values)r r0 r r r" values s zMapping.valuesc C s& t |tstS t| t| kS r! )ra r r( dictr rh r r r" rl s zMapping.__eq__)N) r6 r7 r8 r9 r r r r[ r r r rl rW r r r r" r s c @ s( e Zd ZdZdd Zdd Zdd ZdS ) r _mappingc C s || _ d S r! r )r1 mappingr r r" __init__ s zMappingView.__init__c C s t | jS r! )rb r r0 r r r" rX s zMappingView.__len__c C s d | S )Nz&{0.__class__.__name__}({0._mapping!r}))formatr0 r r r" __repr__ s zMappingView.__repr__N)r6 r7 r8 r9 r rX r r r r r" r s c @ s, e Zd ZdZedd Zdd Zdd ZdS ) r r c C s t |S r! setr1 rm r r r" rn s zKeysView._from_iterablec C s || j kS r! r r r r r" r[ s zKeysView.__contains__c c s | j E d H d S r! r r0 r r r" rU s zKeysView.__iter__Nr6 r7 r8 r9 r: rn r[ rU r r r r" r s c @ s, e Zd ZdZedd Zdd Zdd ZdS ) r r c C s t |S r! r r r r r" rn s zItemsView._from_iterablec C sB |\}}z| j | }W n tk r, Y dS X ||kp<||kS d S rY )r r )r1 itemr r@ vr r r" r[ s zItemsView.__contains__c c s | j D ]}|| j | fV qd S r! r r r r r" rU s zItemsView.__iter__Nr r r r r" r s c @ s e Zd ZdZdd Zdd ZdS )r r c C s0 | j D ]$}| j | }||ks$||kr dS qdS NTFr )r1 r@ r r r r r" r[ s zValuesView.__contains__c c s | j D ]}| j | V qd S r! r r r r r" rU s zValuesView.__iter__N)r6 r7 r8 r9 r[ rU r r r r" r s c @ s^ e Zd ZdZedd Zedd Ze ZefddZ dd Z d d Z dd d Z dddZ dS )r r c C s t d S r! r r1 r r@ r r r" __setitem__ s zMutableMapping.__setitem__c C s t d S r! r r r r r" __delitem__ s zMutableMapping.__delitem__c C s@ z | | }W n$ t k r0 || jkr( | Y S X | |= |S dS )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)r1 r r r@ r r r" r s zMutableMapping.popc C sB zt t| }W n tk r* tdY nX | | }| |= ||fS )zD.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$ s zMutableMapping.popitemc C s( z| qW n tk r" Y nX dS )z,D.clear() -> None. Remove all items from D.N)r r r0 r r r" r 0 s zMutableMapping.clearc K s| t |tr"|D ]}|| | |< qn<t|drH| D ]}|| | |< q4n|D ]\}}|| |< qL| D ]\}}|| |< qfdS )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 r N)ra r hasattrr r )r1 rd r] r r@ r r r" update8 s zMutableMapping.updateNc C s, z | | W S t k r& || |< Y nX |S )z@D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in Dr r r r r" setdefaultJ s zMutableMapping.setdefault)r )N)r6 r7 r8 r9 r r r objectr r r r r r r r r r" r s c @ sJ e Zd ZdZdZedd Zdd Zdd Zd d Z dd dZ dd Z d S )r zAll the operations on a read-only sequence. Concrete subclasses must override __new__ or __init__, __getitem__, and __len__. r c C s t d S r! IndexErrorr1 indexr r r" r b s zSequence.__getitem__c c s< d}z | | }|V |d7 }qW n t k r6 Y d S X d S )Nr r r )r1 ir r r r" rU f s zSequence.__iter__c C s$ | D ]}||ks||kr dS qdS r r )r1 r@ r r r r" r[ p s zSequence.__contains__c c s$ t tt| D ]}| | V qd S r! )reversedrangerb )r1 r r r r" rW v s zSequence.__reversed__r Nc C s |dk r"|dk r"t t| | d}|dk r>|dk r>|t| 7 }|}|dksR||k rz"| | }||ksl||krr|W S W n tk r Y qY nX |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. Nr r )maxrb r ValueError)r1 r@ startstopr r r r r" r z s zSequence.indexc s t fdd| D S )zBS.count(value) -> integer -- return number of occurrences of valuec 3 s" | ]}| ks| krd V qdS )r Nr )rp r r@ r r" rq s z!Sequence.count.<locals>.<genexpr>)sumr? r r r" count s zSequence.count)r N) r6 r7 r8 r r9 r r rU r[ rW r r r r r r" r X s c @ s e Zd ZdZdZdS )r zMThis unifies bytes and bytearray. XXX Should add all their methods. r N)r6 r7 r8 r r9 r r r r" r s c @ sn e Zd ZdZedd Zedd Zedd Zdd Zd d Z d d Z dd Z dddZ dd Z dd ZdS )r r c C s t d S r! r r1 r r@ r r r" r s zMutableSequence.__setitem__c C s t d S r! r r r r r" r s zMutableSequence.__delitem__c C s t dS )z3S.insert(index, value) -- insert value before indexNr r r r r" insert s zMutableSequence.insertc C s | t| | dS )z:S.append(value) -- append value to the end of the sequenceN)r rb r? r r r" append s zMutableSequence.appendc C s( z| qW n tk r" Y nX dS )z,S.clear() -> None -- remove all items from SN)r r r0 r r r" r s zMutableSequence.clearc C sH t | }t|d D ].}| || d | | | |< | || d < qdS )z!S.reverse() -- reverse *IN PLACE*r~ r N)rb r )r1 r r r r r" reverse s zMutableSequence.reversec C s( || krt |}|D ]}| | qdS )zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)listr )r1 r r r r r" extend s zMutableSequence.extendr c C s | | }| |= |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 )r1 r r r r r" r s zMutableSequence.popc C s | | |= dS )zvS.remove(value) -- remove first occurrence of value. Raise ValueError if the value is not present. N)r r? r r r" r s zMutableSequence.removec C s | | | S r! )r )r1 r r r r" __iadd__ s zMutableSequence.__iadd__N)r )r6 r7 r8 r9 r r r r r r r r r r r r r r r" r s )Kr abcr r r __all__r6 typer bytes_iterator bytearraybytearray_iteratorr dict_keyiteratorr dict_valueiteratorr dict_itemiterator list_iteratorr list_reverseiteratorr range_iteratorlongrange_iteratorr set_iterator str_iteratortuple_iteratorzip zip_iterator dict_keys dict_values dict_itemsr' mappingproxy generatorr$ coroutinerM r% async_generatorr. r r r registerr r r r r r r r r r r r frozensetr r r r r r r r r tuplestr memoryviewr bytesr r r r r r" <module> s ) 0 / O 2 S = C