*j B S r / SQrSSKrSSKr\\R
S' \rSSKJr SSKJ
r SSKJ r
SSKJr SS KJr SS
KJr SS KJr SS KJr SS
K J r \R< R? \ 5 SSK J!r! SSK J"r" " S S\RF 5 r$ " S S\RJ 5 r& " S S\RN 5 r( " S S\)5 r* " S S\+5 r, SSK J,r, SSK J-r- S SSS .S jr.S r/ SS!K J/r/ " S" S#\+5 r0 " S$ S%\Rb 5 r2 " S& S'\Rb 5 r3 " S( S)\R< 5 r4 " S* S+\Rj 5 r6g! \ a Nf = f! \ a Nf = f! \ a Nf = f! \ a Nf = f! \ a S r- Nf = f! \ a Nf = f),a? This module implements specialized container datatypes providing
alternatives to Python's general purpose built-in containers, dict,
list, set, and tuple.
* namedtuple factory function for creating tuple subclasses with named fields
* deque list-like container with fast appends and pops on either end
* ChainMap dict-like class for creating a single view of multiple mappings
* Counter dict subclass for counting hashable objects
* OrderedDict dict subclass that remembers the order entries were added
* defaultdict dict subclass that calls a factory function to supply missing values
* UserDict wrapper around dictionary objects for easier dict subclassing
* UserList wrapper around list objects for easier list subclassing
* UserString wrapper around string objects for easier string subclassing
) ChainMapCounter OrderedDictUserDictUserList
UserString defaultdictdeque
namedtuple Nzcollections.abc)chain)repeat)starmap) iskeyword)eq)
itemgetter)recursive_repr)proxy)r )_deque_iterator)r c \ rS rSrS rSrg)_OrderedDictKeysViewB c # J # [ U R 5 S h vN g N7fNreversed_mappingselfs ;/opt/alt/python313/lib64/python3.13/collections/__init__.py __reversed__!_OrderedDictKeysView.__reversed__D s DMM***s #!# N__name__
__module__ __qualname____firstlineno__r __static_attributes__r" r r r B s +r) r c \ rS rSrS rSrg)_OrderedDictItemsViewG c # h # [ U R 5 H nXR U 4v M g 7fr r r keys r r "_OrderedDictItemsView.__reversed__I s* DMM*C
c*+ + +s 02r" Nr# r" r) r r+ r+ G s ,r) r+ c \ rS rSrS rSrg)_OrderedDictValuesViewM c # f # [ U R 5 H nU R U v M g 7fr r r. s r r #_OrderedDictValuesView.__reversed__O s' DMM*C--$ $ +s /1r" Nr# r" r) r r2 r2 M s %r) r2 c \ rS rSrSrSrg)_LinkS )prevnextr/ __weakref__r" N)r$ r% r& r' __slots__r( r" r) r r7 r7 S s 4Ir) r7 c | \ rS rSrSrS rS S jr\R \ \
4S jr\R 4S jr S r S r
S rS S
jrS S jrS r\R& R( =rrS
rS rS r\R& R2 r\" 5 r\4S jr S S jr \ " 5 S 5 r S r S r!\"S S j5 r#S r$S r%S r&S r'Sr(g) r V z)Dictionary that remembers insertion orderc [ R U 5 n[ 5 Ul [ UR 5 =Ul nU=Ul Ul 0 Ul U$ )zDCreate the ordered dict object and set up the underlying structures.) dict__new__r7 _OrderedDict__hardroot_proxy_OrderedDict__rootr9 r: _OrderedDict__map)clsargskwdsr roots r rA OrderedDict.__new__e sH ||C ' #DOO 44 d $$ DI
r) c * U R " U40 UD6 g)z|Initialize an ordered dictionary. The signature is the same as
regular dictionaries. Keyword argument order is preserved.
N)_OrderedDict__update)r otherrH s r __init__OrderedDict.__init__n s
e$t$r) c X; aV U" 5 =U R U' nU R nUR nXUsUl Ul Ul Xhl U" U5 Ul U" XU5 g)z!od.__setitem__(i, y) <==> od[i]=yN)rE rD r9 r: r/ ) r r/ value dict_setitemr LinklinkrI lasts r __setitem__OrderedDict.__setitem__t s]
?%)V +DJJsOd;;D99D-1 *DIty$( I d DIT&r) c U" X5 U R R U5 nUR nUR nXTl XEl SUl SUl g)z od.__delitem__(y) <==> del od[y]N)rE popr9 r: )r r/ dict_delitemrT link_prev link_nexts r __delitem__OrderedDict.__delitem__ sH T zz~~c"II II "" r) c # # U R nUR nX!La! UR v UR nX!La M gg7f)zod.__iter__() <==> iter(od)N)rD r: r/ r rI currs r __iter__OrderedDict.__iter__ 9 {{yy ((N99D
;AAc # # U R nUR nX!La! UR v UR nX!La M gg7f)z#od.__reversed__() <==> reversed(od)N)rD r9 r/ r` s r r OrderedDict.__reversed__ rd re c U R nU=Ul Ul U R R 5 [
R U 5 g)z.od.clear() -> None. Remove all items from od.N)rD r9 r: rE clearr@ )r rI s r ri OrderedDict.clear s5 {{ $$ DI
4r) c @ U ( d [ S5 eU R nU( a% UR nUR nX$l XBl O$UR nUR nXRl X%l UR nU R
U [ R X5 nXg4$ )zRemove and return a (key, value) pair from the dictionary.
Pairs are returned in LIFO order if last is true or FIFO order if false.
zdictionary is empty)KeyErrorrD r9 r: r/ rE r@ rY )r rU rI rT r[ r\ r/ rQ s r popitemOrderedDict.popitem s
01 1{{ 99D I !N!I99D I!I !Nhh JJsO#zr) c : U R U nUR nUR nUR nXTl XEl U R nU( a% UR nX#l Xsl Xgl X2l gUR nXsl Xl Xhl X7l g)ztMove an existing element to the end (or beginning if last is false).
Raise KeyError if the element does not exist.
N)rE r9 r: rD ) r r/ rU rT r[ r\ soft_linkrI firsts r move_to_endOrderedDict.move_to_end s|
zz#II II NN ""{{ 99D I I!I IIIE I I"J Ir) c [ R n[ U 5 S- nU" U R 5 nX1" U R 5 S- -
nX1" U R
5 U- -
nX1" U R 5 U- -
nU$ )N )_sys getsizeoflen__dict__rE rB rD )r sizeofnsizes r
__sizeof__OrderedDict.__sizeof__ ss IMdmm$ tzz"Q&& t'!++ t{{#a'' r) c [ U 5 $ )z:D.keys() -> a set-like object providing a view on D's keys)r r s r keysOrderedDict.keys s
#D))r) c [ U 5 $ )z a set-like object providing a view on D's items)r+ r s r itemsOrderedDict.items s
$T**r) c [ U 5 $ )z6D.values() -> an object providing a view on D's values)r2 r s r valuesOrderedDict.values s
%d++r) c U R n[ R XU5 nXCLaO U R R U5 nUR nUR
nXvl Xgl SUl SUl U$ X#L a [
U5 eU$ )zod.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)_OrderedDict__markerr@ rY rE r9 r: rl )r r/ defaultmarkerresultrT r[ r\ s r rY OrderedDict.pop sy $V, ::>>#&D I I &N &N DI DIM 3- r) Nc X; a X $ X U' U$ )zInsert key with a value of default if key is not in the dictionary.
Return the value for key if key is in the dictionary, else default.
r" r r/ r s r
setdefaultOrderedDict.setdefault s
;9 S r) c U ( d U R R < S3$ U R R < S[ U R 5 5 < S3$ )zod.__repr__() <==> repr(od)()()) __class__r$ r@ r r s r __repr__OrderedDict.__repr__ s: !^^ 4 46 6 >>22D 4FGGr) c U R 5 nU( a [ U[ 5 ( a Uu pO0 nUR 5 nUR 5 n[ [ 5 5 H' nUR
US5 UR
US5 M) U( a X4nO U=( d SnU R SUS[ U R 5 5 4$ )z%Return state information for picklingNr" )
__getstate__
isinstancetuplecopyvarsr rY r iterr )r stateslotsks r
__reduce__OrderedDict.__reduce__ s !!# %'' $ uJJLEJJLE+-( !T" !T" )
~~r5$TZZ\0BBBr) c $ U R U 5 $ )z!od.copy() -> a shallow copy of odr r s r r OrderedDict.copy- ~~d##r) c . U " 5 nU H nX#U' M U$ )zYCreate a new ordered dictionary with keys from iterable and values set to value.
r" )rF iterablerQ r r/ s r fromkeysOrderedDict.fromkeys1 s! uC I r) c [ U[ 5 ( a5 [ R X5 =( a [ [ [ X5 5 $ [ R X5 $ )zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)r r r@ __eq__allmap_eqr rM s r r OrderedDict.__eq__: s@
e[ ) );;t+JCT4I0J J{{4''r) c ( U R U5 U $ r )updater s r __ior__OrderedDict.__ior__C s E r) c [ U[ 5 ( d [ $ U R U 5 nUR U5 U$ r r r@ NotImplementedr r r rM news r __or__OrderedDict.__or__G s4 %&&! !nnT"
5
r) c [ U[ 5 ( d [ $ U R U5 nUR U 5 U$ r r r s r __ror__OrderedDict.__ror__N s4 %&&! !nnU#
4
r) )
__hardroot__map__root)r" )Tr ))r$ r% r& r' __doc__rA rN r@ rV rC r7 r] rb r ri rm rr r~ _collections_abcMutableMappingr rL r r r __ne__objectr rY r _recursive_reprr r r classmethodr r r r r r( r" r) r r r V s / % "&!1!1e ' -1,<,< . 2 )77>>>FX*+,
,
,
3
3FxH ' , H H C&$ (r) r )r ) _tuplegetterc ( [ [ U 5 US9$ )N)doc)property _itemgetter)indexr s r r d s h{5/As&Kr) F)renamedefaultsmodulec
^^^^^^^^ ^ [ T[ 5 ( a TR SS5 R 5 m[ [ [ T5 5 m[ R " [ U 5 5 n U( aw [ 5 n[ T5 H^ u pgUR 5 ( a+ [ U5 ( d UR S5 ( d Xu; a SU 3TU' UR U5 M` U /T- Hc n[ U5 [ La [ S5 eUR 5 ( d [! SU< 35 e[ U5 ( d MV [! SU< 35 e [ 5 nT HT nUR S5 ( a U( d [! SU< 35 eXu; a [! SU< 35 eUR U5 MV 0 nUbg [# U5 n[% U5 [% T5 : a [ S 5 e[' [) [ [+ [) T5 [) U5 5 5 5 5 n[# [ [ R T5 5 m[% T5 mS
R- T5 n TS :X a U S-
n S S
R- S
T 5 5 - S- m [" R. m [& [" [$ [
[* 4u mmmmmT 0 SU 3S.n
SU SU S3n [1 X5 n SU l SU S U S3U l Ub X>> Point = namedtuple('Point', ['x', 'y'])
>>> Point.__doc__ # docstring for the new class
'Point(x, y)'
>>> p = Point(11, y=22) # instantiate with positional args or keywords
>>> p[0] + p[1] # indexable like a plain tuple
33
>>> x, y = p # unpack like a regular tuple
>>> x, y
(11, 22)
>>> p.x + p.y # fields also accessible by name
33
>>> d = p._asdict() # convert to a dictionary
>>> d['x']
11
>>> Point(**d) # convert from a dictionary
Point(x=11, y=22)
>>> p._replace(x=100) # _replace() is like str.replace() but targets named fields
Point(x=100, y=22)
, _z*Type names and field names must be stringsz6Type names and field names must be valid identifiers: z0Type names and field names cannot be a keyword: z-Field names cannot start with an underscore: z"Encountered duplicate field name: z(Got more default values than field names, ru r c 3 * # U H o S 3v M g7f)z=%rNr" ).0names r namedtuple.. s D s| s r namedtuple_)
_tuple_new __builtins__r$ z
lambda _cls, z: _tuple_new(_cls, (z))rA zCreate new instance of c d > T" X5 nT" U5 T:w a [ ST S[ U5 35 eU$ )Nz Expected z arguments, got ) TypeErrorry )rF r r _len
num_fields tuple_news r _makenamedtuple.._make s; 3) <: %i
|3CCK= QR R
r) z Make a new z# object from a sequence or iterablec > U R T" UR TU 5 5 nU( a [ S[ U5 < 35 eU$ )Nz Got unexpected field names: )r rY r list)r rH r _map field_namess r _replace namedtuple.._replace s= D; => :4:. IJ J
r) z
Return a new z2 object replacing specified fields with new valuesc < > U R R TU - - $ )z/Return a nicely formatted representation string)r r$ )r repr_fmts r r namedtuple..__repr__ s ~~&&D 88r) c 6 > T" T" U R U 5 5 $ )z9Return a new dict which maps field names to their values.)_fields)r _dict_zips r _asdictnamedtuple.._asdict s T$,,-..r) c > T" U 5 $ )z7Return self as a plain tuple. Used by copy and pickle.r" )r _tuples r __getnewargs__"namedtuple..__getnewargs__ s
d|r) .r" ) r r< r _field_defaultsrA r __replace__r r r r __match_args__zAlias for field number __main__r$ )&r strreplacesplitr r rw internset enumerate isidentifier
_iskeyword
startswithaddtyper
ValueErrorr ry r@ r zipjoinrA evalr$ r __defaults__r __func__r& r _getframemodulenameAttributeError _getframe f_globalsgetr% ) typenamer r r r seenr r field_defaultsarg_list namespacecoderA r r r r r methodclass_namespacer r r r r r r r r r s ` @@@@@@@@r r
r
f s 4 +s##!))#s399; s3 ,-K{{3x=)H
u$[1KE%%'' d##??3''<'([ E" HHTN
2
[( :S HI I "" --1H 6 7
7 d ))- 2 3
3 ) 5D ??3 L $x ) *
* < A$ JK K
N? x=3{+ + FG G htC0E080B-D (E F G DKK56K[!Jyy%HQCTYY D DDDsJH
I&*E3S&@#E64t
!(,I
8*$8
" ED4#G G/z8*AFGO ' !,H: 6, ,ENN (z 21 1H9/
"*
!FOO+< = Zq
!, ) (%
O !- kk 3E7;< ,UC 8 . (UHo
6F ~ --a0>JF " M
*4488ZP"J/
s* ' P
Q' 0QQ# Q'"Q##Q'c J U R nU H nU" US5 S- X' M g)z!Tally elements from the iterable.r ru N)r )mappingr mapping_getelems r _count_elementsr% s( ++K#D!,q0
r) )r% c ^ \ rS rSrSrS!U 4S jjrS rS rS!S jrS r \
S!S j5 r S!U 4S jjr S!S
jr
S rS rU 4S
jrS rS rS rS rS rS rS rS rS rS rS rS r S r S r S r S r S r!S r"S r#U =r$$ )"r i$ a Dict subclass for counting hashable items. Sometimes called a bag
or multiset. Elements are stored as dictionary keys and their counts
are stored as dictionary values.
>>> c = Counter('abcdeabcdabcaba') # count elements from a string
>>> c.most_common(3) # three most common elements
[('a', 5), ('b', 4), ('c', 3)]
>>> sorted(c) # list all unique elements
['a', 'b', 'c', 'd', 'e']
>>> ''.join(sorted(c.elements())) # list elements with repetitions
'aaaaabbbbcccdde'
>>> sum(c.values()) # total of all counts
15
>>> c['a'] # count of letter 'a'
5
>>> for elem in 'shazam': # update counts from an iterable
... c[elem] += 1 # by adding 1 to each element's count
>>> c['a'] # now there are seven 'a'
7
>>> del c['b'] # remove all 'b'
>>> c['b'] # now there are zero 'b'
0
>>> d = Counter('simsalabim') # make another counter
>>> c.update(d) # add in the second counter
>>> c['a'] # now there are nine 'a'
9
>>> c.clear() # empty the counter
>>> c
Counter()
Note: If a count is set to zero or reduced to zero, it will remain
in the counter until the entry is deleted or the counter is cleared:
>>> c = Counter('aaabbc')
>>> c['b'] -= 2 # reduce the count of 'b' by two
>>> c.most_common() # 'b' is still in, but its count is zero
[('a', 3), ('c', 1), ('b', 0)]
c H > [ TU ] 5 U R " U40 UD6 g)a Create a new, empty Counter object. And if given, count elements
from an input iterable. Or, initialize the count from another mapping
of elements to their counts.
>>> c = Counter() # a new, empty counter
>>> c = Counter('gallahad') # a new counter from an iterable
>>> c = Counter({'a': 4, 'b': 2}) # a new counter from a mapping
>>> c = Counter(a=4, b=2) # a new counter from keyword args
N)superrN r )r r rH r s r rN Counter.__init__W s! H%%r) c g)z1The count of elements not in the Counter is zero.r r" r. s r __missing__Counter.__missing__e s r) c 4 [ U R 5 5 $ )zSum of the counts)sumr r s r total
Counter.totalj s 4;;=!!r) c Uc" [ U R 5 [ S5 SS9$ SSKnUR XR 5 [ S5 S9$ )zList the n most common elements and their counts from the most
common to the least. If n is None, then list all element counts.
>>> Counter('abracadabra').most_common(3)
[('a', 5), ('b', 2), ('r', 2)]
Nru T)r/ reverser )r/ )sortedr r heapqnlargest)r r| r4 s r most_commonCounter.most_commonn sD
9$**,KNDI I ~~a ;q>~BBr) c f [ R " [ [ U R 5 5 5 $ )a Iterator over elements repeating each as many times as its count.
>>> c = Counter('ABCABC')
>>> sorted(c.elements())
['A', 'A', 'B', 'B', 'C', 'C']
Knuth's example for prime factors of 1836: 2**2 * 3**3 * 17**1
>>> import math
>>> prime_factors = Counter({2: 2, 3: 3, 17: 1})
>>> math.prod(prime_factors.elements())
1836
Note, if an element's count has been set to zero or is a negative
number, elements() will ignore it.
)_chain
from_iterable_starmap_repeatr r s r elementsCounter.elements~ s" & ##HWdjjl$CDDr) c [ S5 e)Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)NotImplementedError)rF r vs r r Counter.fromkeys s " NP Pr) c & > Ubt [ U[ R 5 ( aJ U ( a3 U R nUR 5 H u pEXS" US5 - X' M O[
TU ] U5 O [ X5 U( a U R
U5 gg)a Like dict.update() but add counts instead of replacing them.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.update('witch') # add elements from another iterable
>>> d = Counter('watch')
>>> c.update(d) # add elements from another counter
>>> c['h'] # four 'h' in which, witch, and watch
4
Nr )r r Mappingr r r( r r% )r r rH self_getr$ countr s r r Counter.update s{ ( ($4$<$<== #xxH'/~~'7 %*XdA->%>
(8 GN8, / KK r) c Ubj U R n[ U[ R 5 ( a( UR 5 H u pEU" US5 U-
X' M OU H nU" US5 S-
X' M U( a U R U5 gg)a_ Like dict.update() but subtracts counts instead of replacing them.
Counts can be reduced below zero. Both the inputs and outputs are
allowed to contain zero and negative counts.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.subtract('witch') # subtract elements from another iterable
>>> c.subtract(Counter('watch')) # subtract elements from another counter
>>> c['h'] # 2 in which, minus 1 in witch, minus 1 in watch
0
>>> c['w'] # 1 in which, minus 1 in witch, minus 1 in watch
-1
Nr ru )r r r rD r subtract)r r rH rE r$ rF s r rI Counter.subtract s xxH($4$<$<==#+>>#3KD!)$!2U!:DJ $4 %D!)$!2Q!6DJ % MM$ r) c $ U R U 5 $ )zReturn a shallow copy.r r s r r Counter.copy r r) c 2 U R [ U 5 44$ r )r r@ r s r r Counter.__reduce__ s ~~T
},,r) c 0 > X; a [ TU ] U5 gg)zGLike dict.__delitem__() but does not raise KeyError for missing values.N)r( r] )r r$ r s r r] Counter.__delitem__ s < G % r) c U ( d U R R S3$ [ U R 5 5 nU R R SU< S3$ ! [ a [ U 5 n N4f = f)Nr r r )r r$ r@ r6 r )r ds r r Counter.__repr__ so nn--.b1 1 T%%'(A ..))*!A522 T
A s A A0/A0c l ^ ^ [ T[ 5 ( d [ $ [ UU 4S jT T4 5 5 $ )z=True if all counts agree. Missing counts are treated as zero.c 3 L ># U H o H nTU TU :H v M M g 7fr r" r cerM r s r r !Counter.__eq__.. ' I
1q!47eAh&q&
!$r r r r r s ``r r Counter.__eq__ + %))! !Iu
IIIr) c B [ U[ 5 ( d [ $ X:X + $ )z@True if any counts disagree. Missing counts are treated as zero.r r r r s r r Counter.__ne__ s %))! ! r) c l ^ ^ [ T[ 5 ( d [ $ [ UU 4S jT T4 5 5 $ )z:True if all counts in self are a subset of those in other.c 3 L ># U H o H nTU TU :* v M M g 7fr r" rV s r r !Counter.__le__..' rZ r[ r\ r s ``r __le__Counter.__le__# r^ r) c V [ U[ 5 ( d [ $ X:* =( a X:g $ )zATrue if all counts in self are a proper subset of those in other.r` r s r __lt__Counter.__lt__) $ %))! !}. .r) c l ^ ^ [ T[ 5 ( d [ $ [ UU 4S jT T4 5 5 $ )z# U H o H nTU TU : v M M g 7fr r" rV s r r !Counter.__ge__..3 rZ r[ r\ r s ``r __ge__Counter.__ge__/ r^ r) c V [ U[ 5 ( d [ $ X: =( a X:g $ )zCTrue if all counts in self are a proper superset of those in other.r` r s r __gt__Counter.__gt__5 rj r) c [ U[ 5 ( d [ $ [ 5 nU R 5 H u p4XAU - nUS: d M XRU' M UR 5 H u p4X0; d M US: d M XBU' M U$ )zgAdd counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
r r r r r r rM r r$ rF newcounts r __add__Counter.__add__; sx %))! ! ::>> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
r rt ru s r __sub__Counter.__sub__N s| %))! ! ::>> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
r rt r rM r r$ rF other_countrv s r r Counter.__or__a s %))! ! ::>> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
r rt r} s r __and__Counter.__and__u sX %))! ! :: /3zz|M| 519t| M D
Ns ::c l UR 5 H u p#X== U-
ss' M U R 5 $ )zInplace add from another counter, keeping only positive counts.
>>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
r r r rM r$ rF s r __iadd__Counter.__iadd__ 1 !;;=KD J% J )""$$r) c l UR 5 H u p#X== U- ss' M U R 5 $ )zInplace subtract counter, but keep only results with positive counts.
>>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
r r s r __isub__Counter.__isub__ r r) c r UR 5 H u p#X nX4: d M X0U' M U R 5 $ )zInplace union is the maximum of value from either counter.
>>> c = Counter('abbb')
>>> c |= Counter('bcc')
>>> c
Counter({'b': 3, 'c': 2, 'a': 1})
r )r rM r$ r~ rF s r r Counter.__ior__ s< "' DJE" (T
"/ ""$$r) c r U R 5 H u p#X nXC: d M X@U' M U R 5 $ )zInplace intersection is the minimum of corresponding counts.
>>> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
r )r rM r$ rF r~ s r __iand__Counter.__iand__ s; ::G
LA ?Awr) c B ^ [ U4S jU R 5 5 $ )Nc 3 . ># U H
nTU; v M g 7fr r" )r mr/ s r r (ChainMap.__contains__..
s /Y3!8Ys anyr r. s `r __contains__ChainMap.__contains__ s /TYY///r) c , [ U R 5 $ r r r s r __bool__ChainMap.__bool__ 499~ r) c U R R SSR [ [ U R
5 5 S3$ )Nr r r )r r$ r r reprr r s r r ChainMap.__repr__ s5 ..))*!DIIc$ 6J,K+LANNr) c 8 U " [ R X5 5 $ )zFCreate a new ChainMap with keys from iterable and values set to value.)r@ r )rF r rQ s r r ChainMap.fromkeys s 4==122r) c x U R " U R S R 5 /U R SS Q76 $ )zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]r ru N)r r r r s r r
ChainMap.copy s1 ~~diil / / 1BDIIabMBBr) c x Uc UnOU( a UR U5 U R " U/U R Q76 $ )zNew ChainMap with a new map followed by all previous maps.
If no map is provided, an empty dict is used.
Keyword arguments update the map or new empty dict.
)r r r )r r kwargss r new_childChainMap.new_child s5
9A
HHV ~~a,$)),,r) c : U R " U R SS 6 $ )zNew ChainMap from maps[1:].ru N)r r r s r parentsChainMap.parents) s ~~tyy}--r) c & X R S U' g Nr r )r r/ rQ s r rV ChainMap.__setitem__. s ! ! Sr) c ` U R S U g ! [ a [ SU< 35 ef = f)Nr $Key not found in the first mapping: )r rl r. s r r] ChainMap.__delitem__1 s< K ! S! K A#IJ J Ks -c p U R S R 5 $ ! [ a [ S5 ef = f)zPRemove and return an item pair from maps[0]. Raise KeyError is maps[0] is empty.r z#No keys found in the first mapping.)r rm rl r s r rm ChainMap.popitem7 s< B99Q<'') ) B@A A Bs 5c ~ U R S R " U/UQ76 $ ! [ a [ SU< 35 ef = f)zWRemove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].r r )r rY rl )r r/ rG s r rY ChainMap.pop> sJ K99Q<##C/$/ / K A#IJ J Ks " <c > U R S R 5 g)z'Clear maps[0], leaving maps[1:] intact.r N)r ri r s r ri ChainMap.clearE s ! r) c B U R S R U5 U $ r )r r r s r r ChainMap.__ior__I s ! E" r) c [ U[ R 5 ( d [ $ U R 5 nUR
S R
U5 U$ r )r r rD r r r r )r rM r s r r ChainMap.__or__M sB %!1!9!9::! ! IIK q r) c [ U[ R 5 ( d [ $ [ U5 n[ U R 5 H nUR U5 M U R U5 $ r ) r r rD r r@ r r r r )r rM r childs r r ChainMap.__ror__T sR %!1!9!9::! ! K dii(E
HHUO )~~a r) r r ) r$ r% r& r' r rN r+ r r r rb r r r r r r r __copy__r r r rV r] rm rY ri r r r r( r" r) r r r s ' %5, 0 O O 3 3C H - . ."K BK !r) r c \ rS rSrSS jrS rS rS rS rS r S r
SS
jr S r S r
S
rS rS rS r\SS j5 rSrg)r ia Nc l 0 U l Ub U R U5 U( a U R U5 g g r )datar )r r@ r s r rN UserDict.__init__d s/ KK KK r) c , [ U R 5 $ r ry r r s r r UserDict.__len__k r r) c XR ; a U R U $ [ U R S5 ( a U R R X5 $ [ U5 e)Nr+ )r hasattrr r+ rl r. s r r UserDict.__getitem__n sJ )) 99S> ! 4>>= 1 1>>--d8 8smr) c X R U' g r r )r r/ items r rV UserDict.__setitem__u s
#r) c U R U g r r r. s r r] UserDict.__delitem__x s
IIcNr) c , [ U R 5 $ r )r r r s r rb UserDict.__iter__{ DII r) c XR ; $ r r r. s r r UserDict.__contains__ s ii r) c X; a X $ U$ r r" r s r r UserDict.get s ;9 r) c , [ U R 5 $ r r r r s r r UserDict.__repr__ r r) c [ U[ 5 ( a( U R U R UR - 5 $ [ U[ 5 ( a U R U R U- 5 $ [
$ r r r r r r@ r r s r r UserDict.__or__ sV eX & &>>$))ejj"89 9 eT " ">>$))e"34 4 r) c [ U[ 5 ( a( U R UR U R - 5 $ [ U[ 5 ( a U R XR - 5 $ [
$ r r r s r r UserDict.__ror__ sT eX & &>>%**tyy"89 9 eT " ">>%))"34 4 r) c [ U[ 5 ( a! U =R UR - sl U $ U =R U- sl U $ r )r r r r s r r UserDict.__ior__ s= eX & & II #I
II I r) c U R R U R 5 nUR R U R 5 U R S R 5 UR S' U$ Nr )r rA rz r r r insts r r UserDict.__copy__ sU ~~%%dnn5
T]]+ $
f 5 : : <
f r) c U R [ L a# [ U R R 5 5 $ SS KnU R n 0 U l UR U 5 nX l UR U 5 U$ ! X l f = fr )r r r r r )r r r rW s r r
UserDict.copy sg >>X %DIINN ,- -yy DI $A I Is A9 9Bc . U " 5 nU H nX#U' M U$ r r" )rF r rQ rR r/ s r r UserDict.fromkeys s ECcF r) r r )r$ r% r& r' rN r r rV r] rb r r r r r r r r r r r( r" r) r r r a s\
r) r c \ rS rSrSrS#S jrS rS rS rS r S r
S
r S r S r
S
rS rS rS rS rS rS rS r\rS rS rS rS rS$S jrS r S r S r S r S r S r!S r"S! r#S"r$g)%r i zAA more or less complete user-defined wrapper around list objects.Nc / U l Ubt [ U5 [ U R 5 :X a XR S S & g [ U[ 5 ( a UR S S U R S S & g [ U5 U l g g r )r r
r r r )r initlists r rN UserList.__init__ sa H~dii 0 ' ! Hh// '}}Q / ! N r) c , [ U R 5 $ r r r s r r UserList.__repr__ r r) c > U R U R U5 : $ r r _UserList__castr s r rh UserList.__lt__ yy4;;u---r) c > U R U R U5 :* $ r r r s r re UserList.__le__ yyDKK ...r) c > U R U R U5 :H $ r r r s r r UserList.__eq__ r r) c > U R U R U5 : $ r r r s r rq UserList.__gt__ r r) c > U R U R U5 : $ r r r s r rn UserList.__ge__ r r) c H [ U[ 5 ( a UR $ U$ r )r r r r s r __castUserList.__cast s 'x 8 8uzzCeCr) c XR ; $ r r r r s r r UserList.__contains__ s yy r) c , [ U R 5 $ r r r s r r UserList.__len__ r r) c [ U[ 5 ( a U R U R U 5 $ U R U $ r )r slicer r r is r r UserList.__getitem__ s4 a >>$))A,/ /99Q< r) c X R U' g r r r r' r s r rV UserList.__setitem__ s
! r) c U R U g r r r& s r r] UserList.__delitem__ s
IIaLr) c N [ U[ 5 ( a( U R U R UR - 5 $ [ U[ U R 5 5 ( a U R U R U- 5 $ U R U R [ U5 - 5 $ r r r r r r
r r s r rw UserList.__add__ st eX & &>>$))ejj"89 9
tDII
/
/>>$))e"34 4~~dii$u+ 566r) c L [ U[ 5 ( a( U R UR U R - 5 $ [ U[ U R 5 5 ( a U R XR - 5 $ U R [ U5 U R - 5 $ r r/ r s r __radd__UserList.__radd__ sr eX & &>>%**tyy"89 9
tDII
/
/>>%))"34 4~~d5kDII 566r) c $ [ U[ 5 ( a! U =R UR -
sl U $ [ U[ U R 5 5 ( a U =R U-
sl U $ U =R [ U5 -
sl U $ r )r r r r
r r s r r UserList.__iadd__ sm eX & & II #I
tDII
/
/ II I
IIe $I r) c > U R U R U- 5 $ r r r r r| s r __mul__UserList.__mul__ ~~dii!m,,r) c 0 U =R U- sl U $ r r r8 s r __imul__UserList.__imul__ s Q r) c U R R U R 5 nUR R U R 5 U R S S S UR S' U$ r )r rA rz r r s r r UserList.__copy__ sQ ~~%%dnn5
T]]+ $
f 5a 8
f r) c : U R R U5 g r )r appendr s r rB UserList.append r) c : U R R X5 g r )r insertr* s r rF UserList.insert! s !r) c 8 U R R U5 $ r )r rY r& s r rY UserList.pop$ s yy}}Q r) c : U R R U5 g r )r remover s r rK UserList.remove' rD r) c 8 U R R 5 g r )r ri r s r ri UserList.clear* s r) c $ U R U 5 $ r r r s r r
UserList.copy- s ~~d##r) c 8 U R R U5 $ r )r rF r s r rF UserList.count0 s yyt$$r) c < U R R " U/UQ76 $ r )r r )r r rG s r r UserList.index3 s yyt+d++r) c 8 U R R 5 g r )r r2 r s r r2 UserList.reverse6 s r) c < U R R " U0 UD6 g r )r sortr rG rH s r rX
UserList.sort9 s %%r) c [ U[ 5 ( a& U R R UR 5 g U R R U5 g r )r r r extendr s r r\ UserList.extend< s7 eX & & II UZZ ( II U #r) r r )%r$ r% r& r' r rN r rh re r rq rn r r r r rV r] rw r2 r r9 __rmul__r= r rB rF rY rK ri r rF r r2 rX r\ r( r" r) r r r s K + .//./D! 77- H " $%, &$r) r c \ rS rSrS rS rS rS rS rS r S r
S r S
r S r
S rS
rS rS rS rS rS rS rS r\rS rS rS rS rS r S\ R< 4S jr S r S r!SHS jr"S\ R< 4S jr#SIS jr$S\ R< 4S! jr%S" r&S# r'S\ R< 4S$ jr(S% r)S& r*S' r+S( r,S) r-S* r.S+ r/S, r0S- r1S. r2S/ r3S0 r4S1 r5S2 r6S3 r7SJS5 jr8\9Rt r:S6 r;SKS7 jrS: r?S; r@SJS< jrASLS= jrBSLS> jrCSMS? jrDS\ R< 4S@ jrESJSA jrFSB rGSC rHSD rISE rJSF rKSGrLg4)Nr iG c [ U[ 5 ( a Xl g [ U[ 5 ( a UR S S U l g [ U5 U l g r )r r r r r seqs r rN UserString.__init__I s; c3 I
Z
(
( DICDIr) c , [ U R 5 $ r )r r r s r __str__UserString.__str__Q r r) c , [ U R 5 $ r r r s r r UserString.__repr__T r r) c , [ U R 5 $ r )intr r s r __int__UserString.__int__W r r) c , [ U R 5 $ r )floatr r s r __float__UserString.__float__Z s TYY r) c , [ U R 5 $ r )complexr r s r __complex__UserString.__complex__] s tyy!!r) c , [ U R 5 $ r )hashr r s r __hash__UserString.__hash__` r r) c " U R S S 4$ r r r s r r UserString.__getnewargs__c s ! r) c | [ U[ 5 ( a U R UR :H $ U R U:H $ r r r r r strings r r UserString.__eq__f 1 fj ) )99 + +yyF""r) c | [ U[ 5 ( a U R UR : $ U R U: $ r r~ r s r rh UserString.__lt__k 1 fj ) )99v{{* *yy6!!r) c | [ U[ 5 ( a U R UR :* $ U R U:* $ r r~ r s r re UserString.__le__p r r) c | [ U[ 5 ( a U R UR : $ U R U: $ r r~ r s r rq UserString.__gt__u r r) c | [ U[ 5 ( a U R UR : $ U R U: $ r r~ r s r rn UserString.__ge__z r r) c ` [ U[ 5 ( a UR nXR ; $ r r~ )r chars r r UserString.__contains__ s% dJ ' '99Dyy r) c , [ U R 5 $ r r r s r r UserString.__len__ r r) c > U R U R U 5 $ r r7 )r r s r r UserString.__getitem__ s ~~dii .//r) c 0 [ U[ 5 ( a( U R U R UR - 5 $ [ U[ 5 ( a U R U R U- 5 $ U R U R [ U5 - 5 $ r )r r r r r r s r rw UserString.__add__ sl eZ ( (>>$))ejj"89 9
s
#
#>>$))e"34 4~~dii#e* 455r) c [ U[ 5 ( a U R XR - 5 $ U R [ U5 U R - 5 $ r )r r r r r s r r2 UserString.__radd__ sA eS ! !>>%))"34 4~~c%j499 455r) c > U R U R U- 5 $ r r7 r8 s r r9 UserString.__mul__ r; r) c > U R U R U- 5 $ r r7 r rG s r __mod__UserString.__mod__ s ~~dii$ .//r) c < U R [ U5 U - 5 $ r )r r )r templates r __rmod__UserString.__rmod__ s ~~c(md 233r) c T U R U R R 5 5 $ r )r r
capitalizer s r r UserString.capitalize s ~~dii 2 2 455r) c T U R U R R 5 5 $ r )r r casefoldr s r r UserString.casefold ~~dii 0 0 233r) c Z U R U R R " U/UQ76 5 $ r )r r centerr widthrG s r r UserString.center s% ~~dii . .u !dll 0
>
>
2
&'DLL 6= T\\ /
/- !dll 0
###%#(#%'####=17
I(E !dll 0
!"t|| 1
=)7./. ()dll 8641:16r) r )7r __all__r sysrw modulesabc itertoolsr r9 r
r< r r; keywordr r
operatorr r r r reprlibr r _weakrefr rC _collectionsr MutableSequenceregister ImportErrorr r KeysViewr ItemsViewr+
ValuesViewr2 r r7 r@ r r r
r% r r r r r Sequencer r" r) r rV s
"2
% ' ) + . 5 $5" $$--e4 , (++44 +
, , 6 6 , % - 8 8 % 5F 5}$ }@ (L) 16T lf1 ,r%d r%r
}! .. }!HZ .. ZB~$ // ~$Jy6!** y6s(
| LKLL| sl E 3E" :E. E: F 0F E E "E+*E+.E76E7:FF FFF F