????

Your IP : 216.73.217.84

Current Path : /opt/alt/python310/lib64/python3.10/__pycache__/
Upload File :
Current File : //opt/alt/python310/lib64/python3.10/__pycache__/_collections_abc.cpython-310.opt-1.pyc

o

0�i~�@s�dZddlmZmZddlZeee�Zed�Z	dd�Z
ee
�Z[
gd�ZdZ
eed	��Zeee���Zeei����Zeei����Zeei����Zeeg��Zeeeg���Zeeed���Zeeed
d>���Zeee���Zeed��Z eed
��Z!eee"���Z#ei���Z$ei���Z%ei���Z&eej'�Z(edd���Z)dd�Z*e*�Z*ee*�Z+e*�,�[*dd�Z-e-�Z-ee-�Z.[-dd�Z/Gdd�ded�Z0Gdd�ded�Z1Gdd�de1�Z2e2�3e+�Gdd�ded�Z4Gdd �d e4�Z5Gd!d"�d"e5�Z6e6�3e.�Gd#d$�d$ed�Z7Gd%d&�d&e7�Z8e8�3e�e8�3e�e8�3e�e8�3e�e8�3e�e8�3e�e8�3e�e8�3e�e8�3e�e8�3e�e8�3e �e8�3e!�e8�3e#�Gd'd(�d(e7�Z9Gd)d*�d*e8�Z:e:�3e)�Gd+d,�d,ed�Z;Gd-d.�d.ed�Z<Gd/d0�d0e;e7e<�Z=Gd1d2�d2e�Z>d3d4�Z?d5d6�Z@d7d8�ZAGd9d:�d:ed�ZBGd;d<�d<e=�ZCeC�3eD�Gd=d>�d>eC�ZEeE�3e�Gd?d@�d@e=�ZFeF�3e(�GdAdB�dBe;�ZGGdCdD�dDeGeC�ZHeH�3e$�GdEdF�dFeGeC�ZIeI�3e&�GdGdH�dHeGe=�ZJeJ�3e%�GdIdJ�dJeF�ZKeK�3eL�GdKdL�dLe9e=�ZMeM�3eN�eM�3eO�eM�3e�eM�3eP�GdMdN�dNeM�ZQeQ�3eR�eQ�3e�GdOdP�dPeM�ZSeS�3e�eS�3e�dS)QzjAbstract Base Classes (ABCs) for collections, according to PEP 3119.

Unit tests are in test_collections.
�)�ABCMeta�abstractmethodN.cCsdS�N�rrr�7/opt/alt/python310/lib64/python3.10/_collections_abc.py�_fsr)�	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��rccs�dVSrrrrrr�<lambda>>s�r$c�s�dSrrrrrr�_coro@s�r%cCs�dVdSrrrrrr�_agFs�
r&cGsN|j}|D]}|D]}||jvr|j|durtSnq	tSqdS)NT)�__mro__�__dict__�NotImplemented)�C�methods�mro�method�Brrr�_check_methodsNs
��r/c@�(eZdZdZedd��Zedd��ZdS)r
rcC�dS�Nrr��selfrrr�__hash__^�zHashable.__hash__cC�|tur	t|d�StS)Nr5)r
r/r)��clsr*rrr�__subclasshook__b�
zHashable.__subclasshook__N)�__name__�
__module__�__qualname__�	__slots__rr5�classmethodr:rrrrr
Z�
r
)�	metaclassc@�0eZdZdZedd��Zedd��Zee�Z	dS)rrccs�dVdSrrr3rrr�	__await__ms�
zAwaitable.__await__cCr7)NrD)rr/r)r8rrrr:qr;zAwaitable.__subclasshook__N)
r<r=r>r?rrDr@r:�GenericAlias�__class_getitem__rrrrri�

rc@s>eZdZdZedd��Zeddd��Zdd�Zed	d
��Z	dS)r	rcC�t�)zcSend a value into the coroutine.
        Return next yielded value or raise StopIteration.
        ��
StopIteration�r4�valuerrr�send~�zCoroutine.sendNcC�0|dur
|dur
|�|�}|dur|�|�}|�)zgRaise an exception in the coroutine.
        Return next yielded value or raise StopIteration.
        N��with_traceback�r4�typ�val�tbrrr�throw��
zCoroutine.throwc	C�.z
|�t�Wtd��ttfyYdSw)�.Raise GeneratorExit inside coroutine.
        zcoroutine ignored GeneratorExitN�rV�
GeneratorExitrJ�RuntimeErrorr3rrr�close����zCoroutine.closecCs|turt|dddd�StS)NrDrMrVr])r	r/r)r8rrrr:�szCoroutine.__subclasshook__�NN)
r<r=r>r?rrMrVr]r@r:rrrrr	zs

r	c@rC)r
rcCst�Sr)rr3rrr�	__aiter__�szAsyncIterable.__aiter__cCr7)Nr`)r
r/r)r8rrrr:�r;zAsyncIterable.__subclasshook__N)
r<r=r>r?rr`r@r:rErFrrrrr
�rGr
c@�0eZdZdZedd��Zdd�Zedd��ZdS)	rrc���t�)z@Return the next item or raise StopAsyncIteration when exhausted.��StopAsyncIterationr3rrr�	__anext__�s�zAsyncIterator.__anext__cC�|Srrr3rrrr`��zAsyncIterator.__aiter__cC�|tur
t|dd�StS)Nrer`)rr/r)r8rrrr:��zAsyncIterator.__subclasshook__N)	r<r=r>r?rrer`r@r:rrrrr��
rc@�FeZdZdZdd�Zedd��Zed
dd��Zd	d
�Ze	dd��Z
dS)rrc�s�|�d�IdHS)zpReturn the next item from the asynchronous generator.
        When exhausted, raise StopAsyncIteration.
        N)�asendr3rrrre�s�zAsyncGenerator.__anext__c�rb)zuSend a value into the asynchronous generator.
        Return next yielded value or raise StopAsyncIteration.
        rcrKrrrrl�s�zAsyncGenerator.asendNc�s2�|dur|dur|�|�}|dur|�|�}|�)zyRaise an exception in the asynchronous generator.
        Return next yielded value or raise StopAsyncIteration.
        NrPrRrrr�athrow�s�
zAsyncGenerator.athrowc	�s6�z
|�t�IdHWtd��ttfyYdSw)rYNz,asynchronous generator ignored GeneratorExit)rmr[rdr\r3rrr�aclose�s���zAsyncGenerator.aclosecC�|tur
t|ddddd�StS)Nr`rerlrmrn)rr/r)r8rrrr:��
�zAsyncGenerator.__subclasshook__r_)r<r=r>r?rerrlrmrnr@r:rrrrr��

rc@rC)rrcc��dSrrr3rrr�__iter__��zIterable.__iter__cCr7)Nrs)rr/r)r8rrrr:r;zIterable.__subclasshook__N)
r<r=r>r?rrsr@r:rErFrrrrr�s

rc@ra)	rrcCrH)zKReturn the next item from the iterator. When exhausted, raise StopIterationrIr3rrr�__next__�zIterator.__next__cCrfrrr3rrrrsrgzIterator.__iter__cCrh)Nrsru)rr/r)r8rrrr:rizIterator.__subclasshook__N)	r<r=r>r?rrursr@r:rrrrrrjrc@r0)rrccrrrrr3rrr�__reversed__6rtzReversible.__reversed__cCrh)Nrwrs)rr/r)r8rrrr:;rizReversible.__subclasshook__N)r<r=r>r?rrwr@r:rrrrr2s
rc@rk)rrcCs
|�d�S)z^Return the next item from the generator.
        When exhausted, raise StopIteration.
        N)rMr3rrrruFs
zGenerator.__next__cCrH)zcSend a value into the generator.
        Return next yielded value or raise StopIteration.
        rIrKrrrrMLrNzGenerator.sendNcCrO)zgRaise an exception in the generator.
        Return next yielded value or raise StopIteration.
        NrPrRrrrrVSrWzGenerator.throwc	CrX)z.Raise GeneratorExit inside generator.
        zgenerator ignored GeneratorExitNrZr3rrrr]`r^zGenerator.closecCro)NrsrurMrVr])rr/r)r8rrrr:jrpzGenerator.__subclasshook__r_)r<r=r>r?rurrMrVr]r@r:rrrrrBrqrc@r0)rrcCr1r2rr3rrr�__len__yr6z
Sized.__len__cCr7)Nrx)rr/r)r8rrrr:}r;zSized.__subclasshook__N)r<r=r>r?rrxr@r:rrrrrurArc@rC)rrcCr1�NFr)r4�xrrr�__contains__�r6zContainer.__contains__cCr7)Nr{)rr/r)r8rrrr:�r;zContainer.__subclasshook__N)
r<r=r>r?rr{r@r:rErFrrrrr�rGrc@seZdZdZedd��ZdS)rrcCs|turt|ddd�StS)Nrxrsr{)rr/r)r8rrrr:�szCollection.__subclasshook__N)r<r=r>r?r@r:rrrrr�srcsLeZdZdZdZ�fdd�Zedd��Z�fdd�Zd	d
�Z	dd�Z
�ZS)
�_CallableGenericAliasz� Represent `Callable[argtypes, resulttype]`.

    This sets ``__args__`` to a tuple containing the flattened ``argtypes``
    followed by ``resulttype``.

    Example: ``Callable[[int, str], float]`` sets ``__args__`` to
    ``(int, str, float)``.
    rcsft|t�rt|�dkstd��|\}}t|t�r g|�|�R}nt|�s+td|����t��|||�S)N�z6Callable must be used as Callable[[arg, ...], result].�FExpected a list of types, an ellipsis, ParamSpec, or Concatenate. Got )�
isinstance�tuple�len�	TypeError�list�_is_param_expr�super�__new__)r9�origin�args�t_args�t_result��	__class__rrr��s�
�z_CallableGenericAlias.__new__cCsjg}|jD](}t|t�rt|t�sqt|d�r$t|jt�r$|�|j�qt|�r-|�	|�qtt
�|��S)N�__parameters__)�__args__r�typerE�hasattrr�r��extend�_is_typevarlike�append�dict�fromkeys)r4�params�argrrrr��s

�z$_CallableGenericAlias.__parameters__cs\t|j�dkrt|jd�rt���Sdd�dd�|jdd�D���dt|jd��d	�S)
Nr}rzcollections.abc.Callable[[z, cSsg|]}t|��qSr)�
_type_repr)�.0�arrr�
<listcomp>�sz2_CallableGenericAlias.__repr__.<locals>.<listcomp>���z], �])r�r�r�r��__repr__�joinr�r3r�rrr��s
��z_CallableGenericAlias.__repr__cCsB|j}t|�dkrt|d�st|dd��|df}tt|ffS)Nr}rr�)r�r�r�r�r|r)r4r�rrr�
__reduce__�sz _CallableGenericAlias.__reduce__c
	s�t|j�}|dkrt|�d���t|t�s|f}|dkr0t|jd�r0|r0t|d�s0t|�f}t|�}||krNtd||kr@dnd�d|�d|�d	|����tt|j|���g}|j	D]^}t|t
�rmt|t�sm|�|�q[t
|�r�t|�r��|}t|�s�td
|����n$�|}nt|d�r�t|jt�r�|j}|r�t�fdd
�|D��}||}t|t�r�|�|�q[|�|�q[t|dt�s�|d}|dd�}	|	|f}ttt|��S)Nrz is not a generic classr"zToo �many�fewz arguments for z	; actual z, expected r~r�c3s�|]}�|VqdSrr)r�rz��substrr�	<genexpr>�s�z4_CallableGenericAlias.__getitem__.<locals>.<genexpr>r�)r�r�r�rr�r�r�r��zipr�r�rEr�r�r�r�r|r)
r4�item�	param_len�item_len�new_argsr��	subparams�subargsr�r�rr�r�__getitem__�s`

�
�
���

��

z!_CallableGenericAlias.__getitem__)r<r=r>�__doc__r?r��propertyr�r�r�r��
__classcell__rrr�rr|�s	

r|cCst|�}|jdko
|jdvS)N�typing>�TypeVar�	ParamSpec)r�r=r<)r��objrrrr�	s
�r�csF�turdSt�t�r
dSt���d}�jdko"t�fdd�|D��S)z|Checks if obj matches either a list of types, ``...``, ``ParamSpec`` or
    ``_ConcatenateGenericAlias`` from typing.py
    T)r��_ConcatenateGenericAliasr�c3s�|]}�j|kVqdSr)r<)r��name�r�rrr�s�z!_is_param_expr.<locals>.<genexpr>)�Ellipsisrr�r�r=�any)r��namesrr�rr�s
 r�cCsbt|t�r	t|�St|t�r|jdkr|jS|j�d|j��S|tur%dSt|t�r-|jSt|�S)z�Return the repr() of an object, special-casing types (internal helper).

    Copied from :mod:`typing` since collections.abc
    shouldn't depend on that module.
    �builtins�.z...)	rrE�reprr�r=r>r��FunctionTyper<r�rrrr�s



r�c@rC)rrcOr1ryr)r4r��kwdsrrr�__call__2r6zCallable.__call__cCr7)Nr�)rr/r)r8rrrr:6r;zCallable.__subclasshook__N)
r<r=r>r?rr�r@r:r|rFrrrrr.rGrc@s�eZdZdZdZdd�Zdd�Zdd�Zd	d
�Zdd�Z	e
d
d��Zdd�ZeZ
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.
    rcCs>t|t�stSt|�t|�krdS|D]	}||vrdSqdS�NFT�rrr)r��r4�other�elemrrr�__le__O�
�z
Set.__le__cCs(t|t�stSt|�t|�ko|�|�Sr�rrr)r�r��r4r�rrr�__lt__Y�
z
Set.__lt__cCs(t|t�stSt|�t|�ko|�|�Sr)rrr)r��__ge__r�rrr�__gt__^r�z
Set.__gt__cCs>t|t�stSt|�t|�krdS|D]	}||vrdSqdSr�r�r�rrrr�cr�z
Set.__ge__cCs(t|t�stSt|�t|�ko|�|�Srr�r�rrr�__eq__mr�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�r9�itrrr�_from_iterablerszSet._from_iterablecs&t|t�stS���fdd�|D��S)Nc3s�|]	}|�vr|VqdSrr�r�rLr3rrr�~s�zSet.__and__.<locals>.<genexpr>�rrr)r�r�rr3r�__and__{�
zSet.__and__cCs|D]	}||vrdSqdS)z1Return True if two sets have a null intersection.FTr)r4r�rLrrr�
isdisjoint�s
�zSet.isdisjointcCs*t|t�stSdd�||fD�}|�|�S)Ncss�|]
}|D]}|VqqdSrr)r��s�errrr��s�zSet.__or__.<locals>.<genexpr>r�)r4r��chainrrr�__or__�s

z
Set.__or__cs:t�t�st�t�stS|����|��fdd�|D��S)Nc3��|]	}|�vr|VqdSrrr��r�rrr������zSet.__sub__.<locals>.<genexpr>�rrrr)r�r�rr�r�__sub__��



zSet.__sub__cs:t|t�st|t�stS��|�}���fdd�|D��S)Nc3r�rrr�r3rrr��r�zSet.__rsub__.<locals>.<genexpr>r�r�rr3r�__rsub__�r�zSet.__rsub__cCs2t|t�st|t�stS|�|�}||||BSrr�r�rrr�__xor__�s



zSet.__xor__cCs�tj}d|d}t|�}d|d}||M}|D]}t|�}|||d>AdAdN}||M}q||d?|d?AN}|d	d
}||M}||krN||d8}|dkrTd}|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}r"iM��r�i�M[l�4~2��i�
i��6r�i��8#)�sys�maxsizer��hash)r4�MAX�MASK�n�hrz�hxrrr�_hash�s"
z	Set._hashN)r<r=r>r�r?r�r�r�r�r�r@r�r��__rand__r�r��__ror__r�r�r��__rxor__r�rrrrrBs(



rc@sdeZdZdZdZedd��Zedd��Zdd�Zd	d
�Z	dd�Z
d
d�Zdd�Zdd�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.
    rcCrH)zAdd an element.��NotImplementedErrorrKrrr�add�rvzMutableSet.addcCrH)z8Remove an element.  Do not raise an exception if absent.r�rKrrr�discard�rvzMutableSet.discardcCs||vrt|��|�|�dS)z5Remove an element. If not a member, raise a KeyError.N)�KeyErrorr�rKrrr�remove�szMutableSet.removecCs8t|�}zt|�}Wn
tytd�w|�|�|S)z2Return the popped value.  Raise KeyError if empty.N)�iter�nextrJr�r��r4r�rLrrr�pop�s�
zMutableSet.popcC�"z	|��qtyYdSw)z6This is slow (creates N new iterators!) but effective.TN)r�r�r3rrr�clear����zMutableSet.clearcCs|D]}|�|�q|Sr)r�r�rrr�__ior__�szMutableSet.__ior__cCs||D]}|�|�q|Sr)r�r�rrr�__iand__szMutableSet.__iand__cCsT||ur
|��|St|t�s|�|�}|D]}||vr"|�|�q|�|�q|Sr)r�rrr�r�r�r�rrr�__ixor__	s	
�
zMutableSet.__ixor__cCs,||ur
|��|S|D]}|�|�q|Sr)r�r�r�rrr�__isub__s�zMutableSet.__isub__N)r<r=r>r�r?rr�r�r�r�r�r�rrrrrrrr�s



rc@sZeZdZdZdZdZedd��Zddd�Zd	d
�Z	dd�Z
d
d�Zdd�Zdd�Z
dZdS)rz�A Mapping is a generic container for associating key/value
    pairs.

    This class provides concrete generic implementations of all
    methods except for __getitem__, __iter__, and __len__.
    r�@cCrHr�r��r4�keyrrrr�1r6zMapping.__getitem__NcCs"z||WSty|YSw)z<D.get(k[,d]) -> D[k] if k in D, else d.  d defaults to None.r�r4r�defaultrrr�get5s

�zMapping.getcCs$z||WdStyYdSwr�rrrrrr{<s
��zMapping.__contains__cC�t|�S)z:D.keys() -> a set-like object providing a view on D's keys)rr3rrr�keysD�zMapping.keyscCr
)z<D.items() -> a set-like object providing a view on D's items)rr3rrr�itemsHrz
Mapping.itemscCr
)z6D.values() -> an object providing a view on D's values)rr3rrr�valuesLrzMapping.valuescCs&t|t�stSt|���t|���kSr)rrr)r�r
r�rrrr�Pr�zMapping.__eq__r)r<r=r>r�r?�__abc_tpflags__rr�r	r{rr
rr�rwrrrrr$s

rc@s0eZdZdZdd�Zdd�Zdd�Zee�Z	dS)	r��_mappingcCs
||_dSrr)r4�mappingrrr�__init__^�
zMappingView.__init__cCs
t|j�Sr)r�rr3rrrrxarzMappingView.__len__cCs
d�|�S)Nz&{0.__class__.__name__}({0._mapping!r}))�formatr3rrrr�drzMappingView.__repr__N)
r<r=r>r?rrxr�r@rErFrrrrrZsrc@�,eZdZdZedd��Zdd�Zdd�ZdS)	rrcC�t|�Sr��setr�rrrr�nrzKeysView._from_iterablecCs
||jvSrrrrrrr{rrzKeysView.__contains__ccs�|jEdHdSrrr3rrrrsus�zKeysView.__iter__N�r<r=r>r?r@r�r{rsrrrrrjs
rc@r)	rrcCrrrr�rrrr��rzItemsView._from_iterablecCs<|\}}z|j|}Wn
tyYdSw||up||kSry)rr�)r4r�rrL�vrrrr{�s�zItemsView.__contains__ccs"�|jD]
}||j|fVqdSrrrrrrrs�s�
�zItemsView.__iter__Nrrrrrr|s
	rc@s eZdZdZdd�Zdd�ZdS)rrcCs0|jD]}|j|}||us||krdSqdS�NTFr)r4rLrrrrrr{�s

�zValuesView.__contains__ccs�|jD]}|j|VqdSrrrrrrrs�s�
�zValuesView.__iter__N)r<r=r>r?r{rsrrrrr�src@sbeZdZdZdZedd��Zedd��Ze�Z	e	fdd�Z
d	d
�Zdd�Zdd
d�Z
ddd�ZdS)rz�A MutableMapping is a generic container for associating
    key/value pairs.

    This class provides concrete generic implementations of all
    methods except for __getitem__, __setitem__, __delitem__,
    __iter__, and __len__.
    rcCrHrr�r4rrLrrr�__setitem__�r6zMutableMapping.__setitem__cCrHrrrrrr�__delitem__�r6zMutableMapping.__delitem__cCs:z||}Wnty||jur�|YSw||=|S)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.
        )r��_MutableMapping__marker)r4rrrLrrrr��s
�zMutableMapping.popcCs<ztt|��}Wn
tytd�w||}||=||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�rJr�rrrr�popitem�s�zMutableMapping.popitemcCr�)z,D.clear() -> None.  Remove all items from D.TN)r!r�r3rrrr��r�zMutableMapping.clearcKs|t|t�r|D]}||||<qnt|d�r$|��D]}||||<qn|D]\}}|||<q&|��D]\}}|||<q3dS)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
        rN)rrr�rr
)r4r�r�rrLrrr�update�s
�
�

�zMutableMapping.updateNcCs(z||WSty|||<Y|Sw)z@D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in Drrrrr�
setdefault�s

�zMutableMapping.setdefault)rr)r<r=r>r�r?rrr�objectr r�r!r�r"r#rrrrr�s


rc@sNeZdZdZdZdZedd��Zdd�Zdd	�Z	d
d�Z
ddd�Zdd�Zd
S)rz�All the operations on a read-only sequence.

    Concrete subclasses must override __new__ or __init__,
    __getitem__, and __len__.
    r� cCrHr��
IndexError�r4�indexrrrr�r6zSequence.__getitem__ccs6�d}z
	||}|V|d7}qtyYdSw)NrTr"r&)r4�irrrrrss���zSequence.__iter__cCs$|D]
}||us||krdSqdSrr)r4rLrrrrr{s
�zSequence.__contains__ccs&�ttt|���D]}||Vq	dSr)�reversed�ranger�)r4r*rrrrws��zSequence.__reversed__rNcCs�|dur|dkrtt|�|d�}|dur|dkr|t|�7}|}|dus)||krQz||}||us6||kr9|WSWn
tyDYt�w|d7}|dus)||ks)t�)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")�maxr�r'�
ValueError)r4rL�start�stopr*rrrrr)#s$���zSequence.indexcst�fdd�|D��S)zBS.count(value) -> integer -- return number of occurrences of valuec3s$�|]
}|�us|�krdVqdS)r"Nr)r�r�rLrrr�<s�"z!Sequence.count.<locals>.<genexpr>)�sumrKrr1r�count:szSequence.count)rN)
r<r=r>r�r?rrr�rsr{rwr)r3rrrrr�s


rc@seZdZdZdZdS)r zMThis unifies bytes and bytearray.

    XXX Should add all their methods.
    rN)r<r=r>r�r?rrrrr Dsr c@sreZdZdZdZedd��Zedd��Zedd��Zd	d
�Z	dd�Z
d
d�Zdd�Zddd�Z
dd�Zdd�ZdS)rz�All the operations on a read-write sequence.

    Concrete subclasses must provide __new__ or __init__,
    __getitem__, __setitem__, __delitem__, __len__, and insert().
    rcCrHrr&�r4r)rLrrrrYr6zMutableSequence.__setitem__cCrHrr&r(rrrr]r6zMutableSequence.__delitem__cCrH)z3S.insert(index, value) -- insert value before indexr&r4rrr�insertarvzMutableSequence.insertcCs|�t|�|�dS)z:S.append(value) -- append value to the end of the sequenceN)r5r�rKrrrr�fszMutableSequence.appendcCr�)z,S.clear() -> None -- remove all items from STN)r�r'r3rrrr�jr�zMutableSequence.clearcCsHt|�}t|d�D]}|||d||||<|||d<q
dS)z!S.reverse() -- reverse *IN PLACE*r}r"N)r�r,)r4r�r*rrr�reversers,�zMutableSequence.reversecCs(||urt|�}|D]}|�|�q
dS)zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)r�r�)r4rrrrrr�xs
�zMutableSequence.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)r4r)rrrrr�szMutableSequence.popcCs||�|�=dS)zvS.remove(value) -- remove first occurrence of value.
           Raise ValueError if the value is not present.
        N)r)rKrrrr��szMutableSequence.removecCs|�|�|Sr)r�)r4rrrr�__iadd__�s
zMutableSequence.__iadd__N)r�)r<r=r>r�r?rrrr5r�r�r6r�r�r�r7rrrrrPs 



r)Tr��abcrrr�r�r��intrE�EllipsisTyperr��__all__r<r��bytes_iterator�	bytearray�bytearray_iteratorr�dict_keyiteratorr�dict_valueiteratorr
�dict_itemiterator�
list_iteratorr+�list_reverseiteratorr,�range_iterator�longrange_iteratorr�set_iterator�str_iterator�tuple_iteratorr��zip_iterator�	dict_keys�dict_values�
dict_itemsr(�mappingproxy�	generatorr%�	coroutiner]r&�async_generatorr/r
rr	�registerr
rrrrrrrrrr|r�r�r�rr�	frozensetrrrrrrrr�rr��str�
memoryviewr �bytesrrrrr�<module>s�	

)
0













0i

P
3



R
?





B