/opt/imh/python3.13/lib/python3.13/__pycache__
Edit: /opt/imh/python3.13/lib/python3.13/__pycache__/_collections_abc.cpython-313.pyc (46708B)
e~ \
S r SSKJrJr SSKr\" \\ 5 r\" S5 r S r
\" \
5 r C
/ SQr Sr
\" \" S5 5 r\" \" \" 5 5 5 r\" \" 0 R% 5 5 5 r\" \" 0 R) 5 5 5 r\" \" 0 R- 5 5 5 r\" \" / 5 5 r\" \" \" / 5 5 5 r\" \" \" S5 5 5 r \" \" \" S S
- 5 5 5 r \" \" \ " 5 5 5 r \" \" S 5 5 r \" \" S 5 5 r!\" \" \"" 5 5 5 r#\" 0 R% 5 5 r$\" 0 R) 5 5 r%\" 0 R- 5 5 r&\" \RN 5 r(S
r)\)" 5 r*C)\" S " 5 5 r+S r,\," 5 r,\" \,5 r-\,R] 5 C,S r/\/" 5 r/\" \/5 r0C/S r1 " S S\S9r2 " S S\S9r3 " S S\35 r4\4Rk \-5 " S S\S9r6 " S S \65 r7 " S S \75 r8\8Rk \05 " S S \S9r9 " S! S"\95 r:\:Rk \5 \:Rk \5 \:Rk \5 \:Rk \5 \:Rk \5 \:Rk \5 \:Rk \5 \:Rk \ 5 \:Rk \ 5 \:Rk \ 5 \:Rk \ 5 \:Rk \!5 \:Rk \#5 " S# S$\95 r; " S% S&\:5 r<\
5 r? " S- S.\S9r@ " S/ S0\5 rAS1 rBS2 rC " S3 S4\S9rD " S5 S6\?5 rE\ERk \F5 " S7 S8\E5 rG\GRk \ 5 " S9 S:\?5 rH\HRk \(5 \HRk \*5 " S; S<\=5 rI " S= S>\I\E5 rJ\JRk \$5 " S? S@\I\E5 rK\KRk \&5 " SA SB\I\?5 rL\LRk \%5 " SC SD\H5 rM\MRk \N5 " SE SF\;\?5 rO\ORk \P5 \ORk \Q5 \ORk \5 \ORk \R5 " SG SH\5 rS " SI SJ\O\SS9rT\TRk \U5 \TRk \5 " SK SL\O5 rV\VRk \5 \VRk \5 g)MzjAbstract Base Classes (ABCs) for collections, according to PEP 3119.
Unit tests are in test_collections.
)ABCMetaabstractmethodN.c g N r 6/opt/imh/python3.13/lib/python3.13/_collections_abc.py_fr
( s $r ) Awaitable Coroutine
AsyncIterable
AsyncIteratorAsyncGeneratorHashableIterableIterator Generator
ReversibleSized ContainerCallable
CollectionSet
MutableSetMappingMutableMapping MappingViewKeysView ItemsView
ValuesViewSequenceMutableSequence
ByteStringBufferzcollections.abcr i r c R [ [ R " 5 R 5 $ r )typesys _getframef_localsr r r _get_framelocalsproxyr, X s
(( ))r c # # S v $ r r r r r r. \ s 5r c # g 7fr r r r r _coror0 ^ s 4 c # S 7v g 7fr r r r r _agr3 d s c U R nU H> nU H/ nX4R ; d M UR U c
[ s s $ M6 [ s $ g)NT)__mro____dict__NotImplemented)CmethodsmromethodBs r _check_methodsr> l sN
))CA#::f%-)) " ! r c 8 \ rS rSrSr\S 5 r\S 5 rSr g)r x r c gNr r selfs r __hash__Hashable.__hash__| r c 8 U [ L a [ US5 $ [ $ )NrE )r r> r8 clsr9 s r __subclasshook__Hashable.__subclasshook__ (?!!Z0 0 r N)
__name__
__module__ __qualname____firstlineno__ __slots__r rE classmethodrK __static_attributes__r r r r r x - I r r ) metaclassc H \ rS rSrSr\S 5 r\S 5 r\" \ 5 r
Sr g)r r c # # S v g 7fr r rC s r __await__Awaitable.__await__ s
s c 8 U [ L a [ US5 $ [ $ )NrZ )r r> r8 rI s r rK Awaitable.__subclasshook__ s ) !![1 1 r N) rN rO rP rQ rR r rZ rS rK GenericAlias__class_getitem__rT r r r r r s: I
$L1r r c R \ rS rSrSr\S 5 r\SS j5 rS r\ S 5 r
Sr g) r r c [ e)zSSend a value into the coroutine.
Return next yielded value or raise StopIteration.
StopIterationrD values r sendCoroutine.send
r Nc L Uc Uc UeU" 5 nUb UR U5 nUe)zWRaise an exception in the coroutine.
Return next yielded value or raise StopIteration.
with_tracebackrD typvaltbs r throwCoroutine.throw 4
;z %C
>$$R(C r c p U R [ 5 [ S5 e! [ [ 4 a gf = f).Raise GeneratorExit inside coroutine.
z coroutine ignored GeneratorExitNrq
GeneratorExit RuntimeErrorrd rC s r closeCoroutine.close ; B JJ} % @A A }- " 55c > U [ L a [ USSSS5 $ [ $ )NrZ rg rq ry )r r> r8 rI s r rK Coroutine.__subclasshook__ s# ) !![&'7K K r NN) rN rO rP rQ rR r rg rq ry rS rK rT r r r r r sG I
B r r c H \ rS rSrSr\S 5 r\S 5 r\" \ 5 r
Sr g)r
r c [ 5 $ r )r rC s r __aiter__AsyncIterable.__aiter__ s
r c 8 U [ L a [ US5 $ [ $ )Nr )r
r> r8 rI s r rK AsyncIterable.__subclasshook__ s - !![1 1 r N) rN rO rP rQ rR r r rS rK r^ r_ rT r r r r
r
s: I
$L1r r
c > \ rS rSrSr\S 5 rS r\S 5 r Sr
g)r r c # [ e7f)z@Return the next item or raise StopAsyncIteration when exhausted.StopAsyncIterationrC s r __anext__AsyncIterator.__anext__ s
! r4 c U $ r r rC s r r AsyncIterator.__aiter__ r c : U [ L a
[ USS5 $ [ $ )Nr r )r r> r8 rI s r rK AsyncIterator.__subclasshook__ s - !![+> > r N) rN rO rP rQ rR r r r rS rK rT r r r r r s2 I! ! r r c X \ rS rSrSrS r\S 5 r\S S j5 rS r \
S 5 r Sr g)
r r c @ # U R S5 I Sh vN $ N7f)z`Return the next item from the asynchronous generator.
When exhausted, raise StopAsyncIteration.
N)asendrC s r r AsyncGenerator.__anext__ s ZZ%%%%s c # [ e7f)zeSend a value into the asynchronous generator.
Return next yielded value or raise StopAsyncIteration.
r re s r r AsyncGenerator.asend s
! r4 Nc T # Uc Uc UeU" 5 nUb UR U5 nUe7f)ziRaise an exception in the asynchronous generator.
Return next yielded value or raise StopAsyncIteration.
rk rm s r athrowAsyncGenerator.athrow s7
;z %C
>$$R(C &(c # U R [ 5 I Sh vN [ S5 e N! [ [ 4 a gf = f7f)ru Nz,asynchronous generator ignored GeneratorExit)r rw rx r rC s r acloseAsyncGenerator.aclose sG O++m, , , MN N
- 12 s0 A. ,. A. AA AAc @ U [ L a [ USSSSS5 $ [ $ )Nr r r r r )r r> r8 rI s r rK AsyncGenerator.__subclasshook__ s* . !![+")8X?
? r r )
rN rO rP rQ rR r r r r r rS rK rT r r r r r sN I& ! !
O r r c H \ rS rSrSr\S 5 r\S 5 r\" \ 5 r
Sr g)r i r c # # g 7fr r rC s r __iter__Iterable.__iter__ r1 c 8 U [ L a [ US5 $ [ $ )Nr )r r> r8 rI s r rK Iterable.__subclasshook__$ rM r N) rN rO rP rQ rR r r rS rK r^ r_ rT r r r r r s: I
$L1r r c > \ rS rSrSr\S 5 rS r\S 5 r Sr
g)r i- r c [ e)zKReturn the next item from the iterator. When exhausted, raise StopIterationrc rC s r __next__Iterator.__next__1 s
r c U $ r r rC s r r Iterator.__iter__6 r r c : U [ L a
[ USS5 $ [ $ )Nr r )r r> r8 rI s r rK Iterator.__subclasshook__9 s (?!!Z< < r N) rN rO rP rQ rR r r r rS rK rT r r r r r - s2 I r r c 8 \ rS rSrSr\S 5 r\S 5 rSr g)r iP r c # # g 7fr r rC s r __reversed__Reversible.__reversed__T r r1 c : U [ L a
[ USS5 $ [ $ )Nr r )r r> r8 rI s r rK Reversible.__subclasshook__Y s * !!^Z@ @ r N)
rN rO rP rQ rR r r rS rK rT r r r r r P s- I r r c X \ rS rSrSrS r\S 5 r\S S j5 rS r \
S 5 r Sr g)
r i` r c $ U R S5 $ )zNReturn the next item from the generator.
When exhausted, raise StopIteration.
N)rg rC s r r Generator.__next__d s yy r c [ e)zSSend a value into the generator.
Return next yielded value or raise StopIteration.
rc re s r rg Generator.sendj ri r Nc L Uc Uc UeU" 5 nUb UR U5 nUe)zWRaise an exception in the generator.
Return next yielded value or raise StopIteration.
rk rm s r rq Generator.throwq rs r c p U R [ 5 [ S5 e! [ [ 4 a gf = f)z.Raise GeneratorExit inside generator.
z generator ignored GeneratorExitNrv rC s r ry Generator.close~ r{ r| c @ U [ L a [ USSSSS5 $ [ $ )Nr r rg rq ry )r r> r8 rI s r rK Generator.__subclasshook__ s* ) !!Z"('7<
< r r )
rN rO rP rQ rR r r rg rq ry rS rK rT r r r r r ` sN I
B r r c 8 \ rS rSrSr\S 5 r\S 5 rSr g)r i r c grB r rC s r __len__
Sized.__len__ rG r c 8 U [ L a [ US5 $ [ $ )Nr )r r> r8 rI s r rK Sized.__subclasshook__ s %<!!Y/ / r N)
rN rO rP rQ rR r r rS rK rT r r r r r rU r r c H \ rS rSrSr\S 5 r\S 5 r\" \ 5 r
Sr g)r i r c gNFr )rD xs r __contains__Container.__contains__ r c 8 U [ L a [ US5 $ [ $ )Nr )r r> r8 rI s r rK Container.__subclasshook__ s ) !!^4 4 r N) rN rO rP rQ rR r r rS rK r^ r_ rT r r r r r s: I
$L1r r c ( \ rS rSrSr\S 5 rSrg)r i r c < U [ L a [ USSS5 $ [ $ )Nr r r )r r> r8 rI s r rK Collection.__subclasshook__ s! * !!i^L L r N)rN rO rP rQ rR rS rK rT r r r r r s I r r c D \ rS rSrSr\S\S\4S j5 r\ S 5 r
Sr g)r$ i r flagsreturnc [ er NotImplementedError)rD r s r
__buffer__Buffer.__buffer__ s !!r c 8 U [ L a [ US5 $ [ $ )Nr )r$ r> r8 rI s r rK Buffer.__subclasshook__ s &=!!\2 2 r N) rN rO rP rQ rR r int
memoryviewr rS rK rT r r r r$ r$ s; I" ": " " r r$ c N ^ \ rS rSrSrSrU 4S jrU 4S jrS rU 4S jr Sr
U =r $ )_CallableGenericAliasi zRepresent `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 > [ U[ 5 ( a [ U5 S:X d [ S5 eUu p4[ U[ [ 45 ( a / UQUP7nO [ U5 ( d [ SU 35 e[ TU ] XU5 $ )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__)rJ originargst_argst_result __class__s r r _CallableGenericAlias.__new__ s 4''CINHJ
J fudm , ,&V&X&D '' >>DX G H
HwsD11r c @ > [ U R 5 S:X a+ [ U R S 5 ( a [ TU ] 5 $ SSR U R S S Vs/ s H n[
U5 PM sn5 S[
U R S 5 S3$ s snf )Nr r zcollections.abc.Callable[[z, z], ])r __args__r r __repr__join
_type_repr)rD ar s r r _CallableGenericAlias.__repr__ s t}} "~dmmA6F'G'G7#% %YYt}}Sb7I J7I!
1
7I JKLC dmmB /014 5 Js #B
c U R n[ U5 S:X a [ US 5 ( d [ US S 5 US 4n[ [
U44$ )Nr r r )r r r r r r )rD r s r
__reduce__ _CallableGenericAlias.__reduce__ sL }}D Q>$q'#:#:Sb ?DH,D$x&666r c > [ U[ 5 ( d U4n[ TU ]
U5 R n[ US [ [
45 ( d
US nUS S nXC4n[
[ [ U5 5 $ )Nr r )r r r __getitem__r r r r )rD itemnew_argsr r r s r r !_CallableGenericAlias.__getitem__ sr
$&&7D7&t,55 (1+t}55 |H cr]F )H$XuX??r ) rN rO rP rQ __doc__rR r r r r rT
__classcell__r s @r r r s* I
257 @ @r r c ^ T [ L a g[ T [ 5 ( a g[ T 5 m SnT R S:H =( a [ U 4S jU 5 5 $ )ztChecks if obj matches either a list of types, ``...``, ``ParamSpec`` or
``_ConcatenateGenericAlias`` from typing.py
T) ParamSpec_ConcatenateGenericAliastypingc 3 B ># U H nTR U:H v M g 7fr )rN ).0nameobjs r !_is_param_expr..
s -Uutclld.Bus )Ellipsisr r r( rO any)r namess ` r r r sL h#t
s)C 5E >>X % U#-Uu-U*UUr c [ U [ 5 ( a7 U R S:X a U R $ U R SU R 3$ U [ L a g[ U [
5 ( a U R $ [ U 5 $ )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( rO rP r FunctionTyperN repr)r s r r r sq #t >>Z '## #..!3#3#3"455
h#|$$|| 9r c H \ rS rSrSr\S 5 r\S 5 r\" \ 5 r
Sr g)r i! r c gr r )rD r kwdss r __call__Callable.__call__% r r c 8 U [ L a [ US5 $ [ $ )Nr )r r> r8 rI s r rK Callable.__subclasshook__) rM r N) rN rO rP rQ rR r r rS rK r r_ rT r r r r r ! s; I
$$9:r r c \ rS rSrSrSrS rS rS rS r S r
\ S 5 r S
r
\
rS rS r\rS
rS rS r\rS rSrg)r i5 aB 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 [ U[ 5 ( d [ $ [ U 5 [ U5 : a gU H
nX!; d M
g gNFTr r r8 r rD otherelems r __le__
Set.__le__B s@ %%%! ! t9s5z !D r c [ U[ 5 ( d [ $ [ U 5 [ U5 : =( a U R U5 $ r r r r8 r r' rD r% s r __lt__
Set.__lt__L 6 %%%! !4y3u:%<$++e*<# U H oT; d M
Uv M g 7fr r r rf rD s r r Set.__and__..q s "MeU}55es r r r8 r; r+ s ` r __and__ Set.__and__n s- %**! !"""Me"MMMr c $ U H
nX ; d M
g g)z1Return True if two sets have a null intersection.FTr )rD r% rf s r
isdisjointSet.isdisjointu s E} r c n [ U[ 5 ( d [ $ S X4 5 nU R U5 $ )Nc 3 6 # U H o H o"v M M g 7fr r )r ses r r Set.__or__.. s 5Mq1a1Ms rA )rD r% chains r __or__
Set.__or__| s2 %**! !5TM5""5))r c ^ [ T[ 5 ( d, [ T[ 5 ( d [ $ U R T5 mU R U4S jU 5 5 $ )Nc 3 8 ># U H nUT; d M Uv M g 7fr r )r rf r% s r r Set.__sub__.. s #:dU&+5&8 $)5d
r r r r8 r; r+ s `r __sub__ Set.__sub__ sR %%% eX..%%''.E"" #:d #: : :r c ^ [ U[ 5 ( d, [ U[ 5 ( d [ $ T R U5 nT R U 4S jU 5 5 $ )Nc 3 8 ># U H nUT; d M Uv M g 7fr r r? s r r Set.__rsub__.. s #9eU&+4&7 $)5erR rS r+ s ` r __rsub__ Set.__rsub__ sR %%% eX..%%''.E"" #9e #9 9 9r c [ U[ 5 ( d, [ U[ 5 ( d [ $ U R U5 nX-
X-
- $ r rS r+ s r __xor__ Set.__xor__ sA %%% eX..%%''.E ..r c [ R nSU- S- n[ U 5 nSUS- - nXB- nU H" n[ U5 nXFUS- - S- S- - nXB- nM$ XDS- US- - - nUS - S
- nXB- nXA: a XBS- - nUS :X a S nU$ )
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#)r) maxsizer hash)rD MAXMASKnhr hxs r _hash Set._hash s kk3w{ I !a% AaB
b/H,; ;A
IA
2g!r'
""
I ! 7
MA 7Ar N)rN rO rP rQ r rR r' r, r1 r0 r6 rS r; rB __rand__rE rM __ror__rT rY r\ __rxor__ri rT r r r r r 5 st I=
=
>
N
H* G:9/ H r r c f \ rS rSrSrSr\S 5 r\S 5 rS r S r
S r S r S
r
S rS rSrg
)r i ak 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 [ e)zAdd an element.r re s r addMutableSet.add
"!r c [ e)z8Remove an element. Do not raise an exception if absent.r re s r discardMutableSet.discard rr r c F X; a [ U5 eU R U5 g)z5Remove an element. If not a member, raise a KeyError.N)KeyErrorrt re s r removeMutableSet.remove s 5/ ! Ur c [ U 5 n [ U5 nU R U5 U$ ! [ a [ Sef = f)z2Return the popped value. Raise KeyError if empty.N)iternextrd rw rt rD r: rf s r popMutableSet.pop sE
$Z %HE
U % $ %s + =c J U R 5 M ! [ a gf = f)z6This is slow (creates N new iterators!) but effective.N)r~ rw rC s r clearMutableSet.clear s*
""c : U H nU R U5 M U $ r )rp r} s r __ior__MutableSet.__ior__ s E HHUO r c > X-
H nU R U5 M U $ r )rt r} s r __iand__MutableSet.__iand__ s iE LL r c XL a U R 5 U $ [ U[ 5 ( d U R U5 nU H, nX ; a U R U5 M U R U5 M. U $ r )r r r r; rt rp r} s r __ixor__MutableSet.__ixor__ sc
: JJL b#&&((,=LL'HHUO
r c f XL a U R 5 U $ U H nU R U5 M U $ r )r rt r} s r __isub__MutableSet.__isub__ s4
: JJL U# r N)rN rO rP rQ r rR r rp rt rx r~ r r r r r rT r r r r r sW I" " " "
r r c \ \ rS rSrSrSrSr\S 5 rS
S jr S r
S r S
r S r
S rSrSrg)r i 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 [ er rw rD keys r r Mapping.__getitem__$ r Nc 0 X $ ! [ a Us $ f = f)z D[k] if k in D, else d. d defaults to None.r rD r defaults r get Mapping.get( s# 9 N s c . X g! [ a gf = fNTFr r s r r Mapping.__contains__/ s% I s
c [ U 5 $ )z:D.keys() -> a set-like object providing a view on D's keys)r rC s r keys Mapping.keys7 s ~ r c [ U 5 $ )z a set-like object providing a view on D's items)r rC s r items
Mapping.items; s r c [ U 5 $ )z6D.values() -> an object providing a view on D's values)r rC s r valuesMapping.values? s
$ r c [ U[ 5 ( d [ $ [ U R 5 5 [ UR 5 5 :H $ r )r r r8 dictr r+ s r r6 Mapping.__eq__C s6 %))! !DJJL!T%++-%888r r )rN rO rP rQ r rR __abc_tpflags__r r r r r r r r6 r rT r r r r r sL I O 9
Lr r c : \ rS rSrSrS rS rS r\" \ 5 r
Sr g)r iN _mappingc Xl g r r )rD mappings r __init__MappingView.__init__R s
r c , [ U R 5 $ r )r r rC s r r MappingView.__len__U s 4==!!r c $ SR U 5 $ )Nz&{0.__class__.__name__}({0._mapping!r}))formatrC s r r MappingView.__repr__X s 7>>tDDr N) rN rO rP rQ rR r r r rS r^ r_ rT r r r r r N s$ I "E $L1r r c 4 \ rS rSrSr\S 5 rS rS rSr g)r i^ r c [ U5 $ r setr9 s r r; KeysView._from_iterableb 2wr c XR ; $ r r r s r r KeysView.__contains__f s mm##r c # 8 # U R S h vN g N7fr r rC s r r KeysView.__iter__i s == s N
rN rO rP rQ rR rS r; r r rT r r r r r ^ s# I $!r r c 4 \ rS rSrSr\S 5 rS rS rSr g)r ip r c [ U5 $ r r r9 s r r; ItemsView._from_iterablet r r c f Uu p# U R U nXCL =( d XC:H $ ! [ a gf = fr )r rw )rD r r rf vs r r ItemsView.__contains__x sA
,
c"A :+ + s #
00c # V # U R H nXR U 4v M g 7fr r r s r r ItemsView.__iter__ s% ==C
c*+ + !s ')Nr r r r r r p s# I ,,r r c $ \ rS rSrSrS rS rSrg)r i r c ^ U R H nU R U nX1L d X1:X d M g gr r )rD rf r r s r r ValuesView.__contains__ s/ ==C
c"AzQZ ! r c # T # U R H nU R U v M g 7fr r r s r r ValuesView.__iter__ s" ==C--$ $ !r N)rN rO rP rQ rR r r rT r r r r r s I%r r c v \ rS rSrSrSr\S 5 r\S 5 r\ " 5 r
\
4S jr S r S r
S S jrS
S jrSrg
)r i 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 [ er r rD r rf s r __setitem__MutableMapping.__setitem__ r r c [ er r r s r __delitem__MutableMapping.__delitem__ r r c V X nX U$ ! [ a X R L a e Us $ f = f)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.
)rw _MutableMapping__marker)rD r r rf s r r~ MutableMapping.pop s= IE L
--'N s
((c h [ [ U 5 5 nX nX X4$ ! [ a [ Sef = f)zpD.popitem() -> (k, v), remove and return some (key, value) pair
as a 2-tuple; but raise KeyError if D is empty.
N)r| r{ rd rw r s r popitemMutableMapping.popitem sD %tDz"C Iz % $ %s 1c J U R 5 M ! [ a gf = f)z,D.clear() -> None. Remove all items from D.N)r rw rC s r r MutableMapping.clear s* r c [ U[ 5 ( a U H nX X' M O>[ US5 ( a UR 5 H nX X' M OU H u p4X@U' M UR 5 H u p4X@U' M g)a% 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
r N)r r hasattrr r )rD r% r r rf s r updateMutableMapping.update sx eW % % !J
UF
#
# zz| !J $ $
!S $ **,JC I 'r Nc 6 X $ ! [ a X U' U$ f = f)z@D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in Dr r s r
setdefaultMutableMapping.setdefault s* 9 I s )r r )rN rO rP rQ r rR r r r objectr r~ r r r r rT r r r r r sY I xH '
$r r c R \ rS rSrSrSrSr\S 5 rS r S r
S r S S
jr S r
Srg )
r! i z~All the operations on a read-only sequence.
Concrete subclasses must override __new__ or __init__,
__getitem__, and __len__.
r c [ er
IndexErrorrD indexs r r Sequence.__getitem__ r c # P # Sn X nUv US-
nM ! [ a g f = f7f)Nr r% r )rD ir s r r Sequence.__iter__ s?
GQ s &
#&#&c , U H nX!L d X!:X d M g gr r )rD rf r s r r Sequence.__contains__
s AzQZ r c # ` # [ [ [ U 5 5 5 H nX v M g 7fr )reversedranger )rD r s r r Sequence.__reversed__ s$ %D *+A'M ,s ,.Nc Ub US: a [ [ U 5 U- S5 nUb US: a U[ U 5 -
nUnUb XC: a! X nXQL d XQ:X a U$ US-
nUc M XC: a M! [ e! [ a [ ef = f)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)rD rf startstopr r s r r Sequence.index s D E)1-E q CI D lah
G zQZ
FA lah
s A* *
A<;A<c . ^ [ U4S jU 5 5 $ )zBS.count(value) -> integer -- return number of occurrences of valuec 3 @ ># U H oTL d UT:X d M S v M g7f)r% Nr )r r rf s r r !Sequence.count..0 s ?d5jAJ11ds )sumre s `r countSequence.count. s ?d???r )r N)rN rO rP rQ r rR r r r r r r r r rT r r r r! r! sA I O .@r r! c 4 ^ \ rS rSrU 4S jrU 4S jrSrU =r$ )_DeprecateByteStringMetai7 c \ > US:w a SS K nUR SSS9 [ TU ] " XX#40 UD6$ )Nr# r collections.abc.ByteString rx )warnings _deprecatedr r )rJ r
bases namespacekwargsr r s r r _DeprecateByteStringMeta.__new__8 s? < ,
!
ws%EfEEr c J > SS K nUR SSS9 [ TU ]
U5 $ )Nr r
r r )r r r __instancecheck__)rJ instancer r s r r *_DeprecateByteStringMeta.__instancecheck__B s1 (
w(22r r )rN rO rP rQ r r rT r r s @r r r 7 s F3 3r r c \ rS rSrSrSrSrg)r# iK zEThis unifies bytes and bytearray.
XXX Should add all their methods.
r N)rN rO rP rQ r rR rT r r r r# r# K s
Ir r# c z \ rS rSrSrSr\S 5 r\S 5 r\S 5 r S r
S r S r S
r
SS jrS rS
rSrg)r" iW zAll the operations on a read-write sequence.
Concrete subclasses must provide __new__ or __init__,
__getitem__, __setitem__, __delitem__, __len__, and insert().
r c [ er r rD r rf s r r MutableSequence.__setitem__` r r c [ er r r s r r MutableSequence.__delitem__d r r c [ e)z3S.insert(index, value) -- insert value before indexr r s r insertMutableSequence.inserth s
r c : U R [ U 5 U5 g)z:S.append(value) -- append value to the end of the sequenceN)r! r re s r appendMutableSequence.appendm s CIu%r c J U R 5 M ! [ a gf = f)z,S.clear() -> None -- remove all items from SN)r~ r rC s r r MutableSequence.clearq s*
r c v [ U 5 n[ US- 5 H nXU-
S-
X sX' XU-
S-
' M g)z!S.reverse() -- reverse *IN PLACE*r r% N)r r )rD rf r s r reverseMutableSequence.reversey sA Iq!tA#'!A; DGTA#a%[ r c V XL a [ U5 nU H nU R U5 M g)zMS.extend(iterable) -- extend sequence by appending elements from the iterableN)r r$ )rD r r s r extendMutableSequence.extend s% >&\FA KKN r c X nX U$ )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 )rD r r s r r~ MutableSequence.pop s
K Kr c & X R U5 g)zcS.remove(value) -- remove first occurrence of value.
Raise ValueError if the value is not present.
N)r re s r rx MutableSequence.remove s
E" #r c ( U R U5 U $ r )r, )rD r s r __iadd__MutableSequence.__iadd__ s F r N)r )rN rO rP rQ r rR r r r r! r$ r r) r, r~ rx r3 rT r r r r" r" W sk I &8 $ r r" )Wr abcr r r) r( r r r^ EllipsisTyper
r __all__rN r{ bytes_iterator bytearraybytearray_iteratorr dict_keyiteratorr dict_valueiteratorr dict_itemiterator
list_iteratorr list_reverseiteratorr range_iteratorlongrange_iteratorr set_iterator str_iteratortuple_iteratorzip zip_iterator dict_keys dict_values
dict_itemsr7 mappingproxyr, framelocalsproxy generatorr0 coroutinery r3 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 strr r r# bytesr" r r r rS 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