֦i d Z g dZddlZddlZddlmZ ddlmZ ddlm
Z ddl m
Z ddlmZ dd lmZ dd
lmZ dd lmZ dd lmZ ej8 j; e dd
lm Z ddlm Z G d dejB Z" G d dejF Z$ G d dejJ Z& G d de' Z( G d de) Z* ddlm*Z* ddlm+Z+ d ddd d Z,d Z- dd lm-Z- G d! d"e) Z. G d# d$ej^ Z0 G d% d&ej^ Z1 G d' d(ej8 Z2 G d) d*ejf Z4y# e $ r Y w xY w# e $ r Y w xY w# e $ r Y w xY w# e $ r Y w xY w# e $ r d Z+Y w xY w# e $ r Y w xY w)+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 N)chain)repeat)starmap) iskeyword)eq)
itemgetter)recursive_repr)proxy)r )_deque_iterator)r c e Zd Zd Zy)_OrderedDictKeysViewc # J K t | j E d { y 7 wNreversed_mappingselfs -/usr/lib64/python3.12/collections/__init__.py __reversed__z!_OrderedDictKeysView.__reversed__A s DMM***s #!#N__name__
__module__ __qualname__r r r r ? s +r% r c e Zd Zd Zy)_OrderedDictItemsViewc # f K t | j D ] }|| j | f y wr r r keys r r z"_OrderedDictItemsView.__reversed__F s- DMM*C
c*+ + +s /1Nr r$ r% r r' r' D s ,r% r' c e Zd Zd Zy)_OrderedDictValuesViewc # b K t | j D ] }| j | y wr r r) s r r z#_OrderedDictValuesView.__reversed__L s( DMM*C--$ $ +s -/Nr r$ r% r r, r, J s %r% r, c e Zd ZdZy)_Link)prevnextr* __weakref__N)r! r" r# __slots__r$ r% r r/ r/ P s 4Ir% r/ c d e Zd ZdZd ZddZej ee fdZej fdZ
d Z d Z d Z
dd Zdd
Zd Zej$ j& xZZd Zd
Zd Zej$ j0 Z e ZefdZd dZ e d Z d Z d Z e!d d Z"d Z#d Z$d Z%d Z&y) r z)Dictionary that remembers insertion orderc t j | }t |_ t |j x|_ }|x|_ |_ i |_ |S )zDCreate the ordered dict object and set up the underlying structures.) dict__new__r/ _OrderedDict__hardroot_proxy_OrderedDict__rootr0 r1 _OrderedDict__map)clsargskwdsr roots r r7 zOrderedDict.__new__b sH ||C ' #DOO 44 d $$ DI
r% c * | j |fi | y)zInitialize an ordered dictionary. The signature is the same as
regular dictionaries. Keyword argument order is preserved.
N)_OrderedDict__update)r otherr> s r __init__zOrderedDict.__init__k s
e$t$r% c || vrX | x| j |< }| j }|j }|||c|_ |_ |_ ||_ || |_ || || y)z!od.__setitem__(i, y) <==> od[i]=yN)r; r: r0 r1 r* ) r r* value dict_setitemr Linklinkr? lasts r __setitem__zOrderedDict.__setitem__q se
d?%)V +DJJsOd;;D99D-14 *DIty$( DI d DIT3&r% c || | | j j | }|j }|j }||_ ||_ d|_ d|_ y)z od.__delitem__(y) <==> del od[y]N)r; popr0 r1 )r r* dict_delitemrH link_prev link_nexts r __delitem__zOrderedDict.__delitem__ sN T3 zz~~c"II II " " r% c # K | j }|j }||ur |j |j }||ur yyw)zod.__iter__() <==> iter(od)N)r: r1 r* r r? currs r __iter__zOrderedDict.__iter__ > {{yy$ ((N99D $
;A A c # K | j }|j }||ur |j |j }||ur yyw)z#od.__reversed__() <==> reversed(od)N)r: r0 r* rR s r r zOrderedDict.__reversed__ rU rV c | j }|x|_ |_ | j j t
j | y)z.od.clear() -> None. Remove all items from od.N)r: r0 r1 r; clearr6 )r r? s r rY zOrderedDict.clear s5 {{ $$ DI
4r% c 8 | s t d | j }|r'|j }|j }||_ ||_ n&|j }|j }||_ ||_ |j }| j
|= t j | | }||fS )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)KeyErrorr: r0 r1 r* r; r6 rL )r rI r? rH rN rO r* rE s r popitemzOrderedDict.popitem s
01 1{{ 99D I !IN!DI99D I!DI !INhh JJsOs#Ezr% c D | j | }|j }|j }|j }||_ ||_ | j }|r)|j }||_ ||_ ||_ ||_ y|j }||_ ||_ ||_ ||_ y)zMove an existing element to the end (or beginning if last is false).
Raise KeyError if the element does not exist.
N)r; r0 r1 r: ) r r* rI rH rN rO soft_linkr? firsts r move_to_endzOrderedDict.move_to_end s
zz#II II NN " " {{ 99D DI DI!DI DIIIE DI DI"EJ DIr% c t j }t | dz } || j }| || j dz z
}| || j
|z z
}| || j |z z
}|S )N )_sys getsizeoflen__dict__r; r8 r: )r sizeofnsizes r
__sizeof__zOrderedDict.__sizeof__ ss IMdmm$ tzz"Q&& t'!++ t{{#a'' r% c t | S )z:D.keys() -> a set-like object providing a view on D's keys)r r s r keyszOrderedDict.keys s
#D))r% c t | S )z a set-like object providing a view on D's items)r' r s r itemszOrderedDict.items s
$T**r% c t | S )z6D.values() -> an object providing a view on D's values)r, r s r valueszOrderedDict.values s
%d++r% c | j }t j | || }||urQ| j j | }|j }|j
}||_ ||_ d|_ d|_ |S ||u r t
| |S )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__markerr6 rL r; r0 r1 r[ )r r* defaultmarkerresultrH rN rO s r rL zOrderedDict.pop s $V, ::>>#&D I I &IN &IN DI DIM f 3- r% Nc " || v r| | S || |< |S )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* rt s r
setdefaultzOrderedDict.setdefault s#
$;9 S r% c | s| j j dS | j j dt | j dS )zod.__repr__() <==> repr(od)()()) __class__r! r6 ro r s r __repr__zOrderedDict.__repr__ s: !^^ 4 46 6 >>22D 4FGGr% c x | j }|rt |t r|\ }}ni }|j }|j }t t D ]& }|j
|d |j
|d ( |r||f}n|xs d}| j d|dt | j fS )z%Return state information for picklingNr$ )
__getstate__
isinstancetuplecopyvarsr rL r~ iterro )r stateslotsks r
__reduce__zOrderedDict.__reduce__ s !!# %' $ uJJLEJJLE+-( !T" !T" ) u
~~r5$TZZ\0BBBr% c $ | j | S )z!od.copy() -> a shallow copy of odr~ r s r r zOrderedDict.copy* ~~d##r% c , | }|D ] }|||< |S )zYCreate a new ordered dictionary with keys from iterable and values set to value.
r$ )r< iterablerE r r* s r fromkeyszOrderedDict.fromkeys. s# uC DI r% c t |t r2t j | | xr t t t | | S t j | | S )zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)r r r6 __eq__allmap_eqr rB s r r zOrderedDict.__eq__7 sC
e[ );;tU+JCT54I0J J{{4''r% c ( | j | | S r )updater s r __ior__zOrderedDict.__ior__@ s E r% c v t |t st S | j | }|j | |S r r r6 NotImplementedr~ r r rB news r __or__zOrderedDict.__or__D s1 %&! !nnT"
5
r% c v t |t st S | j | }|j | |S r r r s r __ror__zOrderedDict.__ror__K s1 %&! !nnU#
4
r% )r$ )Tr )'r! r" r# __doc__r7 rC r6 rJ r9 r/ rP rT r rY r\ r` rk _collections_abcMutableMappingr rA rm ro rq __ne__objectrs rL ry _recursive_reprr r r classmethodr r r r r r$ r% r r r S s / % "&!1!1e ' -1,<,< . 2 )77>>>FX*+,
,
,
3
3FxH ' , H H C&$ (r% r )r ) _tuplegetterc . t t | | S )N)doc)property _itemgetter)indexr s r r a s h{5/As&Kr% F)renamedefaultsmodulec 2 t t r j dd j t t t t
j t | } |rft }t D ]N \ }}|j r t | s|j d s||v rd| |< |j | P | gz D ]U }t | t ur t d |j st! d| t | sIt! d| t }D ]F }|j d r|st! d| ||v rt! d| |j | H i }|ft# | }t% | t% kD r t d t' t) t t+ t) t) | }t# t t j t% d
j- } d k( r| dz
} d d
j- d
D z dz t" j. t& t" t$ t
t* f\ i d| d}
d| d| d} t1 | |
} d| _ d| d | d| _ ||| _ t8 fd }
d| d|
j: _ fd}d| d|_ fd }fd }fd }| |
j: ||||fD ] }| d |j2 |_ | d | dd || |
||||d! }t D ], \ }}t
j d"| }t? || ||< . t | t" f| }| t
j@ d xs d#}|||_% |S # tB $ rI t
jD d jF jI d$d# }n# tB t f$ r Y nw xY wY \w xY w)%aC Returns a new subclass of tuple with named fields.
>>> 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, rb r| c 3 & K | ] }| d yw)z=%rNr$ ).0names r z namedtuple.. s D $s| s r} namedtuple_)
_tuple_new __builtins__r! z
lambda _cls, z: _tuple_new(_cls, (z))r7 zCreate new instance of c d | | } | k7 rt d dt | |S )Nz Expected z arguments, got ) TypeErrorrf )r< r rv _len
num_fields tuple_news r _makeznamedtuple.._make s= 3) <: %i
|3CCK= QR R
r% z Make a new z# object from a sequence or iterablec | j |j | }|rt dt | |S )Nz Got unexpected field names: )r rL
ValueErrorlist)r r> rv _map field_namess r _replacez namedtuple.._replace s= D; => ;DJ> JK K
r% z
Return a new z2 object replacing specified fields with new valuesc < | j j | z z S )z/Return a nicely formatted representation string)r~ r! )r repr_fmts r r z namedtuple..__repr__ s ~~&&D 88r% c 6 | j | S )z9Return a new dict which maps field names to their values.)_fields)r _dict_zips r _asdictznamedtuple.._asdict s T$,,-..r% c | S )z7Return self as a plain tuple. Used by copy and pickle.r$ )r _tuples r __getnewargs__z"namedtuple..__getnewargs__ s
d|r% .r$ ) r r3 r _field_defaultsr7 r r r r r __match_args__zAlias for field number __main__r! )&r strreplacesplitr r rd internset enumerate isidentifier
_iskeyword
startswithaddtyper r r rf r6 r zipjoinr7 evalr! r __defaults__r __func__r# r _getframemodulenameAttributeError _getframe f_globalsgetr" ) typenamer r r r seenr r field_defaultsarg_list namespacecoder7 r r r r r methodclass_namespacer rv r r r r r r r r s ` @@@@@@@@r r
r
c ss 4 +s#!))#s399; s3 ,-K{{3x=)H
u$[1KE4%%' d#??3'4<'([ E" HHTN
2
[( :S HI I " --1H 6 7
7 d ))- 2 3
3 ) 5D ??3 L $x ) *
* 4< 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 !- tkk 3E7;< ,UC 8 . (UHo
6F ~ --a0>JF " M
*4488ZP"J/
s6 O P/O>=P>P
PPPPc H | j }|D ] } ||d dz | |< y)z!Tally elements from the iterable.r rb N)r )mappingr mapping_getelems r _count_elementsr s* ++K#D!,q0
r% )r c e Zd ZdZd fd Zd Zd Zd dZd Ze d d Z
d fd Z d d Z d
Z
d Z fd Zd
Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Z d Z d Z d Z d Z d Z! xZ"S ) r 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 t | | j |fi | y)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)superrC r )r r r> r~ s r rC zCounter.__init__S s# H%%r% c y)z1The count of elements not in the Counter is zero.r r$ r) s r __missing__zCounter.__missing__a s r% c 4 t | j S )zSum of the counts)sumrq r s r totalz
Counter.totalf s 4;;=!!r% c |%t | j t d d S ddl}|j || j t d S )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)]
Nrb T)r* reverser )r* )sortedro r heapqnlargest)r ri r s r most_commonzCounter.most_commonj sF
9$**,KNDI I ~~a ;q>~BBr% c d t j t t | j S )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_repeatro r s r elementszCounter.elementsz s" & ##HWdjjl$CDDr% c t d )Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)NotImplementedError)r< r vs r r zCounter.fromkeys s " NP Pr% c
|lt |t j rF| r4| j }|j D ] \ }}| ||d z | |< n t
| | n t | | |r| j
| yy)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 ro r r r )r r r> self_getr countr~ s r r zCounter.update s~ ( ($4$<$<= #xxH'/~~'7 e%*XdA->%>T
(8 GN8, h/ KK r% c |d| j }t |t j r(|j D ] \ }} ||d |z
| |< n|D ] } ||d dz
| |< |r| j | yy)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 rb )r r r r ro subtract)r r r> r r r s r r zCounter.subtract s xxH($4$<$<=#+>>#3KD%!)$!2U!:DJ $4 %D!)$!2Q!6DJ % MM$ r% c $ | j | S )zReturn a shallow copy.r r s r r z Counter.copy r r% c 2 | j t | ffS r )r~ r6 r s r r zCounter.__reduce__ s ~~T
},,r% c . || v rt | | yy)zGLike dict.__delitem__() but does not raise KeyError for missing values.N)r rP )r r r~ s r rP zCounter.__delitem__ s 4< G % r% c | s| j j dS t | j }| j j d|dS # t $ r t | }Y 2w xY w)Nr{ r| r} )r~ r! r6 r r )r ds r r zCounter.__repr__ so nn--.b1 1 T%%'(A ..))*!A522 T
A s A A)(A)c ` t t st S t fd fD S )z=True if all counts agree. Missing counts are treated as zero.c 3 B K | ] }|D ] }| | k( y wr r$ r cerB r s r r z!Counter.__eq__.. ( I
1q!47eAh&q&
r r r r r s ``r r zCounter.__eq__ ( %)! !Iu
IIIr% c : t |t st S | |k( S )z@True if any counts disagree. Missing counts are treated as zero.r r r r s r r zCounter.__ne__ s %)! !5= r% c ` t t st S t fd fD S )z:True if all counts in self are a subset of those in other.c 3 B K | ] }|D ] }| | k y wr r$ r s r r z!Counter.__le__..# r" r# r$ r s ``r __le__zCounter.__le__ r% r% c F t |t st S | |k xr | |k7 S )zATrue if all counts in self are a proper subset of those in other.r' r s r __lt__zCounter.__lt__% % %)! !u}. .r% c ` t t st S t fd fD S )z./ r" r# r$ r s ``r __ge__zCounter.__ge__+ r% r% c F t |t st S | |k\ xr | |k7 S )zCTrue if all counts in self are a proper superset of those in other.r' r s r __gt__zCounter.__gt__1 r- r% c t |t st S t }| j D ] \ }}||| z }|dkD s|||< |j D ] \ }}|| vs |dkD s|||< |S )zAdd counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
r r r r ro r rB rv r r newcounts r __add__zCounter.__add__7 s %)! ! ::>> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
r r4 r5 s r __sub__zCounter.__sub__J s %)! ! ::>> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
r r4 r rB rv r r other_countr6 s r r zCounter.__or__] s %)! ! ::>> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
r r4 r; s r __and__zCounter.__and__q s] %)! ! ::>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
ro rG r rB r r s r __iadd__zCounter.__iadd__ 5 !;;=KD% J% J )""$$r% c l |j D ] \ }}| |xx |z cc< | j S )zInplace subtract counter, but keep only results with positive counts.
>>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
rI rJ s r __isub__zCounter.__isub__ rL r% c r |j D ] \ }}| | }||kD s|| |< | j S )zInplace union is the maximum of value from either counter.
>>> c = Counter('abbb')
>>> c |= Counter('bcc')
>>> c
Counter({'b': 3, 'c': 2, 'a': 1})
rI )r rB r r< r s r r zCounter.__ior__ sD "' D+JEU" (T
"/ ""$$r% c r | j D ] \ }}|| }||k s|| |< | j S )zInplace intersection is the minimum of corresponding counts.
>>> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
rI )r rB r r r< s r __iand__zCounter.__iand__ sC :: rB rD rG rK rN r rQ
__classcell__r s @r r r s *d &
"C E. P P D 6$-&
3ZJ ! J / J / &&(" % %
%
%r% r c e Zd ZdZd Zd Zd ZddZd Zd Z d Z
d
Z e d Z
ed Zd
ZeZddZed Zd Zd Zd Zd Zd Zd Zd Zd Z y)r a A ChainMap groups multiple dicts (or other mappings) together
to create a single, updateable view.
The underlying mappings are stored in a list. That list is public and can
be accessed or updated using the *maps* attribute. There is no other
state.
Lookups search the underlying mappings successively until a key is found.
In contrast, writes, updates, and deletions only operate on the first
mapping.
c . t | xs i g| _ y)zInitialize a ChainMap by setting *maps* to the given mappings.
If no mappings are provided, a single empty dictionary is used.
N)r maps)r rU s r rC zChainMap.__init__ s
J&2$ r% c t | r )r[ r) s r r zChainMap.__missing__ s smr% c r | j D ] } || c S | j | S # t $ r Y (w xY wr )rU r[ r )r r* r s r __getitem__zChainMap.__getitem__ sF yyG
s|# !
$$
s * 66Nc || v r| | S |S r r$ rx s r r z ChainMap.get s 4KtCy4W4r% c V t t j | j S r )rf r unionrU r s r __len__zChainMap.__len__ s ;35;; *++r% c i }t t j t | j D ] }||z } t | S r )r r6 r r rU r )r r r s r rT zChainMap.__iter__ s7 4==(499*=>G
LA ?Awr% c @ t fd| j D S )Nc 3 & K | ] }|v
y wr r$ )r mr* s r r z(ChainMap.__contains__.. s /Y3!8Ys anyrU r) s `r __contains__zChainMap.__contains__ s /TYY///r% c , t | j S r ra r s r __bool__zChainMap.__bool__ 499~ r% c | j j ddj t t | j
dS )Nr| r r} )r~ r! r r reprrU r s r r zChainMap.__repr__ s5 ..))*!DIIc$ 6J,K+LANNr% c : | t j |g| S )z?Create a ChainMap with a single dict created from the iterable.)r6 r )r< r r= s r r zChainMap.fromkeys s 4==1D122r% c x | j | j d j g| j dd S )zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]r rb N)r~ rU r r s r r z
ChainMap.copy s3 t~~diil / / 1BDIIabMBBr% c l ||}n|r|j | | j |g| j S )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~ rU )r r` kwargss r new_childzChainMap.new_child s7
9A
HHV t~~a,$)),,r% c : | j | j dd S )zNew ChainMap from maps[1:].rb N)r~ rU r s r parentszChainMap.parents% s t~~tyy}--r% c ( || j d |< y Nr )rU )r r* rE s r rJ zChainMap.__setitem__* s ! ! Sr% c \ | j d |= y # t $ r t d| w xY w)Nr $Key not found in the first mapping: )rU r[ r) s r rP zChainMap.__delitem__- s< K ! S! K A#IJ J Ks +c n | j d j S # t $ r t d w xY w)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.)rU r\ r[ r s r r\ zChainMap.popitem3 s< B99Q<'') ) B@A A Bs 4c z | j d j |g| S # t $ r t d| w xY w)zWRemove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].r rs )rU rL r[ )r r* r= s r rL z ChainMap.pop: sL K#499Q<##C/$/ / K A#IJ J Ks " :c > | j d j y)z'Clear maps[0], leaving maps[1:] intact.r N)rU rY r s r rY zChainMap.clearA s ! r% c B | j d j | | S rq )rU r r s r r zChainMap.__ior__E s ! E" r% c t |t j st S | j }|j
d j
| |S rq )r r r r r rU r )r rB r` s r r zChainMap.__or__I s? %!1!9!9:! ! IIK q r% c t |t j st S t | }t | j D ] }|j | | j | S r ) r r r r r6 r rU r r~ )r rB r` childs r r zChainMap.__ror__P sO %!1!9!9:! ! K dii(E
HHUO )~~a r% r ) r! r" r# r rC r rX r r\ rT rc re r r r r r __copy__rm r ro rJ rP r\ rL rY r r r r$ r% r r r s ' %5, 0 O O 3 3C H - . ."K BK !r% r c v e Zd ZddZd Zd Zd Zd Zd Zd Z dd Z
d
Z d Z d Z
d
Zd Zd Zedd Zy)r Nc ` i | _ || j | |r| j | y y r )datar )r r6 rl s r rC zUserDict.__init__` s/ KK KK r% c , t | j S r rf r~ r s r r\ zUserDict.__len__g rf r% c || j v r| j | S t | j d r | j j | | S t | )Nr )r~ hasattrr~ r r[ r) s r rX zUserDict.__getitem__j sK $)) 99S> ! 4>>= 1>>--dC8 8smr% c " || j |< y r r~ )r r* items r rJ zUserDict.__setitem__q s #r% c | j |= y r r r) s r rP zUserDict.__delitem__t s
IIcNr% c , t | j S r )r r~ r s r rT zUserDict.__iter__w DII r% c || j v S r r r) s r rc zUserDict.__contains__| s dii r% c || v r| | S |S r r$ rx s r r z UserDict.get s $;9 r% c , t | j S r rh r~ r s r r zUserDict.__repr__ r r% c t |t r(| j | j |j z S t |t r | j | j |z S t
S r r r r~ r~ r6 r r s r r zUserDict.__or__ sP eX &>>$))ejj"89 9 eT ">>$))e"34 4 r% c t |t r(| j |j | j z S t |t r | j || j z S t
S r r r s r r zUserDict.__ror__ sP eX &>>%**tyy"89 9 eT ">>%$))"34 4 r% c t |t r!| xj |j z c_ | S | xj |z c_ | S r )r r r~ r s r r zUserDict.__ior__ s: eX & II #I
II I r% c | j j | j }|j j | j | j d j |j d< |S Nr~ )r~ r7 rg r r r insts r r{ zUserDict.__copy__ sU ~~%%dnn5
T]]+ $
f 5 : : <
f r% c
| j t u r#t | j j S dd l}| j } i | _ |j | }|| _ |j | |S # || _ w xY wrq )r~ r r~ r r )r r r~ r s r r z
UserDict.copy sk >>X %DIINN ,- -yy DI $A DI DIs A9 9 Bc , | }|D ] }|||< |S r r$ )r< r rE r r* s r r zUserDict.fromkeys s! ECAcF r% r )r! r" r# rC r\ rX rJ rP rT rc r r r r r r{ r r r r$ r% r r r ] s\
r% r c e Zd ZdZd!dZd Zd Zd Zd Zd Z d Z
d
Z d Z d Z
d
Zd Zd Zd Zd Zd Zd ZeZd Zd Zd Zd Zd"dZd Zd Z d Z d Z d Z d Z d Z!d Z"y)#r zAA more or less complete user-defined wrapper around list objects.Nc g | _ |ot | t | j k( r|| j d d y t |t r |j d d | j d d y t | | _ y y r )r~ r r r r )r initlists r rC zUserList.__init__ s` H~dii 0 ' ! Hh/ '}}Q / ! N r% c , t | j S r r r s r r zUserList.__repr__ r r% c > | j | j | k S r r~ _UserList__castr s r r, zUserList.__lt__ yy4;;u---r% c > | j | j | k S r r r s r r* zUserList.__le__ yyDKK ...r% c > | j | j | k( S r r r s r r zUserList.__eq__ r r% c > | j | j | kD S r r r s r r2 zUserList.__gt__ r r% c > | j | j | k\ S r r r s r r0 zUserList.__ge__ r r% c > t |t r |j S |S r )r r r~ r s r __castzUserList.__cast s 'x 8uzzCeCr% c || j v S r r r r s r rc zUserList.__contains__ s tyy r% c , t | j S r r r s r r\ zUserList.__len__ rf r% c | t |t r | j | j | S | j | S r )r slicer~ r~ r is r rX zUserList.__getitem__ s1 a >>$))A,/ /99Q< r% c " || j |< y r r r r r s r rJ zUserList.__setitem__ s ! r% c | j |= y r r r s r rP zUserList.__delitem__ s
IIaLr% c : t |t r(| j | j |j z S t |t | j r | j | j |z S | j | j t | z S r r r r~ r~ r r r s r r7 zUserList.__add__ sn eX &>>$))ejj"89 9
tDII
/>>$))e"34 4~~dii$u+ 566r% c : t |t r(| j |j | j z S t |t | j r | j || j z S | j t | | j z S r r r s r __radd__zUserList.__radd__ sn eX &>>%**tyy"89 9
tDII
/>>%$))"34 4~~d5kDII 566r% c t |t r!| xj |j z
c_ | S t |t | j r| xj |z
c_ | S | xj t | z
c_ | S r )r r r~ r r r s r rK zUserList.__iadd__ sg eX & II #I
tDII
/ II I
IIe $I r% c > | j | j |z S r r~ r~ r ri s r __mul__zUserList.__mul__
~~dii!m,,r% c 0 | xj |z c_ | S r r r s r __imul__zUserList.__imul__ s Q r% c | j j | j }|j j | j | j d d d |j d< |S r )r~ r7 rg r r s r r{ zUserList.__copy__ sQ ~~%%dnn5
T]]+ $
f 5a 8
f r% c : | j j | y r )r~ appendr s r r zUserList.append r% c < | j j || y r )r~ insertr s r r zUserList.insert s D!r% c 8 | j j | S r )r~ rL r s r rL z UserList.pop s yy}}Q r% c : | j j | y r )r~ remover s r r zUserList.remove# r r% c 8 | j j y r )r~ rY r s r rY zUserList.clear& s r% c $ | j | S r r r s r r z
UserList.copy) s ~~d##r% c 8 | j j | S r )r~ r r s r r zUserList.count, s yyt$$r% c < | j j |g| S r r~ r )r r r= s r r zUserList.index/ s tyyt+d++r% c 8 | j j y r )r~ r r s r r zUserList.reverse2 s r% c < | j j |i | y r )r~ sortr r= r> s r r z
UserList.sort5 s %%r% c t |t r&| j j |j y | j j | y r )r r r~ extendr s r r zUserList.extend8 s4 eX & II UZZ ( II U #r% r )#r! r" r# r rC r r, r* r r2 r0 r rc r\ rX rJ rP r7 r rK r __rmul__r r{ r r rL r rY r r r r r r r$ r% r r r s K + .//./D! 77- H " $%, &$r% r c e Zd Zd Zd Zd Zd Zd Zd Zd Z d Z
d Z d
Z d Z
d Zd
Zd Zd Zd Zd Zd Zd ZeZd Zd Zd Zd Zd Zde j: fdZ d Z d Z dFd Z!de j: fd Z"dGd Z#de j: fd Z$d! Z%d" Z&de j: fd#Z'd$ Z(d% Z)d& Z*d' Z+d( Z,d) Z-d* Z.d+ Z/d, Z0d- Z1d. Z2d/ Z3d0 Z4d1 Z5d2 Z6dHd4Z7e8jr Z9d5 Z:dId6Z;de j: fd7Zd: Z?dHd;Z@dJd<ZAdJd=ZBdKd>ZCde j: fd?ZDdHd@ZEdA ZFdB ZGdC ZHdD ZIdE ZJy3)Lr c t |t r|| _ y t |t r|j d d | _ y t | | _ y r )r r r~ r r seqs r rC zUserString.__init__E s7 c3 DI
Z
( DICDIr% c , t | j S r )r r~ r s r __str__zUserString.__str__M rf r% c , t | j S r r r s r r zUserString.__repr__P r r% c , t | j S r )intr~ r s r __int__zUserString.__int__S rf r% c , t | j S r )floatr~ r s r __float__zUserString.__float__V s TYY r% c , t | j S r )complexr~ r s r __complex__zUserString.__complex__Y s tyy!!r% c , t | j S r )hashr~ r s r __hash__zUserString.__hash__\ r r% c " | j d d fS r r r s r r zUserString.__getnewargs___ s ! r% c r t |t r| j |j k( S | j |k( S r r r r~ r strings r r zUserString.__eq__b . fj )99 + +yyF""r% c r t |t r| j |j k S | j |k S r r r s r r, zUserString.__lt__g . fj )99v{{* *yy6!!r% c r t |t r| j |j k S | j |k S r r r s r r* zUserString.__le__l r r% c r t |t r| j |j kD S | j |kD S r r r s r r2 zUserString.__gt__q r r% c r t |t r| j |j k\ S | j |k\ S r r r s r r0 zUserString.__ge__v r r% c V t |t r |j }|| j v S r r )r chars r rc zUserString.__contains__{ s$ dJ '99Dtyy r% c , t | j S r r r s r r\ zUserString.__len__ rf r% c > | j | j | S r r )r r s r rX zUserString.__getitem__ s ~~dii .//r% c t |t r(| j | j |j z S t |t r | j | j |z S | j | j t | z S r )r r r~ r~ r r s r r7 zUserString.__add__ sf eZ (>>$))ejj"89 9
s
#>>$))e"34 4~~dii#e* 455r% c t |t r | j || j z S | j t | | j z S r )r r r~ r~ r s r r zUserString.__radd__ s@ eS !>>%$))"34 4~~c%j499 455r% c > | j | j |z S r r r s r r zUserString.__mul__ r r% c > | j | j |z S r r r r= s r __mod__zUserString.__mod__ s ~~dii$ .//r% c < | j t | | z S r )r~ r )r templates r __rmod__zUserString.__rmod__ s ~~c(md 233r% c T | j | j j S r )r~ r~
capitalizer s r r zUserString.capitalize s ~~dii 2 2 455r% c T | j | j j S r )r~ r~ casefoldr s r r zUserString.casefold ~~dii 0 0 233r% c Z | j | j j |g| S r )r~ r~ centerr widthr= s r r zUserString.center s( ~~ .dii . .u zUserString.isupper r( r% c 8 | j j | S r )r~ r r s r r zUserString.join s yy~~c""r% c Z | j | j j |g| S r )r~ r~ ljustr s r rA zUserString.ljust % ~~odiiooe ;d ;< r rA rD rG r maketransrL r rS rU rW rY r[ r r_ ra r re rh rj rl rn rp r$ r% r r r C s ! " #
"
#
"
#
!
066
- H0464> !dll 0
>
>
2
&'DLL 6= T\\ /
/- !dll 0###%#(#%'####=17
I(E !dll 0
!"t|| 1=)7./. ()dll 8641:16r% r )5r __all__r sysrd itertoolsr r
r
r
r r keywordr r operatorr r r r reprlibr r _weakrefr r9 _collectionsr MutableSequenceregister ImportErrorr r KeysViewr ItemsViewr'
ValuesViewr, r r/ r6 r r r
r r r r r r Sequencer r$ r% r r s
% ' ) + . 5 $5" $$--e4 , (++44 +
, , 6 6 , % - 8 8 % 5F 5}$ }@ (L) 16T kd1 ,r%d r%r
}! .. }!HZ .. ZB~$ // ~$Ju6!** u6q(
| LKLLz sl E "E )E E% E0 E> E E EEE"!E"%E-,E-0E;:E;>FF