| Server IP : 74.208.236.18 / Your IP : 216.73.217.65 Web Server : Apache System : Linux infong654 4.4.400-icpu-108 #2 SMP Wed Feb 11 10:12:42 UTC 2026 x86_64 User : u39365822 ( 135825) PHP Version : 8.4.23 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : /lib/python3.9/__pycache__/ |
Upload File : |
a
�:j�r � @ 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?G d5d6� d6ed�Z@G d7d8� d8e=�ZAeA�3eB� G d9d:� d:eA�ZCeC�3e � G d;d<� d<e=�ZDeD�3e(� G d=d>� d>e;�ZEG d?d@� d@eEeA�ZFeF�3e$� G dAdB� dBeEeA�ZGeG�3e&� G dCdD� dDeEe=�ZHeH�3e%� G dEdF� dFeD�ZIeI�3eJ� G dGdH� dHe9e=�ZKeK�3eL� eK�3eM� eK�3e� eK�3eN� G dIdJ� dJeK�ZOeO�3eP� eO�3e� G dKdL� dLeK�ZQeQ�3e� eQ�3e� dS )MzjAbstract 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.9/_collections_abc.py�_f � 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.abcr � i� � r c c s d V S r r r r r r �<lambda>> 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 �_agF r r& c G sN | j }|D ]>}|D ],}||jv r|j| d u r:t S q
qt S q
dS )NT)�__mro__�__dict__�NotImplemented)�C�methods�mro�method�Br r r �_check_methodsN s
r/ c @ s( e Zd ZdZedd� �Zedd� �ZdS )r r c C s dS �Nr r ��selfr r r �__hash__^ s zHashable.__hash__c C s | t u rt|d�S tS )Nr3 )r r/ r) ��clsr* r r r �__subclasshook__b s
zHashable.__subclasshook__N)�__name__�
__module__� __qualname__� __slots__r r3 � classmethodr6 r r r r r Z s
r )� metaclassc @ s0 e Zd ZdZedd� �Zedd� �Zee�Z dS )r r c c s
d V d S r r r1 r r r � __await__m s zAwaitable.__await__c C s | t u rt|d�S tS )Nr= )r r/ r) r4 r r r r6 q s
zAwaitable.__subclasshook__N)
r7 r8 r9 r: r r= r; r6 � GenericAlias�__class_getitem__r r r r r i s
r c @ s> e Zd ZdZedd� �Zed dd��Zdd� 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��
StopIteration�r2 �valuer r r �send~ s zCoroutine.sendNc C s4 |du r|du r|�|� }|dur,|� |�}|�dS )zgRaise an exception in the coroutine.
Return next yielded value or raise StopIteration.
N��with_traceback�r2 �typ�val�tbr r r �throw� s
zCoroutine.throwc C s2 z| � t� W n ttfy$ Y n
0 td��dS )�.Raise GeneratorExit inside coroutine.
z coroutine ignored GeneratorExitN�rK �
GeneratorExitrA � RuntimeErrorr1 r r r �close� s
zCoroutine.closec C s | t u rt|dddd�S tS )Nr= rD rK rP )r
r/ r) r4 r r r r6 � s zCoroutine.__subclasshook__)NN)
r7 r8 r9 r: r rD rK rP r; r6 r r r r r
z s
r
c @ s0 e Zd ZdZedd� �Zedd� �Zee�Z dS )r r c C s t � S r )r r1 r r r � __aiter__� s zAsyncIterable.__aiter__c C s | t u rt|d�S tS )NrQ )r r/ r) r4 r r r r6 � s
z AsyncIterable.__subclasshook__N)
r7 r8 r9 r: r rQ r; r6 r> r? r r r r r � s
r c @ s0 e Zd ZdZedd� �Zdd� Zedd� �ZdS ) r r c � s t �dS )z@Return the next item or raise StopAsyncIteration when exhausted.N��StopAsyncIterationr1 r r r � __anext__� s zAsyncIterator.__anext__c C s | S r r r1 r r r rQ � s zAsyncIterator.__aiter__c C s | t u rt|dd�S tS )NrT rQ )r r/ r) r4 r r r r6 � s z AsyncIterator.__subclasshook__N) r7 r8 r9 r: r rT rQ r; r6 r r r r r � s
r c @ sF 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)�asendr1 r r r rT � s zAsyncGenerator.__anext__c � s t �dS )zuSend a value into the asynchronous generator.
Return next yielded value or raise StopAsyncIteration.
NrR rB r r r rU � s zAsyncGenerator.asendNc � s4 |du r|du r|�|� }|dur,|� |�}|�dS )zyRaise an exception in the asynchronous generator.
Return next yielded value or raise StopAsyncIteration.
NrE rG r r r �athrow� s
zAsyncGenerator.athrowc � s8 z| � t�I dH W n ttfy* Y n
0 td��dS )rL Nz,asynchronous generator ignored GeneratorExit)rV rN rS rO r1 r r r �aclose� s
zAsyncGenerator.aclosec C s | t u rt|ddddd�S tS )NrQ rT rU rV rW )r
r/ r) r4 r r r r6 � s
�z AsyncGenerator.__subclasshook__)NN) r7 r8 r9 r: rT r rU rV rW r; r6 r r r r r
� s
r
c @ s0 e Zd ZdZedd� �Zedd� �Zee�Z dS )r r c c s d S r r r1 r r r �__iter__ s zIterable.__iter__c C s | t u rt|d�S tS )NrX )r r/ r) r4 r r r r6 s
zIterable.__subclasshook__N)
r7 r8 r9 r: r rX r; r6 r> r? r r r r r � s
r 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@ r1 r r r �__next__ s zIterator.__next__c C s | S r r r1 r r r rX s zIterator.__iter__c C s | t u rt|dd�S tS )NrX rY )r r/ r) r4 r r r r6 s zIterator.__subclasshook__N) r7 r8 r9 r: r rY rX r; r6 r r r r r s
r c @ s( e Zd ZdZedd� �Zedd� �ZdS )r r c c s d S r r r1 r r r � __reversed__6 s zReversible.__reversed__c C s | t u rt|dd�S tS )NrZ rX )r r/ r) r4 r r r r6 ; s zReversible.__subclasshook__N)r7 r8 r9 r: r rZ r; r6 r r r r r 2 s
r c @ sF e Zd ZdZdd� Zedd� �Zed
dd��Zd d
� Ze d d � �Z
dS )r r c C s
| � d�S )z^Return the next item from the generator.
When exhausted, raise StopIteration.
N)rD r1 r r r rY F s zGenerator.__next__c C s t �dS )zcSend a value into the generator.
Return next yielded value or raise StopIteration.
Nr@ rB r r r rD L s zGenerator.sendNc C s4 |du r|du r|�|� }|dur,|� |�}|�dS )zgRaise an exception in the generator.
Return next yielded value or raise StopIteration.
NrE rG r r r rK S s
zGenerator.throwc C s2 z| � t� W n ttfy$ Y n
0 td��dS )z.Raise GeneratorExit inside generator.
z generator ignored GeneratorExitNrM r1 r r r rP ` s
zGenerator.closec C s | t u rt|ddddd�S tS )NrX rY rD rK rP )r r/ r) r4 r r r r6 j s
�zGenerator.__subclasshook__)NN) r7 r8 r9 r: rY r rD rK rP r; r6 r r r r r B s
r c @ s( e Zd ZdZedd� �Zedd� �ZdS )r r c C s dS r0 r r1 r r r �__len__y s z
Sized.__len__c C s | t u rt|d�S tS )Nr[ )r r/ r) r4 r r r r6 } s
zSized.__subclasshook__N)r7 r8 r9 r: r r[ r; r6 r r r r r u s
r c @ s0 e Zd ZdZedd� �Zedd� �Zee�Z dS )r r c C s dS �NFr )r2 �xr r r � __contains__� s zContainer.__contains__c C s | t u rt|d�S tS )Nr^ )r r/ r) r4 r r r r6 � s
zContainer.__subclasshook__N)
r7 r8 r9 r: r r^ r; r6 r> r? r r r r r � s
r c @ s e Zd ZdZedd� �ZdS )r r c C s | t u rt|ddd�S tS )Nr[ rX r^ )r r/ r) r4 r r r r6 � s zCollection.__subclasshook__N)r7 r8 r9 r: r; r6 r r r r r � s r c sP e Zd ZdZdZdd� Ze� fdd��Z� fdd�Zd d
� Z � fd 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
C s` z| � ||�W S tyZ } z4dd l}|�t|�� d�t� t||�W Y d }~S d }~0 0 d S )Nr z. (This will raise a TypeError in Python 3.10.))� _CallableGenericAlias__create_ga� TypeError�warnings�warn�str�DeprecationWarningr> )r5 �origin�args�excrb r r r �__new__� s �z _CallableGenericAlias.__new__c sX t |t�rt|�dkr td��|\}}t |ttf�rDt|�|f }n|}t� �| ||�S )N� z6Callable must be used as Callable[[arg, ...], result].)�
isinstance�tuple�lenra �list�superri )r5 rf rg �t_args�t_result�ga_args�� __class__r r � __create_ga� s �z!_CallableGenericAlias.__create_gac s\ t | j�dkr&| jd tu r&t� �� S dd�dd� | jd d� D ��� dt| jd �� d �S )
Nrj r zcollections.abc.Callable[[z, c S s g | ] }t |��qS r )�
_type_repr)�.0�ar r r �
<listcomp>� r z2_CallableGenericAlias.__repr__.<locals>.<listcomp>���z], �])rm �__args__�Ellipsisro �__repr__�joinrv r1 rs r r r~ � s
� �z _CallableGenericAlias.__repr__c C sB | j }t|�dkr |d tu s6t|d d� �|d f}tt|ffS )Nrj r rz )r| rm r} rn r_ r )r2 rg r r r �
__reduce__� s z _CallableGenericAlias.__reduce__c s8 t � �|�}|j}|d }|d d� }||f}tt|�S )Nrz )ro � __getitem__r| r_ r )r2 �item�garg rq rp rs r r r� � s z!_CallableGenericAlias.__getitem__) r7 r8 r9 �__doc__r: ri r; r` r~ r� r� �
__classcell__r r rs r r_ � s
r_ c C sb t | t�rt| �S t | t�r>| jdkr,| jS | j� d| j� �S | tu rJdS t | t�rZ| 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...) rk r> �repr�typer8 r9 r} � FunctionTyper7 )�objr r r rv � s
rv c @ s0 e Zd ZdZedd� �Zedd� �Zee�Z dS )r r c O s dS r\ r )r2 rg �kwdsr r r �__call__� s zCallable.__call__c C s | t u rt|d�S tS )Nr� )r r/ r) r4 r r r r6 � s
zCallable.__subclasshook__N)
r7 r8 r9 r: r r� r; r6 r_ r? r r r r r � s
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|�kr"dS | D ]}||vr& dS q&dS �NFT�rk r r) rm �r2 �other�elemr r r �__le__ s
z
Set.__le__c C s( t |t�stS t| �t|�k o&| �|�S r �rk r r) rm r� �r2 r� r r r �__lt__ s
z
Set.__lt__c C s( t |t�stS t| �t|�ko&| �|�S r )rk r r) rm �__ge__r� r r r �__gt__! s
z
Set.__gt__c C s> t |t�stS t| �t|�k r"dS |D ]}|| vr& dS q&dS r� r� r� r r r r� & s
z
Set.__ge__c C s( t |t�stS t| �t|�ko&| �|�S r r� r� r r r �__eq__0 s
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 )r5 �itr r r �_from_iterable5 s zSet._from_iterablec s& t |t�stS � �� fdd�|D ��S )Nc 3 s | ]}|� v r|V qd S r r �rw rC r1 r r � <genexpr>A r z Set.__and__.<locals>.<genexpr>�rk r r) r� r� r r1 r �__and__> s
z Set.__and__c C s |D ]}|| v r dS qdS )z1Return True if two sets have a null intersection.FTr )r2 r� rC r r r �
isdisjointE s zSet.isdisjointc C s* t |t�stS dd� | |fD �}| �|�S )Nc s s | ]}|D ]
}|V q
qd S r r )rw �s�er r r r� O r z Set.__or__.<locals>.<genexpr>r� )r2 r� �chainr r r �__or__L s
z
Set.__or__c s: t � t�s"t � t�stS | �� �� | �� fdd�| D ��S )Nc 3 s | ]}|� vr|V qd S r r r� �r� r r r� Y s �z Set.__sub__.<locals>.<genexpr>�rk r r r) r� r� r r� r �__sub__T s
z Set.__sub__c s: t |t�s"t |t�stS � �|�}� �� fdd�|D ��S )Nc 3 s | ]}|� vr|V qd S r r r� r1 r r r� a s �z Set.__rsub__.<locals>.<genexpr>r� r� r r1 r �__rsub__\ s
z Set.__rsub__c C s2 t |t�s"t |t�stS | �|�}| | || B S r r� r� r r r �__xor__d 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 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.
rj r" iM��r� i�M[l �4~2 i�
i��6rz i��8#)�sys�maxsizerm �hash)r2 �MAX�MASK�n�hr] �hxr r r �_hashm s
z Set._hashN)r7 r8 r9 r� r: r� r� r� r� r� r; r� r� �__rand__r� r� �__ror__r� r� r� �__rxor__r� r r r r r 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 s t �dS )zAdd an element.N��NotImplementedErrorrB r r r �add� s zMutableSet.addc C s t �dS )z8Remove an element. Do not raise an exception if absent.Nr� rB r r r �discard� s zMutableSet.discardc C s || vrt |��| �|� dS )z5Remove an element. If not a member, raise a KeyError.N)�KeyErrorr� rB r r r �remove� s zMutableSet.removec C s< t | �}z t|�}W n ty, td�Y n0 | �|� |S )z2Return the popped value. Raise KeyError if empty.N)�iter�nextrA r� r� �r2 r� rC r r r �pop� s
zMutableSet.popc C s& z| � � qW n ty Y n0 dS )z6This is slow (creates N new iterators!) but effective.N)r� r� r1 r r r �clear� 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__� s zMutableSet.__iand__c C sR || u r| � � n<t|t�s&| �|�}|D ]"}|| v rB| �|� q*| �|� q*| S r )r� rk r r� r� r� r� r r r �__ixor__� s
zMutableSet.__ixor__c C s* || u r| � � n|D ]}| �|� q| S r )r� r� r� r r r �__isub__� s
zMutableSet.__isub__N)r7 r8 r9 r� r: r r� r� r� r� r� r� r� r� r� r r r r r � s
r c @ sR e Zd ZdZedd� �Zddd�Zdd� Zd d
� Zd d � Z d
d� Z
dd� Z dZ dS )r r c C s t �d S r �r� �r2 �keyr r r r� � s zMapping.__getitem__Nc C s& z
| | W S t y | Y S 0 dS )z<D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.Nr� �r2 r� �defaultr r r �get� s
z Mapping.getc C s* z | | W n t y Y dS 0 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 r1 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 r1 r r r �items
s z
Mapping.itemsc C s t | �S )z6D.values() -> an object providing a view on D's values)r r1 r r r �values s zMapping.valuesc C s& t |t�stS t| �� �t|�� �kS r )rk r r) �dictr� r� r r r r� s
zMapping.__eq__)N)
r7 r8 r9 r: r r� r� r^ r� r� r� r� rZ 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� )r2 �mappingr r r �__init__! s zMappingView.__init__c C s
t | j�S r )rm r� r1 r r r r[ $ s zMappingView.__len__c C s
d� | �S )Nz&{0.__class__.__name__}({0._mapping!r}))�formatr1 r r r r~ ' s zMappingView.__repr__N)
r7 r8 r9 r: r� r[ r~ r; r> r? r r r r r s
r c @ s, e Zd ZdZedd� �Zdd� Zdd� ZdS ) r r c C s t |�S r ��set�r2 r� r r r r� 1 s zKeysView._from_iterablec C s
|| j v S r r� r� r r r r^ 5 s zKeysView.__contains__c c s | j E d H d S r r� r1 r r r rX 8 s zKeysView.__iter__N�r7 r8 r9 r: r; r� r^ rX r r r r r - s
r c @ s, e Zd ZdZedd� �Zdd� Zdd� ZdS ) r r c C s t |�S r r� r� r r r r� C s zItemsView._from_iterablec C s@ |\}}z| j | }W n ty* Y dS 0 ||u p:||kS d S r\ )r� r� )r2 r� r� rC �vr r r r^ G s zItemsView.__contains__c c s | j D ]}|| j | fV qd S r r� r� r r r rX P 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� )r2 rC r� r� r r r r^ \ s
zValuesView.__contains__c c s | j D ]}| j | V qd S r r� r� r r r rX c s
zValuesView.__iter__N)r7 r8 r9 r: r^ rX r r r r r X s r c @ s^ e Zd ZdZedd� �Zedd� �Ze� Zefdd�Z dd � Z
d
d � Z dd d
�Z ddd�Z
dS )r r c C s t �d S r r� �r2 r� rC r r r � __setitem__x 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 y. || ju r&� | Y S 0 | |= |S dS )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)r� �_MutableMapping__marker)r2 r� r� rC r r r r� � s
zMutableMapping.popc C s@ zt t| ��}W n ty( td�Y n0 | | }| |= ||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� rA r� r� r r r �popitem� s zMutableMapping.popitemc C s& z| � � qW n ty Y n0 dS )z,D.clear() -> None. Remove all items from D.N)r� r� r1 r r r r� � s zMutableMapping.clearc K s| t |t�r"|D ]}|| | |< qn<t|d�rH|�� 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)rk r �hasattrr� r� )r2 r� r� r� rC r r r �update� s
zMutableMapping.updateNc C s* z
| | W S t y$ || |< Y n0 |S )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 )N)r7 r8 r9 r: r r� r� �objectr� r� r� r� r� r� r r r r r k s
r c @ sJ e Zd ZdZdZedd� �Zdd� Zdd� Zd d
� Z dd
d�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 s t �d S r ��
IndexError�r2 �indexr r r r� � s zSequence.__getitem__c c s: d}z | | }|V |d7 }qW n t y4 Y d S 0 d S )Nr r" r� )r2 �ir� r r r rX � s zSequence.__iter__c C s$ | D ]}||u s||kr dS qdS r� r )r2 rC r� r r r r^ � s zSequence.__contains__c c s$ t tt| ���D ]}| | V qd S r )�reversed�rangerm )r2 r� r r r rZ � s zSequence.__reversed__r Nc C s� |dur"|dk r"t t| �| d�}|dur>|dk r>|t| �7 }|}|du sR||k r�z"| | }||u sl||krr|W S W n ty� Y q�Y n0 |d7 }qBt�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.
Nr r" )�maxrm r� �
ValueError)r2 rC �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 )rw r� �rC r r r� r z!Sequence.count.<locals>.<genexpr>)�sumrB r r� r �count� s zSequence.count)r N) r7 r8 r9 r� r: r r� rX r^ rZ r� r� 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)r7 r8 r9 r� r: r r r r r! s r! c @ sn e Zd ZdZedd� �Zedd� �Zedd� �Zdd � Zd
d � Z d d
� Z
dd� Z ddd�Z dd� Z
dd� ZdS )r r c C s t �d S r r� �r2 r� rC 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� rm rB r r r �append. s zMutableSequence.appendc C s& z| � � qW n ty Y n0 dS )z,S.clear() -> None -- remove all items from SN)r� r� r1 r r r r� 2 s zMutableSequence.clearc C sH t | �}t|d �D ].}| || d | | | |< | || d < qdS )z!S.reverse() -- reverse *IN PLACE*rj r" N)rm r� )r2 r� r� r r r �reverse: s zMutableSequence.reversec C s( || u rt |�}|D ]}| �|� qdS )zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)rn r� )r2 r� r� r r r �extend@ s zMutableSequence.extendrz 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 )r2 r� r� r r r r� G s zMutableSequence.popc C s | | � |�= dS )zvS.remove(value) -- remove first occurrence of value.
Raise ValueError if the value is not present.
N)r� rB r r r r� O s zMutableSequence.removec C s | � |� | S r )r� )r2 r� r r r �__iadd__U s
zMutableSequence.__iadd__N)rz )r7 r8 r9 r: r r� r� r� r� r� r� r� r� r� r� r r r r r s
r )Rr� �abcr r r� r� rn �intr> � EllipsisTyper r� �__all__r7 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_iterator�zip� zip_iterator� dict_keys� dict_values�
dict_itemsr( � mappingproxy� generatorr% � coroutinerP r& �async_generatorr/ r r r
�registerr r r
r r r r r r r r_ rv r r � frozensetr r r r r r r r� r rl rd �
memoryviewr! �bytesr r r r r �<module> s�
)
0
0
=
P
3
T
>
D