3
\ $ @ s d Z ddddddddd g Zd
d lT d
d lZeej7 Zd
d
lmZmZ d
dlm Z
d
d l Z d
d l
Zd
dlmZ d
dlmZmZmZ d
dlmZ yd
dl m Z W n e k
r Y n X e j e yd
dl m!Z! W n e k
r Y nX G dd de"Z#G dd de$Z%G dd de&Z'G dd de(Z)G d d de*Z+yd
d l m+Z+ W n e k
rX Y nX d Z,d Z-d Z.d!d!d d"d#dZ/d$d% Z0yd
d&l m0Z0 W n e k
r Y nX G d'd de*Z1G d(d d e2Z3G d)d de2Z4G d*d de Z5G d+d de6Z7d 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
namedtupleUserDictUserList
UserStringCounter OrderedDictChainMap )*N)
itemgettereq) iskeyword)proxy)repeatchainstarmap)recursive_repr)r )r c @ s e Zd Zdd ZdS )_OrderedDictKeysViewc c s t | jE d H d S )N)reversed_mapping)self r ,/usr/lib64/python3.6/collections/__init__.py __reversed__5 s z!_OrderedDictKeysView.__reversed__N)__name__
__module__ __qualname__r r r r r r 3 s r c @ s e Zd Zdd ZdS )_OrderedDictItemsViewc c s( x"t | jD ]}|| j| fV q W d S )N)r r )r keyr r r r : s z"_OrderedDictItemsView.__reversed__N)r r r r r r r r r 8 s r c @ s e Zd Zdd ZdS )_OrderedDictValuesViewc c s$ x t | jD ]}| j| V q W d S )N)r r )r r r r r r @ s z#_OrderedDictValuesView.__reversed__N)r r r r r r r r r > s r c @ s e Zd ZdZdS )_Linkprevnextr __weakref__N)r" r# r r$ )r r r __slots__r r r r r! D s r! c @ s e Zd ZdZdd ZejeefddZej fddZ dd Z
d
d Z d d
Z d*ddZ
d+ddZdd Zej ZZdd Zdd Zdd ZejZe 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 )zInitialize 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) TypeErrorlen_OrderedDict__rootAttributeErrorr! _OrderedDict__hardroot_proxyr" r# _OrderedDict__map_OrderedDict__update)argskwdsr rootr r r __init__V s
zOrderedDict.__init__c C sZ || krJ| | j |< }| j}|j}||| |_|_|_||_|||_|| || dS )z!od.__setitem__(i, y) <==> od[i]=yN)r- r) r" r# r ) r r valueZ dict_setitemr ZLinklinkr1 lastr r r __setitem__i s
zOrderedDict.__setitem__c C s> || | | j j|}|j}|j}||_||_d|_d|_dS )z od.__delitem__(y) <==> del od[y]N)r- popr" r# )r r Z dict_delitemr4 link_prev link_nextr r r __delitem__w s
zOrderedDict.__delitem__c c s, | j }|j}x||k r&|jV |j}qW dS )zod.__iter__() <==> iter(od)N)r) r# r )r r1 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)r) r" r )r r1 r; r r r r s
zOrderedDict.__reversed__c C s* | j }| |_|_| jj tj| dS )z.od.clear() -> None. Remove all items from od.N)r) r" r# r- cleardict)r r1 r r r r= s
zOrderedDict.clearTc C sj | s t d| j}|r0|j}|j}||_||_n|j}|j}||_||_|j}| j|= tj| |}||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) r" r# r r- r> r7 )r r5 r1 r4 r8 r9 r r3 r r r popitem s zOrderedDict.popitemc C st | j | }|j}|j}|j}||_||_| j}|rR|j}||_||_||_||_n |j}||_||_||_||_dS )zMove an existing element to the end (or beginning if last==False).
Raises KeyError if the element does not exist.
When last=True, acts like a fast version of self[key]=self.pop(key).
N)r- r" r# r) ) r r r5 r4 r8 r9 Z soft_linkr1 firstr r r move_to_end s$
zOrderedDict.move_to_endc C sV t j}t| d }|| j}||| jd 7 }||| j| 7 }||| j| 7 }|S )Nr& )_sys getsizeofr( __dict__r- r+ r) )r Zsizeofnsizer 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 )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.
)_OrderedDict__markerr? )r r defaultresultr r r r7 s
zOrderedDict.popNc C s || kr| | S || |< |S )zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr )r r rN r r r
setdefault s zOrderedDict.setdefaultc C s* | sd| j jf S d| j jt| j f S )zod.__repr__() <==> repr(od)z%s()z%s(%r)) __class__r listrK )r r r r __repr__ s zOrderedDict.__repr__c C sH t | j }x t t D ]}|j|d qW | jf |p8ddt| j fS )z%Return state information for picklingN)varscopyr r7 rQ iterrK )r Z inst_dictkr r r
__reduce__ s zOrderedDict.__reduce__c C s
| j | S )z!od.copy() -> a shallow copy of od)rQ )r r r r rU
s zOrderedDict.copyc C s | }x|D ] }|||< q W |S )zOD.fromkeys(S[, v]) -> New ordered dictionary with keys from S.
If not specified, the value defaults to None.
r )clsiterabler3 r r r r r fromkeys s
zOrderedDict.fromkeysc C s2 t |tr&tj| |o$ttt| |S tj| |S )zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)
isinstancer r> __eq__allmap_eq)r otherr r r r] s
zOrderedDict.__eq__)T)T)N)N)"r r r __doc__r2 r> r6 r, r! r: r< r r= r@ rB rI MutableMappingupdater. rJ rK rL __ne__objectrM r7 rP _recursive_reprrS rX rU classmethodr[ r] r r r r r G s0
)r a from builtins import property as _property, tuple as _tuple
from operator import itemgetter as _itemgetter
from collections import OrderedDict
class {typename}(tuple):
'{typename}({arg_list})'
__slots__ = ()
_fields = {field_names!r}
def __new__(_cls, {arg_list}):
'Create new instance of {typename}({arg_list})'
return _tuple.__new__(_cls, ({arg_list}))
@classmethod
def _make(cls, iterable, new=tuple.__new__, len=len):
'Make a new {typename} object from a sequence or iterable'
result = new(cls, iterable)
if len(result) != {num_fields:d}:
raise TypeError('Expected {num_fields:d} arguments, got %d' % len(result))
return result
def _replace(_self, **kwds):
'Return a new {typename} object replacing specified fields with new values'
result = _self._make(map(kwds.pop, {field_names!r}, _self))
if kwds:
raise ValueError('Got unexpected field names: %r' % list(kwds))
return result
def __repr__(self):
'Return a nicely formatted representation string'
return self.__class__.__name__ + '({repr_fmt})' % self
def _asdict(self):
'Return a new OrderedDict which maps field names to their values.'
return OrderedDict(zip(self._fields, self))
def __getnewargs__(self):
'Return self as a plain tuple. Used by copy and pickle.'
return tuple(self)
{field_defs}
z {name}=%rzW {name} = _property(_itemgetter({index:d}), doc='Alias for field number {index:d}')
F)verboserenamemodulec C s t |tr|jddj }ttt|}t| } |rt }xNt|D ]B\}}|j spt |sp|j
dsp||kr|d| ||< |j | qDW xN| g| D ]@}t |tk rt
d|j std| t |rtd| qW t }xJ|D ]B}|j
do| rtd| ||kr td | |j | qW tj| t|t|tt|jd
d d d d
jdd |D djdd t|D d}td| d} t|| | | }
||
_|rt|
j |dkrytjd jj dd}W n t tfk
r Y nX |dk r
||
_ |
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_%dz*Type names and field names must be stringsz8Type names and field names must be valid identifiers: %rz2Type names and field names cannot be a keyword: %rz/Field names cannot start with an underscore: %rz$Encountered duplicate field name: %r' r& z, c s s | ]}t j|d V qdS ))nameN)_repr_templateformat).0rq r r r s z namedtuple..
c s s | ]\}}t j||d V qdS ))indexrq N)_field_templaters )rt rw rq r r r ru s )typename field_names
num_fieldsarg_listrepr_fmt
field_defsz
namedtuple_%s)r Nr __main__) r\ strreplacesplitrR r_ set enumerate isidentifier
_iskeyword
startswithaddtyper'
ValueError_class_templaters tupler( reprjoinr> exec_sourceprintrD _getframe f_globalsgetr* r ) ry rz ri rj rk seenrw rq class_definition namespacerO r r r r e sj
c C s* | j }x |D ]}||dd | |< q W dS )z!Tally elements from the iterable.r
r& N)r )mappingrZ Z mapping_getelemr r r _count_elements s
r )r c s e Zd ZdZ fddZdd Zd/ddZd d
Zed0d d Z fd
dZ
dd Z dd Z dd Z
fddZdd 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 |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 argumentr& z$expected at most 1 arguments, got %dN)r' r( superr r2 rd )r/ r0 r )rQ r r r2 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 | j tdddS tj|| j tddS )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('abcdeabcdabcaba').most_common(3)
[('a', 5), ('b', 4), ('c', 3)]
Nr& T)r reverse)r )sortedrK _itemgetter_heapqnlargest)r rG r r r most_common s zCounter.most_commonc C s t jtt| 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
>>> 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_repeatrK )r r r r elements+ s zCounter.elementsc C s t dd S )Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)NotImplementedError)rY rZ vr r r r[ C s zCounter.fromkeysc s | s t d| ^}} t| dkr0t dt| | r<| d nd}|dk rt|tr|r|j}x8|j D ]\}}|||d ||< qfW qtt|j| n
t || |r|j| 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 argumentr& z$expected at most 1 arguments, got %dr
N)
r' r( r\ Mappingr rK r r rd r )r/ r0 r rZ self_getr count)rQ r r rd J s
zCounter.updatec O s | s t d| ^}} t| dkr0t dt| | r<| d nd}|dk r|j}t|trxH|j D ]\}}||d| ||< qbW n x |D ]}||dd ||< qW |r|j| 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 argumentr& z$expected at most 1 arguments, got %dr
N)r' r( r r\ r rK subtract)r/ r0 r rZ r r r r r r r r s
zCounter.subtractc C s
| j | S )zReturn a shallow copy.)rQ )r r r r rU s z Counter.copyc C s | j t| ffS )N)rQ r> )r r r r rX s zCounter.__reduce__c s || krt j| dS )zGLike dict.__delitem__() but does not raise KeyError for missing values.N)r r: )r r )rQ r r r: s zCounter.__delitem__c C s` | sd| j j S y&djtdj| j }d| j j|f S tk
rZ dj| j jt| S X d S )Nz%s()z, z%r: %rz%s({%s})z
{0}({1!r})) rQ r r r_ __mod__r r' rs r> )r rK r r r rS s zCounter.__repr__c C sx t |tstS t }x0| j D ]$\}}||| }|dkr |||< q W x,|j D ] \}}|| krP|dkrP|||< qPW |S )zAdd counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
r
)r\ r NotImplementedrK )r ra rO r r newcountr r r __add__ s
zCounter.__add__c C s| t |tstS t }x0| j D ]$\}}||| }|dkr |||< q W x0|j 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
)r\ r r rK )r ra rO r r r r r r __sub__ s
zCounter.__sub__c C s t |tstS t }x<| j D ]0\}}|| }||k r:|n|}|dkr |||< q W x,|j D ] \}}|| kr\|dkr\|||< q\W |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
)r\ r r rK )r ra rO r r other_countr r r r __or__ s
zCounter.__or__c C sV t |tstS t }x<| j 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
)r\ r r rK )r ra rO r r r r r r r __and__ s
zCounter.__and__c C s0 t }x$| j D ]\}}|dkr|||< qW |S )zEAdds an empty counter, effectively stripping negative and zero countsr
)r rK )r rO r r r r r __pos__ s
zCounter.__pos__c C s4 t }x(| j 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 rK )r rO r r r r r __neg__ s
zCounter.__neg__c C s* dd | j 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 )rt r r r r r
s z*Counter._keep_positive..)rK )r nonpositiver r r r _keep_positive s
zCounter._keep_positivec C s. x$|j D ]\}}| | |7 < q
W | j S )zInplace add from another counter, keeping only positive counts.
>>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
)rK r )r ra r r r r r __iadd__ s zCounter.__iadd__c C s. x$|j D ]\}}| | |8 < q
W | j S )zInplace subtract counter, but keep only results with positive counts.
>>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
)rK r )r ra r r r r r __isub__% s zCounter.__isub__c C s6 x,|j D ] \}}| | }||kr
|| |< q
W | 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})
)rK r )r ra r r r r r r __ior__2 s
zCounter.__ior__c C s6 x,| j D ] \}}|| }||k r
|| |< q
W | j S )zInplace intersection is the minimum of corresponding counts.
>>> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
)rK r )r ra r r r r r r __iand__A s
zCounter.__iand__)N)N) r r r rb r2 r r r rh r[ rd r rU rX r: rS r r r r r r r r r r r
__classcell__r r )rQ 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(ddZedd 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)rR maps)r r r r r r2 c s zChainMap.__init__c C s t |d S )N)r? )r r r r r r j s zChainMap.__missing__c C s8 x,| j D ]"}y|| S tk
r( Y qX qW | j|S )N)r r? r )r r r r r r __getitem__m s
zChainMap.__getitem__Nc C s || kr| | S |S )Nr )r r rN r r r r u s z ChainMap.getc C s t t j| j S )N)r( r unionr )r r r r __len__x s zChainMap.__len__c C s t t j| j S )N)rV r r r )r r r r r< { s zChainMap.__iter__c s t fdd| jD S )Nc 3 s | ]} |kV qd S )Nr )rt m)r r r ru s z(ChainMap.__contains__..)anyr )r r r )r r __contains__~ s zChainMap.__contains__c C s
t | jS )N)r r )r r r r __bool__ s zChainMap.__bool__c C s dj | djtt| jS )Nz{0.__class__.__name__}({1})z, )rs r r_ r r )r r r r rS s zChainMap.__repr__c G s | t j|f| S )z?Create a ChainMap with a single dict created from the iterable.)r> r[ )rY rZ r/ r r r r[ s zChainMap.fromkeysc C s$ | j | jd j f| jdd S )zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]r
r& N)rQ r rU )r r r r rU 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)rQ r )r r r r r new_child s zChainMap.new_childc C s | j | jdd S )zNew ChainMap from maps[1:].r& N)rQ r )r r r r parents s zChainMap.parentsc C s || j d |< d S )Nr
)r )r r r3 r r r r6 s zChainMap.__setitem__c C s8 y| j d |= W n" tk
r2 tdj|Y nX d S )Nr
z(Key not found in the first mapping: {!r})r r? rs )r r r r r r: s zChainMap.__delitem__c C s0 y| j d j S tk
r* tdY 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 r@ r? )r r r r r@ s zChainMap.popitemc G s> y| j d j|f| S tk
r8 tdj|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 r7 r? rs )r r r/ r r r r7 s z ChainMap.popc C s | j d j dS )z'Clear maps[0], leaving maps[1:] intact.r
N)r r= )r r r r r= s zChainMap.clear)N)N)r r r rb r2 r r r r r< r r rg rS rh r[ rU __copy__r propertyr r6 r: r@ r7 r= r r r r r U s(
c @ sb e Zd Zdd Zdd Zdd Zdd Zd d
Zd d Zd
d Z dd Z
dd Z e dddZ
dS )r c O s | s t d| ^}} t| dkr0t dt| | r>| d }n0d|krj|jd}dd l}|jdtdd nd }i |_|d k r|j| t|r|j| d S ) Nz z0Passing 'dict' as keyword argument is deprecatedrC )
stacklevel)r' r( r7 warningswarnDeprecationWarningdatard )r/ kwargsr r> r r r r r2 s$
zUserDict.__init__c C s
t | jS )N)r( r )r r r r r s zUserDict.__len__c C s: || j kr| j | S t| jdr.| jj| |S t|d S )Nr )r hasattrrQ r r? )r r r r r r s
zUserDict.__getitem__c C s || j |< d S )N)r )r r itemr r r r6 s zUserDict.__setitem__c C s | j |= d S )N)r )r r r r r r: s zUserDict.__delitem__c C s
t | jS )N)rV r )r r r r r< s zUserDict.__iter__c C s
|| j kS )N)r )r r r r r r s zUserDict.__contains__c C s
t | jS )N)r r )r r r r rS s zUserDict.__repr__c C sR | j tkrt| jj S dd l}| j}zi | _|j| }W d || _X |j| |S )Nr
)rQ r r rU rd )r rU r cr r r rU s
z
UserDict.copyNc C s | }x|D ] }|||< q W |S )Nr )rY rZ r3 dr r r r r[ s
zUserDict.fromkeys)N)r r r r2 r r r6 r: r< r rS rU rh r[ r r r r r s c @ s e Zd ZdZd>ddZdd 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,d-Zd.d/ Zd0d1 Zd2d3 Z d4d5 Z d6d7 Z d8d9 Z d:d; Z d s zUserList.indexc C s | j j d S )N)r r )r r r r r ? s zUserList.reversec O s | j j|| d S )N)r sort)r r/ r0 r r r r @ s z
UserList.sortc C s* t |tr| jj|j n | jj| d S )N)r\ r r extend)r ra r r r r A s
zUserList.extend)Nr )r )"r r r rb r2 rS r r r] r r r r r r r6 r: r r r r __rmul__r r r r7 r r= rU r rw r r r r r r r r s>
c @ s` 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 fd2d3Z dd5d6Z d1e j fd7d8Z dd:d;Z!d1e j fdd? Z#d@dA Z$d1e j fdBdCZ%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_ Z3dd`daZ4e5j6Z6dbdc Z7ddedfZ8d1e j fdgdhZ9d1e j fdidjZ:dkdl Z;dmdn ZddsdtZ?ddvdwZ@d1e j fdxdyZAddzd{ZBd|d} ZCd~d ZDdd ZEdd ZFdd ZGd4S )r c C s< t |tr|| _n&t |tr.|jd d | _n
t|| _d S )N)r\ r r r )r seqr r r r2 N s
zUserString.__init__c C s
t | jS )N)r r )r r r r __str__U s zUserString.__str__c C s
t | jS )N)r r )r r r r rS V s zUserString.__repr__c C s
t | jS )N)intr )r r r r __int__W s zUserString.__int__c C s
t | jS )N)floatr )r r r r __float__X s zUserString.__float__c C s
t | jS )N)complexr )r r r r __complex__Y s zUserString.__complex__c C s
t | jS )N)hashr )r r r r __hash__Z s zUserString.__hash__c C s | j d d fS )N)r )r r r r __getnewargs__[ s zUserString.__getnewargs__c C s t |tr| j|jkS | j|kS )N)r\ r r )r stringr r r r] ^ s
zUserString.__eq__c C s t |tr| j|jk S | j|k S )N)r\ r r )r r r r r r b s
zUserString.__lt__c C s t |tr| j|jkS | j|kS )N)r\ r r )r r r r r r f s
zUserString.__le__c C s t |tr| j|jkS | j|kS )N)r\ r r )r r r r r r j s
zUserString.__gt__c C s t |tr| j|jkS | j|kS )N)r\ r r )r r r r r r n s
zUserString.__ge__c C s t |tr|j}|| jkS )N)r\ r r )r charr r r r s s
zUserString.__contains__c C s
t | jS )N)r( r )r r r r r x s zUserString.__len__c C s | j | j| S )N)rQ r )r rw r r r r y s zUserString.__getitem__c C sJ t |tr | j| j|j S t |tr6| j| j| S | j| jt| S )N)r\ r rQ r r )r ra r r r r z s
zUserString.__add__c C s. t |tr| j|| j S | jt|| j S )N)r\ r rQ r )r ra r r r r s
zUserString.__radd__c C s | j | j| S )N)rQ r )r rG r r r r s zUserString.__mul__c C s | j | j| S )N)rQ r )r r/ r r r r s zUserString.__mod__c C s | j |t S )N)rQ r/ )r rs r r r __rmod__ s zUserString.__rmod__c C s | j | jj S )N)rQ r
capitalize)r r r r r s zUserString.capitalizec C s | j | jj S )N)rQ r casefold)r r r r r s zUserString.casefoldc G s | j | jj|f| S )N)rQ r center)r widthr/ r r r r s zUserString.centerr
c C s t |tr|j}| jj|||S )N)r\ r r r )r substartendr r r r s
zUserString.countNc C s> |r.|r | j | jj||S | j | jj|S | j | jj S )N)rQ r encode)r encodingerrorsr r r r s
zUserString.encodec C s | j j|||S )N)r endswith)r suffixr r r r r r s zUserString.endswith c C s | j | jj|S )N)rQ r
expandtabs)r tabsizer r r r s zUserString.expandtabsc C s t |tr|j}| jj|||S )N)r\ r r find)r r r r r r r r s
zUserString.findc O s | j j||S )N)r rs )r r/ r0 r r r rs s zUserString.formatc C s | j j|S )N)r
format_map)r r r r r r s zUserString.format_mapc C s | j j|||S )N)r rw )r r r r r r r rw s zUserString.indexc C s
| j j S )N)r isalpha)r r r r r s zUserString.isalphac C s
| j j S )N)r isalnum)r r r r r s zUserString.isalnumc C s
| j j S )N)r isdecimal)r r r r r s zUserString.isdecimalc C s
| j j S )N)r isdigit)r r r r r
s zUserString.isdigitc C s
| j j S )N)r r )r r r r r s zUserString.isidentifierc C s
| j j S )N)r islower)r r r r r s zUserString.islowerc C s
| j j S )N)r isnumeric)r r r r r s zUserString.isnumericc C s
| j j S )N)r isprintable)r r r r r
s zUserString.isprintablec C s
| j j S )N)r isspace)r r r r r s zUserString.isspacec C s
| j j S )N)r istitle)r r r r r s zUserString.istitlec C s
| j j S )N)r isupper)r r r r r s zUserString.isupperc C s | j j|S )N)r r )r r r r r r s zUserString.joinc G s | j | jj|f| S )N)rQ r ljust)r r r/ r r r r s zUserString.ljustc C s | j | jj S )N)rQ r lower)r r r r r s zUserString.lowerc C s | j | jj|S )N)rQ r lstrip)r charsr r r r s zUserString.lstripc C s | j j|S )N)r partition)r sepr r r r s zUserString.partitionr& c C s6 t |tr|j}t |tr |j}| j| jj|||S )N)r\ r r rQ r )r oldnewmaxsplitr r r r s
zUserString.replacec C s t |tr|j}| jj|||S )N)r\ r r rfind)r r r r r r r r s
zUserString.rfindc C s | j j|||S )N)r rindex)r r r r r r r r s zUserString.rindexc G s | j | jj|f| S )N)rQ r rjust)r r r/ r r r r s zUserString.rjustc C s | j j|S )N)r
rpartition)r r r r r r s zUserString.rpartitionc C s | j | jj|S )N)rQ r rstrip)r r r r r r s zUserString.rstripc C s | j j||S )N)r r )r r r r r r r s zUserString.splitc C s | j j||S )N)r rsplit)r r r r r r r s zUserString.rsplitFc C s | j j|S )N)r
splitlines)r keependsr r r r s zUserString.splitlinesc C s | j j|||S )N)r r )r prefixr r r r r r s zUserString.startswithc C s | j | jj|S )N)rQ r strip)r r r r r r# s zUserString.stripc C s | j | jj S )N)rQ r swapcase)r r r r r$ s zUserString.swapcasec C s | j | jj S )N)rQ r title)r r r r r% s zUserString.titlec G s | j | jj| S )N)rQ r translate)r r/ r r r r& s zUserString.translatec C s | j | jj S )N)rQ r upper)r r r r r' s zUserString.upperc C s | j | jj|S )N)rQ r zfill)r r r r r r( s zUserString.zfill)NN)r )Nr )r )Nr )Nr r )Nr )F)N)Hr r r r2 r rS r r r r r r] r r r r r r r r r r r r r r r r rD maxsizer r r r r rs r rw r r r r
r r r r
r r r r r r r r maketransr r r r r r r r r r r r# r$ r% r& r' r( r r r r r M s
)8rb __all___collections_abcoperatorr r r
r` keywordr r sysrD heapqr _weakrefr r, itertoolsr r r r r r reprlibr rg _collectionsr ImportErrorMutableSequenceregisterr KeysViewr ItemsViewr
ValuesViewr rf r! r> r r rr rx r r r rc r r r Sequencer r r r r s`
`3b lCI