⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.144
Server IP:
157.245.143.252
Server:
Linux www 6.11.0-9-generic #9-Ubuntu SMP PREEMPT_DYNAMIC Mon Oct 14 13:19:59 UTC 2024 x86_64
Server Software:
nginx/1.26.0
PHP Version:
8.3.11
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
snap
/
core
/
17210
/
usr
/
lib
/
python3.5
/
__pycache__
/
View File Name :
_collections_abc.cpython-35.pyc
f` @ s d Z d d l m Z m Z d d l Z d d d d d d d d d d d d d d d d d d d d d d g Z d Z e e d Z e e e Z e e i j Z e e i j Z e e i j Z e e g Z e e e g Z e e e d Z e e e Z e e d Z e e f Z e e e Z e i j Z e i j Z e i j Z e e j Z! e d d Z" d d Z# e# Z# e e# Z$ e# j% [# Gd! d d d" e Z& Gd# d d d" e Z' Gd$ d d e' Z( e( j) e$ Gd% d d d" e Z* Gd& d d e* Z+ Gd' d d d" e Z, Gd( d d e, Z- e- j) e e- j) e e- j) e e- j) e e- j) e e- j) e e- j) e e- j) e e- j) e e- j) e e- j) e e- j) e Gd) d d e- Z. e. j) e" Gd* d d d" e Z/ Gd+ d d d" e Z0 Gd, d d d" e Z1 Gd- d d e/ e, e0 Z2 e2 j) e3 Gd. d d e2 Z4 e4 j) e Gd/ d d e/ e, e0 Z5 e5 j) e! Gd0 d d e/ Z6 Gd1 d d e6 e2 Z7 e7 j) e Gd2 d d e6 e2 Z8 e8 j) e Gd3 d d e6 Z9 e9 j) e Gd4 d d e5 Z: e: j) e; Gd5 d d e/ e, e0 Z< e< j) e= e< j) e> e< j) e e< j) e? Gd6 d d e< Z@ e@ j) eA e@ j) e Gd7 d d e< ZB eB j) eC eB j) e d S)8zjAbstract Base Classes (ABCs) for collections, according to PEP 3119. Unit tests are in test_collections. )ABCMetaabstractmethodN Awaitable Coroutine AsyncIterable AsyncIteratorHashableIterableIterator GeneratorSized ContainerCallableSet MutableSetMappingMutableMapping MappingViewKeysView ItemsView ValuesViewSequenceMutableSequence ByteStringzcollections.abc c c s d VS)N r r r &/usr/lib/python3.5/_collections_abc.py<lambda>6 s r c s d S)Nr r r r r _coro8 s r c @ s: e Z d Z f Z e d d Z e d d Z d S)r c C s d S)Nr r )selfr r r __hash__E s zHashable.__hash__c C sE | t k rA x2 | j D]' } d | j k r | j d r< d SPq Wt S)Nr! T)r __mro____dict__NotImplemented)clsCBr r r __subclasshook__I s zHashable.__subclasshook__N)__name__ __module__ __qualname__ __slots__r r! classmethodr( r r r r r A s metaclassc @ s: e Z d Z f Z e d d Z e d d Z d S)r c c s d Vd S)Nr )r r r r __await__X s zAwaitable.__await__c C sE | t k rA x2 | j D]' } d | j k r | j d r< d SPq Wt S)Nr/ T)r r" r# r$ )r% r& r' r r r r( \ s zAwaitable.__subclasshook__N)r) r* r+ r, r r/ r- r( r r r r r T s c @ s^ e Z d Z f Z e d d Z e d d d d Z d d Z e d d Z d S) r c C s t d S)zcSend a value into the coroutine. Return next yielded value or raise StopIteration. N) StopIteration)r valuer r r sendk s zCoroutine.sendNc C sL | d k r' | d k r | | } | d k rB | j | } | d S)zgRaise an exception in the coroutine. Return next yielded value or raise StopIteration. N)with_traceback)r typvaltbr r r throwr s zCoroutine.throwc C s< y | j t Wn t t f k r+ Yn Xt d d S)z.Raise GeneratorExit inside coroutine. z coroutine ignored GeneratorExitN)r7 GeneratorExitr0 RuntimeError)r r r r close s zCoroutine.closec C sS | t k rO | j } x3 d D]+ } x" | D] } | | j k r) Pq) Wt Sq Wd St S)Nr/ r2 r7 r: T)z __await__zsendzthrowzclose)r r" r# r$ )r% r& mromethodbaser r r r( s zCoroutine.__subclasshook__) r) r* r+ r, r r2 r7 r: r- r( r r r r r g s c @ s: e Z d Z f Z e d d Z e d d Z d S)r c C s t S)N)r )r r r r __aiter__ s zAsyncIterable.__aiter__c C s0 | t k r, t d d | j D r, d St S)Nc s s | ] } d | j k Vq d S)r> N)r# ).0r' r r r <genexpr> s z1AsyncIterable.__subclasshook__.<locals>.<genexpr>T)r anyr" r$ )r% r& r r r r( s z AsyncIterable.__subclasshook__N)r) r* r+ r, r r> r- r( r r r r r s c @ sF e Z d Z f Z e d d Z d d Z e d d Z d S)r c s t d S)z@Return the next item or raise StopAsyncIteration when exhausted.N)StopAsyncIteration)r r r r __anext__ s zAsyncIterator.__anext__c C s | S)Nr )r r r r r> s zAsyncIterator.__aiter__c C sL | t k rH t d d | j D rH t d d | j D rH d St S)Nc s s | ] } d | j k Vq d S)rC N)r# )r? r' r r r r@ s z1AsyncIterator.__subclasshook__.<locals>.<genexpr>c s s | ] } d | j k Vq d S)r> N)r# )r? r' r r r r@ s T)r rA r" r$ )r% r& r r r r( s z AsyncIterator.__subclasshook__N) r) r* r+ r, r rC r> r- r( r r r r r s c @ s: e Z d Z f Z e d d Z e d d Z d S)r c c s d S)Nr )r r r r __iter__ s zIterable.__iter__c C s0 | t k r, t d d | j D r, d St S)Nc s s | ] } d | j k Vq d S)rD N)r# )r? r' r r r r@ s z,Iterable.__subclasshook__.<locals>.<genexpr>T)r rA r" r$ )r% r& r r r r( s zIterable.__subclasshook__N)r) r* r+ r, r rD r- r( r r r r r s c @ sF e Z d Z f Z e d d Z d d Z e d d Z d S)r c C s t d S)zKReturn the next item from the iterator. When exhausted, raise StopIterationN)r0 )r r r r __next__ s zIterator.__next__c C s | S)Nr )r r r r rD s zIterator.__iter__c C sL | t k rH t d d | j D rH t d d | j D rH d St S)Nc s s | ] } d | j k Vq d S)rE N)r# )r? r' r r r r@ s z,Iterator.__subclasshook__.<locals>.<genexpr>c s s | ] } d | j k Vq d S)rD N)r# )r? r' r r r r@ s T)r rA r" r$ )r% r& r r r r( s zIterator.__subclasshook__N) r) r* r+ r, r rE rD r- r( r r r r r s c @ sj e Z d Z f Z d d Z e d d Z e d d d d Z d d Z e d d Z d S) r c C s | j d S)z^Return the next item from the generator. When exhausted, raise StopIteration. N)r2 )r r r r rE s zGenerator.__next__c C s t d S)zcSend a value into the generator. Return next yielded value or raise StopIteration. N)r0 )r r1 r r r r2 s zGenerator.sendNc C sL | d k r' | d k r | | } | d k rB | j | } | d S)zgRaise an exception in the generator. Return next yielded value or raise StopIteration. N)r3 )r r4 r5 r6 r r r r7 s zGenerator.throwc C s< y | j t Wn t t f k r+ Yn Xt d d S)z.Raise GeneratorExit inside generator. z generator ignored GeneratorExitN)r7 r8 r0 r9 )r r r r r: s zGenerator.closec C sS | t k rO | j } x3 d D]+ } x" | D] } | | j k r) Pq) Wt Sq Wd St S)NrD rE r2 r7 r: T)z__iter__z__next__zsendzthrowzclose)r r" r# r$ )r% r& r; r< r= r r r r( s zGenerator.__subclasshook__) r) r* r+ r, rE r r2 r7 r: r- r( r r r r r s c @ s: e Z d Z f Z e d d Z e d d Z d S)r c C s d S)Nr r )r r r r __len__0 s z Sized.__len__c C s0 | t k r, t d d | j D r, d St S)Nc s s | ] } d | j k Vq d S)rF N)r# )r? r' r r r r@ 7 s z)Sized.__subclasshook__.<locals>.<genexpr>T)r rA r" r$ )r% r& r r r r( 4 s zSized.__subclasshook__N)r) r* r+ r, r rF r- r( r r r r r , s c @ s: e Z d Z f Z e d d Z e d d Z d S)r c C s d S)NFr )r xr r r __contains__@ s zContainer.__contains__c C s0 | t k r, t d d | j D r, d St S)Nc s s | ] } d | j k Vq d S)rH N)r# )r? r' r r r r@ G s z-Container.__subclasshook__.<locals>.<genexpr>T)r rA r" r$ )r% r& r r r r( D s zContainer.__subclasshook__N)r) r* r+ r, r rH r- r( r r r r r < s c @ s: e Z d Z f Z e d d Z e d d Z d S)r c O s d S)NFr )r argskwdsr r r __call__P s zCallable.__call__c C s0 | t k r, t d d | j D r, d St S)Nc s s | ] } d | j k Vq d S)rK N)r# )r? r' r r r r@ W s z,Callable.__subclasshook__.<locals>.<genexpr>T)r rA r" r$ )r% r& r r r r( T s zCallable.__subclasshook__N)r) r* r+ r, r rK r- r( r r r r r L s c @ s e Z d Z d Z f Z d d Z d d Z d d Z d d Z d d Z e d d Z d d Z e Z d d Z d d Z e Z d d Z d d Z d d Z e Z d d Z d 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. c C sT t | t s t St | t | k r/ d Sx | D] } | | k r6 d Sq6 Wd S)NFT) isinstancer r$ len)r otherelemr r r __le__m s z Set.__le__c C s8 t | t s t St | t | k o7 | j | S)N)rL r r$ rM rP )r rN r r r __lt__w s z Set.__lt__c C s8 t | t s t St | t | k o7 | j | S)N)rL r r$ rM __ge__)r rN r r r __gt__| s z Set.__gt__c C sT t | t s t St | t | k r/ d Sx | D] } | | k r6 d Sq6 Wd S)NFT)rL r r$ rM )r rN rO r r r rR s z Set.__ge__c C s8 t | t s t St | t | k o7 | j | S)N)rL r r$ rM rP )r rN 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 )r% itr r r _from_iterable s zSet._from_iterablec s3 t | t s t S j f d d | D S)Nc 3 s! | ] } | k r | Vq d S)Nr )r? r1 )r r r r@ s z Set.__and__.<locals>.<genexpr>)rL r r$ rV )r rN r )r r __and__ s z Set.__and__c C s% x | D] } | | k r d Sq Wd S)z1Return True if two sets have a null intersection.FTr )r rN r1 r r r isdisjoint s zSet.isdisjointc C s9 t | t s t Sd d | | f D } | j | S)Nc s s" | ] } | D] } | Vq q d S)Nr )r? ser r r r@ s z Set.__or__.<locals>.<genexpr>)rL r r$ rV )r rN chainr r r __or__ s z Set.__or__c sQ t t s1 t t s" t S| j | j f d d | D S)Nc 3 s! | ] } | k r | Vq d S)Nr )r? r1 )rN r r r@ s z Set.__sub__.<locals>.<genexpr>)rL r r r$ rV )r rN r )rN r __sub__ s z Set.__sub__c sQ t | t s1 t | t s" t S j | } j f d d | D S)Nc 3 s! | ] } | k r | Vq d S)Nr )r? r1 )r r r r@ s z Set.__rsub__.<locals>.<genexpr>)rL r r r$ rV )r rN r )r r __rsub__ s z Set.__rsub__c C sA t | t s1 t | t s" t S| j | } | | | | BS)N)rL r r r$ rV )r rN r r r __xor__ s z Set.__xor__c C s t j } d | d } t | } d | d } | | M} x> | D]6 } t | } | | | d >Ad Ad N} | | M} qB W| d d } | | M} | | k r | | d 8} | d k r 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. iMr iM[l 4~2 i i6i8#)sysmaxsizerM hash)r MAXMASKnhrG hxr r r _hash s z Set._hashN)r) r* r+ __doc__r, rP rQ rS rR rT r- rV rW __rand__rX r\ __ror__r] r^ r_ __rxor__rl r r r r r _ s$ c @ s e Z d Z d Z f Z e d d Z e d d Z d d Z d d Z d d Z d d Z d d Z d d Z d d Z d S)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. c C s t d S)zAdd an element.N)NotImplementedError)r r1 r r r add s zMutableSet.addc C s t d S)z8Remove an element. Do not raise an exception if absent.N)rq )r r1 r r r discard s zMutableSet.discardc C s) | | k r t | | j | d S)z5Remove an element. If not a member, raise a KeyError.N)KeyErrorrs )r r1 r r r remove s zMutableSet.removec C sH t | } y t | } Wn t k r6 t Yn X| j | | S)z2Return the popped value. Raise KeyError if empty.)iternextr0 rt rs )r rU r1 r r r pop s zMutableSet.popc C s. y x | j q WWn t k r) Yn Xd S)z6This is slow (creates N new iterators!) but effective.N)rx rt )r r r r clear s zMutableSet.clearc C s" x | D] } | j | q W| S)N)rr )r rU r1 r r r __ior__ s zMutableSet.__ior__c C s& x | | D] } | j | q W| S)N)rs )r rU r1 r r r __iand__ s zMutableSet.__iand__c C su | | k r | j nX t | t s7 | j | } x7 | D]/ } | | k r` | j | q> | j | q> W| S)N)ry rL r rV rs rr )r rU r1 r r r __ixor__% s zMutableSet.__ixor__c C s; | | k r | j n x | D] } | j | q W| S)N)ry rs )r rU r1 r r r __isub__2 s zMutableSet.__isub__N)r) r* r+ rm r, r rr rs ru rx ry rz r{ r| r} r r r r r s c @ ss e Z d Z f Z e d d Z d d d Z d d Z d d Z d d Z d d Z d d Z d S)r c C s t d S)N)rt )r keyr r r __getitem__L s zMapping.__getitem__Nc C s) y | | SWn t k r$ | SYn Xd S)z<D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.N)rt )r r~ defaultr r r getP s z Mapping.getc C s- y | | Wn t k r$ d SYn Xd Sd S)NFT)rt )r r~ r r r rH W s zMapping.__contains__c C s t | S)z:D.keys() -> a set-like object providing a view on D's keys)r )r 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 )r r r r itemsc s z Mapping.itemsc C s t | S)z6D.values() -> an object providing a view on D's values)r )r r r r valuesg s zMapping.valuesc C s5 t | t s t St | j t | j k S)N)rL r r$ dictr )r rN r r r rT k s zMapping.__eq__) r) r* r+ r, r r r rH r r r rT r r r r r @ s c @ s: e Z d Z d Z d d Z d d Z d d Z d S) r _mappingc C s | | _ d S)N)r )r mappingr r r __init__w s zMappingView.__init__c C s t | j S)N)rM r )r r r r rF z s zMappingView.__len__c C s d j | S)Nz&{0.__class__.__name__}({0._mapping!r}))format)r r r r __repr__} s zMappingView.__repr__N)z_mapping)r) r* r+ r, r rF r r r r r r s s c @ s@ e Z d Z f Z e d d Z d d Z d d Z d S)r c C s t | S)N)set)r rU r r r rV s zKeysView._from_iterablec C s | | j k S)N)r )r r~ r r r rH s zKeysView.__contains__c c s | j Ed Hd S)N)r )r r r r rD s zKeysView.__iter__N)r) r* r+ r, r- rV rH rD r r r r r s c @ s@ e Z d Z f Z e d d Z d d Z d d Z d S)r c C s t | S)N)r )r rU r r r rV s zItemsView._from_iterablec C sD | \ } } y | j | } Wn t k r5 d SYn X| | k Sd S)NF)r rt )r itemr~ r1 vr r r rH s zItemsView.__contains__c c s* x# | j D] } | | j | f Vq Wd S)N)r )r r~ r r r rD s zItemsView.__iter__N)r) r* r+ r, r- rV rH rD r r r r r s c @ s. e Z d Z f Z d d Z d d Z d S)r c C s/ x( | j D] } | | j | k r d Sq Wd S)NTF)r )r r1 r~ r r r rH s zValuesView.__contains__c c s$ x | j D] } | j | Vq Wd S)N)r )r r~ r r r rD s zValuesView.__iter__N)r) r* r+ r, rH rD r r r r r s c @ s e Z d Z f Z e d d Z e d d Z e Z e d d Z d d Z d d Z d d Z d d d Z d S)r c C s t d S)N)rt )r r~ r1 r r r __setitem__ s zMutableMapping.__setitem__c C s t d S)N)rt )r r~ r r r __delitem__ s zMutableMapping.__delitem__c C sH y | | } Wn( t k r8 | | j k r0 | SYn X| | =| Sd 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. N)rt _MutableMapping__marker)r r~ r r1 r r r rx s zMutableMapping.popc C sL y t t | } Wn t k r0 t Yn X| | } | | =| | f S)zD.popitem() -> (k, v), remove and return some (key, value) pair as a 2-tuple; but raise KeyError if D is empty. )rw rv r0 rt )r r~ r1 r r r popitem s zMutableMapping.popitemc C s. y x | j q WWn t k r) Yn Xd S)z,D.clear() -> None. Remove all items from D.N)r rt )r r r r ry s zMutableMapping.clearc O s | s t d | ^ } } t | d k rF t d t | | r | d } t | t r xw | D] } | | | | <ql WnX t | d r xF | j D] } | | | | <q Wn! x | D] \ } } | | | <q Wx$ | j D] \ } } | | | <q Wd S)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 argumentra z+update expected at most 1 arguments, got %dr r N) TypeErrorrM rL r hasattrr r )rI rJ r rN r~ r1 r r r update s$ zMutableMapping.updateNc C s/ y | | SWn t k r* | | | <Yn X| S)z@D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D)rt )r r~ r r r r setdefault s zMutableMapping.setdefault)r) r* r+ r, r r r objectr rx r ry r r r r r r r s c @ sp e Z d Z d Z f Z e d d Z d d Z d d Z d d Z d d d d Z d d Z d S)r zAll the operations on a read-only sequence. Concrete subclasses must override __new__ or __init__, __getitem__, and __len__. c C s t d S)N) IndexError)r indexr r r r ' s zSequence.__getitem__c c sG d } y$ x | | } | V| d 7} q WWn t k rB d SYn Xd S)Nr ra )r )r ir r r r rD + s zSequence.__iter__c C s% x | D] } | | k r d Sq Wd S)NTFr )r r1 r r r r rH 5 s zSequence.__contains__c c s0 x) t t t | D] } | | Vq Wd S)N)reversedrangerM )r r r r r __reversed__; s zSequence.__reversed__r Nc C s | d k r1 | d k r1 t t | | d } | d k rY | d k rY | t | 7} | } xT | d k sz | | k r y | | | k r | SWn t k r PYn X| d 7} qb Wt d S)zS.index(value, [start, [stop]]) -> integer -- return first index of value. Raises ValueError if the value is not present. Nr ra )maxrM r ValueError)r r1 startstopr r r r r ? s zSequence.indexc s t f d d | D S)zBS.count(value) -> integer -- return number of occurrences of valuec 3 s! | ] } | k r d Vq d S)ra Nr )r? r )r1 r r r@ T s z!Sequence.count.<locals>.<genexpr>)sum)r r1 r )r1 r countR s zSequence.count) r) r* r+ rm r, r r rD rH r r r r r r r r s c @ s e Z d Z d Z f Z d S)r zMThis unifies bytes and bytearray. XXX Should add all their methods. N)r) r* r+ rm r, r r r r r \ s c @ s e Z d Z f Z e d d Z e d d Z e d d Z d d Z d d Z d d Z d d Z d d d Z d d Z d d Z d S)r c C s t d S)N)r )r r r1 r r r r t s zMutableSequence.__setitem__c C s t d S)N)r )r r r r r r x s zMutableSequence.__delitem__c C s t d S)z3S.insert(index, value) -- insert value before indexN)r )r r r1 r r r insert| s zMutableSequence.insertc C s | j t | | d S)z:S.append(value) -- append value to the end of the sequenceN)r rM )r r1 r r r append s zMutableSequence.appendc C s. y x | j q WWn t k r) Yn Xd S)z,S.clear() -> None -- remove all items from SN)rx r )r r r r ry s zMutableSequence.clearc C sX t | } xE t | d D]3 } | | | d | | | | <| | | d <q Wd S)z!S.reverse() -- reverse *IN PLACE*r` ra N)rM r )r ri r r r r reverse s zMutableSequence.reversec C s" x | D] } | j | q Wd S)zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)r )r r r r r r extend s zMutableSequence.extendra 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 )r r r r r r rx s zMutableSequence.popc C s | | j | =d S)zvS.remove(value) -- remove first occurrence of value. Raise ValueError if the value is not present. N)r )r r1 r r r ru s zMutableSequence.removec C s | j | | S)N)r )r r r r r __iadd__ s zMutableSequence.__iadd__Nrc )r) r* r+ r, r r r r r ry r r rx ru r r r r r r i s )Drm abcr r rd __all__r) typerv bytes_iterator bytearraybytearray_iteratorr dict_keyiteratorr dict_valueiteratorr dict_itemiterator list_iteratorr list_reverseiteratorr range_iteratorr set_iterator str_iteratortuple_iteratorzip zip_iterator dict_keys dict_values dict_itemsr# mappingproxy generatorr coroutiner: r r r registerr r r r r r r r r frozensetr r r r r r r r r tuplestr memoryviewr bytesr listr r r r <module> s 0 6 O 0 \ 9 A