֦iY} Z
d Z ddlmZmZ ddlZ eee Z ed Z d Z
ee
Z [
g dZ dZ
e ed Z e e e Z e ei j% Z e ei j) Z e ei j- Z e eg Z e e eg Z e e ed Z e e ed d
z Z e e e Z e ed Z e ed Z! e e e" Z# ei j% Z$ ei j) Z% ei j- Z& eejN Z( e d
Z)d Z* e* Z* ee* Z+e*jY [*d Z- e- Z- ee- Z.[-d Z/ G d de Z0 G d de Z1 G d de1 Z2e2jg e+ G d de Z4 G d de4 Z5 G d d e5 Z6e6jg e. G d d e Z7 G d d!e7 Z8e8jg e e8jg e e8jg e e8jg e e8jg e e8jg e e8jg e e8jg e e8jg e e8jg e e8jg e e8jg e! e8jg e# G d" d#e7 Z9 G d$ d%e8 Z:e:jg e) G d& d'e Z; G d( d)e Z< G d* d+e;e7e< Z= G d, d-e Z> G d. d/e Z?d0 Z@d1 ZA G d2 d3e ZB G d4 d5e= ZCeCjg eD G d6 d7eC ZEeEjg e G d8 d9e= ZFeFjg e( G d: d;e; ZG G d< d=eGeC ZHeHjg e$ G d> d?eGeC ZIeIjg e& G d@ dAeGe= ZJeJjg e% G dB dCeF ZKeKjg eL G dD dEe9e= ZMeMjg eN eMjg eO eMjg e eMjg eP G dF dGe ZQ G dH dIeMeQ ZReRjg eS eRjg e G dJ dKeM ZTeTjg e eTjg e y)LzjAbstract Base Classes (ABCs) for collections, according to PEP 3119.
Unit tests are in test_collections.
)ABCMetaabstractmethodN.c y N r )/usr/lib64/python3.12/_collections_abc.py_fr
( s $r ) Awaitable Coroutine
AsyncIterable
AsyncIteratorAsyncGeneratorHashableIterableIterator Generator
ReversibleSized ContainerCallable
CollectionSet
MutableSetMappingMutableMapping MappingViewKeysView ItemsView
ValuesViewSequenceMutableSequence
ByteStringBufferzcollections.abcr i r c # K d S r r r r r r( X s 5r c K y wr r r r r _coror* Z s 4 c K d y wr r r r r _agr- ` s c | j }|D ]9 }|D ]+ }||j v s|j |
t c c S 2 t c S y)NT)__mro____dict__NotImplemented)CmethodsmromethodBs r _check_methodsr8 h sP
))CA#::f%-)) " ! r c 0 e Zd ZdZed Zed Zy)r r c yNr r selfs r __hash__zHashable.__hash__x r c 6 | t u r t |d S t S )Nr> )r r8 r2 clsr3 s r __subclasshook__zHashable.__subclasshook__| (?!!Z0 0 r N)__name__
__module__ __qualname__ __slots__r r> classmethodrC r r r r r t - I r r ) metaclassc @ e Zd ZdZed Zed Z ee Z y)r r c # K d y wr r r< s r __await__zAwaitable.__await__ s
s c 6 | t u r t |d S t S )NrN )r r8 r2 rA s r rC zAwaitable.__subclasshook__ s ) !![1 1 r N)
rE rF rG rH r rN rI rC GenericAlias__class_getitem__r r r r r s: I
$L1r r c H e Zd ZdZed Zedd Zd Zed Z y)r r c t )zcSend a value into the coroutine.
Return next yielded value or raise StopIteration.
StopIterationr= values r sendzCoroutine.send
r Nc F | || | }||j | }|)zgRaise an exception in the coroutine.
Return next yielded value or raise StopIteration.
with_tracebackr= typvaltbs r throwzCoroutine.throw 4
;z %C
>$$R(C r c n | j t t d # t t f$ r Y yw xY w).Raise GeneratorExit inside coroutine.
z coroutine ignored GeneratorExitNra
GeneratorExit RuntimeErrorrU r< s r closezCoroutine.close ; B JJ} % @A A }- " 44c < | t u rt |dddd S t S )NrN rX ra rh )r r8 r2 rA s r rC zCoroutine.__subclasshook__ s# ) !![&'7K K r NN)
rE rF rG rH r rX ra rh rI rC r r r r r sG I
B r r c @ e Zd ZdZed Zed Z ee Z y)r
r c t S r )r r< s r __aiter__zAsyncIterable.__aiter__ s
r c 6 | t u r t |d S t S )Nro )r
r8 r2 rA s r rC z AsyncIterable.__subclasshook__ s - !![1 1 r N)
rE rF rG rH r ro rI rC rP rQ r r r r
r
s: I
$L1r r
c 6 e Zd ZdZed Zd Zed Zy)r r c K t w)z@Return the next item or raise StopAsyncIteration when exhausted.StopAsyncIterationr< s r __anext__zAsyncIterator.__anext__ s ! r. c | S r r r< s r ro zAsyncIterator.__aiter__ r c 8 | t u r
t |dd S t S )Nru ro )r r8 r2 rA s r rC z AsyncIterator.__subclasshook__ s - !![+> > r N) rE rF rG rH r ru ro rI rC r r r r r s2 I! ! r r c N e Zd ZdZd Zed Zedd Zd Ze d Z
y) r r c @ K | j d d{ S 7 w)zpReturn the next item from the asynchronous generator.
When exhausted, raise StopAsyncIteration.
N)asendr< s r ru zAsyncGenerator.__anext__ s ZZ%%%%s c K t w)zuSend a value into the asynchronous generator.
Return next yielded value or raise StopAsyncIteration.
rs rV s r r{ zAsyncGenerator.asend s
! r. Nc N K | || | }||j | }|w)zyRaise an exception in the asynchronous generator.
Return next yielded value or raise StopAsyncIteration.
r[ r] s r athrowzAsyncGenerator.athrow s8
;z %C
>$$R(C s #%c K | j t d{ t d 7 # t t f$ r Y yw xY ww)rd Nz,asynchronous generator ignored GeneratorExit)r~ rf rg rt r< s r aclosezAsyncGenerator.aclose sH O++m, , , MN N
- 12 s/ A. ,. A. A AA Ac > | t u rt |ddddd S t S )Nro ru r{ r~ r )r r8 r2 rA s r rC z AsyncGenerator.__subclasshook__ s* . !![+")8X?
? r rl ) rE rF rG rH ru r r{ r~ r rI rC r r r r r sN I& ! !
O r r c @ e Zd ZdZed Zed Z ee Z y)r r c # K y wr r r< s r __iter__zIterable.__iter__ r+ c 6 | t u r t |d S t S )Nr )r r8 r2 rA s r rC zIterable.__subclasshook__ rD r N)
rE rF rG rH r r rI rC rP rQ r r r r r s: I
$L1r r c 6 e Zd ZdZed Zd Zed Zy)r r c t )zKReturn the next item from the iterator. When exhausted, raise StopIterationrT r< s r __next__zIterator.__next__- s
r c | S r r r< s r r zIterator.__iter__2 rw r c 8 | t u r
t |dd S t S )Nr r )r r8 r2 rA s r rC zIterator.__subclasshook__5 s (?!!Z< < r N) rE rF rG rH r r r rI rC r r r r r ) s2 I r r c 0 e Zd ZdZed Zed Zy)r r c # K y wr r r< s r __reversed__zReversible.__reversed__P r r+ c 8 | t u r
t |dd S t S )Nr r )r r8 r2 rA s r rC zReversible.__subclasshook__U s * !!^Z@ @ r N)rE rF rG rH r r rI rC r r r r r L s- I r r c N e Zd ZdZd Zed Zedd Zd Ze d Z
y) r r c $ | j d S )z^Return the next item from the generator.
When exhausted, raise StopIteration.
N)rX r< s r r zGenerator.__next__` s yy r c t )zcSend a value into the generator.
Return next yielded value or raise StopIteration.
rT rV s r rX zGenerator.sendf rY r Nc F | || | }||j | }|)zgRaise an exception in the generator.
Return next yielded value or raise StopIteration.
r[ r] s r ra zGenerator.throwm rb r c n | j t t d # t t f$ r Y yw xY w)z.Raise GeneratorExit inside generator.
z generator ignored GeneratorExitNre r< s r rh zGenerator.closez ri rj c > | t u rt |ddddd S t S )Nr r rX ra rh )r r8 r2 rA s r rC zGenerator.__subclasshook__ s* ) !!Z"('7<
< r rl ) rE rF rG rH r r rX ra rh rI rC r r r r r \ sN I
B r r c 0 e Zd ZdZed Zed Zy)r r c yr; r r< s r __len__z
Sized.__len__ r? r c 6 | t u r t |d S t S )Nr )r r8 r2 rA s r rC zSized.__subclasshook__ s %<!!Y/ / r N)rE rF rG rH r r rI rC r r r r r rJ r r c @ e Zd ZdZed Zed Z ee Z y)r r c yNFr )r= xs r __contains__zContainer.__contains__ r c 6 | t u r t |d S t S )Nr )r r8 r2 rA s r rC zContainer.__subclasshook__ s ) !!^4 4 r N)
rE rF rG rH r r rI rC rP rQ r r r r r s: I
$L1r r c e Zd ZdZed Zy)r r c : | t u rt |ddd S t S )Nr r r )r r8 r2 rA s r rC zCollection.__subclasshook__ s! * !!i^L L r N)rE rF rG rH rI rC r r r r r s I r r c : e Zd ZdZededefd Zed Z y)r$ r flagsreturnc t r NotImplementedError)r= r s r
__buffer__zBuffer.__buffer__ s !!r c 6 | t u r t |d S t S )Nr )r$ r8 r2 rA s r rC zBuffer.__subclasshook__ s &=!!\2 2 r N)
rE rF rG rH r int
memoryviewr rI rC r r r r$ r$ s; I" ": " " r r$ c @ e Zd ZdZdZ fdZ fdZd Z fdZ xZ 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 t |t rt | dk( s t d |\ }}t |t t f rg ||}nt | st d| t | | || S )N z6Callable must be used as Callable[[arg, ...], result].zFExpected a list of types, an ellipsis, ParamSpec, or Concatenate. Got )
isinstancetuplelen TypeErrorlist_is_param_exprsuper__new__)rB originargst_argst_result __class__s r r z _CallableGenericAlias.__new__ s 4'CINHJ
J fudm ,&V&X&D ' >>DX G H
HwsFD11r c . t | j dk( r&t | j d rt | S ddj | j d d D cg c]
}t
| c} dt
| j d dS c c}w )Nr r zcollections.abc.Callable[[z, z], ])r __args__r r __repr__join
_type_repr)r= ar s r r z _CallableGenericAlias.__repr__ s t}} "~dmmA6F'G7#% %YYt}}Sb7I J7I!
1
7I JKLC dmmB /014 5 Js B
c | j }t | dk( rt |d st |d d |d f}t t
|ffS )Nr r r )r r r r r r )r= r s r
__reduce__z _CallableGenericAlias.__reduce__ sI }}D Q>$q'#:Sb ?DH,D$x&666r c t |t s|f}t |
| j }t |d t t
f s|d }|d d }||f}t
t t | S )Nr r )r r r __getitem__r r r r )r= itemnew_argsr r r s r r z!_CallableGenericAlias.__getitem__ sn
$&7D7&t,55 (1+t}5 |H cr]F )H$XuX??r )
rE rF rG __doc__rH r r r r
__classcell__r s @r r r s* I
257 @ @r r c t u ryt t ryt d} j dk( xr t fd|D S )z|Checks if obj matches either a list of types, ``...``, ``ParamSpec`` or
``_ConcatenateGenericAlias`` from typing.py
T) ParamSpec_ConcatenateGenericAliastypingc 3 < K | ] }j |k( y wr )rE ).0nameobjs r z!_is_param_expr.. s -Uutclld.Bus )Ellipsisr r typerF any)r namess ` r r r sI h#t
s)C 5E >>X % U#-Uu-U*UUr c t | t r6| j dk( r | j S | j d| j S | t u ryt | t
r | j S t | S )zReturn the repr() of an object, special-casing types (internal helper).
Copied from :mod:`typing` since collections.abc
shouldn't depend on that module.
(Keep this roughly in sync with the typing version.)
builtins.z...)r r rF rG r FunctionTyperE repr)r s r r r sk #t >>Z '## #..!3#3#3"455
h#|$|| 9r c @ e Zd ZdZed Zed Z ee Z y)r r c yr r )r= r kwdss r __call__zCallable.__call__! r r c 6 | t u r t |d S t S )Nr )r r8 r2 rA s r rC zCallable.__subclasshook__% rD r N)
rE rF rG rH r r rI rC r rQ r r r r r s; I
$$9:r r c x e Zd ZdZdZd Zd Zd Zd Zd Z e
d Z d Z e Z
d
Zd ZeZd Zd
Zd ZeZd Zy)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 z t |t st S t | t | kD ry| D ] }||vs y yNFTr r r2 r r= otherelems r __le__z
Set.__le__> s? %%! ! t9s5z !D5 r c t |t st S t | t | k xr | j | S r r r r2 r r r= r s r __lt__z
Set.__lt__H 3 %%! !4y3u:%<$++e*<.m s "MeUu}5es r r r2 r r s ` r __and__z Set.__and__j s* %*! !"""Me"MMMr c |D ] }|| v s y y)z1Return True if two sets have a null intersection.FTr )r= r rW s r
isdisjointzSet.isdisjointq s E} r c f t |t st S d | |fD }| j | S )Nc 3 . K | ]
}|D ] }| y wr r )r ses r r z Set.__or__..{ s 5Mq1a1Ms r )r= r chains r __or__z
Set.__or__x s1 %*! !5T5M5""5))r c t t s't t st S | j | j fd| D S )Nc 3 * K | ]
}|vr| y wr r )r rW r s r r z Set.__sub__.. s #:dU&+5&8 $)d r r r r2 r r s `r __sub__z Set.__sub__ sL %% eX.%%''.E"" #:d #: : :r c t |t s't |t st S j | } j fd|D S )Nc 3 * K | ]
}|vr| y wr r r s r r z Set.__rsub__.. s #9eU&+4&7 $)er r
r s ` r __rsub__z Set.__rsub__ sL %% eX.%%''.E"" #9e #9 9 9r c t |t s't |t st S | j | }| |z
|| z
z S r r
r s r __xor__z Set.__xor__ s? %% eX.%%''.Eu ..r c t j }d|z dz }t | }d|dz z }||z }| D ]# }t | }|||dz z dz dz z }||z }% ||dz |dz z z }|d z d
z }||z }||kD r||dz z }|d k( rd }|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% iMr iM[l 4~2 i
i6r i8#)sysmaxsizer hash)r= MAXMASKnhr hxs r _hashz Set._hash s kk3w{ I !a% T AaB
"b/H,; ;A
IA
a2g!r'
""
I ! T s7
MA 7Ar N)rE rF rG r rH r r r r r rI r r __rand__r r __ror__r r r __rxor__r r r r r r 1 st I=
=
>
N
H* G:9/ H r r c ^ e Zd ZdZdZed Zed Zd Zd Z d Z
d Z d Z d
Z
d Zy )
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 t )zAdd an element.r rV s r addzMutableSet.add
"!r c t )z8Remove an element. Do not raise an exception if absent.r rV s r discardzMutableSet.discard r' r c D || vr t | | j | y)z5Remove an element. If not a member, raise a KeyError.N)KeyErrorr) rV s r removezMutableSet.remove s 5/ ! Ur c ~ t | } t | }| j | |S # t $ r t dw xY w)z2Return the popped value. Raise KeyError if empty.N)iternextrU r+ r) r= r rW s r popzMutableSet.pop sE
$Z %HE
U % $ %s + <c F | j # t $ r Y yw xY w)z6This is slow (creates N new iterators!) but effective.N)r1 r+ r< s r clearzMutableSet.clear s*
c 6 |D ] }| j | | S r )r& r0 s r __ior__zMutableSet.__ior__ s E HHUO r c < | |z
D ] }| j | | S r )r) r0 s r __iand__zMutableSet.__iand__ s! RiE LL r c || u r| j | S t |t s| j | }|D ]) }|| v r| j | | j | + | S r )r3 r r r r) r& r0 s r __ixor__zMutableSet.__ixor__ sd
: JJL b#&((,D=LL'HHUO
r c b || u r| j | S |D ] }| j | | S r )r3 r) r0 s r __isub__zMutableSet.__isub__ s6
: JJL U# r N)rE rF rG r rH r r& r) r, r1 r3 r6 r8 r: r< r r r r r sW I" " " "
r r c R e Zd ZdZdZdZed Zd dZd Z d Z
d Z d
Z d Z
dZy)
r zA 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 t r r+ r= keys r r zMapping.__getitem__ r Nc 0 | | S # t $ r |cY S w xY w)z D[k] if k in D, else d. d defaults to None.r@ r= rB defaults r getz Mapping.get$ s% 9 N s c . | | y# t $ r Y yw xY wNTFr@ rA s r r zMapping.__contains__+ s' I s c t | S )z:D.keys() -> a set-like object providing a view on D's keys)r r< s r keysz Mapping.keys3 s ~ r c t | S )z a set-like object providing a view on D's items)r r< s r itemsz
Mapping.items7 s r c t | S )z6D.values() -> an object providing a view on D's values)r r< s r valueszMapping.values; s
$ r c t |t st S t | j t |j k( S r )r r r2 dictrM r s r r zMapping.__eq__? s3 %)! !DJJL!T%++-%888r r )rE rF rG r rH __abc_tpflags__r r rG r rK rM rO r r r r r r r sL I O 9
Lr r c 2 e Zd ZdZd Zd Zd Z ee Z y)r _mappingc || _ y r rT )r= mappings r __init__zMappingView.__init__M s
r c , t | j S r )r rU r< s r r zMappingView.__len__P s 4==!!r c $ dj | S )Nz&{0.__class__.__name__}({0._mapping!r}))formatr< s r r zMappingView.__repr__S s 7>>tDDr N)
rE rF rG rH rX r r rI rP rQ r r r r r I s$ I "E $L1r r c , e Zd ZdZed Zd Zd Zy)r r c t | S r setr s r r zKeysView._from_iterable] 2wr c || j v S r rT rA s r r zKeysView.__contains__a s dmm##r c # 8 K | j E d { y 7 wr rT r< s r r zKeysView.__iter__d s == s NrE rF rG rH rI r r r r r r r r Y s# I $!r r c , e Zd ZdZed Zd Zd Zy)r r c t | S r r^ r s r r zItemsView._from_iterableo r` r c ` |\ }} | j | }||u xs ||k( S # t $ r Y yw xY wr )rU r+ )r= r rB rW vs r r zItemsView.__contains__s sG
U ,
c"A :+e + s ! --c # T K | j D ] }|| j | f y wr rT rA s r r zItemsView.__iter__| s( ==C
c*+ + !s &(Nrc r r r r r k s# I ,,r r c e Zd ZdZd Zd Zy)r r c Z | j D ] }| j | }||u s||k( s y yrI rT )r= rW rB rg s r r zValuesView.__contains__ s3 ==C
c"AEzQ%Z ! r c # P K | j D ] }| j | y wr rT rA s r r zValuesView.__iter__ s# ==C--$ $ !s $&N)rE rF rG rH r r r r r r r s I%r r c h e Zd ZdZdZed Zed Z e Z e fdZ
d Z d Z d dZ
d d
Zy )
r zA 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 t r r@ r= rB rW s r __setitem__zMutableMapping.__setitem__ rC r c t r r@ rA s r __delitem__zMutableMapping.__delitem__ rC r c X | | }| |= |S # t $ r || j u r |cY S w xY w)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.
)r+ _MutableMapping__marker)r= rB rF rW s r r1 zMutableMapping.pop sC IE S L
$--'N s ))c l t t | }| | }| |= ||fS # t $ r t dw xY w)zD.popitem() -> (k, v), remove and return some (key, value) pair
as a 2-tuple; but raise KeyError if D is empty.
N)r/ r. rU r+ rn s r popitemzMutableMapping.popitem sJ %tDz"C S IEz % $ %s " 3c F | j # t $ r Y yw xY w)z,D.clear() -> None. Remove all items from D.N)ru r+ r< s r r3 zMutableMapping.clear s* r4 c t |t r|D ]
}|| | |< n9t |d r |j D ]
}|| | |< n|D ]
\ }}|| |< |j D ]
\ }}|| |< y)aR 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.keys(): 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
rK N)r r hasattrrK rM )r= r r rB rW s r updatezMutableMapping.update s eW % !#JS
UF
# zz| !#JS $ $
U !S $ **,JC DI 'r Nc 8 | | S # t $ r || |< Y |S w xY w)z@D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in Dr@ rE s r
setdefaultzMutableMapping.setdefault s. 9 DI s )r r )rE rF rG r rH r ro rq objectrs r1 ru r3 ry r{ r r r r r sY I xH '
$r r c H e Zd ZdZdZdZed Zd Zd Z d Z
d d Z d
Z y) r! zAll the operations on a read-only sequence.
Concrete subclasses must override __new__ or __init__,
__getitem__, and __len__.
r c t r
IndexErrorr= indexs r r zSequence.__getitem__ r c # N K d} | | }| |dz
}# t $ r Y y w xY ww)Nr r% r )r= irg s r r zSequence.__iter__ sB
GQ s % "%"%c ( | D ]
}||u s||k( s
y yrI r )r= rW rg s r r zSequence.__contains__ s! AEzQ%Z r c # ^ K t t t | D ] }| | y wr )reversedranger )r= r s r r zSequence.__reversed__ s' %D *+Aq'M ,s +-Nc | |dk rt t | |z d }||dk r|t | z
}|}|||k r | | }||u s||k( r|S |dz
}|||k r t # t $ r Y t w xY w)zS.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.
r r% )maxr r
ValueError)r= rW startstopr rg s r r zSequence.index s D E)1-E q CI D la$h
G EzQ%Z
FA la$h
s A# # A43A4c , t fd| D S )zBS.count(value) -> integer -- return number of occurrences of valuec 3 6 K | ] }|u s|k( s
d yw)r% Nr )r rg rW s r r z!Sequence.count..+ s ?da5jAJ1ds )sumrV s `r countzSequence.count) s ?d???r )r N)
rE rF rG r rH rR r r r r r r r r r r r! r! sA I O .@r r! c ( e Zd Z fdZ fdZ xZS )_DeprecateByteStringMetac b |dk7 rdd l }|j dd t | | |||fi |S )Nr# r collections.abc.ByteString r, )warnings _deprecatedr r )rB r bases namespacekwargsr r s r r z _DeprecateByteStringMeta.__new__3 sC < ,
!
wsD%EfEEr c P dd l }|j dd t |
| S )Nr r r r )r r r __instancecheck__)rB instancer r s r r z*_DeprecateByteStringMeta.__instancecheck__= s1 (
w(22r )rE rF rG r r r r s @r r r 2 s F3 3r r c e Zd ZdZdZy)r# zMThis unifies bytes and bytearray.
XXX Should add all their methods.
r N)rE rF rG r rH r r r r# r# F s
Ir r# c p e Zd ZdZdZed Zed Zed Zd Z d Z
d Z d Z dd
Z
d Zd Zy
)r" zAll the operations on a read-write sequence.
Concrete subclasses must provide __new__ or __init__,
__getitem__, __setitem__, __delitem__, __len__, and insert().
r c t r r r= r rW s r ro zMutableSequence.__setitem__[ r r c t r r r s r rq zMutableSequence.__delitem___ r r c t )z3S.insert(index, value) -- insert value before indexr r s r insertzMutableSequence.insertc s
r c : | j t | | y)z:S.append(value) -- append value to the end of the sequenceN)r r rV s r appendzMutableSequence.appendh s CIu%r c F | j # t $ r Y yw xY w)z,S.clear() -> None -- remove all items from SN)r1 r r< s r r3 zMutableSequence.clearl s*
r4 c z t | }t |dz D ] }| ||z
dz
| | c| |< | ||z
dz
< ! y)z!S.reverse() -- reverse *IN PLACE*r r% N)r r )r= r r s r reversezMutableSequence.reverset sI Iq!tA#'!A;Q DGT!A#a%[ r c R || u r t | }|D ] }| j | y)zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)r r )r= rO rg s r extendzMutableSequence.extendz s' T>&\FA KKN r c | | }| |= |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 rg s r r1 zMutableSequence.pop s
K Kr c ( | | j | = y)zvS.remove(value) -- remove first occurrence of value.
Raise ValueError if the value is not present.
N)r rV s r r, zMutableSequence.remove s
E" #r c ( | j | | S r )r )r= rO s r __iadd__zMutableSequence.__iadd__ s F r N)r )rE rF rG r rH r ro rq r r r3 r r r1 r, r r r r r" r" R sk I &8 $ r r" )Ur abcr r r r r r rP EllipsisTyper
r __all__rE r. bytes_iterator bytearraybytearray_iteratorrK dict_keyiteratorrO dict_valueiteratorrM dict_itemiterator
list_iteratorr list_reverseiteratorr range_iteratorlongrange_iteratorr_ set_iterator str_iteratortuple_iteratorzip zip_iterator dict_keys dict_values
dict_itemsr1 mappingproxy generatorr* coroutinerh r- async_generatorr8 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 rQ r! r strr r r# bytesr" r r r r s > (
DI Cy Bx
d3i $y{+, RWWY( $ryy{+, bhhj)* T"X
D" ./ d58n%$uQ$Y /01 DK DH~ d2h DK O 299;
"((*
DMM" /$ %
K
es)
2' 2"& & R
9 2g 2" M &- ] - ` (2 2$ x & . ! $ % " # $ % # $ - & ' . ! $ % , , . ! ,
- - `
9 g 2' 2" ) w 4@L 4@l
V$; ;(G* GT Y M M` C
1j 1f
2%
2 !{C ! ) , S ,,
:
%j
% K OW Od
=@z: =@~ % # % * 3w 3(%= E
I ?h ?D #r