D7net
Home
Console
Upload
information
Create file
Create Folder
About
Tools
Logout
Path :
/
sys
/
..
/
..
/
lib
/
python3
/
..
/
python3.10
/
__pycache__
/
Filename :
_collections_abc.cpython-310.pyc
back
Edit
Copy
o �T�j ~ � @ s� d Z ddlmZmZ ddlZeee �Zed�Z dd� Z ee �Z [ g d�Z dZ eed ��Zeee� ��Zeei �� ��Zeei �� ��Zeei �� ��Zeeg ��Zeeeg ���Zeeed���Z eeed d > ���Z eee � ��Z eed ��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/G dd� ded�Z0G dd� ded�Z1G dd � d e1�Z2e2�3e+� G d d � d ed�Z4G d d � d e4�Z5G d!d"� d"e5�Z6e6�3e.� G d#d$� d$ed�Z7G d%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#� G d'd(� d(e7�Z9G d)d*� d*e8�Z:e:�3e)� G d+d,� d,ed�Z;G d-d.� d.ed�Z<G d/d0� d0e;e7e<�Z=G d1d2� d2e�Z>d3d4� Z?d5d6� Z@d7d8� ZAG d9d:� d:ed�ZBG d;d<� d<e=�ZCeC�3eD� G d=d>� d>eC�ZEeE�3e � G d?d@� d@e=�ZFeF�3e(� G dAdB� dBe;�ZGG dCdD� dDeGeC�ZHeH�3e$� G dEdF� dFeGeC�ZIeI�3e&� G dGdH� dHeGe=�ZJeJ�3e%� G dIdJ� dJeF�ZKeK�3eL� G dKdL� dLe9e=�ZMeM�3eN� eM�3eO� eM�3e� eM�3eP� G dMdN� dNeM�ZQeQ�3eR� eQ�3e� G dOdP� dPeM�ZSeS�3e� eS�3e� dS )QzjAbstract Base Classes (ABCs) for collections, according to PEP 3119. Unit tests are in test_collections. � )�ABCMeta�abstractmethodN.c C s d S �N� r r r �'/usr/lib/python3.10/_collections_abc.py�_f s r )� 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� � r c c s � d V S r r r r r r �<lambda>> s � r$ c � s �d S r r r r r r �_coro@ s � r% c C s �d V d S r r r r r r �_agF s � r& c G sN | j }|D ] }|D ]}||jv r |j| d u r t S nq t S qdS )NT)�__mro__�__dict__�NotImplemented)�C�methods�mro�method�Br r r �_check_methodsN s ��r/ c @ �( e Zd ZdZedd� �Zedd� �ZdS )r r c C � dS �Nr r ��selfr r r �__hash__^ � zHashable.__hash__c C � | t u r t|d�S tS )Nr5 )r r/ r) ��clsr* r r r �__subclasshook__b � zHashable.__subclasshook__N)�__name__� __module__� __qualname__� __slots__r r5 � classmethodr: r r r r r Z � r )� metaclassc @ �0 e Zd ZdZedd� �Zedd� �Zee�Z dS )r r c c s � d V d S r r r3 r r r � __await__m s � zAwaitable.__await__c C r7 )NrD )r r/ r) r8 r r r r: q r; zAwaitable.__subclasshook__N) r< r= r> r? r rD r@ r: � GenericAlias�__class_getitem__r r r r r i � r c @ s> e Zd ZdZedd� �Zed dd��Zdd� Zed d � �Z dS ) r r c C � t �)zcSend a value into the coroutine. Return next yielded value or raise StopIteration. �� StopIteration�r4 �valuer r r �send~ � zCoroutine.sendNc C �0 |du r |du r |�|� }|dur|� |�}|�)zgRaise an exception in the coroutine. Return next yielded value or raise StopIteration. N��with_traceback�r4 �typ�val�tbr r r �throw� � zCoroutine.throwc C �. z | � t� W td�� ttfy Y dS w )�.Raise GeneratorExit inside coroutine. z coroutine ignored GeneratorExitN�rV � GeneratorExitrJ � RuntimeErrorr3 r r r �close� � ��zCoroutine.closec C s | t u r t|dddd�S tS )NrD rM rV r] )r r/ r) r8 r r r r: � s zCoroutine.__subclasshook__�NN) r< r= r> r? r rM rV r] r@ r: r r r r r z s r c @ rC )r r c C s t � S r )r r3 r r r � __aiter__� s zAsyncIterable.__aiter__c C r7 )Nr` )r r/ r) r8 r r r r: � r; z AsyncIterable.__subclasshook__N) r< r= r> r? r r` r@ r: rE rF r r r r r � rG r c @ �0 e Zd ZdZedd� �Zdd� Zedd� �ZdS ) r r c � � �t �)z@Return the next item or raise StopAsyncIteration when exhausted.��StopAsyncIterationr3 r r r � __anext__� s �zAsyncIterator.__anext__c C � | S r r r3 r r r r` � � zAsyncIterator.__aiter__c C � | t u r t|dd�S tS )Nre r` )r r/ r) r8 r r r r: � � z AsyncIterator.__subclasshook__N) r< r= r> r? r re r` r@ r: r r r r r � � r c @ �F e Zd ZdZdd� Zedd� �Zed dd��Zd d � Ze d d � �Z dS )r r c � s �| � d�I dH S )zpReturn the next item from the asynchronous generator. When exhausted, raise StopAsyncIteration. N)�asendr3 r r r re � s �zAsyncGenerator.__anext__c � rb )zuSend a value into the asynchronous generator. Return next yielded value or raise StopAsyncIteration. rc rK r r r rl � s �zAsyncGenerator.asendNc � s2 �|du r|du r |�|� }|dur|� |�}|�)zyRaise an exception in the asynchronous generator. Return next yielded value or raise StopAsyncIteration. NrP rR r r r �athrow� s � zAsyncGenerator.athrowc � s6 �z | � t�I dH W td�� ttfy Y dS w )rY Nz,asynchronous generator ignored GeneratorExit)rm r[ rd r\ r3 r r r �aclose� s ���zAsyncGenerator.aclosec C � | t u r t|ddddd�S tS )Nr` re rl rm rn )r r/ r) r8 r r r r: � � �z AsyncGenerator.__subclasshook__r_ ) r< r= r> r? re r rl rm rn r@ r: r r r r r � � r c @ rC )r r c c � � d S r r r3 r r r �__iter__ � �zIterable.__iter__c C r7 )Nrs )r r/ r) r8 r r r r: r; zIterable.__subclasshook__N) r< r= r> r? r rs r@ r: rE rF r r r r r � s r c @ ra ) r r c C rH )zKReturn the next item from the iterator. When exhausted, raise StopIterationrI r3 r r r �__next__ � zIterator.__next__c C rf r r r3 r r r rs rg zIterator.__iter__c C rh )Nrs ru )r r/ r) r8 r r r r: ri zIterator.__subclasshook__N) r< r= r> r? r ru rs r@ r: r r r r r rj r c @ r0 )r r c c rr r r r3 r r r � __reversed__6 rt zReversible.__reversed__c C rh )Nrw rs )r r/ r) r8 r r r r: ; ri zReversible.__subclasshook__N)r< r= r> r? r rw r@ r: r r r r r 2 s r c @ rk )r r c C s | � d�S )z^Return the next item from the generator. When exhausted, raise StopIteration. N)rM r3 r r r ru F s zGenerator.__next__c C rH )zcSend a value into the generator. Return next yielded value or raise StopIteration. rI rK r r r rM L rN zGenerator.sendNc C rO )zgRaise an exception in the generator. Return next yielded value or raise StopIteration. NrP rR r r r rV S rW zGenerator.throwc C rX )z.Raise GeneratorExit inside generator. z generator ignored GeneratorExitNrZ r3 r r r r] ` r^ zGenerator.closec C ro )Nrs ru rM rV r] )r r/ r) r8 r r r r: j rp zGenerator.__subclasshook__r_ ) r< r= r> r? ru r rM rV r] r@ r: r r r r r B rq r c @ r0 )r r c C r1 r2 r r3 r r r �__len__y r6 z Sized.__len__c C r7 )Nrx )r r/ r) r8 r r r r: } r; zSized.__subclasshook__N)r< r= r> r? r rx r@ r: r r r r r u rA r c @ rC )r r c C r1 �NFr )r4 �xr r r � __contains__� r6 zContainer.__contains__c C r7 )Nr{ )r r/ r) r8 r r r r: � r; zContainer.__subclasshook__N) r< r= r> r? r r{ r@ r: rE rF r r r r r � rG r c @ s e Zd ZdZedd� �ZdS )r r c C s | t u r t|ddd�S tS )Nrx rs r{ )r r/ r) r8 r r r r: � s zCollection.__subclasshook__N)r< r= r> r? r@ r: r r r r r � s r c sL e Zd ZdZdZ� fdd�Zedd� �Z� fdd�Zd d � Z d d � Z � Z S ) �_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)``. r c sf t |t�r t|�dkstd��|\}}t |t�r g |�|�R }n t|�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__r r r� � s � �z _CallableGenericAlias.__new__c C sj g }| j D ](}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�argr r r r� � s �z$_CallableGenericAlias.__parameters__c s\ t | j�dkrt| jd �rt� �� S dd�dd� | jd d� D ��� dt| jd �� d �S ) Nr} r zcollections.abc.Callable[[z, c S s g | ]}t |��qS r )� _type_repr)�.0�ar r r � <listcomp>� s z2_CallableGenericAlias.__repr__.<locals>.<listcomp>���z], �])r� r� r� r� �__repr__�joinr� r3 r� r r r� � s � �z _CallableGenericAlias.__repr__c C sB | j }t|�dkrt|d �st|d d� �|d f}tt|ffS )Nr} r r� )r� r� r� r� r| r )r4 r� r r r � __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$� | }n t|d �r�t|jt�r�|j}|r�t� fd d �|D ��}|| }t|t�r�|�|� q[|� |� q[t|d t�s�|d }|d d� } | |f}ttt|��S )Nr z is not a generic classr" zToo �many�fewz arguments for z ; actual z , expected r~ r� c 3 s � | ]}� | V qd S r r )r� rz ��substr r � <genexpr>� s � z4_CallableGenericAlias.__getitem__.<locals>.<genexpr>r� )r� r� r� r r� r� r� r� �zipr� r� rE r� r� r� r� r| r ) r4 �item� param_len�item_len�new_argsr� � subparams�subargsr� r� r r� r � __getitem__� s` � � ��� �� z!_CallableGenericAlias.__getitem__) r< r= r> �__doc__r? r� �propertyr� r� r� r� � __classcell__r r r� r r| � s r| c C s t | �}|jdko |jdv S )N�typing> �TypeVar� ParamSpec)r� r= r< )r� �objr r r r� s �r� c sF � t u rdS t� t�r dS t� �� 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� c 3 s � | ]}� j |kV qd S r )r< )r� �name�r� r r r� s � z!_is_param_expr.<locals>.<genexpr>)�Ellipsisr r� r� r= �any)r� �namesr r� r r� s r� c C sb t | t�r t| �S t | t�r | jdkr| jS | j� d| j� �S | tu r%dS t | t�r-| jS t| �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...) r rE �reprr� r= r> r� � FunctionTyper< r� r r r r� s r� c @ rC )r r c O r1 ry r )r4 r� �kwdsr r r �__call__2 r6 zCallable.__call__c C r7 )Nr� )r r/ r) r8 r r r r: 6 r; zCallable.__subclasshook__N) r< r= r> r? r r� r@ r: r| rF r r r r r . rG r 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 |t�stS t| �t|�krdS | D ] }||vr dS qdS �NFT�r r r) r� �r4 �other�elemr r r �__le__O � �z Set.__le__c C s( t |t�stS t| �t|�k o| �|�S r �r r r) r� r� �r4 r� r r r �__lt__Y � z Set.__lt__c C s( t |t�stS t| �t|�ko| �|�S r )r r r) r� �__ge__r� r r r �__gt__^ r� z Set.__gt__c C s> t |t�stS t| �t|�k rdS |D ] }|| vr dS qdS r� r� r� r r r r� c r� z Set.__ge__c C s( t |t�stS t| �t|�ko| �|�S r r� r� r r r �__eq__m r� z Set.__eq__c C s | |�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 �itr r r �_from_iterabler s zSet._from_iterablec s& t |t�stS � �� fdd�|D ��S )Nc 3 s � | ] }|� v r|V qd S r r �r� rL r3 r r r� ~ s � z Set.__and__.<locals>.<genexpr>�r r r) r� r� r r3 r �__and__{ � z Set.__and__c C s |D ] }|| v r dS qdS )z1Return True if two sets have a null intersection.FTr )r4 r� rL r r r � isdisjoint� s �zSet.isdisjointc C s* t |t�stS dd� | |fD �}| �|�S )Nc s s � | ] }|D ]}|V qqd S r r )r� �s�er r r r� � s � z Set.__or__.<locals>.<genexpr>r� )r4 r� �chainr r r �__or__� s z Set.__or__c s: t � t�st � t�s tS | �� �� | �� fdd�| D ��S )Nc 3 � � | ] }|� vr|V qd S r r r� �r� r r r� � � � ��z Set.__sub__.<locals>.<genexpr>�r r r r) r� r� r r� r �__sub__� � z Set.__sub__c s: t |t�st |t�s tS � �|�}� �� fdd�|D ��S )Nc 3 r� r r r� r3 r r r� � r� z Set.__rsub__.<locals>.<genexpr>r� r� r r3 r �__rsub__� r� z Set.__rsub__c C s2 t |t�st |t�s tS | �|�}| | || B S r r� r� 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 }q||d? |d? A N }|d d }||M }||krN||d 8 }|d krTd }|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 �hxr r r �_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� r r r r r B s( r 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 rH )zAdd an element.��NotImplementedErrorrK r r r �add� rv zMutableSet.addc C rH )z8Remove an element. Do not raise an exception if absent.r� rK r r r �discard� rv zMutableSet.discardc C s || vrt |��| �|� dS )z5Remove an element. If not a member, raise a KeyError.N)�KeyErrorr� rK r r r �remove� s zMutableSet.removec C s8 t | �}zt|�}W n ty td�w | �|� |S )z2Return the popped value. Raise KeyError if empty.N)�iter�nextrJ r� r� �r4 r� rL r r r �pop� s � zMutableSet.popc C �" z | � � q ty Y dS w )z6This is slow (creates N new iterators!) but effective.TN)r� r� r3 r r r �clear� � � �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__ s zMutableSet.__iand__c C sT || u r | � � | S t|t�s| �|�}|D ]}|| v r"| �|� q| �|� q| S r )r� r r r� r� r� r� r r r �__ixor__ s � zMutableSet.__ixor__c C s, || u r | � � | S |D ]}| �|� q | S r )r� r� r� r r r �__isub__ s � zMutableSet.__isub__N)r< r= r> r� r? r r� r� r� r� r� r� r r r r r r r r � s r c @ sZ e Zd ZdZdZdZedd� �Zddd�Zd d � Z d d � Z d d� Z dd� Z dd� Z dZdS )r z�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 �@ c C rH r �r� �r4 �keyr r r r� 1 r6 zMapping.__getitem__Nc C s" z| | W S t y | Y S w )z<D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.r �r4 r �defaultr r r �get5 s �z Mapping.getc C s$ z| | W dS t y Y dS w r� r r r r r r{ < s ��zMapping.__contains__c C � t | �S )z:D.keys() -> a set-like object providing a view on D's keys)r r3 r r r �keysD � z Mapping.keysc C r )z<D.items() -> a set-like object providing a view on D's items)r r3 r r r �itemsH r z Mapping.itemsc C r )z6D.values() -> an object providing a view on D's values)r r3 r r r �valuesL r zMapping.valuesc C s& t |t�stS t| �� �t|�� �kS r )r r r) r� r r� r r r r� P r� zMapping.__eq__r )r< r= r> r� r? �__abc_tpflags__r r� r r{ r r r r� rw r r r r r $ s r c @ s0 e Zd ZdZdd� Zdd� Zdd� Zee�Z dS ) r ��_mappingc C s || _ d S r r )r4 �mappingr r r �__init__^ � zMappingView.__init__c C s t | j�S r )r� r r3 r r r rx a r zMappingView.__len__c C s d� | �S )Nz&{0.__class__.__name__}({0._mapping!r}))�formatr3 r r r r� d r zMappingView.__repr__N) r< r= r> r? r rx r� r@ rE rF r r r r r Z s r c @ �, e Zd ZdZedd� �Zdd� Zdd� ZdS ) r r c C � t |�S r ��setr� r r r r� n r zKeysView._from_iterablec C s || j v S r r r r r r r{ r r zKeysView.__contains__c c s � | j E d H d S r r r3 r r r rs u s �zKeysView.__iter__N�r< r= r> r? r@ r� r{ rs r r r r r j s r c @ r ) r r c C r r r r� r r r r� � r zItemsView._from_iterablec C s< |\}}z| j | }W n ty Y dS w ||u p ||kS ry )r r� )r4 r� r rL �vr r r r{ � s �zItemsView.__contains__c c s" � | j D ] }|| j | fV qd S r r r r r r rs � s � �zItemsView.__iter__Nr r r r r r | s r c @ s e Zd ZdZdd� Zdd� ZdS )r r c C s0 | j D ]}| j | }||u s||kr dS qdS �NTFr )r4 rL r r r r r r{ � s �zValuesView.__contains__c c s � | j D ]}| j | V qd S r r r r r r rs � s � �zValuesView.__iter__N)r< r= r> r? r{ rs r r r r r � s r c @ sb e Zd ZdZdZedd� �Zedd� �Ze� Z e fdd�Z d d � Z d d � Z dd d�Z ddd�ZdS )r z�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__. r c C rH r r �r4 r rL r r r � __setitem__� r6 zMutableMapping.__setitem__c C rH r r r r r r � __delitem__� r6 zMutableMapping.__delitem__c C s: z| | }W n t y || ju r� | Y S w | |= |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)r4 r r rL r r r r� � s �zMutableMapping.popc C s< zt t| ��}W n ty td�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� rJ r� r r r r �popitem� s �zMutableMapping.popitemc C r� )z,D.clear() -> None. Remove all items from D.TN)r! r� r3 r r r r� � r� zMutableMapping.clearc K s| t |t�r|D ]}|| | |< qn t|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 r N)r r r� r r )r4 r� r� r rL r r r �update� s � � �zMutableMapping.updateNc C s( z| | W S t y || |< Y |S w )z@D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in Dr r r r r � setdefault� s �zMutableMapping.setdefault)r r )r< r= r> r� r? r r r �objectr r� r! r� r" r# r r r r r � s r c @ sN e Zd ZdZdZdZedd� �Zdd� Zdd � Z d d � Z ddd�Z dd� Z d S )r z�All the operations on a read-only sequence. Concrete subclasses must override __new__ or __init__, __getitem__, and __len__. r � c C rH r �� IndexError�r4 �indexr r r r� r6 zSequence.__getitem__c c s6 � d}z | | }|V |d7 }q t y Y d S w )Nr Tr" r& )r4 �ir r r r rs s �� �zSequence.__iter__c C s$ | D ] }||u s ||kr dS qdS r r )r4 rL r r r r r{ s �zSequence.__contains__c c s& � t tt| ���D ]}| | V q d S r )�reversed�ranger� )r4 r* r r r rw s � �zSequence.__reversed__r Nc C s� |dur|dk rt t| �| d�}|dur |dk r |t| �7 }|}|du s)||k rQz| | }||u s6||kr9|W S W n tyD Y t�w |d7 }|du s)||k s)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. Nr r" )�maxr� r' � ValueError)r4 rL �start�stopr* r r r r r) # s$ � ��zSequence.indexc s t � fdd�| D ��S )zBS.count(value) -> integer -- return number of occurrences of valuec 3 s$ � | ] }|� u s |� krd V qdS )r" Nr )r� r �rL r r r� < s �" z!Sequence.count.<locals>.<genexpr>)�sumrK r r1 r �count: s zSequence.count)r N) r< r= r> r� r? r r r� rs r{ rw r) r3 r r r r r � s r c @ s e Zd ZdZdZdS )r zMThis unifies bytes and bytearray. XXX Should add all their methods. r N)r< r= r> r� r? r r r r r D s r c @ sr e Zd ZdZdZedd� �Zedd� �Zedd� �Zd d � Z d d � Z d d� Z dd� Z ddd�Z dd� Zdd� ZdS )r z�All the operations on a read-write sequence. Concrete subclasses must provide __new__ or __init__, __getitem__, __setitem__, __delitem__, __len__, and insert(). r c C rH r r& �r4 r) rL r r r r Y r6 zMutableSequence.__setitem__c C rH r r& r( r r r r ] r6 zMutableSequence.__delitem__c C rH )z3S.insert(index, value) -- insert value before indexr& r4 r r r �inserta rv zMutableSequence.insertc C s | � t| �|� dS )z:S.append(value) -- append value to the end of the sequenceN)r5 r� rK r r r r� f s zMutableSequence.appendc C r� )z,S.clear() -> None -- remove all items from STN)r� r' r3 r r r r� j r� zMutableSequence.clearc C sH t | �}t|d �D ]}| || d | | | |< | || d < q dS )z!S.reverse() -- reverse *IN PLACE*r} r" N)r� r, )r4 r� r* r r r �reverser s ,�zMutableSequence.reversec C s( || u rt |�}|D ]}| �|� q dS )zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)r� r� )r4 r r r r r r� x s �zMutableSequence.extendr� c C s | | }| |= |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 )r4 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) rK r r r r� � s zMutableSequence.removec C s | � |� | S r )r� )r4 r r r r �__iadd__� s zMutableSequence.__iadd__N)r� )r< r= r> r� r? r r r r5 r� r� r6 r� r� r� r7 r r r r r P s r )Tr� �abcr r r� r� r� �intrE � EllipsisTyper r� �__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 r r �registerr r r r r r r r r r r| r� r� r� r r � frozensetr r r r r r r r� r r� �str� memoryviewr �bytesr r r r r �<module> s� ) 0 0 i P 3 R ? B