AѳMv
d Z ddlmZmZ ddlZ eee Z ed Z d Z
ee
Z [
g dZ dZ
e ed Z e e e Z e ei Z e ei Z e ei 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 Z$ ei Z% ei Z& eej' Z( e d
Z)d Z* e* Z* ee* Z+e*, [*d Z- e- Z- ee- Z.[-d Z/ G d de Z0 G d de Z1 G d de1 Z2e23 e+ G d de Z4 G d de4 Z5 G d d e5 Z6e63 e. G d d e Z7 G d d!e7 Z8e83 e e83 e e83 e e83 e e83 e e83 e e83 e e83 e e83 e e83 e e83 e e83 e! e83 e# G d" d#e7 Z9 G d$ d%e8 Z:e:3 e) G d& d'e Z; G d( d)e Z< G d* d+e;e7e< Z= G d, d-e Z>d. Z?d/ Z@ G d0 d1e ZA G d2 d3e= ZBeB3 eC G d4 d5eB ZDeD3 e G d6 d7e= ZEeE3 e( G d8 d9e; ZF G d: d;eFeB ZGeG3 e$ G d< d=eFeB ZHeH3 e& G d> d?eFe= ZIeI3 e% G d@ dAeE ZJeJ3 eK G dB dCe9e= ZLeL3 eM eL3 eN eL3 e eL3 eO G dD dEeL ZPeP3 eQ eP3 e G dF dGeL ZReR3 e eR3 e dS )HzjAbstract Base Classes (ABCs) for collections, according to PEP 3119.
Unit tests are in test_collections.
)ABCMetaabstractmethodN.c d S N r 7/opt/alt/python311/lib64/python3.11/_collections_abc.py_fr
s r ) Awaitable Coroutine
AsyncIterable
AsyncIteratorAsyncGeneratorHashableIterableIterator Generator
ReversibleSized ContainerCallable
CollectionSet
MutableSetMappingMutableMapping MappingViewKeysView ItemsView
ValuesViewSequenceMutableSequence
ByteStringzcollections.abcr i r c # K d V S r r r r r r' > s 5555r c
K d S r r r r r _coror) @ s
r c K d W V d S r r r r r _agr+ F s r c | j }|D ]3}|D ]%}||j v r|j | t c c S n
&t c S 4dS )NT)__mro____dict__NotImplemented)CmethodsmromethodBs r _check_methodsr5 N sw
)C " " " "A##:f%-)))))) $
" ! ! ! 4r c > e Zd ZdZed Zed ZdS )r r c dS Nr r selfs r __hash__zHashable.__hash__^ qr c B | t u rt |d S t S )Nr; )r r5 r/ clsr0 s r __subclasshook__zHashable.__subclasshook__b ! (??!!Z00 0 r N)__name__
__module__ __qualname__ __slots__r r; classmethodr@ r r r r r Z M I ^ [ r r ) metaclassc T e Zd ZdZed Zed Z ee Z dS )r r c # K d V d S r r r9 s r __await__zAwaitable.__await__m s
r c B | t u rt |d S t S )NrK )r r5 r/ r> s r r@ zAwaitable.__subclasshook__q s# ) !![11 1 r N)
rB rC rD rE r rK rF r@ GenericAlias__class_getitem__r r r r r i s[ I ^ [
$ L11r r c \ e Zd ZdZed Zedd Zd Zed Z dS )r r c t )zcSend a value into the coroutine.
Return next yielded value or raise StopIteration.
StopIterationr: values r sendzCoroutine.send~
r Nc T ||| | }|| | }|)zgRaise an exception in the coroutine.
Return next yielded value or raise StopIteration.
with_tracebackr: typvaltbs r throwzCoroutine.throw ;
;z #%%C
>$$R((C r c | t t d # t t f$ r Y dS w xY w).Raise GeneratorExit inside coroutine.
z coroutine ignored GeneratorExitNr^
GeneratorExit RuntimeErrorrR r9 s r closezCoroutine.close T B JJ} % % % @AA A }- DD + A A c H | t u rt |dddd S t S )NrK rU r^ re )r r5 r/ r> s r r@ zCoroutine.__subclasshook__ s) ) !![&'7KK K r NN)
rB rC rD rE r rU r^ re rF r@ r r r r r z s I ^
^
B B B [ r r c T e Zd ZdZed Zed Z ee Z dS )r
r c t S r )r r9 s r __aiter__zAsyncIterable.__aiter__ s r c B | t u rt |d S t S )Nrl )r
r5 r/ r> s r r@ z AsyncIterable.__subclasshook__ s# - !![11 1 r N)
rB rC rD rE r rl rF r@ rM rN r r r r
r
s[ I ^ [
$ L11r r
c D e Zd ZdZed Zd Zed ZdS )r r c K t )z@Return the next item or raise StopAsyncIteration when exhausted.StopAsyncIterationr9 s r __anext__zAsyncIterator.__anext__ s ! r c | S r r r9 s r rl zAsyncIterator.__aiter__ r c D | t u rt |dd S t S )Nrr rl )r r5 r/ r> s r r@ z AsyncIterator.__subclasshook__ s% - !![+>> > r N) rB rC rD rE r rr rl rF r@ r r r r r s\ I! ! ^! [ r r c b e Zd ZdZd Zed Zedd Zd Ze d Z
dS ) r r c < K | d d{V S )zpReturn the next item from the asynchronous generator.
When exhausted, raise StopAsyncIteration.
N)asendr9 s r rr zAsyncGenerator.__anext__ s, ZZ%%%%%%%%%r c K t )zuSend a value into the asynchronous generator.
Return next yielded value or raise StopAsyncIteration.
rp rS s r rx zAsyncGenerator.asend s
! r Nc X K ||| | }|| | }|)zyRaise an exception in the asynchronous generator.
Return next yielded value or raise StopAsyncIteration.
rX rZ s r athrowzAsyncGenerator.athrow s?
;z #%%C
>$$R((C r c K | t d{V t d # t t f$ r Y dS w xY w)ra Nz,asynchronous generator ignored GeneratorExit)r{ rc rd rq r9 s r aclosezAsyncGenerator.aclose sk O++m,, , , , , , , , MNN N 12 DD s 3 AAc J | t u rt |ddddd S t S )Nrl rr rx r{ r} )r r5 r/ r> s r r@ z AsyncGenerator.__subclasshook__ s2 . !![+")8X? ?
? r ri ) rB rC rD rE rr r rx r{ r} rF r@ r r r r r s I& & & ! ! ^!
^
O O O [ r r c T e Zd ZdZed Zed Z ee Z dS )r r c #
K d S r r r9 s r __iter__zIterable.__iter__ r c B | t u rt |d S t S )Nr )r r5 r/ r> s r r@ zIterable.__subclasshook__ rA r N)
rB rC rD rE r r rF r@ rM rN r r r r r s[ I ^ [
$ L11r r c D e Zd ZdZed Zd Zed ZdS )r r c t )zKReturn the next item from the iterator. When exhausted, raise StopIterationrQ r9 s r __next__zIterator.__next__ s
r c | S r r r9 s r r zIterator.__iter__ rt r c D | t u rt |dd S t S )Nr r )r r5 r/ r> s r r@ zIterator.__subclasshook__ s# (??!!Z<< < r N) rB rC rD rE r r r rF r@ r r r r r s\ I ^ [ r r c > e Zd ZdZed Zed ZdS )r r c #
K d S r r r9 s r __reversed__zReversible.__reversed__6 r r c D | t u rt |dd S t S )Nr r )r r5 r/ r> s r r@ zReversible.__subclasshook__; s% * !!^Z@@ @ r N)rB rC rD rE r r rF r@ r r r r r 2 sM I ^ [ r r c b e Zd ZdZd Zed Zedd Zd Ze d Z
dS ) r r c , | d S )z^Return the next item from the generator.
When exhausted, raise StopIteration.
N)rU r9 s r r zGenerator.__next__F s yy r c t )zcSend a value into the generator.
Return next yielded value or raise StopIteration.
rQ rS s r rU zGenerator.sendL rV r Nc T ||| | }|| | }|)zgRaise an exception in the generator.
Return next yielded value or raise StopIteration.
rX rZ s r r^ zGenerator.throwS r_ r c | t t d # t t f$ r Y dS w xY w)z.Raise GeneratorExit inside generator.
z generator ignored GeneratorExitNrb r9 s r re zGenerator.close` rf rg c J | t u rt |ddddd S t S )Nr r rU r^ re )r r5 r/ r> s r r@ zGenerator.__subclasshook__j s2 ) !!Z"('7< <
< r ri ) rB rC rD rE r r rU r^ re rF r@ r r r r r B s I ^
^
B B B [ r r c > e Zd ZdZed Zed ZdS )r r c dS r8 r r9 s r __len__z
Sized.__len__y r< r c B | t u rt |d S t S )Nr )r r5 r/ r> s r r@ zSized.__subclasshook__} s! %<<!!Y// / r N)rB rC rD rE r r rF r@ r r r r r u rG r r c T e Zd ZdZed Zed Z ee Z dS )r r c dS NFr )r: xs r __contains__zContainer.__contains__ ur c B | t u rt |d S t S )Nr )r r5 r/ r> s r r@ zContainer.__subclasshook__ s# ) !!^44 4 r N)
rB rC rD rE r r rF r@ rM rN r r r r r s[ I ^ [
$ L11r r c ( e Zd ZdZed ZdS )r r c F | t u rt |ddd S t S )Nr r r )r r5 r/ r> s r r@ zCollection.__subclasshook__ s' * !!i^LL L r N)rB rC rD rE rF r@ r r r r r s2 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 L t |t rt | dk st d |\ }}t |t t f rg ||R }n!t | 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__)r? originargst_argst_result __class__s r r z _CallableGenericAlias.__new__ s 4'' JCIINNHJ J
J fudm , , H&V&X&&DD '' H G>D G G H H
HwwsFD111r c > t | j dk r:t | j d r t S dd d | j d d D dt
| j d dS ) Nr r zcollections.abc.Callable[[z, c , g | ]}t | S r )
_type_repr).0as r
z2_CallableGenericAlias.__repr__.. s J J J!
1
J J Jr z], ])r __args__r r __repr__joinr )r: r s r r z _CallableGenericAlias.__repr__ s t} " "~dmA6F'G'G "77##%% %4YY J Jt}SbS7I J J JKK4 4 dmB /004 4 4 5r c | j }t | dk rt |d s t |d d |d f}t t
|ffS )Nr r r )r r r r r r )r: r s r
__reduce__z _CallableGenericAlias.__reduce__ sT }D Q>$q'#:#:SbS ??DH,D$x&666r c t |t s|f}t | j dk r4t | j d r|rt |d s|f}t | j }t |d t t f s|d }|d d }||f}t t t | S )Nr$ r r ) r r r __parameters__r r __getitem__r r r r )r: itemnew_argsr r r s r r z!_CallableGenericAlias.__getitem__ s $&& 7D
# $ $ ) )"4#6q#9::
*
*!/Q!8!8
* 7D77&&t,,5 (1+t}55 * |H crc]F )H$XuX???r )
rB rC rD __doc__rE r r r r
__classcell__)r s @r r r s I
2
2
2
2
25 5 5 5 57 7 7 @ @ @ @ @ @ @ @ @r r c t u rdS t t rdS t d} j dk ot 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 V d S r )rB )r nameobjs r z!_is_param_expr.. s* -U-Utcld.B-U-U-U-U-U-Ur )Ellipsisr r typerC any)r namess ` r r r si ht#t t
s))C 5E >X % U#-U-U-U-Uu-U-U-U*U*UUr c & t | t rt | S t | t r#| j dk r| j S | j d| j S | t u rdS t | 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.
builtins.z...) r rM reprr rC rD r FunctionTyperB )r s r r r s #|$$ Cyy#t 6 >Z ' '# #.553#3555
hu#|$$ | 99r c T e Zd ZdZed Zed Z ee Z dS )r r c dS r r )r: r kwdss r __call__zCallable.__call__ r r c B | t u rt |d S t S )Nr )r r5 r/ r> s r r@ zCallable.__subclasshook__ rA r N)
rB rC rD rE r r rF r@ r rN r r r r r s\ I ^ [
$ $9::r r c e Zd ZdZdZd Zd Zd Zd Zd Z e
d Z d Z e Z
d
Zd ZeZd Zd
Zd ZeZd ZdS )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 t |t st S t | t | k rdS | D ] }||vr dS
dS NFTr r r/ r r: otherelems r __le__z
Set.__le__ sa %%% "! ! t99s5zz ! !5 D5 uu !tr c t |t st S t | t | k o| | S r r r r/ r r r: r s r __lt__z
Set.__lt__' B %%% "! !4yy3u::%<$++e*<*<.L s' "M"MUu}}5}}}}"M"Mr r r r/ r r s ` r __and__z Set.__and__I sD %** "! !"""M"M"M"Me"M"M"MMMMr c |D ] }|| v r dS
dS )z1Return True if two sets have a null intersection.FTr )r: r rT s r
isdisjointzSet.isdisjointP s+ E}} uu tr c t |t st S d | |fD }| | S )Nc 3 $ K | ] }|D ]}|V d S r r )r ses r r z Set.__or__..Z s/ 55q155a5555555r r )r: r chains r __or__z
Set.__or__W sE %** "! !55T5M555""5)))r c t t s1t t st S | | fd| D S )Nc 3 $ K | ]
}|v|V d S r r )r rT r s r r z Set.__sub__..d s9 #: #:U&+5&8&8 $)&8&8&8&8#: #:r r r r r/ r r s `r __sub__z Set.__sub___ s} %%% / eX..
&%%''..E"" #: #: #: #:d #: #: #: : : :r c t |t s1t |t st S | } fd|D S )Nc 3 $ K | ]
}|v|V d S r r r s r r z Set.__rsub__..l s9 #9 #9U&+4&7&7 $)&7&7&7&7#9 #9r r r s ` r __rsub__z Set.__rsub__g s} %%% / eX..
&%%''..E"" #9 #9 #9 #9e #9 #9 #9 9 9 9r c t |t s1t |t st S | | }| |z
|| z
z S r r r s r __xor__z Set.__xor__o sR %%% / 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 }||k 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._hashx s k3w{ II !a% T AaB
"b/H,; ;A
IAA a2g!r'
""
I ! T s77
MA 77Ar N)rB rC rD r rE r r r r r rF r r __rand__r r __ror__r r r __rxor__r r r r r r s I = = =
= = =
> > >
[N N N
H * * * G: : :9 9 9/ / / H r r c l e Zd ZdZdZed Zed Zd Zd Z d Z
d Z d Z d
Z
d Zd 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.
r c t )zAdd an element.NotImplementedErrorrS s r addzMutableSet.add
"!r c t )z8Remove an element. Do not raise an exception if absent.r rS s r discardzMutableSet.discard r r c V || vrt | | | dS )z5Remove an element. If not a member, raise a KeyError.N)KeyErrorr rS s r removezMutableSet.remove s1 5// ! Ur c t | } t | }n# t $ r t dw xY w| | |S )z2Return the popped value. Raise KeyError if empty.N)iternextrR r! r r: r rT s r popzMutableSet.pop sY
$ZZ %HHEE % % % $ % U s ! 4c R | # t $ r Y dS w xY w)z6This is slow (creates N new iterators!) but effective.TN)r' r! r9 s r clearzMutableSet.clear s@
DD
&&c : |D ]}| | | S r )r r& s r __ior__zMutableSet.__ior__ s' E HHUOOOO r c @ | |z
D ]}| | | S r )r r& s r __iand__zMutableSet.__iand__ s/ Ri E LL r c || u r| n^t |t s| | }|D ]1}|| v r| | | | 2| S r )r) r r r r r r& s r __ixor__zMutableSet.__ixor__ s
:: JJLLLL b#&&
-((,,
$
$D==LL''''HHUOOOO r c l || u r| n|D ]}| | | S r )r) r r& s r __isub__zMutableSet.__isub__ sC
:: JJLLLL
$
$ U#### r N)rB rC rD r rE r r r r" r' r) r, r. r0 r2 r r r r r s I" " ^" " " ^"
r r c Z e Zd ZdZdZdZed Zd dZd Z d Z
d Z d
Z d Z
dZdS )
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 8 | | S # t $ r |cY S w xY w)z D[k] if k in D, else d. d defaults to None.r6 r: r8 defaults r getz Mapping.get s5 9 NNN s
c : | | dS # t $ r Y dS w xY wNTFr6 r7 s r r zMapping.__contains__
s; II 4 55 s
c t | S )z:D.keys() -> a set-like object providing a view on D's keys)r r9 s r keysz Mapping.keys s ~~ r c t | S )z a set-like object providing a view on D's items)r r9 s r itemsz
Mapping.items s r c t | S )z6D.values() -> an object providing a view on D's values)r r9 s r valueszMapping.values s $ r c t |t st S t | t | k S r )r r r/ dictrC r s r r zMapping.__eq__ sE %)) "! !DJJLL!!T%++--%8%888r r )rB rC rD r rE __abc_tpflags__r r r= r rA rC rE r r r r r r r s I O ^ 9 9 9
LLLr r c : e Zd ZdZd Zd Zd Z ee Z dS )r _mappingc || _ d S r rJ )r: mappings r __init__zMappingView.__init__, s
r c * t | j S r )r rK r9 s r r zMappingView.__len__/ s 4=!!!r c , d | S )Nz&{0.__class__.__name__}({0._mapping!r}))formatr9 s r r zMappingView.__repr__2 s 7>>tDDDr N)
rB rC rD rE rN r r rF rM rN r r r r r ( sW I " " "E E E $ L11r r c 4 e Zd ZdZed Zd Zd ZdS )r r c t | S r setr s r r zKeysView._from_iterable<
2wwr c || j v S r rJ r7 s r r zKeysView.__contains__@ s dm##r c # $ K | j E d {V d S r rJ r9 s r r zKeysView.__iter__C s& = r NrB rC rD rE rF r r r r r r r r 8 sP I [$ $ $! ! ! ! !r r c 4 e Zd ZdZed Zd Zd ZdS )r r c t | S r rT r s r r zItemsView._from_iterableN rV r c ^ |\ }} | j | }||u p||k S # t $ r Y dS w xY wr )rK r! )r: r r8 rT vs r r zItemsView.__contains__R sU
U ,
c"A :+e + 55 s
,,c # @ K | j D ]}|| j | fV d S r rJ r7 s r r zItemsView.__iter__[ s< = , ,C
c*+ + + + + , ,r NrY r r r r r J sP I [, , ,, , , , ,r r c e Zd ZdZd Zd ZdS )r r c N | j D ] }| j | }||u s||k r dS dS r? rJ )r: rT r8 r] s r r zValuesView.__contains__g sA = C
c"AEzzQ%ZZtt (ur c # < K | j D ]}| j | V d S r rJ r7 s r r zValuesView.__iter__n s7 = % %C-$ $ $ $ $ % %r N)rB rC rD rE r r r r r r r c s7 I % % % % %r r c | e Zd ZdZdZed Zed Z e Z e fdZ
d Z d Z d dZ
d d
Zd S )
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 r6 r: r8 rT s r __setitem__zMutableMapping.__setitem__ r9 r c t r r6 r7 s r __delitem__zMutableMapping.__delitem__ r9 r c V | | }| |= |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: r8 r< rT s r r' zMutableMapping.pop sT IE S L
$-''NNN s ((c t t | }n# t $ r t dw xY w| | }| |= ||fS )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$ rR r! rd s r popitemzMutableMapping.popitem sY %tDzz""CC % % % $ %S IEzs 2c R | # t $ r Y dS w xY w)z,D.clear() -> None. Remove all items from D.TN)rk r! r9 s r r) zMutableMapping.clear s@
DD r* c t |t r|D ]
}|| | |< n@t |d r#| D ]
}|| | |< n
|D ]
\ }}|| |< | D ]
\ }}|| |< dS )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
rA N)r r hasattrrA rC )r: r r r8 rT s r updatezMutableMapping.update s eW % % "
'
' !#JS
'
UF
#
# " zz||
'
' !#JS
' $
"
"
U !S **,, JC DII r Nc B | | S # t $ r || |< Y nw xY w|S )z@D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in Dr6 r; s r
setdefaultzMutableMapping.setdefault s> 9 DIII s
)r r )rB rC rD r rE r re rg objectri r' rk r) ro rq r r r r r v s I ^ ^ vxxH '
$ r r c P e Zd ZdZdZdZed Zd Zd Z d Z
d d
Z d Z d S )
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 # T K d} | | }|V |dz
}# t $ r Y d S w xY w)Nr Tr$ rv )r: ir] s r r zSequence.__iter__ sY
GQ
FF s
''c * | D ]}||u s||k r dS dS r? r )r: rT r] s r r zSequence.__contains__ s3 AEzzQ%ZZtt (ur c # v K t t t | D ] }| | V
d S r )reversedranger )r: r| s r r zSequence.__reversed__ sD %D **++ Aq'MMMM r r Nc |&|dk r t t | |z d }||dk r|t | z
}|}|||k r3 | | }n# t $ r Y n w xY w||u s||k r|S |dz
}|-||k 3t )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.
Nr r$ )maxr rw
ValueError)r: rT startstopr| r] s r ry zSequence.index s D E)1--E q CII D la$hh
G
EzzQ%ZZ
FA la$hh s A
A$#A$c : t fd| D S )zBS.count(value) -> integer -- return number of occurrences of valuec 3 0 K | ]}|u s|k d V dS )r$ Nr )r r] rT s r r z!Sequence.count..
s/ ??a5jjAJJ1JJJJ??r )sumrS s `r countzSequence.count s& ????d??????r )r N)
rB rC rD r rE rH r r r r r ry r r r r r! r! s I O ^ .@ @ @ @ @r r! c e Zd ZdZdZdS )r# zMThis unifies bytes and bytearray.
XXX Should add all their methods.
r N)rB rC rD r rE r r r r# r# s
IIIr r# c e Zd ZdZdZed Zed Zed Zd Z d Z
d Z d Z dd Z
d Zd
ZdS )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 rv r: ry rT s r re zMutableSequence.__setitem__' rz r c t r rv rx s r rg zMutableSequence.__delitem__+ rz r c t )z3S.insert(index, value) -- insert value before indexrv r s r insertzMutableSequence.insert/ s
r c L | t | | dS )z:S.append(value) -- append value to the end of the sequenceN)r r rS s r appendzMutableSequence.append4 s" CIIu%%%%%r c R | # t $ r Y dS w xY w)z,S.clear() -> None -- remove all items from STN)r' rw r9 s r r) zMutableSequence.clear8 s@
DD r* c t | }t |dz D ]%}| ||z
dz
| | c| |< | ||z
dz
< &dS )z!S.reverse() -- reverse *IN PLACE*r r$ N)r r )r: r r| s r reversezMutableSequence.reverse@ s^ IIq!t 8 8A#'!A;Q DGT!A#a%[[ 8 8r c ` || u rt | }|D ]}| | dS )zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)r r )r: rE r] s r extendzMutableSequence.extendF s@ T>>&\\F A KKNNNN r 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: ry r] s r r' zMutableSequence.popM s
K Kr c 2 | | | = dS )zvS.remove(value) -- remove first occurrence of value.
Raise ValueError if the value is not present.
N)ry rS s r r" zMutableSequence.removeU s
E"" # # #r c 0 | | | S r )r )r: rE s r __iadd__zMutableSequence.__iadd__[ s F r N)r )rB rC rD r rE r re rg r r r) r r r' r" r r r r r" r" s I ^ ^ ^& & & 8 8 8 $ $ $ r r" )Sr abcr r r r r intrM EllipsisTyper
r __all__rB r$ bytes_iterator bytearraybytearray_iteratorrA dict_keyiteratorrE dict_valueiteratorrC dict_itemiterator
list_iteratorr list_reverseiteratorr range_iteratorlongrange_iteratorrU set_iterator str_iteratortuple_iteratorzip zip_iterator dict_keys dict_values
dict_itemsr. mappingproxy generatorr) coroutinere r+ async_generatorr5 r r r registerr
r r r r r r r r r r r r r r frozensetr r r r r r r rG r! r str
memoryviewr# bytesr" r r r r s%
( ' ' ' ' ' ' '
tDI tCyy tBxx
dd3ii T$$yy{{++,, 4RWWYY(( T$$ryy{{++,, Dbhhjj))** TT"XX
tDD" . .// dd5588nn%%T$$uuQ$Y / /0011 tDDKK tDDHH~~ dd2hh tDDKK DOO d299;;
T"((**
tDM"" D///$$ % %
DKK
cee$s))
2 2 2 2 2' 2 2 2 2"& & & & & & & & R
9 2 2 2 2 2g 2 2 2 2" M &- - - - - ] - - - ` ( ( (2 2 2 2 2 2 2 2 2$ x & . ! ! ! $ % % % " # # # $ % % % # $ $ $ - & ' ' ' . ! ! ! $ % % % , , . ! ! ! ,
- - - - - - - - `
9 g 2 2 2 2 2' 2 2 2 2" ) ;@ ;@ ;@ ;@ ;@L ;@ ;@ ;@z
V
V
V &; ; ; ; ; ; ; ; ;(G G G G G* G G GT Y M M M M M M M M` C
1 1 1 1 1j 1 1 1f
2
2
2
2
2%
2
2
2 ! ! ! ! !{C ! ! ! ) , , , , , S , , ,,
:
%
%
%
%
%j
%
%
% K O O O O OW O O Od
=@ =@ =@ =@ =@z: =@ =@ =@~ % # % * E
I ? ? ? ? ?h ? ? ?D # # # # #r