B
Vva=Ã Øã @ sú d Z ddddddddd g Zd
d lZd
d lmZmZ d
d
lm Z
d
d l Z d
d l
Zd
dlmZ d
dlmZmZmZ d
dlmZ yd
dl m Z W n e k
rž Y nX ej e ¡ yd
dl m!Z! W n e k
rÐ Y nX dd„ Z"G dd„ dej#ƒZ$G dd„ dej%ƒZ&G dd„ dej'ƒZ(G dd „ d e)ƒZ*G d d„ de+ƒZ,yd
d l m,Z, W n e k
rV Y nX i Z-d d d d œd!d„Z.d"d#„ Z/yd
d$l m/Z/ W n e k
rœ Y nX G d%d„ de+ƒZ0G d&d „ d ej1ƒZ2G d'd„ dej1ƒZ3G d(d„ dej ƒZ4G d)d„ dej5ƒZ6d S )*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
ÚdequeÚ defaultdictÚ
namedtupleÚUserDictÚUserListÚ
UserStringÚCounterÚ OrderedDictÚChainMapé N)Ú
itemgetterÚeq)Ú iskeyword)Úproxy)ÚrepeatÚchainÚstarmap)Úrecursive_repr)r )r c C sR | t jkr:tt | ƒ}dd l}|jdtdd |tƒ | < |S tdt›d| ›ƒ‚d S )Nr
zUsing or importing the ABCs from 'collections' instead of from 'collections.abc' is deprecated since Python 3.3,and in 3.9 it will stop workingé )Ú
stacklevelzmodule z has no attribute ) Ú_collections_abcÚ__all__ÚgetattrÚwarningsÚwarnÚDeprecationWarningÚglobalsÚAttributeErrorÚ__name__)ÚnameÚobjr © r ú9/opt/alt/python37/lib64/python3.7/collections/__init__.pyÚ __getattr__* s
r" c @ s e Zd Zdd„ ZdS )Ú_OrderedDictKeysViewc c s t | jƒE d H d S )N)ÚreversedÚ_mapping)Úselfr r r! Ú __reversed__? s z!_OrderedDictKeysView.__reversed__N)r Ú
__module__Ú __qualname__r' r r r r! r# = s r# c @ s e Zd Zdd„ ZdS )Ú_OrderedDictItemsViewc c s( x"t | jƒD ]}|| j| fV q W d S )N)r$ r% )r& Úkeyr r r! r' D s z"_OrderedDictItemsView.__reversed__N)r r( r) r' r r r r! r* B s r* c @ s e Zd Zdd„ ZdS )Ú_OrderedDictValuesViewc c s$ x t | jƒD ]}| j| V q W d S )N)r$ r% )r& r+ r r r! r' J s z#_OrderedDictValuesView.__reversed__N)r r( r) r' r r r r! r, H s r, c @ s e Zd ZdZdS )Ú_Link)ÚprevÚnextr+ Ú __weakref__N)r r( r) Ú __slots__r r r r! r- N s r- c @ sè e Zd ZdZdd„ Zejeefdd„Zej fdd„Z dd „ Z
d
d „ Z d d
„ Z d*dd„Z
d+dd„Zdd„ Zejj ZZdd„ Zdd„ Zdd„ ZejjZeƒ Zefdd „Zd,d d „Ze ƒ d d!„ ƒZ d"d#„ Z d$d%„ Z e d-d&d'„ƒZ!d(d)„ Z"d S ).r z)Dictionary that remembers insertion orderc O sŠ | s t dƒ‚| ^}} t| ƒdkr0t dt| ƒ ƒ‚y
|j W n> tk
rx tƒ |_t|jƒ |_}| |_|_i |_ Y nX |j
| |Ž dS )zŒInitialize an ordered dictionary. The signature is the same as
regular dictionaries. Keyword argument order is preserved.
z?descriptor '__init__' of 'OrderedDict' object needs an argumenté z$expected at most 1 arguments, got %dN) Ú TypeErrorÚlenÚ_OrderedDict__rootr r- Ú_OrderedDict__hardrootÚ_proxyr. r/ Ú_OrderedDict__mapÚ_OrderedDict__update)ÚargsÚkwdsr& Úrootr r r! Ú__init__` s
zOrderedDict.__init__c C sZ || krJ|ƒ | j |< }| j}|j}||| |_|_|_||_||ƒ|_|| ||ƒ dS )z!od.__setitem__(i, y) <==> od[i]=yN)r8 r5 r. r/ r+ ) r& r+ ÚvalueZ dict_setitemr ZLinkÚlinkr< Úlastr r r! Ú __setitem__s s
zOrderedDict.__setitem__c C s> || |ƒ | j |¡}|j}|j}||_||_d|_d|_dS )z od.__delitem__(y) <==> del od[y]N)r8 Úpopr. r/ )r& r+ Z dict_delitemr? Ú link_prevÚ link_nextr r r! Ú __delitem__ s
zOrderedDict.__delitem__c c s, | j }|j}x||k r&|jV |j}qW dS )zod.__iter__() <==> iter(od)N)r5 r/ r+ )r& r< Úcurrr r r! Ú__iter__Ž s
zOrderedDict.__iter__c c s, | j }|j}x||k r&|jV |j}qW dS )z#od.__reversed__() <==> reversed(od)N)r5 r. r+ )r& r< rF r r r! r' — s
zOrderedDict.__reversed__c C s* | j }| |_|_| j ¡ t | ¡ dS )z.od.clear() -> None. Remove all items from od.N)r5 r. r/ r8 ÚclearÚdict)r& r< r r r! rH s
zOrderedDict.clearTc C sj | s t dƒ‚| j}|r0|j}|j}||_||_n|j}|j}||_||_|j}| j|= t | |¡}||fS )z•Remove 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)ÚKeyErrorr5 r. r/ r+ r8 rI rB )r& r@ r< r? rC rD r+ r> r r r! Úpopitem§ s zOrderedDict.popitemc C st | j | }|j}|j}|j}||_||_| j}|rR|j}||_||_||_||_n |j}||_||_||_||_dS )z„Move an existing element to the end (or beginning if last is false).
Raise KeyError if the element does not exist.
N)r8 r. r/ r5 ) r& r+ r@ r? rC rD Z soft_linkr< Úfirstr r r! Ú move_to_end¾ s$
zOrderedDict.move_to_endc C sV t j}t| ƒd }|| jƒ}||| jƒd 7 }||| jƒ| 7 }||| jƒ| 7 }|S )Nr2 r )Ú_sysÚ getsizeofr4 Ú__dict__r8 r6 r5 )r& ZsizeofÚnÚsizer r r! Ú
__sizeof__× s
zOrderedDict.__sizeof__c C s t | ƒS )z:D.keys() -> a set-like object providing a view on D's keys)r# )r& r r r! Úkeysâ s zOrderedDict.keysc C s t | ƒS )z a set-like object providing a view on D's items)r* )r& r r r! Úitemsæ s zOrderedDict.itemsc C s t | ƒS )z6D.values() -> an object providing a view on D's values)r, )r& r r r! Úvaluesê s zOrderedDict.valuesc C s0 || kr| | }| |= |S || j kr,t|ƒ‚|S )z²od.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.
)Ú_OrderedDict__markerrJ )r& r+ ÚdefaultÚresultr r r! rB ò s
zOrderedDict.popNc C s || kr| | S || |< |S )z™Insert 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+ rX r r r! Ú
setdefault s zOrderedDict.setdefaultc C s* | sd| j jf S d| j jt| ¡ ƒf S )zod.__repr__() <==> repr(od)z%s()z%s(%r))Ú __class__r ÚlistrU )r& r r r! Ú__repr__
s zOrderedDict.__repr__c C sH t | ƒ ¡ }x t tƒ ƒD ]}| |d¡ qW | jd|p8ddt| ¡ ƒfS )z%Return state information for picklingNr )ÚvarsÚcopyr rB r[ ÚiterrU )r& Z inst_dictÚkr r r! Ú
__reduce__ s zOrderedDict.__reduce__c C s
| | ¡S )z!od.copy() -> a shallow copy of od)r[ )r& r r r! r_ s zOrderedDict.copyc C s | ƒ }x|D ] }|||< q W |S )zYCreate a new ordered dictionary with keys from iterable and values set to value.
r )ÚclsÚiterabler> r& r+ r r r! Úfromkeys s
zOrderedDict.fromkeysc C s2 t |tƒr&t | |¡o$ttt| |ƒƒS t | |¡S )z“od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)Ú
isinstancer rI Ú__eq__ÚallÚmapÚ_eq)r& Úotherr r r! rg % s
zOrderedDict.__eq__)T)T)N)N)#r r( r) Ú__doc__r= rI rA r7 r- rE rG r' rH rK rM rS r ÚMutableMappingÚupdater9 rT rU rV Ú__ne__ÚobjectrW rB rZ Ú_recursive_reprr] rb r_ Ú classmethodre rg r r r r! r Q s0
)r F)ÚrenameÚdefaultsÚmodulec sº t ˆtƒrˆ dd¡ ¡ ‰tttˆƒƒ‰t t| ƒ¡} |rtƒ }xNt ˆƒD ]B\}}|
¡ rtt |ƒst| d¡st||kr‚d|› ˆ|< |
|¡ qJW xR| gˆ D ]D}t|ƒtk r´tdƒ‚|
¡ sÊtd|›ƒ‚t |ƒrœtd|›ƒ‚qœW tƒ }xNˆD ]F}| d¡r|std|›ƒ‚||kr,td|›ƒ‚|
|¡ qðW i }|d k rˆt|ƒ}t|ƒtˆƒkrjtd
ƒ‚tttttˆƒt|ƒƒƒƒƒ}tttjˆƒƒ‰tˆƒ‰tˆƒ d d ¡d
d… } dd dd„ ˆD ƒ¡ d ‰tj‰t‰ d| › d| › d}
ˆd| › dœ} t|
| ƒ | d } d| › d| › d| _|d k r6|| _t ‡ ‡‡fdd „ƒ}
d | › d |
j _‡fd d „}d!| › d"|_‡fd#d$„}d%d&„ }d'd(„ }x.| |
j ||||fD ]}| › d)|j › |_ q¤W | › d| › dd*ˆ||| |
||||d+œ }t }xlt ˆƒD ]`\}}y|| \}}W n4 t!k
rB t"|ƒ}d,|› }||f||< Y nX t#||d-||< qöW t| tf|ƒ}|d kr¦yt $d
¡j% &d.d/¡}W n t'tfk
r¤ Y nX |d k r¶||_(|S )0aC 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ú'Ú r2 éÿÿÿÿú(z, c s s | ]}|› d V qdS )z=%rNr )Ú.0r r r r! ú „ s z namedtuple..ú)zdef __new__(_cls, z ): return _tuple_new(_cls, (z))Ú namedtuple_)Ú
_tuple_newr Ú__new__zCreate new instance of c s2 ˆ| |ƒ}ˆ |ƒˆkr.t dˆ› dt|ƒ› ƒ‚|S )Nz Expected z arguments, got )r3 r4 )rc rd rY )Ú_lenÚ
num_fieldsÚ tuple_newr r! Ú_make“ s
znamedtuple.._makez Make a new z# object from a sequence or iterablec s. | t|jˆ | ƒ¡}|r*tdt|ƒ›ƒ‚|S )Nz Got unexpected field names: )r† ri rB Ú
ValueErrorr\ )Ú_selfr; rY )Ú field_namesr r! Ú_replace s z namedtuple.._replacez
Return a new z2 object replacing specified fields with new valuesc s | j jˆ | S )z/Return a nicely formatted representation string)r[ r )r& )Úrepr_fmtr r! r] ¦ s z namedtuple..__repr__c S s t t| j| ƒƒS )z@Return a new OrderedDict which maps field names to their values.)r ÚzipÚ_fields)r& r r r! Ú_asdictª s znamedtuple.._asdictc S s t | ƒS )z7Return self as a plain tuple. Used by copy and pickle.)Útuple)r& r r r! Ú__getnewargs__® s z"namedtuple..__getnewargs__Ú.r ) rl r1 r Ú_field_defaultsÚ_fields_defaultsr‚ r† rŠ r] rŽ r zAlias for field number )Údocr Ú__main__))rf ÚstrÚreplaceÚsplitr\ ri rN ÚinternÚsetÚ enumerateÚ isidentifierÚ
_iskeywordÚ
startswithÚaddÚtyper3 r‡ r r4 rI r$ rŒ ÚreprÚjoinr‚ Úexecrl Ú __defaults__rr Ú__func__r r) Ú_nt_itemgettersrJ Ú _itemgetterÚpropertyÚ _getframeÚ f_globalsÚgetr r( )Útypenamer‰ rs rt ru ÚseenÚindexr Úfield_defaultsÚarg_listÚsÚ namespacer‚ r† rŠ r] rŽ r ÚmethodÚclass_namespaceÚcacheÚitemgetter_objectr” rY r )rƒ r‰ r„ r‹ r… r! r < s¬
c C s* | j }x |D ]}||dƒd | |< q W dS )z!Tally elements from the iterable.r
r2 N)r« )Úmappingrd Z mapping_getÚelemr r r! Ú_count_elementsè s
r¹ )r¹ c sØ e Zd ZdZ‡ fdd„Zdd„ Zd/dd„Zd d
„ Zed0d d „ƒZ ‡ fd
d„Z
dd„ Z dd„ Z dd„ Z
‡ fdd„Zdd„ Zdd„ Zdd „ Zd d „ Zd d „ Zd!d"„ Zd#d$„ Zd%d&„ Zd'd(„ Zd)d*„ Zd+d,„ Zd-d.„ Z‡ ZS )1r 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 sN | s t dƒ‚| ^}} t| ƒdkr0t dt| ƒ ƒ‚tt|ƒ ¡ |j| |Ž 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
z;descriptor '__init__' of 'Counter' object needs an argumentr2 z$expected at most 1 arguments, got %dN)r3 r4 Úsuperr r= rn )r: r; r& )r[ r r! r= & s zCounter.__init__c C s dS )z1The count of elements not in the Counter is zero.r
r )r& r+ r r r! Ú __missing__: s zCounter.__missing__Nc C s6 |dkr t | ¡ tdƒddS tj|| ¡ tdƒdS )zðList 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('abcdeabcdabcaba').most_common(3)
[('a', 5), ('b', 4), ('c', 3)]
Nr2 T)r+ Úreverse)r+ )ÚsortedrU r§ Ú_heapqÚnlargest)r& rQ r r r! Ú most_common? s zCounter.most_commonc C s t tt| ¡ ƒ¡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
>>> prime_factors = Counter({2: 2, 3: 3, 17: 1})
>>> product = 1
>>> for factor in prime_factors.elements(): # loop over factors
... product *= factor # and multiply them
>>> product
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Ú_repeatrU )r& r r r! ÚelementsL s zCounter.elementsc C s t dƒ‚d S )Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)ÚNotImplementedError)rc rd Úvr r r! re d s zCounter.fromkeysc s¶ | s t dƒ‚| ^}} t| ƒdkr0t dt| ƒ ƒ‚| r<| d nd}|dk r¤t|tjƒrš|rˆ|j}x8| ¡ D ]\}}|||dƒ ||< qhW q¤tt|ƒ |¡ n
t
||ƒ |r²| |¡ 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
z9descriptor 'update' of 'Counter' object needs an argumentr2 z$expected at most 1 arguments, got %dr
N) r3 r4 rf r ÚMappingr« rU rº r rn r¹ )r: r; r& rd Úself_getr¸ Úcount)r[ r r! rn k s
zCounter.updatec O s¶ | s t dƒ‚| ^}} t| ƒdkr0t dt| ƒ ƒ‚| r<| d nd}|dk r¤|j}t|tjƒr„xH| ¡ D ]\}}||dƒ| ||< qdW n x |D ]}||dƒd ||< qŠW |r²| |¡ 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
z;descriptor 'subtract' of 'Counter' object needs an argumentr2 z$expected at most 1 arguments, got %dr
N)r3 r4 r« rf r rÈ rU Úsubtract)r: r; r& rd rÉ r¸ rÊ r r r! rË “ s
zCounter.subtractc C s
| | ¡S )zReturn a shallow copy.)r[ )r& r r r! r_ µ s z Counter.copyc C s | j t| ƒffS )N)r[ rI )r& r r r! rb ¹ s zCounter.__reduce__c s || krt ƒ |¡ dS )zGLike dict.__delitem__() but does not raise KeyError for missing values.N)rº rE )r& r¸ )r[ r r! rE ¼ s zCounter.__delitem__c C s` | sd| j j S y&d tdj| ¡ ƒ¡}d| j j|f S tk
rZ d | j jt| ƒ¡S X d S )Nz%s()z, z%r: %rz%s({%s})z
{0}({1!r})) r[ r r¢ ri Ú__mod__rÀ r3 ÚformatrI )r& rU r r r! r] Á s zCounter.__repr__c C sx t |tƒstS tƒ }x0| ¡ D ]$\}}||| }|dkr |||< q W x,| ¡ D ] \}}|| krP|dkrP|||< qPW |S )zAdd counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
r
)rf r ÚNotImplementedrU )r& rk rY r¸ rÊ Únewcountr r r! Ú__add__Ô s
zCounter.__add__c C s| t |tƒstS tƒ }x0| ¡ D ]$\}}||| }|dkr |||< q W x0| ¡ D ]$\}}|| krP|dk rPd| ||< qPW |S )z˜ Subtract count, but keep only results with positive counts.
>>> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
r
)rf r rÎ rU )r& rk rY r¸ rÊ rÏ r r r! Ú__sub__ç s
zCounter.__sub__c C s„ t |tƒstS tƒ }x<| ¡ D ]0\}}|| }||k r:|n|}|dkr |||< q W x,| ¡ D ] \}}|| kr\|dkr\|||< q\W |S )z Union is the maximum of value in either of the input counters.
>>> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
r
)rf r rÎ rU )r& rk rY r¸ rÊ Ú other_countrÏ r r r! Ú__or__ú s
zCounter.__or__c C sV t |tƒstS tƒ }x<| ¡ D ]0\}}|| }||k r:|n|}|dkr |||< q W |S )z‡ Intersection is the minimum of corresponding counts.
>>> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
r
)rf r rÎ rU )r& rk rY r¸ rÊ rÒ rÏ r r r! Ú__and__ s
zCounter.__and__c C s0 t ƒ }x$| ¡ D ]\}}|dkr|||< qW |S )zEAdds an empty counter, effectively stripping negative and zero countsr
)r rU )r& rY r¸ rÊ r r r! Ú__pos__ s
zCounter.__pos__c C s4 t ƒ }x(| ¡ D ] \}}|dk rd| ||< qW |S )z{Subtracts from an empty counter. Strips positive and zero counts,
and flips the sign on negative counts.
r
)r rU )r& rY r¸ rÊ r r r! Ú__neg__' s
zCounter.__neg__c C s* dd„ | ¡ D ƒ}x|D ]
}| |= qW | S )z?Internal method to strip elements with a negative or zero countc S s g | ]\}}|d ks|‘qS )r
r )r} r¸ rÊ r r r! ú
4 s z*Counter._keep_positive..)rU )r& Ú nonpositiver¸ r r r! Ú_keep_positive2 s
zCounter._keep_positivec C s. x$| ¡ D ]\}}| | |7 < q
W | ¡ S )zÂInplace add from another counter, keeping only positive counts.
>>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
)rU rÙ )r& rk r¸ rÊ r r r! Ú__iadd__9 s zCounter.__iadd__c C s. x$| ¡ D ]\}}| | |8 < q
W | ¡ S )zÂInplace subtract counter, but keep only results with positive counts.
>>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
)rU rÙ )r& rk r¸ rÊ r r r! Ú__isub__F s zCounter.__isub__c C s6 x,| ¡ D ] \}}| | }||kr
|| |< q
W | ¡ S )z½Inplace union is the maximum of value from either counter.
>>> c = Counter('abbb')
>>> c |= Counter('bcc')
>>> c
Counter({'b': 3, 'c': 2, 'a': 1})
)rU rÙ )r& rk r¸ rÒ rÊ r r r! Ú__ior__S s
zCounter.__ior__c C s6 x,| ¡ D ] \}}|| }||k r
|| |< q
W | ¡ S )z¯Inplace intersection is the minimum of corresponding counts.
>>> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
)rU rÙ )r& rk r¸ rÊ rÒ r r r! Ú__iand__b s
zCounter.__iand__)N)N) r r( r) rl r= r» rÀ rÅ rr re rn rË r_ rb rE r] rÐ rÑ rÓ rÔ rÕ rÖ rÙ rÚ rÛ rÜ rÝ Ú
__classcell__r r )r[ r! r ó s0 +
("
c @ s¶ e Zd ZdZdd„ Zdd„ Zdd„ Zd'd d
„Zd d „ Zd
d„ Z dd„ Z
dd„ Z e ƒ dd„ ƒZ
edd„ ƒZdd„ ZeZd(dd„Zedd „ ƒZd d „ Zd d „ Zd!d"„ Zd#d$„ Zd%d&„ ZdS ))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 G s t |ƒp i 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& rß r r r! r= „ s zChainMap.__init__c C s t |ƒ‚d S )N)rJ )r& r+ r r r! r» ‹ s zChainMap.__missing__c C s8 x,| j D ]"}y|| S tk
r( Y qX qW | |¡S )N)rß rJ r» )r& r+ r· r r r! Ú __getitem__Ž s
zChainMap.__getitem__Nc C s || kr| | S |S )Nr )r& r+ rX r r r! r« – s z ChainMap.getc C s t tƒ j| jŽ ƒS )N)r4 rš Úunionrß )r& r r r! Ú__len__™ s zChainMap.__len__c C s* i }x t | jƒD ]}| |¡ qW t|ƒS )N)r$ rß rn r` )r& Údr· r r r! rG œ s zChainMap.__iter__c s t ‡ fdd„| jD ƒƒS )Nc 3 s | ]}ˆ |kV qd S )Nr )r} Úm)r+ r r! r~ £ s z(ChainMap.__contains__..)Úanyrß )r& r+ r )r+ r! Ú __contains__¢ s zChainMap.__contains__c C s
t | jƒS )N)rå rß )r& r r r! Ú__bool__¥ s zChainMap.__bool__c C s d | d tt| jƒ¡¡S )Nz{0.__class__.__name__}({1})z, )rÍ r¢ ri r¡ rß )r& r r r! r] ¨ s zChainMap.__repr__c G s | t j|f|žŽ ƒS )z?Create a ChainMap with a single dict created from the iterable.)rI re )rc rd r: r r r! re s zChainMap.fromkeysc C s$ | j | jd ¡ f| jdd… žŽ S )zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]r
r2 N)r[ rß r_ )r& r r r! r_ ² s z
ChainMap.copyc C s |dkr i }| j |f| jžŽ S )zyNew ChainMap with a new map followed by all previous maps.
If no map is provided, an empty dict is used.
N)r[ rß )r& rä r r r! Ú new_child¸ s zChainMap.new_childc C s | j | jdd… Ž S )zNew ChainMap from maps[1:].r2 N)r[ rß )r& r r r! ÚparentsÀ s zChainMap.parentsc C s || j d |< d S )Nr
)rß )r& r+ r> r r r! rA Å s zChainMap.__setitem__c C s8 y| j d |= W n" tk
r2 td |¡ƒ‚Y nX d S )Nr
z(Key not found in the first mapping: {!r})rß rJ rÍ )r& r+ r r r! rE È s zChainMap.__delitem__c C s0 y| j d ¡ S tk
r* tdƒ‚Y nX dS )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.N)rß rK rJ )r& r r r! rK Î s zChainMap.popitemc G s> y| j d j|f|žŽ S tk
r8 td |¡ƒ‚Y nX dS )zWRemove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].r
z(Key not found in the first mapping: {!r}N)rß rB rJ rÍ )r& r+ r: r r r! rB Õ s z ChainMap.popc C s | j d ¡ dS )z'Clear maps[0], leaving maps[1:] intact.r
N)rß rH )r& r r r! rH Ü s zChainMap.clear)N)N)r r( r) rl r= r» rà r« râ rG ræ rç rq r] rr re r_ Ú__copy__rè r¨ ré rA rE rK rB rH r r r r! r v s(
c @ sj e Zd Zdd„ Zdd„ Zdd„ Zdd„ Zd d
„ Zd d „ Zd
d„ Z dd„ Z
dd„ Z dd„ Z e
ddd„ƒZdS )r c O sœ | s t dƒ‚| ^}} t| ƒdkr0t dt| ƒ ƒ‚| r>| d }n0d|krj| d¡}dd l}|jdtdd nd }i |_|d k r†| |¡ t|ƒr˜| |¡ d S ) Nz rã r+ r r r! re # s
zUserDict.fromkeys)N)r r( r) r= râ rà rA rE rG ræ r] rê r_ rr re r r r r! r å s
c @ s e Zd ZdZd@dd„Zdd„ Zdd„ Zd d
„ Zd d „ Zd
d„ Z dd„ Z
dd„ Z dd„ Z dd„ Z
dd„ Zdd„ Zdd „ Zd d „ Zd d „ Zd!d"„ Zd#d$„ ZeZd%d&„ Zd'd(„ Zd)d*„ Zd+d,„ ZdAd.d/„Zd0d1„ Zd2d3„ Z d4d5„ Z d6d7„ Z d8d9„ Z d:d;„ Z dd?„ Z"dS )Br zAA more or less complete user-defined wrapper around list objects.Nc C sb g | _ |d k r^t|ƒt| j ƒkr0|| j d d …< n.t|tƒrT|j d d … | j d d …< n
t|ƒ| _ d S )N)rë r rf r r\ )r& Úinitlistr r r! r= 2 s
zUserList.__init__c C s
t | jƒS )N)r¡ rë )r& r r r! r] < rí zUserList.__repr__c C s | j | |¡k S )N)rë Ú_UserList__cast)r& rk r r r! Ú__lt__= rí zUserList.__lt__c C s | j | |¡kS )N)rë ró )r& rk r r r! Ú__le__> rí zUserList.__le__c C s | j | |¡kS )N)rë ró )r& rk r r r! rg ? rí zUserList.__eq__c C s | j | |¡kS )N)rë ró )r& rk r r r! Ú__gt__@ rí zUserList.__gt__c C s | j | |¡kS )N)rë ró )r& rk r r r! Ú__ge__A rí zUserList.__ge__c C s t |tƒr|jS |S )N)rf r rë )r& rk r r r! Ú__castB s zUserList.__castc C s
|| j kS )N)rë )r& rï r r r! ræ D rí zUserList.__contains__c C s
t | jƒS )N)r4 rë )r& r r r! râ E rí zUserList.__len__c C s( t |tƒr| | j| ¡S | j| S d S )N)rf Úslicer[ rë )r& Úir r r! rà F s
zUserList.__getitem__c C s || j |< d S )N)rë )r& rú rï r r r! rA K rí zUserList.__setitem__c C s | j |= d S )N)rë )r& rú r r r! rE L rí zUserList.__delitem__c C sP t |tƒr | | j|j ¡S t |t| jƒƒr<| | j| ¡S | | jt|ƒ ¡S )N)rf r r[ rë r r\ )r& rk r r r! rÐ M s
zUserList.__add__c C sP t |tƒr | |j| j ¡S t |t| jƒƒr<| || j ¡S | t|ƒ| j ¡S )N)rf r r[ rë r r\ )r& rk r r r! Ú__radd__S s
zUserList.__radd__c C sR t |tƒr | j|j7 _n2t |t| jƒƒr<| j|7 _n| jt|ƒ7 _| S )N)rf r rë r r\ )r& rk r r r! rÚ Y s
zUserList.__iadd__c C s | | j| ¡S )N)r[ rë )r& rQ r r r! Ú__mul__a s zUserList.__mul__c C s | j |9 _ | S )N)rë )r& rQ r r r! Ú__imul__d s zUserList.__imul__c C s8 | j | j ¡}|j | j¡ | jd d d … |jd< |S )Nrë )r[ r‚ rP rn )r& rð r r r! rê g s zUserList.__copy__c C s | j |¡ d S )N)rë Úappend)r& rï r r r! rþ m rí zUserList.appendc C s | j ||¡ d S )N)rë Úinsert)r& rú rï r r r! rÿ n rí zUserList.insertr{ c C s | j |¡S )N)rë rB )r& rú r r r! rB o rí z UserList.popc C s | j |¡ d S )N)rë Úremove)r& rï r r r! r p rí zUserList.removec C s | j ¡ d S )N)rë rH )r& r r r! rH q rí zUserList.clearc C s
| | ¡S )N)r[ )r& r r r! r_ r rí z
UserList.copyc C s | j |¡S )N)rë rÊ )r& rï r r r! rÊ s rí zUserList.countc G s | j j|f|žŽ S )N)rë r® )r& rï r: r r r! r® t rí zUserList.indexc C s | j ¡ d S )N)rë r¼ )r& r r r! r¼ u rí zUserList.reversec O s | j j||Ž d S )N)rë Úsort)r& r: r; r r r! r v rí z
UserList.sortc C s* t |tƒr| j |j¡ n | j |¡ d S )N)rf r rë Úextend)r& rk r r r! r w s
zUserList.extend)N)r{ )#r r( r) rl r= r] rô rõ rg rö r÷ ró ræ râ rà rA rE rÐ rû rÚ rü Ú__rmul__rý rê rþ rÿ rB r rH r_ rÊ r® r¼ r r r r r r! r 0 s@
c @ sh e Zd Zdd„ Zdd„ Zdd„ Zdd„ Zd d
„ Zd d „ Zd
d„ Z dd„ Z
dd„ Z dd„ Z dd„ Z
dd„ Zdd„ Zdd „ Zd d „ Zd d „ Zd!d"„ Zd#d$„ Zd%d&„ ZeZd'd(„ Zd)d*„ Zd+d,„ Zd-d.„ Zd/d0„ Zd1e j fd2d3„Z dˆd5d6„Z d1e j fd7d8„Z d‰d:d;„Z!d1e j fdd?„ Z#d@dA„ Z$d1e j fdBdC„Z%dDdE„ Z&dFdG„ Z'dHdI„ Z(dJdK„ Z)dLdM„ Z*dNdO„ Z+dPdQ„ Z,dRdS„ Z-dTdU„ Z.dVdW„ Z/dXdY„ Z0dZd[„ Z1d\d]„ Z2d^d_„ Z3d`da„ Z4dŠdbdc„Z5e6j7Z7ddde„ Z8d‹dgdh„Z9d1e j fdidj„Z:d1e j fdkdl„Z;dmdn„ Zddsdt„Z?dŽdudv„Z@ddxdy„ZAd1e j fdzd{„ZBdd|d}„ZCd~d„ ZDd€d„ ZEd‚dƒ„ ZFd„d…„ ZGd†d‡„ ZHd4S )‘r c C s< t |tƒr|| _n&t |tƒr.|jd d … | _n
t|ƒ| _d S )N)rf r– rë r )r& Úseqr r r! r= „ s
zUserString.__init__c C s
t | jƒS )N)r– rë )r& r r r! Ú__str__‹ rí zUserString.__str__c C s
t | jƒS )N)r¡ rë )r& r r r! r] Œ rí zUserString.__repr__c C s
t | jƒS )N)Úintrë )r& r r r! Ú__int__ rí zUserString.__int__c C s
t | jƒS )N)Úfloatrë )r& r r r! Ú __float__Ž rí zUserString.__float__c C s
t | jƒS )N)Úcomplexrë )r& r r r! Ú __complex__ rí zUserString.__complex__c C s
t | jƒS )N)Úhashrë )r& r r r! Ú__hash__ rí zUserString.__hash__c C s | j d d … fS )N)rë )r& r r r! r ‘ s zUserString.__getnewargs__c C s t |tƒr| j|jkS | j|kS )N)rf r rë )r& Ústringr r r! rg ” s
zUserString.__eq__c C s t |tƒr| j|jk S | j|k S )N)rf r rë )r& r r r r! rô ˜ s
zUserString.__lt__c C s t |tƒr| j|jkS | j|kS )N)rf r rë )r& r r r r! rõ œ s
zUserString.__le__c C s t |tƒr| j|jkS | j|kS )N)rf r rë )r& r r r r! rö s
zUserString.__gt__c C s t |tƒr| j|jkS | j|kS )N)rf r rë )r& r r r r! r÷ ¤ s
zUserString.__ge__c C s t |tƒr|j}|| jkS )N)rf r rë )r& Úcharr r r! ræ © s
zUserString.__contains__c C s
t | jƒS )N)r4 rë )r& r r r! râ ® rí zUserString.__len__c C s | | j| ¡S )N)r[ rë )r& r® r r r! rà ¯ rí zUserString.__getitem__c C sJ t |tƒr | | j|j ¡S t |tƒr6| | j| ¡S | | jt|ƒ ¡S )N)rf r r[ rë r– )r& rk r r r! rÐ ° s
zUserString.__add__c C s. t |tƒr| || j ¡S | t|ƒ| j ¡S )N)rf r– r[ rë )r& rk r r r! rû ¶ s
zUserString.__radd__c C s | | j| ¡S )N)r[ rë )r& rQ r r r! rü º s zUserString.__mul__c C s | | j| ¡S )N)r[ rë )r& r: r r r! rÌ ½ s zUserString.__mod__c C s | |t ¡S )N)r[ r: )r& rÍ r r r! Ú__rmod__¿ s zUserString.__rmod__c C s | | j ¡ ¡S )N)r[ rë Ú
capitalize)r& r r r! r à rí zUserString.capitalizec C s | | j ¡ ¡S )N)r[ rë Úcasefold)r& r r r! r Ä s zUserString.casefoldc G s | | jj|f|žŽ ¡S )N)r[ rë Úcenter)r& Úwidthr: r r r! r Æ s zUserString.centerr
c C s t |tƒr|j}| j |||¡S )N)rf r rë rÊ )r& ÚsubÚstartÚendr r r! rÊ È s
zUserString.countNc C s> |r.|r | | j ||¡¡S | | j |¡¡S | | j ¡ ¡S )N)r[ rë Úencode)r& ÚencodingÚerrorsr r r! r Ì s
zUserString.encodec C s | j |||¡S )N)rë Úendswith)r& Úsuffixr r r r r! r Ò s zUserString.endswithé c C s | | j |¡¡S )N)r[ rë Ú
expandtabs)r& Útabsizer r r! r Ô s zUserString.expandtabsc C s t |tƒr|j}| j |||¡S )N)rf r rë Úfind)r& r r r r r r! r Ö s
zUserString.findc O s | j j||ŽS )N)rë rÍ )r& r: r; r r r! rÍ Ú s zUserString.formatc C s | j |¡S )N)rë Ú
format_map)r& r· r r r! r! Ü s zUserString.format_mapc C s | j |||¡S )N)rë r® )r& r r r r r r! r® Þ s zUserString.indexc C s
| j ¡ S )N)rë Úisalpha)r& r r r! r" à rí zUserString.isalphac C s
| j ¡ S )N)rë Úisalnum)r& r r r! r# á rí zUserString.isalnumc C s
| j ¡ S )N)rë Úisascii)r& r r r! r$ â rí zUserString.isasciic C s
| j ¡ S )N)rë Ú isdecimal)r& r r r! r% ã rí zUserString.isdecimalc C s
| j ¡ S )N)rë Úisdigit)r& r r r! r& ä rí zUserString.isdigitc C s
| j ¡ S )N)rë rœ )r& r r r! rœ å rí zUserString.isidentifierc C s
| j ¡ S )N)rë Úislower)r& r r r! r' æ rí zUserString.islowerc C s
| j ¡ S )N)rë Ú isnumeric)r& r r r! r( ç rí zUserString.isnumericc C s
| j ¡ S )N)rë Ú isprintable)r& r r r! r) è rí zUserString.isprintablec C s
| j ¡ S )N)rë Úisspace)r& r r r! r* é rí zUserString.isspacec C s
| j ¡ S )N)rë Úistitle)r& r r r! r+ ê rí zUserString.istitlec C s
| j ¡ S )N)rë Úisupper)r& r r r! r, ë rí zUserString.isupperc C s | j |¡S )N)rë r¢ )r& r r r r! r¢ ì rí zUserString.joinc G s | | jj|f|žŽ ¡S )N)r[ rë Úljust)r& r r: r r r! r- í s zUserString.ljustc C s | | j ¡ ¡S )N)r[ rë Úlower)r& r r r! r. ï rí zUserString.lowerc C s | | j |¡¡S )N)r[ rë Úlstrip)r& Úcharsr r r! r/ ð rí zUserString.lstripc C s | j |¡S )N)rë Ú partition)r& Úsepr r r! r1 ò s zUserString.partitionr{ c C s6 t |tƒr|j}t |tƒr |j}| | j |||¡¡S )N)rf r rë r[ r— )r& ÚoldÚnewÚmaxsplitr r r! r— ô s
zUserString.replacec C s t |tƒr|j}| j |||¡S )N)rf r rë Úrfind)r& r r r r r r! r6 ú s
zUserString.rfindc C s | j |||¡S )N)rë Úrindex)r& r r r r r r! r7 þ s zUserString.rindexc G s | | jj|f|žŽ ¡S )N)r[ rë Úrjust)r& r r: r r r! r8 s zUserString.rjustc C s | j |¡S )N)rë Ú
rpartition)r& r2 r r r! r9 s zUserString.rpartitionc C s | | j |¡¡S )N)r[ rë Úrstrip)r& r0 r r r! r: s zUserString.rstripc C s | j ||¡S )N)rë r˜ )r& r2 r5 r r r! r˜ s zUserString.splitc C s | j ||¡S )N)rë Úrsplit)r& r2 r5 r r r! r; s zUserString.rsplitFc C s | j |¡S )N)rë Ú
splitlines)r& Úkeependsr r r! r<
rí zUserString.splitlinesc C s | j |||¡S )N)rë rž )r& Úprefixr r r r r! rž s zUserString.startswithc C s | | j |¡¡S )N)r[ rë Ústrip)r& r0 r r r! r?
rí zUserString.stripc C s | | j ¡ ¡S )N)r[ rë Úswapcase)r& r r r! r@ rí zUserString.swapcasec C s | | j ¡ ¡S )N)r[ rë Útitle)r& r r r! rA rí zUserString.titlec G s | | jj|Ž ¡S )N)r[ rë Ú translate)r& r: r r r! rB s zUserString.translatec C s | | j ¡ ¡S )N)r[ rë Úupper)r& r r r! rC rí zUserString.upperc C s | | j |¡¡S )N)r[ rë Úzfill)r& r r r r! rD rí zUserString.zfill)NN)r )N)r{ )N)Nr{ )Nr{ )F)N)Ir r( r) r= r r] r r r r
r rg rô rõ rö r÷ ræ râ rà rÐ rû rü r rÌ r r r r rN ÚmaxsizerÊ r r r r rÍ r! r® r" r# r$ r% r& rœ r' r( r) r* r+ r, r¢ r- r. r/ r– Ú maketransr1 r— r6 r7 r8 r9 r: r˜ r; r< rž r? r@ rA rB rC rD r r r r! r ƒ s†
)7rl r r Úoperatorr r§ r rj Úkeywordr
r ÚsysrN Úheapqr¾ Ú_weakrefr r7 Ú itertoolsr rÄ r rÁ r rà Úreprlibr rq Ú _collectionsr Ú ImportErrorÚMutableSequenceÚregisterr r" ÚKeysViewr# Ú ItemsViewr* Ú
ValuesViewr, rp r- rI r r¦ r r¹ r rm r r r ÚSequencer r r r r! Ú s\
_ - oKS