ATBB6 d Z g dZddlZddlZddlmZ ddlmZ ddlm
Z ddl m
Z ddlmZ dd lmZ dd
lmZ dd lmZ dd lmZ ej e n # e $ r Y nw xY w dd
lm Z n # e $ r Y nw xY w G d dej Z! G d dej" Z# G d dej$ Z% G d de& Z' G d de( Z) ddlm)Z) n # e $ r Y nw xY w ddlm*Z* n# e $ r d Z*Y nw xY wdddd d Z+d Z, dd lm,Z, n # e $ r Y nw xY w G d d!e( Z- G d" d#ej. Z/ G d$ d%ej. Z0 G d& d'ej Z1 G d( d)ej2 Z3dS )*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 )r c e Zd Zd ZdS )_OrderedDictKeysViewc # > K t | j E d {V d S Nreversed_mappingselfs ;/opt/alt/python311/lib64/python3.11/collections/__init__.py __reversed__z!_OrderedDictKeysView.__reversed__< s. DM*********** N__name__
__module__ __qualname__r r r r r : s# + + + + +r r c e Zd Zd ZdS )_OrderedDictItemsViewc # Z K t | j D ]}|| j | fV d S r r r keys r r z"_OrderedDictItemsView.__reversed__A sD DM** , ,C
c*+ + + + + , ,r Nr r$ r r r& r& ? s# , , , , ,r r& c e Zd Zd ZdS )_OrderedDictValuesViewc # V K t | j D ]}| j | V d S r r r( s r r z#_OrderedDictValuesView.__reversed__G s? DM** % %C-$ $ $ $ $ % %r Nr r$ r r r+ r+ E s# % % % % %r r+ c e Zd ZdZdS )_Link)prevnextr) __weakref__N)r! r" r# __slots__r$ r r r. r. K s 4IIIr r. c B e Zd ZdZd Zd dZej ee fdZej
fdZ
d Z d Z d Z
d d Zd d Zd
Zej j xZZd Zd Zd Zej j Z e ZefdZd dZ e d Z d Z d Z e!d d Z"d Z#d Z$d Z%d Z&dS ) r z)Dictionary that remembers insertion orderc t | }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__rootr/ r0 _OrderedDict__map)clsargskwdsr roots r r6 zOrderedDict.__new__] sN ||C '' #DO 4 44 d $$ DI
r r$ c " | j |fi | dS )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__f s$
e$$t$$$$$r c || vrO | x| j |< }| j }|j }|||c|_ |_ |_ ||_ || |_ || || dS )z!od.__setitem__(i, y) <==> od[i]=yN)r: r9 r/ r0 r) ) r r) value dict_setitemr Linklinkr> lasts r __setitem__zOrderedDict.__setitem__l sw
d??%)TVV +DJsOd;D9D-14 *DIty$( DI d DI T3&&&&&r c || | | j | }|j }|j }||_ ||_ d|_ d|_ dS )z od.__delitem__(y) <==> del od[y]N)r: popr/ r0 )r r) dict_delitemrG link_prev link_nexts r __delitem__zOrderedDict.__delitem__z sW T3 z~~c""I I " " r c # Z K | j }|j }||ur|j V |j }||udS dS )zod.__iter__() <==> iter(od)N)r9 r0 r) r r> currs r __iter__zOrderedDict.__iter__ L {y$ (NNN9D $ r c # Z K | j }|j }||ur|j V |j }||udS dS )z#od.__reversed__() <==> reversed(od)N)r9 r/ r) rQ s r r zOrderedDict.__reversed__ rT r c | j }|x|_ |_ | j t
| dS )z.od.clear() -> None. Remove all items from od.N)r9 r/ r0 r: clearr5 )r r> s r rW zOrderedDict.clear sC { $$ DI
4r Tc | st d | j }|r |j }|j }||_ ||_ n |j }|j }||_ ||_ |j }| j |= t | | }||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)KeyErrorr9 r/ r0 r) r: r5 rK )r rH r> rG rM rN r) rD s r popitemzOrderedDict.popitem s
2011 1{ "9D I !IN!DII9D I!DI !INh JsOs##Ezr c | j | }|j }|j }|j }||_ ||_ | j }|r%|j }||_ ||_ ||_ ||_ dS |j }||_ ||_ ||_ ||_ dS )zMove an existing element to the end (or beginning if last is false).
Raise KeyError if the element does not exist.
N)r: r/ r0 r9 ) r r) rH rG rM rN soft_linkr> firsts r move_to_endzOrderedDict.move_to_end s
z#I I N " " { 9D DI DI!DI DIIIIE DI DI"EJ DIIIr c t j }t | dz } || j }| || j dz z
}| || j |z z
}| || j |z z
}|S )N )_sys getsizeoflen__dict__r: r7 r9 )r sizeofnsizes r
__sizeof__zOrderedDict.__sizeof__ s IIMvdm$$ tz""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 | || }||urF| j | }|j }|j }||_ ||_ d|_ d|_ |S ||u rt
| |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__markerr5 rK r: r/ r0 rY )r r) defaultmarkerresultrG rM rN s r rK 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) rr s r
setdefaultzOrderedDict.setdefault s%
$;;9 S r c | s| j j dS | j j dt | dS )zod.__repr__() <==> repr(od)()()) __class__r! listrm r s r __repr__zOrderedDict.__repr__ sL 7 !^ 4 4 46 6 >222D 4F4F4F4FGGr c | }|rt |t r|\ }}ni }| }| }t t D ].}| |d | |d /|r||f}n|pd}| j d|dt | fS )z%Return state information for picklingNr$ )
__getstate__
isinstancetuplecopyvarsr rK r| iterrm )r stateslotsks r
__reduce__zOrderedDict.__reduce__ s !!##
&%''
$ uuJJLLEJJLLE+--((
#
# !T""" !T""""
& u
~r5$TZZ\\0B0BBBr c , | | 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; iterablerD r r) s r fromkeyszOrderedDict.fromkeys) s. suu C DII r c t |t r>t | | o"t t t | | S t | | S )zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)r r r5 __eq__allmap_eqr rA s r r zOrderedDict.__eq__2 sX
e[ ) ) K;;tU++JCT54I4I0J0J J{{4'''r c 0 | | | S r )updater s r __ior__zOrderedDict.__ior__; s E r c t |t st S | | }| | |S r r r5 NotImplementedr| r r rA news r __or__zOrderedDict.__or__? sB %&& "! !nnT""
5
r c t |t st S | | }| | |S r r r s r __ror__zOrderedDict.__ror__F sB %&& "! !nnU##
4
r )r$ )Tr )'r! r" r# __doc__r6 rB r5 rI r8 r. rO rS r rW rZ r^ ri _collections_abcMutableMappingr r@ rk rm ro __ne__objectrq rK rw _recursive_reprr~ r r classmethodr r r r r r$ r r r r N s // % % % % "&!1e ' ' ' ' -1,< . 2 )7>>FX* * *+ + +, , ,
,
3FvxxH ' , _H H H C C C&$ $ $ [( ( ( r r )r ) _tuplegetterc > t t | | S )N)doc)property _itemgetter)indexr s r r \ s h{5/A/As&K&K&K r F)renamedefaultsmodulec t t r( dd t t t t
j t | } |r|t }t D ]^\ }}|
r(t | s| d s||v rd| |< |
| _| gz D ]n}t | t urt d |
st! d| t | rt! d| ot }D ]V}| d r|st! d| ||v rt! d| |
| Wi }|t# | }t% | t% k rt d
t' t) t t+ t) t) | }t# t t j t% d } d k r| dz
} d
d 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 |j |_ | d
| dd!|| |
||||d" }t D ]/\ }}t
j d#| }t? || ||< 0t | t" f| }|F t
j d j! " d$d% }n# tF t f$ r Y nw xY w|||_$ |S )&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: Nz(Got more default values than field names, r` rz c 3 K | ] }| d V
dS )z=%rNr$ ).0names r z namedtuple.. s( D D$||| D D D D D Dr r{ namedtuple_)
_tuple_new __builtins__r! z
lambda _cls, z: _tuple_new(_cls, (z))r6 zCreate new instance of c | | } | k r"t d dt | |S )Nz Expected z arguments, got ) TypeErrorrd )r; r rt _len
num_fields tuple_news r _makeznamedtuple.._make sQ 3)) 4<<: % % Q
Q QCKK Q QRR R
r z Make a new z# object from a sequence or iterablec | |j | }|r t dt | |S )Nz Got unexpected field names: )r rK
ValueErrorr} )r r= rt _map field_namess r _replacez namedtuple.._replace sO DD; = =>> L JDJJ J JKK 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 8 | j | S )z9Return a new dict which maps field names to their values.)_fields)r _dict_zips r _asdictznamedtuple.._asdict s! uTT$,--...r c | S )z7Return self as a plain tuple. Used by copy and pickle.r$ )r _tuples r __getnewargs__z"namedtuple..__getnewargs__ s vd||r .r$ ) r r2 r _field_defaultsr6 r r r~ r r __match_args__zAlias for field number r! __main__)%r strreplacesplitr} r rb internset enumerate isidentifier
_iskeyword
startswithaddtyper r r rd r5 r zipjoinr6 evalr! r __defaults__r __func__r# r _getframe f_globalsgetAttributeErrorr" ) typenamer r r r seenr r field_defaultsarg_list namespacecoder6 r r r~ r r methodclass_namespacer rt r r r r r r r r s ` @@@@@@@@r r
r
^ s 4 +s## <!))#s3399;; s3 ,,--K{3x==))H
uu$[11 KE4%%''
1 d##
1??3''
1 4<<%0[[ E" HHTNNNN
[( 3 3 ::S HII I "" 7 6-1 6 6 7 7
7 d 3 2)- 2 2 3 3
3 3 55D ??3 * * ) $ ) ) * *
* 4<< J$ J JKK K N?? x==3{++ + + FGG G htC0E0E080B0B-D -D (E (E F F G G DK5566K[!!Jyy%%HQCTYY D D D D DDDDsJH
I&*E3S&@#E64t
,(,, I
F8 E E E E ED4##G GFFF8FFFGO ' [ ,H , , ,EN 1 1 1 1H9 9 9 9 9/ / / / / /
> > "* = =FO = =
,,,,, ) (% O !-- 9 9 tk;E;;<< ,UC 8 8
(UHo
6
6F ~ ^A&&044ZLLFF
+ D
" Ms 7-Q% %Q98Q9c B | j }|D ]} ||d dz | |< dS )z!Tally elements from the iterable.r r` N)r )mappingr mapping_getelems r _count_elementsr
s> +K 1 1# D!,,q0
1 1r )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)]
Nc d t | j |fi | dS )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)superrB r )r r r= r| s r rB zCounter.__init__K s; H%%%%%%%r c dS )z1The count of elements not in the Counter is zero.r r$ r( s r __missing__zCounter.__missing__Y s qr c D t | S )zSum of the counts)sumro r s r totalz
Counter.total^ s 4;;==!!!r c |1t | t d d S ddl}| || 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)]
Nr` T)r) reverser )r) )sortedrm r heapqnlargest)r rg r s r most_commonzCounter.most_commonb s]
9$**,,KNNDIII I ~~a ;q>>~BBBr c t t j t t | 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_repeatrm r s r elementszCounter.elementsr s' $ #HWdjjll$C$CDDDr c t d )Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)NotImplementedError)r; r vs r r zCounter.fromkeys s " NP P Pr c B |t |t j rX| r4| j }| D ]\ }}| ||d z | |< n2t | nt | | |r| | dS dS )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 rm r r r )r r r= self_getr countr| s r r zCounter.update s ( ($4$<==
0 - #xH'/~~'7'7 ? ? e%*XXdA->->%>T
? GGNN8,,,, h/// KK r c |e| j }t |t j r-| D ]\ }} ||d |z
| |< n|D ]} ||d dz
| |< |r| | dS dS )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 r` )r r r r rm subtract)r r r= r r r s r r zCounter.subtract s xH($4$<==
7#+>>#3#3 ; ;KD%!)$!2!2U!:DJJ; % 7 7D!)$!2!2Q!6DJJ MM$ r c , | | S )zReturn a shallow copy.r r s r r z Counter.copy r r c 0 | j t | ffS r )r| r5 r s r r zCounter.__reduce__ s ~T
},,r c V || v r#t | dS dS )zGLike dict.__delitem__() but does not raise KeyError for missing values.N)r rO )r r r| s r rO zCounter.__delitem__ s1 4<< GG % % % % % . = II1qII!47eAh&IIIIIIIr r r r r r s ``r r zCounter.__eq__
F %)) "! !IIIIIu
IIIIIIr c H 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 z t t st S t fd fD S )z:True if all counts in self are a subset of those in other.c 3 F K | ]}|D ]}| | k V d S r r$ r s r r z!Counter.__le__.. r r r r s ``r __le__zCounter.__le__ r! r c R t |t st S | |k o| |k 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 z t t st S t fd fD S )z.& r r r r s ``r __ge__zCounter.__ge__" r! r c R t |t st S | |k o| |k S )zCTrue if all counts in self are a proper superset of those in other.r# r s r __gt__zCounter.__gt__( r) r c t |t st S t }| D ]\ }}||| z }|dk r|||< | D ]\ }}|| vr |dk r|||< |S )zAdd counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
r r r r rm r rA rt r r newcounts r __add__zCounter.__add__. s %)) "! ! ::<< ( (KD% uT{*H!|| 't ;;== % %KD%4 EAII $t
r c t |t st S t }| D ]\ }}||| z
}|dk r|||< | D ]\ }}|| vr|dk rd|z
||< |S )z Subtract count, but keep only results with positive counts.
>>> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
r r0 r1 s r __sub__zCounter.__sub__A s %)) "! ! ::<< ( (KD% uT{*H!|| 't ;;== ) )KD%4 EAII 5yt
r c t |t st S t }| D ]"\ }}|| }||k r|n|}|dk r|||< #| D ]\ }}|| vr |dk r|||< |S )zUnion is the maximum of value in either of the input counters.
>>> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
r r0 r rA rt r r other_countr2 s r r zCounter.__or__T s %)) "! ! ::<< ( (KD% +K&+k&9&9{{uH!|| 't ;;== % %KD%4 EAII $t
r c t |t st S t }| D ]"\ }}|| }||k r|n|}|dk r|||< #|S )z Intersection is the minimum of corresponding counts.
>>> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
r r0 r7 s r __and__zCounter.__and__h st %)) "! ! ::<< ( (KD% +K % 3 3uuH!|| 't
r c l t }| D ]\ }}|dk r|||< |S )zEAdds an empty counter, effectively stripping negative and zero countsr r rm r rt r r s r __pos__zCounter.__pos__y s> ::<< % %KD%qyy $t
r c r t }| D ]\ }}|dk rd|z
||< |S )z{Subtracts from an empty counter. Strips positive and zero counts,
and flips the sign on negative counts.
r r< r= s r __neg__zCounter.__neg__ sD
::<< ) )KD%qyy 5yt
r c R d | D }|D ]}| |= | S )z?Internal method to strip elements with a negative or zero countc $ g | ]
\ }}|d k |S )r r$ )r r r s r
z*Counter._keep_positive.. s! MMM e5199t999r )rm )r nonpositiver s r _keep_positivezCounter._keep_positive s: MMtzz||MMM DT
r c ~ | D ]\ }}| |xx |z
cc< | S )zInplace add from another counter, keeping only positive counts.
>>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
rm rE r rA r r s r __iadd__zCounter.__iadd__ I !;;== KD% JJJ% JJJJ""$$$r c ~ | D ]\ }}| |xx |z cc< | S )zInplace subtract counter, but keep only results with positive counts.
>>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
rG rH s r __isub__zCounter.__isub__ rJ r c | D ]\ }}| | }||k r|| |< | 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})
rG )r rA r r8 r s r r zCounter.__ior__ sP "' ) ) D+JEU"" (T
""$$$r c | D ]\ }}|| }||k r|| |< | S )zInplace intersection is the minimum of corresponding counts.
>>> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
rG )r rA r r r8 s r __iand__zCounter.__iand__ sO ::<< ) )KD% +KU"" (T
""$$$r r )#r! r" r# r rB r r r r r r r r r r rO r~ r r r& r( r, r. r3 r5 r r: r> r@ rE rI rL r rO
__classcell__r s @r r r s6 * *d & & & & & &
" " "C C C C E E E, P P P [ P D 6$ $ $- - -& & & & &
3 3 3ZJ J J ! ! ! J J J / / / J 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 dS )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 4 t | pi g| _ dS )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 rS s r rB zChainMap.__init__ s
JJ&2$ r c t | r )rY r( s r r zChainMap.__missing__ s smmr c t | j D ] } || c S # t $ r Y w xY w| | S r )rS rY r )r r) r s r __getitem__zChainMap.__getitem__ s\ y G
s|###
$$$s
""Nc || v r| | n|S r r$ rv s r r z ChainMap.get s 4KKtCyyW4r c R t t j | j S r )rd r unionrS r s r __len__zChainMap.__len__ s ;355; *+++r c i }t | j D ]/}| t | 0t | S r )r rS r r5 r r )r r r s r rS zChainMap.__iter__ sL ** - -G
HHT]]7++ , , , ,Awwr c D t fd| j D S )Nc 3 K | ]}|v V d S r r$ )r mr) s r r z(ChainMap.__contains__.. s' //3!8//////r anyrS r( s `r __contains__zChainMap.__contains__ s( ////TY//////r c * t | j S r r_ r s r __bool__zChainMap.__bool__ 49~~ r c | | j j dd t t | j dS )Nrz r r{ )r| r! r r reprrS r s r r~ zChainMap.__repr__ s6 .)NNDIIc$ 6J6J,K,KNNNNr c 8 | t j |g|R S )z?Create a ChainMap with a single dict created from the iterable.)r5 r )r; r r< s r r zChainMap.fromkeys s& s4=1D111222r c r | j | j d g| j dd R S )zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]r r` N)r| rS r r s r r z
ChainMap.copy s8 t~dil / / 1 1BDIabbMBBBBr c ` ||}n|r| | | j |g| j R 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| rS )r r^ kwargss r new_childzChainMap.new_child sF
9AA
HHV t~a,$),,,,r c 0 | j | j dd S )zNew ChainMap from maps[1:].r` N)r| rS r s r parentszChainMap.parents s t~ty}--r c & || j d |< d S Nr )rS )r r) rD s r rI zChainMap.__setitem__! s ! ! Sr c d | j d |= d S # t $ r t d| w xY w)Nr $Key not found in the first mapping: )rS rY r( s r rO zChainMap.__delitem__$ sR K ! S!!! K K KI#IIJJ J Ks /c | | j d 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.)rS rZ rY r s r rZ zChainMap.popitem* sN B9Q<'')) ) B B B@AA A Bs ! ;c v | j d j |g|R 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 rq )rS rK rY )r r) r< s r rK z ChainMap.pop1 s_ K#49Q<#C/$/// / K K KI#IIJJ J Ks 8c D | j d dS )z'Clear maps[0], leaving maps[1:] intact.r N)rS rW r s r rW zChainMap.clear8 s ! r c F | j d | | S ro )rS r r s r r zChainMap.__ior__< s! ! E""" r c t |t j st S | }|j d | |S ro )r r r r r rS r )r rA r^ s r r zChainMap.__or__@ sJ %!1!9:: "! ! IIKK q r c t |t j st S t | }t | j D ]}| | | | S r ) r r r r r5 r rS r r| )r rA r^ childs r r zChainMap.__ror__G se %!1!9:: "! ! KK di(( E
HHUOOOO~~a r r ) r! r" r# r rB r rV r rZ rS ra rc r r~ r r r __copy__rk r rm rI rO rZ rK rW r r r r$ r r r r s ' ' ' % % %5 5 5 5, , , 0 0 0 _O O O 3 3 [3C C C H - - - - . . X." " "K K K B B BK K K ! ! ! ! !r r c v e Zd ZddZd Zd Zd Zd Zd Zd Z d Z
d
Z d Z d Z
d
Zd Zedd ZdS )r Nc t i | _ || | |r| | d S d S r )datar )r r5 rj s r rB zUserDict.__init__W sK KK KK r c * t | j S r rd r| r s r rZ zUserDict.__len__^ rd r c || j v r
| j | S t | j d r| j | | S t | )Nr )r| hasattrr| r rY r( s r rV zUserDict.__getitem__a sS $) 9S> ! 4>= 1 1 9>--dC88 8smmr c || j |< d S r r| )r r) items r rI zUserDict.__setitem__h s #r c | j |= d S r r r( s r rO zUserDict.__delitem__k s IcNNNr c * t | j S r )r r| r s r rS zUserDict.__iter__n DI r c || j v S r r r( s r ra zUserDict.__contains__r s di r c * t | j S r rf r| r s r r~ zUserDict.__repr__v r r c t |t r"| | j |j z S t |t r | | j |z S t
S r r r r| r| r5 r r s r r zUserDict.__or__y s` eX & & :>>$)ej"899 9 eT " " 5>>$)e"344 4 r c t |t r"| |j | j z S t |t r | || j z S t
S r r r s r r zUserDict.__ror__ s` eX & & :>>%*ty"899 9 eT " " 5>>%$)"344 4 r c | t |t r| xj |j z c_ n| xj |z c_ | S r )r r r| r s r r zUserDict.__ior__ s= eX & & II #III II II r c | j | j }|j | j | j d |j d< |S Nr| )r| r6 re r r r insts r ry zUserDict.__copy__ sU ~%%dn55
T]+++ $
f 5 : : < <
f r c | j t u r&t | j S dd l}| j } i | _ | | }|| _ n # || _ w xY w| | |S ro )r| r r| r r )r r r| r s r r z
UserDict.copy s >X % %DINN , ,-- - y DI $A DIIDI s A% % A.c . | }|D ]}|||< |S r r$ )r; r rD r r) s r r zUserDict.fromkeys s, CEE CAcFFr r )r! r" r# rB rZ rV rI rO rS ra r~ r r r ry r r r r$ r r r r T 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"dS )$r zAA more or less complete user-defined wrapper around list objects.Nc
g | _ |yt | t | j k r|| j d d < d S t |t r|j d d | j d d < d S t | | _ d S d S r )r| r r r r} )r initlists r rB zUserList.__init__ s H~~di 00 ' !!! Hh//
+ '}QQQ / !!! NN r c * t | j S r r r s r r~ zUserList.__repr__ r r c > | j | | k S r r| _UserList__castr s r r( zUserList.__lt__ y4;;u----r c > | j | | k S r r r s r r& zUserList.__le__ yDKK . ...r c > | j | | k S r r r s r r zUserList.__eq__ r r c > | j | | k S r r r s r r. zUserList.__gt__ r r c > | j | | k S r r r s r r, zUserList.__ge__ r r c > t |t r|j n|S r )r r r| r s r __castzUserList.__cast s 'x 8 8CuzzeCr c || j v S r r r r s r ra zUserList.__contains__ s ty r c * t | j S r r~ r s r rZ zUserList.__len__ rd r c t |t r | | j | S | j | S r )r slicer| r| r is r rV zUserList.__getitem__ s8 a >>$)A,// /9Q< r c || j |< d S r r r r r s r rI zUserList.__setitem__ s ! r c | j |= d S r r r s r rO zUserList.__delitem__ s IaLLLr c B t |t r"| | j |j z S t |t | j r | | j |z S | | j t | z S r r r r| r| r r} r s r r3 zUserList.__add__ s eX & & 5>>$)ej"899 9
tDI
/
/ 5>>$)e"344 4~~di$u++ 5666r c B t |t r"| |j | j z S t |t | j r | || j z S | t | | j z S r r r s r __radd__zUserList.__radd__ s eX & & 5>>%*ty"899 9
tDI
/
/ 5>>%$)"344 4~~d5kkDI 5666r c t |t r| xj |j z
c_ nPt |t | j r| xj |z
c_ n | xj t | z
c_ | S r )r r r| r r} r s r rI zUserList.__iadd__ so eX & & % II #III
tDI
/
/ % II III IIe $II r c < | | j |z S r r| r| r rg s r __mul__zUserList.__mul__ ~~di!m,,,r c & | xj |z c_ | S r r r s r __imul__zUserList.__imul__ s Q r c | j | j }|j | j | j d d d |j d< |S r )r| r6 re r r s r ry zUserList.__copy__ sR ~%%dn55
T]+++ $
f 5aaa 8
f r c : | j | d S r )r| appendr s r r zUserList.append
r c < | j || d S r )r| insertr s r r zUserList.insert
s D!!!!!r c 6 | j | S r )r| rK r s r rK z UserList.pop s y}}Q r c : | j | d S r )r| remover s r r zUserList.remove r r c 8 | j d S r )r| rW r s r rW zUserList.clear s r c , | | S r r r s r r z
UserList.copy s ~~d###r c 6 | j | S r )r| r r s r r zUserList.count s yt$$$r c ( | j j |g|R S r r| r )r r r< s r r zUserList.index s tyt+d++++r c 8 | j d S r )r| r r s r r zUserList.reverse" s r c * | j j |i | d S r )r| sortr r< r= s r r z
UserList.sort% s! %%%%%%r c t |t r!| j |j d S | j | d S r )r r r| extendr s r r zUserList.extend( sN eX & & $ I UZ ( ( ( ( ( I U # # # # #r r r )#r! r" r# r rB r~ r( r& r r. r, r ra rZ rV rI rO r3 r rI r __rmul__r ry r r rK r rW r r r r r r r$ r r r r s KK + + + + . . ./ / // / /. . ./ / /D D D! ! ! 7 7 77 7 7 - - - H " " " $ $ $% % %, , , & & &$ $ $ $ $r r c 4 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 dKd Z!de j fd Z"dLd"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/ Z0d0 Z1d1 Z2d2 Z3d3 Z4d4 Z5d5 Z6dMd7Z7e8j9 Z9d8 Z:dNd:Z;de j fd;Zd> Z?dMd?Z@dOd@ZAdOdAZBdPdCZCde j fdDZDdMdEZEdF ZFdG ZGdH ZHdI ZIdJ ZJd6S )Qr c t |t r || _ d S t |t r|j d d | _ d S t | | _ d S r )r r r| r r seqs r rB zUserString.__init__5 sW c3 !DIII
Z
(
( ! DIIICDIIIr c * t | j S r )r r| r s r __str__zUserString.__str__= rd r c * t | j S r r r s r r~ zUserString.__repr__@ r r c * t | j S r )intr| r s r __int__zUserString.__int__C rd r c * t | j S r )floatr| r s r __float__zUserString.__float__F s TY r c * t | j S r )complexr| r s r __complex__zUserString.__complex__I s ty!!!r c * t | j S r )hashr| r s r __hash__zUserString.__hash__L r r c " | j d d fS r r r s r r zUserString.__getnewargs__O s !!! r c b t |t r| j |j k S | j |k S r r r r| r strings r r zUserString.__eq__R 0 fj ) ) ,9 + +yF""r c b t |t r| j |j k S | j |k S r r r s r r( zUserString.__lt__W 0 fj ) ) +9v{* *y6!!r c b t |t r| j |j k S | j |k S r r r s r r& zUserString.__le__\ r r c b t |t r| j |j k S | j |k S r r r s r r. zUserString.__gt__a r r c b t |t r| j |j k S | j |k S r r r s r r, zUserString.__ge__f r r c L t |t r|j }|| j v S r r )r chars r ra zUserString.__contains__k s( dJ ' ' 9Dty r c * t | j S r r~ r s r rZ zUserString.__len__p rd r c B | | j | S r r )r r s r rV zUserString.__getitem__s s ~~di .///r c ( t |t r"| | j |j z S t |t r | | j |z S | | j t | z S r )r r r| r| r r s r r3 zUserString.__add__v sy eZ ( ( 5>>$)ej"899 9
s
#
# 5>>$)e"344 4~~di#e** 4555r c t |t r | || j z S | t | | j z S r )r r r| r| r s r r zUserString.__radd__} sL eS ! ! 5>>%$)"344 4~~c%jj49 4555r c < | | j |z S r r r s r r zUserString.__mul__ r r c < | | j |z S r r r r< s r __mod__zUserString.__mod__ s ~~di$ .///r c L | t | | z S r )r| r )r templates r __rmod__zUserString.__rmod__ s ~~c(mmd 2333r c Z | | j S r )r| r|
capitalizer s r r zUserString.capitalize s" ~~di 2 2 4 4555r c Z | | j S r )r| r| casefoldr s r r zUserString.casefold " ~~di 0 0 2 2333r c N | | j j |g|R S r )r| r| centerr widthr< s r r zUserString.center s, ~~ .di .u > > !dl 0 0 0 0
> > >
> > >
2 2 2 2
&'DL 6 6 6 6= = = = T\ / / / /
/ / /- - - !dl 0 0 0 0# # ## # ## # #% % %# # #( ( (# # #% % %' ' '# # ## # ## # ## # #= = =1 1 17 7 7 7
I( ( (E E E E !dl 0 0 0 0
!"t| 1 1 1 1= = =) ) )7 7 7 7. . . ./ / / /. . . . ()dl 8 8 8 86 6 6 64 4 41 1 1: : :1 1 16 6 6 6 6r r )4r __all__r sysrb itertoolsr r r
r
r r keywordr r operatorr r r r reprlibr r _weakrefr r8 _collectionsr MutableSequenceregister ImportErrorr KeysViewr ItemsViewr&
ValuesViewr+ r r. r5 r r r
r r r r r r Sequencer r$ r r r sK
% % % % % % ' ' ' ' ' ' ) ) ) ) ) ) + + + + + + . . . . . . 5 5 5 5 5 5 $ $ $ $ $ $5"""""" $--e4444 D
((((((( D + + + + ++4 + + +
, , , , , , 6 , , , % % % % % - 8 % % % 5 5 5 5 5F 5 5 5} } } } }$ } } }@ ((((((( D L))))))) L L LKKLLLL 16T h h h h h^1 1 1 ,,,,,,, D q% q% q% q% q%d q% q% q%p
}! }! }! }! }! . }! }! }!HS S S S S . S S St~$ ~$ ~$ ~$ ~$ / ~$ ~$ ~$Ju6 u6 u6 u6 u6!* u6 u6 u6 u6 u6sZ A! !A)(A)-A4 4A<;A<C C$#C$(C/ /C:9C: D DD