MINI MINI MANI MO

Path : /usr/lib64/python3.6/collections/__pycache__/
File Upload :
Current File : //usr/lib64/python3.6/collections/__pycache__/__init__.cpython-36.pyc

3


 \$@sdZddddddddd	g	Zd
dlTd
dlZeej7Zd
d
lmZmZd
dlm	Z
d
dlZd
dl
Zd
dlmZd
dlmZmZmZd
dlmZyd
dlmZWnek
rYnXej eyd
dlm!Z!Wnek
rYnXGddde"Z#Gddde$Z%Gddde&Z'Gddde(Z)Gddde*Z+yd
dlm+Z+Wnek
rXYnXdZ,dZ-d Z.d!d!dd"d#dZ/d$d%Z0yd
d&lm0Z0Wnek
rYnXGd'dde*Z1Gd(d	d	e2Z3Gd)dde2Z4Gd*ddeZ5Gd+dde6Z7d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

dequedefaultdict
namedtupleUserDictUserList
UserStringCounterOrderedDictChainMap)*N)
itemgettereq)	iskeyword)proxy)repeatchainstarmap)recursive_repr)r)rc@seZdZddZdS)_OrderedDictKeysViewccst|jEdHdS)N)reversed_mapping)selfr,/usr/lib64/python3.6/collections/__init__.py__reversed__5sz!_OrderedDictKeysView.__reversed__N)__name__
__module____qualname__rrrrrr3src@seZdZddZdS)_OrderedDictItemsViewccs(x"t|jD]}||j|fVqWdS)N)rr)rkeyrrrr:sz"_OrderedDictItemsView.__reversed__N)rrrrrrrrr8src@seZdZddZdS)_OrderedDictValuesViewccs$xt|jD]}|j|VqWdS)N)rr)rrrrrr@sz#_OrderedDictValuesView.__reversed__N)rrrrrrrrr >sr c@seZdZdZdS)_Linkprevnextr__weakref__N)r"r#rr$)rrr	__slots__rrrrr!Dsr!c@seZdZdZddZejeefddZej	fddZ	dd	Z
d
dZdd
Zd*ddZ
d+ddZddZejZZddZddZddZejZeZefddZd,ddZed d!Zd"d#Zd$d%Zed-d&d'Z d(d)Z!dS).rz)Dictionary that remembers insertion ordercOs|std|^}}t|dkr0tdt|y
|jWn>tk
rxt|_t|j|_}||_|_i|_	YnX|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 argumentz$expected at most 1 arguments, got %dN)	TypeErrorlen_OrderedDict__rootAttributeErrorr!_OrderedDict__hardroot_proxyr"r#_OrderedDict__map_OrderedDict__update)argskwdsrrootrrr__init__Vs
zOrderedDict.__init__c	CsZ||krJ||j|<}|j}|j}||||_|_|_||_|||_||||dS)z!od.__setitem__(i, y) <==> od[i]=yN)r-r)r"r#r)	rrvalueZdict_setitemrZLinklinkr1lastrrr__setitem__is
zOrderedDict.__setitem__cCs>||||jj|}|j}|j}||_||_d|_d|_dS)z od.__delitem__(y) <==> del od[y]N)r-popr"r#)rrZdict_delitemr4	link_prev	link_nextrrr__delitem__ws
zOrderedDict.__delitem__ccs,|j}|j}x||k	r&|jV|j}qWdS)zod.__iter__() <==> iter(od)N)r)r#r)rr1currrrr__iter__s

zOrderedDict.__iter__ccs,|j}|j}x||k	r&|jV|j}qWdS)z#od.__reversed__() <==> reversed(od)N)r)r"r)rr1r;rrrrs

zOrderedDict.__reversed__cCs*|j}||_|_|jjtj|dS)z.od.clear() -> None.  Remove all items from od.N)r)r"r#r-cleardict)rr1rrrr=s
zOrderedDict.clearTcCsj|std|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#rr-r>r7)rr5r1r4r8r9rr3rrrpopitems zOrderedDict.popitemc	Cst|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))	rrr5r4r8r9Z	soft_linkr1firstrrrmove_to_ends$
zOrderedDict.move_to_endcCsVtj}t|d}||j}|||jd7}|||j|7}|||j|7}|S)Nr&)_sys	getsizeofr(__dict__r-r+r))rZsizeofnsizerrr
__sizeof__s
zOrderedDict.__sizeof__cCst|S)z:D.keys() -> a set-like object providing a view on D's keys)r)rrrrkeysszOrderedDict.keyscCst|S)z<D.items() -> a set-like object providing a view on D's items)r)rrrritemsszOrderedDict.itemscCst|S)z6D.values() -> an object providing a view on D's values)r )rrrrvaluesszOrderedDict.valuescCs0||kr||}||=|S||jkr,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?)rrdefaultresultrrrr7s
zOrderedDict.popNcCs||kr||S|||<|S)zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr)rrrNrrr
setdefaultszOrderedDict.setdefaultcCs*|sd|jjfSd|jjt|jfS)zod.__repr__() <==> repr(od)z%s()z%s(%r))	__class__rlistrK)rrrr__repr__szOrderedDict.__repr__cCsHt|j}xttD]}|j|dqW|jf|p8ddt|jfS)z%Return state information for picklingN)varscopyrr7rQiterrK)rZ	inst_dictkrrr
__reduce__szOrderedDict.__reduce__cCs
|j|S)z!od.copy() -> a shallow copy of od)rQ)rrrrrU
szOrderedDict.copycCs |}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)clsiterabler3rrrrrfromkeyss
zOrderedDict.fromkeyscCs2t|tr&tj||o$ttt||Stj||S)zod.__eq__(y) <==> od==y.  Comparison to another OD is order-sensitive
        while comparison to a regular mapping is order-insensitive.

        )
isinstancerr>__eq__allmap_eq)rotherrrrr]s
zOrderedDict.__eq__)T)T)N)N)"rrr__doc__r2r>r6r,r!r:r<rr=r@rBrIMutableMappingupdater.rJrKrL__ne__objectrMr7rP_recursive_reprrSrXrUclassmethodr[r]rrrrrGs0

		

	


)rafrom 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Cst|tr|jddj}ttt|}t|}|rt}xNt|D]B\}}|jspt	|sp|j
dsp||kr|d|||<|j|qDWxN|g|D]@}t|tk	rt
d|jstd|t	|rtd|qWt}xJ|D]B}|j
do|rtd|||krtd	||j|qWtj|t|t|tt|jd
dddd
jdd|Ddjddt|Dd}td|d}	t||	|	|}
||
_|rt|
j|dkrytjdjjdd}Wnttfk
rYnX|dk	r
||
_|
S)aCReturns 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, css|]}tj|dVqdS))nameN)_repr_templateformat).0rqrrr	<genexpr>sznamedtuple.<locals>.<genexpr>
css |]\}}tj||dVqdS))indexrqN)_field_templaters)rtrwrqrrrrus)typenamefield_names
num_fieldsarg_listrepr_fmt
field_defsz
namedtuple_%s)rNr__main__)r\strreplacesplitrRr_set	enumerateisidentifier
_iskeyword
startswithaddtyper'
ValueError_class_templaterstupler(reprjoinr>exec_sourceprintrD	_getframe	f_globalsgetr*r)ryrzrirjrkseenrwrqclass_definition	namespacerOrrrresj










cCs*|j}x|D]}||dd||<qWdS)z!Tally elements from the iterable.r
r&N)r)mappingrZZmapping_getelemrrr_count_elementss
r)rcseZdZdZfddZddZd/ddZd	d
Zed0ddZ	fd
dZ
ddZddZddZ
fddZddZddZddZddZdd Zd!d"Zd#d$Zd%d&Zd'd(Zd)d*Zd+d,Zd-d.ZZS)1raDict 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)]

    csN|std|^}}t|dkr0tdt|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(superrr2rd)r/r0r)rQrrr2szCounter.__init__cCsdS)z1The count of elements not in the Counter is zero.r
r)rrrrr__missing__szCounter.__missing__NcCs6|dkrt|jtdddStj||jtddS)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)rreverse)r)sortedrK_itemgetter_heapqnlargest)rrGrrrmost_commons	zCounter.most_commoncCstjtt|jS)aIterator 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)rrrrelements+szCounter.elementscCstddS)Nz@Counter.fromkeys() is undefined.  Use Counter(iterable) instead.)NotImplementedError)rYrZvrrrr[CszCounter.fromkeyscs|std|^}}t|dkr0tdt||r<|dnd}|dk	rt|tr|r|j}x8|jD]\}}|||d||<qfWqtt|j|n
t	|||r|j|dS)aLike 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\MappingrrKrrrdr)r/r0rrZself_getrcount)rQrrrdJs 

zCounter.updatecOs|std|^}}t|dkr0tdt||r<|dnd}|dk	r|j}t|trxH|jD]\}}||d|||<qbWn x|D]}||dd||<qW|r|j|dS)aLike 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(rr\rrKsubtract)r/r0rrZrrrrrrrrs

zCounter.subtractcCs
|j|S)zReturn a shallow copy.)rQ)rrrrrUszCounter.copycCs|jt|ffS)N)rQr>)rrrrrXszCounter.__reduce__cs||krtj|dS)zGLike dict.__delitem__() but does not raise KeyError for missing values.N)rr:)rr)rQrrr:szCounter.__delitem__cCs`|sd|jjSy&djtdj|j}d|jj|fStk
rZdj|jjt|SXdS)Nz%s()z, z%r: %rz%s({%s})z
{0}({1!r}))	rQrrr___mod__rr'rsr>)rrKrrrrSszCounter.__repr__cCsxt|tstSt}x0|jD]$\}}|||}|dkr|||<qWx,|jD] \}}||krP|dkrP|||<qPW|S)zAdd counts from two counters.

        >>> Counter('abbb') + Counter('bcc')
        Counter({'b': 4, 'c': 2, 'a': 1})

        r
)r\rNotImplementedrK)rrarOrrnewcountrrr__add__s
zCounter.__add__cCs|t|tstSt}x0|jD]$\}}|||}|dkr|||<qWx0|jD]$\}}||krP|dkrPd|||<qPW|S)z Subtract count, but keep only results with positive counts.

        >>> Counter('abbbc') - Counter('bccd')
        Counter({'b': 2, 'a': 1})

        r
)r\rrrK)rrarOrrrrrr__sub__s
zCounter.__sub__cCst|tstSt}x<|jD]0\}}||}||kr:|n|}|dkr|||<qWx,|jD] \}}||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\rrrK)rrarOrrother_countrrrr__or__s
zCounter.__or__cCsVt|tstSt}x<|jD]0\}}||}||kr:|n|}|dkr|||<qW|S)z Intersection is the minimum of corresponding counts.

        >>> Counter('abbb') & Counter('bcc')
        Counter({'b': 1})

        r
)r\rrrK)rrarOrrrrrrr__and__s
zCounter.__and__cCs0t}x$|jD]\}}|dkr|||<qW|S)zEAdds an empty counter, effectively stripping negative and zero countsr
)rrK)rrOrrrrr__pos__s
zCounter.__pos__cCs4t}x(|jD]\}}|dkrd|||<qW|S)z{Subtracts from an empty counter.  Strips positive and zero counts,
        and flips the sign on negative counts.

        r
)rrK)rrOrrrrr__neg__s
zCounter.__neg__cCs*dd|jD}x|D]
}||=qW|S)z?Internal method to strip elements with a negative or zero countcSsg|]\}}|dks|qS)r
r)rtrrrrr
<listcomp>sz*Counter._keep_positive.<locals>.<listcomp>)rK)rnonpositiverrrr_keep_positives

zCounter._keep_positivecCs.x$|jD]\}}|||7<q
W|jS)zInplace add from another counter, keeping only positive counts.

        >>> c = Counter('abbb')
        >>> c += Counter('bcc')
        >>> c
        Counter({'b': 4, 'c': 2, 'a': 1})

        )rKr)rrarrrrr__iadd__s	zCounter.__iadd__cCs.x$|jD]\}}|||8<q
W|jS)zInplace subtract counter, but keep only results with positive counts.

        >>> c = Counter('abbbc')
        >>> c -= Counter('bccd')
        >>> c
        Counter({'b': 2, 'a': 1})

        )rKr)rrarrrrr__isub__%s	zCounter.__isub__cCs6x,|jD] \}}||}||kr
|||<q
W|jS)zInplace union is the maximum of value from either counter.

        >>> c = Counter('abbb')
        >>> c |= Counter('bcc')
        >>> c
        Counter({'b': 3, 'c': 2, 'a': 1})

        )rKr)rrarrrrrr__ior__2s
	zCounter.__ior__cCs6x,|jD] \}}||}||kr
|||<q
W|jS)zInplace intersection is the minimum of corresponding counts.

        >>> c = Counter('abbb')
        >>> c &= Counter('bcc')
        >>> c
        Counter({'b': 1})

        )rKr)rrarrrrrr__iand__As
	zCounter.__iand__)N)N)rrrrbr2rrrrhr[rdrrUrXr:rSrrrrrrrrrrr
__classcell__rr)rQrrs0+

("

c@seZdZdZddZddZddZd'd	d
ZddZd
dZ	ddZ
ddZeddZ
eddZddZeZd(ddZeddZddZdd 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.

    cGst|pig|_dS)zInitialize a ChainMap by setting *maps* to the given mappings.
        If no mappings are provided, a single empty dictionary is used.

        N)rRmaps)rrrrrr2cszChainMap.__init__cCst|dS)N)r?)rrrrrrjszChainMap.__missing__cCs8x,|jD]"}y||Stk
r(YqXqW|j|S)N)rr?r)rrrrrr__getitem__ms
zChainMap.__getitem__NcCs||kr||S|S)Nr)rrrNrrrruszChainMap.getcCsttj|jS)N)r(runionr)rrrr__len__xszChainMap.__len__cCsttj|jS)N)rVrrr)rrrrr<{szChainMap.__iter__cstfdd|jDS)Nc3s|]}|kVqdS)Nr)rtm)rrrrusz(ChainMap.__contains__.<locals>.<genexpr>)anyr)rrr)rr__contains__~szChainMap.__contains__cCs
t|jS)N)rr)rrrr__bool__szChainMap.__bool__cCsdj|djtt|jS)Nz{0.__class__.__name__}({1})z, )rsrr_rr)rrrrrSszChainMap.__repr__cGs|tj|f|S)z?Create a ChainMap with a single dict created from the iterable.)r>r[)rYrZr/rrrr[szChainMap.fromkeyscCs$|j|jdjf|jddS)zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]r
r&N)rQrrU)rrrrrUsz
ChainMap.copycCs|dkri}|j|f|jS)zyNew ChainMap with a new map followed by all previous maps.
        If no map is provided, an empty dict is used.
        N)rQr)rrrrr	new_childszChainMap.new_childcCs|j|jddS)zNew ChainMap from maps[1:].r&N)rQr)rrrrparentsszChainMap.parentscCs||jd|<dS)Nr
)r)rrr3rrrr6szChainMap.__setitem__cCs8y|jd|=Wn"tk
r2tdj|YnXdS)Nr
z(Key not found in the first mapping: {!r})rr?rs)rrrrrr:szChainMap.__delitem__cCs0y|jdjStk
r*tdYnXdS)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)rr@r?)rrrrr@szChainMap.popitemcGs>y|jdj|f|Stk
r8tdj|YnXdS)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)rr7r?rs)rrr/rrrr7szChainMap.popcCs|jdjdS)z'Clear maps[0], leaving maps[1:] intact.r
N)rr=)rrrrr=szChainMap.clear)N)N)rrrrbr2rrrrr<rrrgrSrhr[rU__copy__rpropertyrr6r:r@r7r=rrrrr	Us(

c@sbeZdZddZddZddZddZd	d
ZddZd
dZ	ddZ
ddZedddZ
dS)rcOs|std|^}}t|dkr0tdt||r>|d}n0d|krj|jd}ddl}|jdtddnd}i|_|dk	r|j|t|r|j|dS)	Nz<descriptor '__init__' of 'UserDict' object needs an argumentr&z$expected at most 1 arguments, got %dr
r>z0Passing 'dict' as keyword argument is deprecatedrC)
stacklevel)r'r(r7warningswarnDeprecationWarningdatard)r/kwargsrr>rrrrr2s$


zUserDict.__init__cCs
t|jS)N)r(r)rrrrrszUserDict.__len__cCs:||jkr|j|St|jdr.|jj||St|dS)Nr)rhasattrrQrr?)rrrrrrs


zUserDict.__getitem__cCs||j|<dS)N)r)rritemrrrr6szUserDict.__setitem__cCs|j|=dS)N)r)rrrrrr:szUserDict.__delitem__cCs
t|jS)N)rVr)rrrrr<szUserDict.__iter__cCs
||jkS)N)r)rrrrrrszUserDict.__contains__cCs
t|jS)N)rr)rrrrrSszUserDict.__repr__cCsR|jtkrt|jjSddl}|j}zi|_|j|}Wd||_X|j||S)Nr
)rQrrrUrd)rrUrcrrrrUs

z
UserDict.copyNcCs |}x|D]}|||<qW|S)Nr)rYrZr3drrrrr[s
zUserDict.fromkeys)N)rrrr2rrr6r:r<rrSrUrhr[rrrrrsc@seZdZdZd>ddZddZddZd	d
ZddZd
dZ	ddZ
ddZddZddZ
ddZddZddZddZdd Zd!d"Zd#d$ZeZd%d&Zd'd(Zd)d*Zd@d,d-Zd.d/Zd0d1Zd2d3Zd4d5Zd6d7Zd8d9Zd:d;Z d<d=Z!dS)ArzAA more or less complete user-defined wrapper around list objects.NcCsbg|_|dk	r^t|t|jkr0||jdd<n.t|trT|jdd|jdd<n
t||_dS)N)rrr\rrR)rinitlistrrrr2s
zUserList.__init__cCs
t|jS)N)rr)rrrrrSszUserList.__repr__cCs|j|j|kS)N)r_UserList__cast)rrarrr__lt__szUserList.__lt__cCs|j|j|kS)N)rr)rrarrr__le__szUserList.__le__cCs|j|j|kS)N)rr)rrarrrr]szUserList.__eq__cCs|j|j|kS)N)rr)rrarrr__gt__szUserList.__gt__cCs|j|j|kS)N)rr)rrarrr__ge__szUserList.__ge__cCst|tr|jS|S)N)r\rr)rrarrr__castszUserList.__castcCs
||jkS)N)r)rrrrrrszUserList.__contains__cCs
t|jS)N)r(r)rrrrrszUserList.__len__cCs
|j|S)N)r)rirrrrszUserList.__getitem__cCs||j|<dS)N)r)rrrrrrr6szUserList.__setitem__cCs|j|=dS)N)r)rrrrrr:szUserList.__delitem__cCsPt|tr|j|j|jSt|t|jr<|j|j|S|j|jt|S)N)r\rrQrrrR)rrarrrrs

zUserList.__add__cCsPt|tr|j|j|jSt|t|jr<|j||jS|jt||jS)N)r\rrQrrrR)rrarrr__radd__#s

zUserList.__radd__cCsRt|tr|j|j7_n2t|t|jr<|j|7_n|jt|7_|S)N)r\rrrrR)rrarrrr)s
zUserList.__iadd__cCs|j|j|S)N)rQr)rrGrrr__mul__1szUserList.__mul__cCs|j|9_|S)N)r)rrGrrr__imul__4szUserList.__imul__cCs|jj|dS)N)rappend)rrrrrr7szUserList.appendcCs|jj||dS)N)rinsert)rrrrrrr8szUserList.insertr&cCs|jj|S)N)rr7)rrrrrr79szUserList.popcCs|jj|dS)N)rremove)rrrrrr:szUserList.removecCs|jjdS)N)rr=)rrrrr=;szUserList.clearcCs
|j|S)N)rQ)rrrrrU<sz
UserList.copycCs|jj|S)N)rr)rrrrrr=szUserList.countcGs|jj|f|S)N)rrw)rrr/rrrrw>szUserList.indexcCs|jjdS)N)rr)rrrrr?szUserList.reversecOs|jj||dS)N)rsort)rr/r0rrrr@sz
UserList.sortcCs*t|tr|jj|jn|jj|dS)N)r\rrextend)rrarrrrAs
zUserList.extend)Nr)r)"rrrrbr2rSrrr]rrrrrrr6r:rrrr__rmul__rrrr7rr=rUrrwrrrrrrrrs>


c@s`eZdZddZddZddZddZd	d
ZddZd
dZ	ddZ
ddZddZddZ
ddZddZddZddZdd Zd!d"Zd#d$Zd%d&ZeZd'd(Zd)d*Zd+d,Zd-d.Zd/d0Zd1ejfd2d3Zdd5d6Zd1ejfd7d8Z dd:d;Z!d1ejfd<d=Z"d>d?Z#d@dAZ$d1ejfdBdCZ%dDdEZ&dFdGZ'dHdIZ(dJdKZ)dLdMZ*dNdOZ+dPdQZ,dRdSZ-dTdUZ.dVdWZ/dXdYZ0dZd[Z1d\d]Z2d^d_Z3dd`daZ4e5j6Z6dbdcZ7ddedfZ8d1ejfdgdhZ9d1ejfdidjZ:dkdlZ;dmdnZ<ddodpZ=ddqdrZ>ddsdtZ?ddvdwZ@d1ejfdxdyZAddzd{ZBd|d}ZCd~dZDddZEddZFddZGd4S)rcCs<t|tr||_n&t|tr.|jdd|_n
t||_dS)N)r\rrr)rseqrrrr2Ns


zUserString.__init__cCs
t|jS)N)rr)rrrr__str__UszUserString.__str__cCs
t|jS)N)rr)rrrrrSVszUserString.__repr__cCs
t|jS)N)intr)rrrr__int__WszUserString.__int__cCs
t|jS)N)floatr)rrrr	__float__XszUserString.__float__cCs
t|jS)N)complexr)rrrr__complex__YszUserString.__complex__cCs
t|jS)N)hashr)rrrr__hash__ZszUserString.__hash__cCs|jddfS)N)r)rrrr__getnewargs__[szUserString.__getnewargs__cCs t|tr|j|jkS|j|kS)N)r\rr)rstringrrrr]^s
zUserString.__eq__cCs t|tr|j|jkS|j|kS)N)r\rr)rrrrrrbs
zUserString.__lt__cCs t|tr|j|jkS|j|kS)N)r\rr)rrrrrrfs
zUserString.__le__cCs t|tr|j|jkS|j|kS)N)r\rr)rrrrrrjs
zUserString.__gt__cCs t|tr|j|jkS|j|kS)N)r\rr)rrrrrrns
zUserString.__ge__cCst|tr|j}||jkS)N)r\rr)rcharrrrrss
zUserString.__contains__cCs
t|jS)N)r(r)rrrrrxszUserString.__len__cCs|j|j|S)N)rQr)rrwrrrryszUserString.__getitem__cCsJt|tr|j|j|jSt|tr6|j|j|S|j|jt|S)N)r\rrQrr)rrarrrrzs


zUserString.__add__cCs.t|tr|j||jS|jt||jS)N)r\rrQr)rrarrrrs
zUserString.__radd__cCs|j|j|S)N)rQr)rrGrrrrszUserString.__mul__cCs|j|j|S)N)rQr)rr/rrrrszUserString.__mod__cCs|j|tS)N)rQr/)rrsrrr__rmod__szUserString.__rmod__cCs|j|jjS)N)rQr
capitalize)rrrrrszUserString.capitalizecCs|j|jjS)N)rQrcasefold)rrrrrszUserString.casefoldcGs|j|jj|f|S)N)rQrcenter)rwidthr/rrrrszUserString.centerr
cCs t|tr|j}|jj|||S)N)r\rrr)rsubstartendrrrrs
zUserString.countNcCs>|r.|r|j|jj||S|j|jj|S|j|jjS)N)rQrencode)rencodingerrorsrrrrs
zUserString.encodecCs|jj|||S)N)rendswith)rsuffixrrrrrrszUserString.endswithcCs|j|jj|S)N)rQr
expandtabs)rtabsizerrrrszUserString.expandtabscCs t|tr|j}|jj|||S)N)r\rrfind)rrrrrrrrs
zUserString.findcOs|jj||S)N)rrs)rr/r0rrrrsszUserString.formatcCs|jj|S)N)r
format_map)rrrrrrszUserString.format_mapcCs|jj|||S)N)rrw)rrrrrrrrwszUserString.indexcCs
|jjS)N)risalpha)rrrrrszUserString.isalphacCs
|jjS)N)risalnum)rrrrrszUserString.isalnumcCs
|jjS)N)r	isdecimal)rrrrr	szUserString.isdecimalcCs
|jjS)N)risdigit)rrrrr
szUserString.isdigitcCs
|jjS)N)rr)rrrrrszUserString.isidentifiercCs
|jjS)N)rislower)rrrrrszUserString.islowercCs
|jjS)N)r	isnumeric)rrrrrszUserString.isnumericcCs
|jjS)N)risprintable)rrrrr
szUserString.isprintablecCs
|jjS)N)risspace)rrrrrszUserString.isspacecCs
|jjS)N)ristitle)rrrrrszUserString.istitlecCs
|jjS)N)risupper)rrrrrszUserString.isuppercCs|jj|S)N)rr)rrrrrrszUserString.joincGs|j|jj|f|S)N)rQrljust)rrr/rrrrszUserString.ljustcCs|j|jjS)N)rQrlower)rrrrrszUserString.lowercCs|j|jj|S)N)rQrlstrip)rcharsrrrrszUserString.lstripcCs|jj|S)N)r	partition)rseprrrrszUserString.partitionr&cCs6t|tr|j}t|tr |j}|j|jj|||S)N)r\rrrQr)roldnewmaxsplitrrrrs


zUserString.replacecCs t|tr|j}|jj|||S)N)r\rrrfind)rrrrrrrrs
zUserString.rfindcCs|jj|||S)N)rrindex)rrrrrrrrszUserString.rindexcGs|j|jj|f|S)N)rQrrjust)rrr/rrrrszUserString.rjustcCs|jj|S)N)r
rpartition)rrrrrrszUserString.rpartitioncCs|j|jj|S)N)rQrrstrip)rrrrrrszUserString.rstripcCs|jj||S)N)rr)rrrrrrrszUserString.splitcCs|jj||S)N)rrsplit)rrrrrrrszUserString.rsplitFcCs|jj|S)N)r
splitlines)rkeependsrrrr szUserString.splitlinescCs|jj|||S)N)rr)rprefixrrrrrrszUserString.startswithcCs|j|jj|S)N)rQrstrip)rrrrrr#szUserString.stripcCs|j|jjS)N)rQrswapcase)rrrrr$szUserString.swapcasecCs|j|jjS)N)rQrtitle)rrrrr%szUserString.titlecGs|j|jj|S)N)rQr	translate)rr/rrrr&szUserString.translatecCs|j|jjS)N)rQrupper)rrrrr'szUserString.uppercCs|j|jj|S)N)rQrzfill)rrrrrr(szUserString.zfill)NN)r)Nr)r)Nr)Nrr)Nr)F)N)Hrrrr2rrSrrrrrr]rrrrrrrrrrrrrrrrrDmaxsizerrrrrrsrrwrrr	r
rrrr
rrrrrrrr	maketransrrrrrrrrrr rr#r$r%r&r'r(rrrrrMs








)8rb__all___collections_abcoperatorrrr
r`keywordrrsysrDheapqr_weakrefrr,	itertoolsrrrrrrreprlibrrg_collectionsrImportErrorMutableSequenceregisterrKeysViewr	ItemsViewr
ValuesViewr rfr!r>rrrrrxrrrrcr	rrSequencerrrrr<module>s`


`3blCI

OHA YOOOO