senaduka/old-parkingkoncept
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
9bfb1e1bc355c94cc3db07bd11c18f2cbe6c8a9c
old-parkingkoncept/parkingkonceptvenv/lib/python3.7/__pycache__/_collections_abc.cpython-37.pyc

275 lines
28 KiB
Plaintext
Raw Normal View History

Initial commit
2019-11-17 12:44:16 +01:00
B
<00>x-]8g<00>@stdZddlmZmZddlZdddddd d
d d d dddddddddddddddgZdZeed<1E><01>Z eee
<EFBFBD><00><01>Z eei<00> <0C><00><01>Z eei<00><0E><00><01>Zeei<00><10><00><01>Zeeg<00><01>Zeeeg<00><01><01>Zeeed<01><01><01>Zeeedd ><00><01><01>Zeee<18><00><01>Zeed!<21><01>Zeed"<22><01>Zeee<1C><00><01>Zei<00> <0C><00>Zei<00><0E><00>Zei<00><10><00>Z eej!<21>Z"ed#d$<24><00><00>Z#d%d&<26>Z$e$<24>Z$ee$<24>Z%e$<24>&<26>[$d'd(<28>Z'e'<27>Z'ee'<27>Z(['d)d*<2A>Z)Gd+d <09>d ed,<2C>Z*Gd-d<04>ded,<2C>Z+Gd.d<05>de+<2B>Z,e,<2C>-e%<25>Gd/d<06>ded,<2C>Z.Gd0d<07>de.<2E>Z/Gd1d<08>de/<2F>Z0e0<65>-e(<28>Gd2d
<EFBFBD>d
ed,<2C>Z1Gd3d <0B>d e1<65>Z2e2<65>-e <09>e2<65>-e <0B>e2<65>-e <0A>e2<65>-e<0F>e2<65>-e<11>e2<65>-e<12>e2<65>-e<14>e2<65>-e<16>e2<65>-e<17>e2<65>-e<19>e2<65>-e<1A>e2<65>-e<1B>e2<65>-e<1D>Gd4d <0A>d e1<65>Z3Gd5d <0C>d e2<65>Z4e4<65>-e#<23>Gd6d<0E>ded,<2C>Z5Gd7d<0F>ded,<2C>Z6Gd8d<11>de5e1e6<65>Z7Gd9d<10>ded,<2C>Z8Gd:d<12>de7<65>Z9e9<65>-e:<3A>Gd;d<13>de9<65>Z;e;<3B>-e<18>Gd<d<14>de7<65>Z<e<<3C>-e"<22>Gd=d<16>de5<65>Z=Gd>d<17>de=e9<65>Z>e><3E>-e<1E>Gd?d<18>de=e9<65>Z?e?<3F>-e <20>Gd@d<19>de=e7<65>Z@e@<40>-e<1F>GdAd<15>de<<3C>ZAeA<65>-eB<65>GdBd<1A>de3e7<65>ZCeC<65>-eD<65>eC<65>-eE<65>eC<65>-e<15>eC<65>-eF<65>GdCd<1C>deC<65>ZGeG<65>-eH<65>eG<65>-e
<EFBFBD>GdDd<1B>deC<65>ZIeI<65>-eJ<65>eI<65>-e
<EFBFBD>dS)EzjAbstract Base Classes (ABCs) for collections, according to PEP 3119.
Unit tests are in test_collections.
<EFBFBD>)<02>ABCMeta<74>abstractmethodN<64> Awaitable<6C> Coroutine<6E> AsyncIterable<6C> AsyncIterator<6F>AsyncGenerator<6F>Hashable<6C>Iterable<6C>Iterator<6F> Generator<6F>
Reversible<EFBFBD>Sized<65> Container<65>Callable<6C>
Collection<EFBFBD>Set<65>
MutableSet<EFBFBD>Mapping<6E>MutableMapping<6E> MappingView<65>KeysView<65> ItemsView<65>
ValuesView<EFBFBD>Sequence<63>MutableSequence<63>
ByteStringzcollections.abc<62><00>i<><00><00>ccsdVS)Nr r r r <00>^/home/hamo/projects/zoblak/parkingkoncept/parkingkonceptvenv/lib/python3.7/_collections_abc.py<70><lambda>8rr"c<00>sdS)Nr r r r r!<00>_coro:rr#cCs
dVdS)Nr r r r r!<00>_ag@rr$cGsH|j}x<|D]4}x.|D]"}||jkr|j|dkr6tSPqWtSq WdS)NT)<03>__mro__<5F>__dict__<5F>NotImplemented)<05>CZmethods<64>mro<72>method<6F>Br r r!<00>_check_methodsHs


r,c@s(eZdZdZedd<03><00>Zedd<05><00>ZdS)r r cCsdS)Nrr )<01>selfr r r!<00>__hash__XszHashable.__hash__cCs|tkrt|d<01>StS)Nr.)r r,r')<02>clsr(r r r!<00>__subclasshook__\s
zHashable.__subclasshook__N)<08>__name__<5F>
__module__<EFBFBD> __qualname__<5F> __slots__rr.<00> classmethodr0r r r r!r Ts )<01> metaclassc@s(eZdZdZedd<03><00>Zedd<05><00>ZdS)rr ccs
dVdS)Nr )r-r r r!<00> __await__gszAwaitable.__await__cCs|tkrt|d<01>StS)Nr7)rr,r')r/r(r r r!r0ks
zAwaitable.__subclasshook__N)r1r2r3r4rr7r5r0r r r r!rcs c@s>eZdZdZedd<03><00>Zed dd<06><01>Zdd<08>Zed d
<EFBFBD><00>Z dS) rr cCst<00>dS)zcSend a value into the coroutine.
Return next yielded value or raise StopIteration.
N)<01> StopIteration)r-<00>valuer r r!<00>sendvszCoroutine.sendNcCs4|dkr|dkr|<01>|<01>}|dk r,|<02>|<03>}|<02>dS)zgRaise an exception in the coroutine.
Return next yielded value or raise StopIteration.
N)<01>with_traceback)r-<00>typ<79>val<61>tbr r r!<00>throw}s
zCoroutine.throwc Cs4y|<00>t<01>Wnttfk
r&Yn
Xtd<01><01>dS)z.Raise GeneratorExit inside coroutine.
zcoroutine ignored GeneratorExitN)r?<00> GeneratorExitr8<00> RuntimeError)r-r r r!<00>close<73>s
zCoroutine.closecCs|tkrt|dddd<04>StS)Nr7r:r?rB)rr,r')r/r(r r r!r0<00>szCoroutine.__subclasshook__)NN)
r1r2r3r4rr:r?rBr5r0r r r r!rrs   
c@s(eZdZdZedd<03><00>Zedd<05><00>ZdS)rr cCst<00>S)N)r)r-r r r!<00> __aiter__<5F>szAsyncIterable.__aiter__cCs|tkrt|d<01>StS)NrC)rr,r')r/r(r r r!r0<00>s
zAsyncIterable.__subclasshook__N)r1r2r3r4rrCr5r0r r r r!r<00>s c@s0eZdZdZedd<03><00>Zdd<05>Zedd<07><00>ZdS) rr c<00>st<00>dS)z@Return the next item or raise StopAsyncIteration when exhausted.N)<01>StopAsyncIteration)r-r r r!<00> __anext__<5F>szAsyncIterator.__anext__cCs|S)Nr )r-r r r!rC<00>szAsyncIterator.__aiter__cCs|tkrt|dd<02>StS)NrErC)rr,r')r/r(r r r!r0<00>s zAsyncIterator.__subclasshook__N) r1r2r3r4rrErCr5r0r r r r!r<00>s c@sFeZdZdZdd<03>Zedd<05><00>Zed dd<08><01>Zd d
<EFBFBD>Ze d d <0C><00>Z
dS)rr c<00>s|<00>d<01>IdHS)zpReturn the next item from the asynchronous generator.
When exhausted, raise StopAsyncIteration.
N)<01>asend)r-r r r!rE<00>szAsyncGenerator.__anext__c<00>st<00>dS)zuSend a value into the asynchronous generator.
Return next yielded value or raise StopAsyncIteration.
N)rD)r-r9r r r!rF<00>szAsyncGenerator.asendNc<00>s4|dkr|dkr|<01>|<01>}|dk r,|<02>|<03>}|<02>dS)zyRaise an exception in the asynchronous generator.
Return next yielded value or raise StopAsyncIteration.
N)r;)r-r<r=r>r r r!<00>athrow<6F>s
zAsyncGenerator.athrowc <00>s:y|<00>t<01>IdHWnttfk
r,Yn
Xtd<02><01>dS)z.Raise GeneratorExit inside coroutine.
Nz,asynchronous generator ignored GeneratorExit)rGr@rDrA)r-r r r!<00>aclose<73>s
zAsyncGenerator.aclosecCs|tkrt|ddddd<05>StS)NrCrErFrGrH)rr,r')r/r(r r r!r0<00>s
zAsyncGenerator.__subclasshook__)NN) r1r2r3r4rErrFrGrHr5r0r r r r!r<00>s  
c@s(eZdZdZedd<03><00>Zedd<05><00>ZdS)r
r ccsdS)Nr )r-r r r!<00>__iter__<5F>szIterable.__iter__cCs|tkrt|d<01>StS)NrI)r
r,r')r/r(r r r!r0<00>s
zIterable.__subclasshook__N)r1r2r3r4rrIr5r0r r r r!r
<00>s c@s0eZdZdZedd<03><00>Zdd<05>Zedd<07><00>ZdS) r r cCst<00>dS)zKReturn the next item from the iterator. When exhausted, raise StopIterationN)r8)r-r r r!<00>__next__szIterator.__next__cCs|S)Nr )r-r r r!rI szIterator.__iter__cCs|tkrt|dd<02>StS)NrIrJ)r r,r')r/r(r r r!r0s zIterator.__subclasshook__N) r1r2r3r4rrJrIr5r0r r r r!r s c@s(eZdZdZedd<03><00>Zedd<05><00>ZdS)r r ccsdS)Nr )r-r r r!<00> __reversed__)szReversible.__reversed__cCs|tkrt|dd<02>StS)NrKrI)r r,r')r/r(r r r!r0.s zReversible.__subclasshook__N)r1r2r3r4rrKr5r0r r r r!r %s c@sFeZdZdZdd<03>Zedd<05><00>Zed dd<08><01>Zd d
<EFBFBD>Ze d d <0C><00>Z
dS)r r cCs
|<00>d<01>S)z^Return the next item from the generator.
When exhausted, raise StopIteration.
N)r:)r-r r r!rJ9szGenerator.__next__cCst<00>dS)zcSend a value into the generator.
Return next yielded value or raise StopIteration.
N)r8)r-r9r r r!r:?szGenerator.sendNcCs4|dkr|dkr|<01>|<01>}|dk r,|<02>|<03>}|<02>dS)zgRaise an exception in the generator.
Return next yielded value or raise StopIteration.
N)r;)r-r<r=r>r r r!r?Fs
zGenerator.throwc Cs4y|<00>t<01>Wnttfk
r&Yn
Xtd<01><01>dS)z.Raise GeneratorExit inside generator.
zgenerator ignored GeneratorExitN)r?r@r8rA)r-r r r!rBSs
zGenerator.closecCs|tkrt|ddddd<05>StS)NrIrJr:r?rB)r r,r')r/r(r r r!r0]s
zGenerator.__subclasshook__)NN) r1r2r3r4rJrr:r?rBr5r0r r r r!r 5s  
c@s(eZdZdZedd<03><00>Zedd<05><00>ZdS)rr cCsdS)Nrr )r-r r r!<00>__len__ksz Sized.__len__cCs|tkrt|d<01>StS)NrL)rr,r')r/r(r r r!r0os
zSized.__subclasshook__N)r1r2r3r4rrLr5r0r r r r!rgs c@s(eZdZdZedd<03><00>Zedd<05><00>ZdS)rr cCsdS)NFr )r-<00>xr r r!<00> __contains__zszContainer.__contains__cCs|tkrt|d<01>StS)NrN)rr,r')r/r(r r r!r0~s
zContainer.__subclasshook__N)r1r2r3r4rrNr5r0r r r r!rvs c@seZdZdZedd<03><00>ZdS)rr cCs|tkrt|ddd<03>StS)NrLrIrN)rr,r')r/r(r r r!r0<00>szCollection.__subclasshook__N)r1r2r3r4r5r0r r r r!r<00>sc@s(eZdZdZedd<03><00>Zedd<05><00>ZdS)rr cOsdS)NFr )r-<00>args<67>kwdsr r r!<00>__call__<5F>szCallable.__call__cCs|tkrt|d<01>StS)NrQ)rr,r')r/r(r r r!r0<00>s
zCallable.__subclasshook__N)r1r2r3r4rrQr5r0r r r r!r<00>s c@s<>eZdZdZdZdd<04>Zdd<06>Zdd<08>Zd d
<EFBFBD>Zd d <0C>Z e
d d<0E><00>Z dd<10>Z e Z dd<12>Zdd<14>ZeZdd<16>Zdd<18>Zdd<1A>ZeZdd<1C>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<01>stSt|<00>t|<01>kr"dSx|D]}||kr(dSq(WdS)NFT)<04>
isinstancerr'<00>len)r-<00>other<65>elemr r r!<00>__le__<5F>s

z
Set.__le__cCs(t|t<01>stSt|<00>t|<01>ko&|<00>|<01>S)N)rRrr'rSrV)r-rTr r r!<00>__lt__<5F>s
z
Set.__lt__cCs(t|t<01>stSt|<00>t|<01>ko&|<00>|<01>S)N)rRrr'rS<00>__ge__)r-rTr r r!<00>__gt__<5F>s
z
Set.__gt__cCs@t|t<01>stSt|<00>t|<01>kr"dSx|D]}||kr(dSq(WdS)NFT)rRrr'rS)r-rTrUr r r!rX<00>s

z
Set.__ge__cCs(t|t<01>stSt|<00>t|<01>ko&|<00>|<01>S)N)rRrr'rSrV)r-rTr r r!<00>__eq__<5F>s
z
Set.__eq__cCs||<01>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 )r/<00>itr r r!<00>_from_iterable<6C>szSet._from_iterablecs&t|t<01>stS<00><00><03>fdd<02>|D<00><01>S)Nc3s|]}|<01>kr|VqdS)Nr )<02>.0r9)r-r r!<00> <genexpr><3E>szSet.__and__.<locals>.<genexpr>)rRr
r'r\)r-rTr )r-r!<00>__and__<5F>s
z Set.__and__cCsx|D]}||krdSqWdS)z1Return True if two sets have a null intersection.FTr )r-rTr9r r r!<00>
isdisjoint<EFBFBD>s
zSet.isdisjointcCs*t|t<01>stSdd<02>||fD<00>}|<00>|<02>S)Ncss|]}|D]
}|Vq
qdS)Nr )r]<00>s<>er r r!r^<00>szSet.__or__.<locals>.<genexpr>)rRr
r'r\)r-rTZchainr r r!<00>__or__<5F>s
z
Set.__or__cs:t<00>t<01>s"t<00>t<02>stS|<00><04><00><01>|<00><04>fdd<02>|D<00><01>S)Nc3s|]}|<01>kr|VqdS)Nr )r]r9)rTr r!r^<00>szSet.__sub__.<locals>.<genexpr>)rRrr
r'r\)r-rTr )rTr!<00>__sub__<5F>s



z Set.__sub__cs:t|t<01>s"t|t<02>stS<00><00>|<01>}<01><00><04>fdd<02>|D<00><01>S)Nc3s|]}|<01>kr|VqdS)Nr )r]r9)r-r r!r^<00>szSet.__rsub__.<locals>.<genexpr>)rRrr
r'r\)r-rTr )r-r!<00>__rsub__<5F>s



z Set.__rsub__cCs2t|t<01>s"t|t<02>stS|<00>|<01>}||||BS)N)rRrr
r'r\)r-rTr r r!<00>__xor__s



z Set.__xor__cCs<>tj}d|d}t|<00>}d|d}||M}x4|D],}t|<05>}|||d>AdAdN}||M}q4W|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.
<20>riM<69><4D>r<EFBFBD>i<>M[l<00>4~2i<> i<><69>6<><36><EFBFBD><EFBFBD><EFBFBD>i<EFBFBD><69>8#)<04>sys<79>maxsizerS<00>hash)r-ZMAXZMASK<53>n<>hrMZhxr r r!<00>_hash s   
   z Set._hashN)r1r2r3<00>__doc__r4rVrWrYrXrZr5r\r_<00>__rand__r`rc<00>__ror__rdrerf<00>__rxor__ror r r r!r<00>s$


 c@sdeZdZdZdZedd<04><00>Zedd<06><00>Zdd<08>Zd d
<EFBFBD>Z d d <0C>Z
d d<0E>Z dd<10>Z dd<12>Z dd<14>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<00>dS)zAdd an element.N)<01>NotImplementedError)r-r9r r r!<00>add:szMutableSet.addcCst<00>dS)z8Remove an element. Do not raise an exception if absent.N)rt)r-r9r r r!<00>discard?szMutableSet.discardcCs||krt|<01><01>|<00>|<01>dS)z5Remove an element. If not a member, raise a KeyError.N)<02>KeyErrorrv)r-r9r r r!<00>removeDszMutableSet.removecCs>t|<00>}y t|<01>}Wntk
r.td<01>YnX|<00>|<02>|S)z2Return the popped value. Raise KeyError if empty.N)<05>iter<65>nextr8rwrv)r-r[r9r r r!<00>popJs  
zMutableSet.popcCs,yx |<00><00>qWWntk
r&YnXdS)z6This is slow (creates N new iterators!) but effective.N)r{rw)r-r r r!<00>clearTs
zMutableSet.clearcCsx|D]}|<00>|<02>qW|S)N)ru)r-r[r9r r r!<00>__ior__\s
zMutableSet.__ior__cCs x||D]}|<00>|<02>q
W|S)N)rv)r-r[r9r r r!<00>__iand__aszMutableSet.__iand__cCsV||kr|<00><00>n@t|t<02>s&|<00>|<01>}x*|D]"}||krD|<00>|<02>q,|<00>|<02>q,W|S)N)r|rRrr\rvru)r-r[r9r r r!<00>__ixor__fs



 zMutableSet.__ixor__cCs.||kr|<00><00>nx|D]}|<00>|<02>qW|S)N)r|rv)r-r[r9r r r!<00>__isub__ss


zMutableSet.__isub__N)r1r2r3rpr4rrurvrxr{r|r}r~rr<>r r r r!r,s
  
 c@sReZdZdZedd<03><00>Zddd<06>Zdd<08>Zd d
<EFBFBD>Zd d <0C>Z d d<0E>Z
dd<10>Z dZ dS)rr cCst<00>dS)N)rw)r-<00>keyr r r!<00> __getitem__<5F>szMapping.__getitem__NcCs"y||Stk
r|SXdS)z<D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.N)rw)r-r<><00>defaultr r r!<00>get<65>sz Mapping.getcCs*y ||Wntk
r dSXdSdS)NFT)rw)r-r<>r r r!rN<00>s
 zMapping.__contains__cCst|<00>S)z:D.keys() -> a set-like object providing a view on D's keys)r)r-r r r!<00>keys<79>sz Mapping.keyscCst|<00>S)z<D.items() -> a set-like object providing a view on D's items)r)r-r r r!<00>items<6D>sz Mapping.itemscCst|<00>S)z6D.values() -> an object providing a view on D's values)r)r-r r r!<00>values<65>szMapping.valuescCs&t|t<01>stSt|<00><04><00>t|<01><04><00>kS)N)rRrr'<00>dictr<74>)r-rTr r r!rZ<00>s
zMapping.__eq__)N) r1r2r3r4rr<>r<>rNr<>r<>r<>rZrKr r r r!r<00>s

c@s(eZdZdZdd<03>Zdd<05>Zdd<07>ZdS) r)<01>_mappingcCs
||_dS)N)r<>)r-Zmappingr r r!<00>__init__<5F>szMappingView.__init__cCs
t|j<01>S)N)rSr<>)r-r r r!rL<00>szMappingView.__len__cCs
d<01>|<00>S)Nz&{0.__class__.__name__}({0._mapping!r}))<01>format)r-r r r!<00>__repr__<5F>szMappingView.__repr__N)r1r2r3r4r<>rLr<>r r r r!r<00>sc@s,eZdZdZedd<03><00>Zdd<05>Zdd<07>ZdS) rr cCst|<01>S)N)<01>set)r-r[r r r!r\<00>szKeysView._from_iterablecCs
||jkS)N)r<>)r-r<>r r r!rN<00>szKeysView.__contains__ccs|jEdHdS)N)r<>)r-r r r!rI<00>szKeysView.__iter__N)r1r2r3r4r5r\rNrIr r r r!r<00>s c@s,eZdZdZedd<03><00>Zdd<05>Zdd<07>ZdS) rr cCst|<01>S)N)r<>)r-r[r r r!r\<00>szItemsView._from_iterablecCs@|\}}y|j|}Wntk
r*dSX||kp:||kSdS)NF)r<>rw)r-<00>itemr<6D>r9<00>vr r r!rN<00>s zItemsView.__contains__ccs$x|jD]}||j|fVqWdS)N)r<>)r-r<>r r r!rI<00>s zItemsView.__iter__N)r1r2r3r4r5r\rNrIr r r r!r<00>s  c@s eZdZdZdd<03>Zdd<05>ZdS)rr cCs2x,|jD]"}|j|}||ks&||krdSqWdS)NTF)r<>)r-r9r<>r<>r r r!rN<00>s
 
zValuesView.__contains__ccs x|jD]}|j|VqWdS)N)r<>)r-r<>r r r!rI<00>s zValuesView.__iter__N)r1r2r3r4rNrIr r r r!r<00>sc@s\eZdZdZedd<03><00>Zedd<05><00>Ze<07>Zefdd<07>Z dd <09>Z
d
d <0B>Z d d <0A>Z ddd<10>Z dS)rr cCst<00>dS)N)rw)r-r<>r9r r r!<00> __setitem__ szMutableMapping.__setitem__cCst<00>dS)N)rw)r-r<>r r r!<00> __delitem__szMutableMapping.__delitem__cCs<y ||}Wn tk
r,||jkr(<28>|SX||=|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)rw<00>_MutableMapping__marker)r-r<>r<>r9r r r!r{s 
zMutableMapping.popcCsBytt|<00><01>}Wntk
r*td<01>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)rzryr8rw)r-r<>r9r r r!<00>popitem$s zMutableMapping.popitemcCs,yx |<00><00>qWWntk
r&YnXdS)z,D.clear() -> None. Remove all items from D.N)r<>rw)r-r r r!r|0s
zMutableMapping.clearcOs<>|s td<01><01>|^}}t|<00>dkr0tdt|<00><00><01>|r<>|d}t|t<03>rbx^|D]}||||<qLWnDt|d<05>r<>x8|<03><05>D]}||||<qvWnx|D]\}}|||<q<>Wx|<01><06>D]\}}|||<q<>WdS)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
z@descriptor 'update' of 'MutableMapping' object needs an argumentrz+update expected at most 1 arguments, got %drr<>N)<07> TypeErrorrSrRr<00>hasattrr<72>r<>)rOrPr-rTr<>r9r r r!<00>update8s$  


 zMutableMapping.updateNcCs*y||Stk
r$|||<YnX|S)z@D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D)rw)r-r<>r<>r r r!<00>
setdefaultSs
zMutableMapping.setdefault)N)r1r2r3r4rr<>r<><00>objectr<74>r{r<>r|r<>r<>r r r r!r<00>s    c@sJeZdZdZdZedd<04><00>Zdd<06>Zdd<08>Zd d
<EFBFBD>Z dd d<0E>Z
dd<10>Z d S)rz<>All the operations on a read-only sequence.
Concrete subclasses must override __new__ or __init__,
__getitem__, and __len__.
r cCst<00>dS)N)<01>
IndexError)r-<00>indexr r r!r<>kszSequence.__getitem__ccs>d}y x||}|V|d7}qWWntk
r8dSXdS)Nrr)r<>)r-<00>ir<69>r r r!rIoszSequence.__iter__cCs&x |D]}||ks||krdSqWdS)NTFr )r-r9r<>r r r!rNys
zSequence.__contains__ccs(x"ttt|<00><01><01>D]}||VqWdS)N)<03>reversed<65>rangerS)r-r<>r r r!rKszSequence.__reversed__rNcCs<>|dk r"|dkr"tt|<00>|d<02>}|dk r>|dkr>|t|<00>7}|}xT|dksT||kr<>y ||}||ksn||krr|SWntk
r<EFBFBD>PYnX|d7}qDWt<03>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)<04>maxrSr<><00>
ValueError)r-r9<00>start<72>stopr<70>r<>r r r!r<><00>s  zSequence.indexcst<00>fdd<02>|D<00><01>S)zBS.count(value) -> integer -- return number of occurrences of valuec3s"|]}|<01>ks|<01>krdVqdS)rNr )r]r<>)r9r r!r^<00>sz!Sequence.count.<locals>.<genexpr>)<01>sum)r-r9r )r9r!<00>count<6E>szSequence.count)rN) r1r2r3rpr4rr<>rIrNrKr<>r<>r r r r!ras 

c@seZdZdZdZdS)rzMThis unifies bytes and bytearray.
XXX Should add all their methods.
r N)r1r2r3rpr4r r r r!r<00>sc@sneZdZdZedd<03><00>Zedd<05><00>Zedd<07><00>Zdd <09>Zd
d <0B>Z d d <0A>Z
dd<0F>Z ddd<12>Z dd<14>Z dd<16>ZdS)rr cCst<00>dS)N)r<>)r-r<>r9r r r!r<><00>szMutableSequence.__setitem__cCst<00>dS)N)r<>)r-r<>r r r!r<><00>szMutableSequence.__delitem__cCst<00>dS)z3S.insert(index, value) -- insert value before indexN)r<>)r-r<>r9r r r!<00>insert<72>szMutableSequence.insertcCs|<00>t|<00>|<01>dS)z:S.append(value) -- append value to the end of the sequenceN)r<>rS)r-r9r r r!<00>append<6E>szMutableSequence.appendcCs,yx |<00><00>qWWntk
r&YnXdS)z,S.clear() -> None -- remove all items from SN)r{r<>)r-r r r!r|<00>s
zMutableSequence.clearcCsLt|<00>}x>t|d<00>D].}|||d||||<|||d<qWdS)z!S.reverse() -- reverse *IN PLACE*rgrN)rSr<>)r-rmr<>r r r!<00>reverse<73>szMutableSequence.reversecCsx|D]}|<00>|<02>qWdS)zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)r<>)r-r<>r<>r r r!<00>extend<6E>s
zMutableSequence.extendricCs||}||=|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 )r-r<>r<>r r r!r{<00>szMutableSequence.popcCs||<00>|<01>=dS)zvS.remove(value) -- remove first occurrence of value.
Raise ValueError if the value is not present.
N)r<>)r-r9r r r!rx<00>szMutableSequence.removecCs|<00>|<01>|S)N)r<>)r-r<>r r r!<00>__iadd__<5F>s
zMutableSequence.__iadd__N)ri)r1r2r3r4rr<>r<>r<>r<>r|r<>r<>r{rxr<>r r r r!r<00>s   
)Krp<00>abcrrrj<00>__all__r1<00>typeryZbytes_iterator<6F> bytearrayZbytearray_iteratorr<72>Zdict_keyiteratorr<72>Zdict_valueiteratorr<72>Zdict_itemiteratorZ list_iteratorr<72>Zlist_reverseiteratorr<72>Zrange_iteratorZlongrange_iteratorr<72>Z set_iteratorZ str_iteratorZtuple_iterator<6F>zipZ zip_iteratorZ dict_keysZ dict_valuesZ
dict_itemsr&Z mappingproxyZ generatorr#Z coroutinerBr$Zasync_generatorr,r rr<00>registerrrrr
r r r rrrrr<00> frozensetrrrrrrrr<>r<00>tuple<6C>str<74>
memoryviewr<00>bytesr<00>listr r r r!<00><module>s<>
       
 )
0













/


O
2



\
=





A

Reference in New Issue Copy Permalink