%PDF- %PDF-
Mini Shell

Mini Shell

Direktori : /snap/core/17212/usr/lib/python3.5/collections/__pycache__/
Upload File :
Create Path :
Current File : //snap/core/17212/usr/lib/python3.5/collections/__pycache__/__init__.cpython-35.pyc



|�gn��$@s�dZddddddddd	g	Zd
dlTd
dlZeej7Zd
d
lmZmZd
dlm	Z
d
dlZd
dl
Zd
dlmZd
dlmZmZmZd
dlmZyd
dlmZWnek
r�YnXej e�yd
dlm!Z!Wnek
r"YnXGdd�de"�Z#Gdd�de$�Z%Gdd�de&�Z'Gdd�de(�Z)Gdd�de*�Z+yd
dlm+Z+Wnek
r�YnXdZ,dZ-d Z.d!d!d"d�Z/d#d$�Z0yd
d%lm0Z0Wnek
rYnXGd&d�de*�Z1Gd'd	�d	e2�Z3Gd(d�de2�Z4Gd)d�de�Z5Gd*d�de6�Z7d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)rc@seZdZdd�ZdS)�_OrderedDictKeysViewccst|j�EdHdS)N)�reversed�_mapping)�self�r�*/usr/lib/python3.5/collections/__init__.py�__reversed__5sz!_OrderedDictKeysView.__reversed__N)�__name__�
__module__�__qualname__rrrrrr3src@seZdZdd�ZdS)�_OrderedDictItemsViewccs0x)t|j�D]}||j|fVqWdS)N)rr)r�keyrrrr:sz"_OrderedDictItemsView.__reversed__N)rrrrrrrrr8src@seZdZdd�ZdS)�_OrderedDictValuesViewccs*x#t|j�D]}|j|VqWdS)N)rr)rrrrrr@sz#_OrderedDictValuesView.__reversed__N)rrrrrrrrr >sr c@seZdZdZdS)�_Link�prev�nextr�__weakref__N)zprevznextzkeyz__weakref__)rrr�	__slots__rrrrr!Dsr!c@sIeZdZdZdd�Zejeedd�Zej	dd�Z	dd	�Z
d
d�Zdd
�Zddd�Z
ddd�Zdd�ZejZZdd�Zdd�Zdd�ZejZe�Zedd�Zddd�Ze�d d!��Zd"d#�Zd$d%�Zedd&d'��Z d(d)�Z!dS)*rz)Dictionary that remembers insertion ordercOs�|std��|^}}t|�dkrFtdt|���y|jWnMtk
r�t�|_t|j�|_}||_|_i|_	YnX|j
||�dS)z�Initialize an ordered dictionary.  The signature is the same as
        regular dictionaries, but keyword arguments are not recommended because
        their insertion order is arbitrary.

        z?descriptor '__init__' of 'OrderedDict' object needs an argument�z$expected at most 1 arguments, got %dN)�	TypeError�len�_OrderedDict__root�AttributeErrorr!�_OrderedDict__hardroot�_proxyr"r#�_OrderedDict__map�_OrderedDict__update)�args�kwdsr�rootrrr�__init__Vs
zOrderedDict.__init__c	Cs{||krg|�|j|<}|j}|j}||||_|_|_||_||�|_||||�dS)z!od.__setitem__(i, y) <==> od[i]=yN)r-r)r"r#r)	rr�valueZdict_setitemrZLink�linkr1�lastrrr�__setitem__ks			zOrderedDict.__setitem__cCsY|||�|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__ys
					zOrderedDict.__delitem__ccs:|j}|j}x!||k	r5|jV|j}qWdS)zod.__iter__() <==> iter(od)N)r)r#r)rr1�currrrr�__iter__�s
		zOrderedDict.__iter__ccs:|j}|j}x!||k	r5|jV|j}qWdS)z#od.__reversed__() <==> reversed(od)N)r)r"r)rr1r;rrrr�s
		zOrderedDict.__reversed__cCs7|j}||_|_|jj�tj|�dS)z.od.clear() -> None.  Remove all items from od.N)r)r"r#r-�clear�dict)rr1rrrr=�s	
zOrderedDict.clearTcCs�|std��|j}|rH|j}|j}||_||_n$|j}|j}||_||_|j}|j|=tj||�}||fS)z�od.popitem() -> (k, v), return and remove a (key, value) pair.
        Pairs are returned in LIFO order if last is true or FIFO order if false.

        zdictionary is empty)�KeyErrorr)r"r#rr-r>r7)rr5r1r4r8r9rr3rrr�popitem�s 									
zOrderedDict.popitemcCs�|j|}|j}|j}||_||_|j}|rn|j}||_||_||_|_n+|j}||_||_||_|_dS)z�Move 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))rrr5r4r8r9r1�firstrrr�move_to_end�s
											zOrderedDict.move_to_endcCsqtj}t|�d}||j�}|||j�d7}|||j�|7}|||j�|7}|S)Nr&�)�_sys�	getsizeofr(�__dict__r-r+r))rZsizeof�n�sizerrr�
__sizeof__�s	zOrderedDict.__sizeof__cCs
t|�S)z:D.keys() -> a set-like object providing a view on D's keys)r)rrrr�keys�szOrderedDict.keyscCs
t|�S)z<D.items() -> a set-like object providing a view on D's items)r)rrrr�items�szOrderedDict.itemscCs
t|�S)z6D.values() -> an object providing a view on D's values)r )rrrr�values�szOrderedDict.valuescCs@||kr!||}||=|S||jkr<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__markerr?)rr�default�resultrrrr7�s
zOrderedDict.popNcCs"||kr||S|||<|S)zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr)rrrNrrr�
setdefault�s
zOrderedDict.setdefaultcCs7|sd|jjfSd|jjt|j��fS)zod.__repr__() <==> repr(od)z%s()z%s(%r))�	__class__r�listrK)rrrr�__repr__�szOrderedDict.__repr__cCsdt|�j�}x'tt��D]}|j|d�q"W|jf|pNddt|j��fS)z%Return state information for picklingN)�vars�copyrr7rQ�iterrK)rZ	inst_dict�krrr�
__reduce__szOrderedDict.__reduce__cCs
|j|�S)z!od.copy() -> a shallow copy of od)rQ)rrrrrUszOrderedDict.copycCs(|�}x|D]}|||<qW|S)zOD.fromkeys(S[, v]) -> New ordered dictionary with keys from S.
        If not specified, the value defaults to None.

        r)�cls�iterabler3rrrrr�fromkeyss	
zOrderedDict.fromkeyscCsGt|t�r7tj||�o6ttt||��Stj||�S)z�od.__eq__(y) <==> od==y.  Comparison to another OD is order-sensitive
        while comparison to a regular mapping is order-insensitive.

        )�
isinstancerr>�__eq__�all�map�_eq)r�otherrrrr]s(zOrderedDict.__eq__)"rrr�__doc__r2r>r6r,r!r:r<rr=r@rBrI�MutableMapping�updater.rJrKrL�__ne__�objectrMr7rP�_recursive_reprrSrXrU�classmethodr[r]rrrrrGs0

			
		
)ra�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}')
Fc
Cs�t|t�r'|jdd�j�}ttt|��}t|�}|r�t�}xit|�D][\}}|j�s�t	|�s�|j
d�s�||kr�d|||<|j|�qdWxk|g|D]\}t|�tkr�t
d��|j�std|��t	|�r�td|��q�Wt�}x]|D]U}|j
d�rm|rmtd|��||kr�td	|��|j|�qAWtjd
|dt|�dt|�d
tt|��jdd�dd�ddjdd�|D��ddjdd�t|�D���}tdd|�}t||�||}	||	_|rpt|	j�y%tjd�jjdd�|	_Wnttfk
r�YnX|	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�typename�field_names�
num_fields�arg_list�'�r&�repr_fmtz, css!|]}tjd|�VqdS)�nameN)�_repr_template�format)�.0rsrrr�	<genexpr>�sznamedtuple.<locals>.<genexpr>�
field_defs�
css-|]#\}}tjd|d|�VqdS)�indexrsN)�_field_templateru)rvrzrsrrrrw�srz
namedtuple_%s�__main__���)r\�str�replace�splitrRr_�set�	enumerate�isidentifier�
_iskeyword�
startswith�add�typer'�
ValueError�_class_templateru�tupler(�repr�joinr>�exec�_source�printrD�	_getframe�	f_globals�getrr*)
rlrm�verbose�rename�seenrzrs�class_definition�	namespacerOrrrrdsd	

	

	(


	
%cCs5|j}x%|D]}||d�d||<qWdS)z!Tally elements from the iterable.r
r&N)r�)�mappingrZZmapping_get�elemrrr�_count_elements�s	
r�)r�cs<eZdZdZ�fdd�Zdd�Zddd�Zd	d
�Zeddd��Z	�fd
d�Z
dd�Zdd�Zdd�Z
�fdd�Zdd�Zdd�Zdd�Zdd�Zdd �Zd!d"�Zd#d$�Zd%d&�Zd'd(�Zd)d*�Zd+d,�Zd-d.�Z�S)/ra�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)]

    csm|std��|^}}t|�dkrFtdt|���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__NcCsP|dkr.t|j�dtd�dd�Stj||j�dtd��S)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)]

        Nrr&�reverseT)�sortedrK�_itemgetter�_heapq�nlargest)rrGrrr�most_commons	"zCounter.most_commoncCstjtt|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)rrrr�elements&szCounter.elementscCstd��dS)Nz@Counter.fromkeys() is undefined.  Use Counter(iterable) instead.)�NotImplementedError)rYrZ�vrrrr[>szCounter.fromkeyscs�|std��|^}}t|�dkrFtdt|���|rV|dnd}|dk	r�t|t�r�|r�|j}xJ|j�D]#\}}|||d�||<q�Wq�tt|�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�rKr�rrdr�)r/r0rrZ�self_getr��count)rQrrrdEs 	
zCounter.updatecOs�|std��|^}}t|�dkrFtdt|���|rV|dnd}|dk	r�|j}t|t�r�x\|j�D]#\}}||d�|||<q�Wn(x%|D]}||d�d||<q�W|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/r0rrZr�r�r�rrrr�ms	
zCounter.subtractcCs
|j|�S)zReturn a shallow copy.)rQ)rrrrrU�szCounter.copycCs|jt|�ffS)N)rQr>)rrrrrX�szCounter.__reduce__cs ||krt�j|�dS)zGLike dict.__delitem__() but does not raise KeyError for missing values.N)r�r:)rr�)rQrrr:�szCounter.__delitem__cCs�|sd|jjSy9djtdj|j���}d|jj|fSWn.tk
r}dj|jjt|��SYnXdS)Nz%s()z, z%r: %rz%s({%s})z
{0}({1!r}))	rQrr�r_�__mod__r�r'rur>)rrKrrrrS�s!
zCounter.__repr__cCs�t|t�stSt�}x>|j�D]0\}}|||}|dkr)|||<q)Wx<|j�D].\}}||krj|dkrj|||<qjW|S)zAdd counts from two counters.

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

        r
)r\r�NotImplementedrK)rrarOr�r��newcountrrr�__add__�s	zCounter.__add__cCs�t|t�stSt�}x>|j�D]0\}}|||}|dkr)|||<q)Wx@|j�D]2\}}||krj|dkrjd|||<qjW|S)z� Subtract count, but keep only results with positive counts.

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

        r
)r\rr�rK)rrarOr�r�r�rrr�__sub__�s	zCounter.__sub__cCs�t|t�stSt�}xR|j�D]D\}}||}||krQ|n|}|dkr)|||<q)Wx<|j�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
)r\rr�rK)rrarOr�r��other_countr�rrr�__or__�s	
zCounter.__or__cCsut|t�stSt�}xR|j�D]D\}}||}||krQ|n|}|dkr)|||<q)W|S)z� Intersection is the minimum of corresponding counts.

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

        r
)r\rr�rK)rrarOr�r�r�r�rrr�__and__�s	
zCounter.__and__cCs@t�}x0|j�D]"\}}|dkr|||<qW|S)zEAdds an empty counter, effectively stripping negative and zero countsr
)rrK)rrOr�r�rrr�__pos__�s
	zCounter.__pos__cCsDt�}x4|j�D]&\}}|dkrd|||<qW|S)z{Subtracts from an empty counter.  Strips positive and zero counts,
        and flips the sign on negative counts.

        r
)rrK)rrOr�r�rrr�__neg__s
	zCounter.__neg__cCs5dd�|j�D�}x|D]
}||=q W|S)z?Internal method to strip elements with a negative or zero countcSs(g|]\}}|dks|�qS)r
r)rvr�r�rrr�
<listcomp>s	z*Counter._keep_positive.<locals>.<listcomp>)rK)r�nonpositiver�rrr�_keep_positives
zCounter._keep_positivecCs5x(|j�D]\}}|||7<q
W|j�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})

        )rKr�)rrar�r�rrr�__iadd__s	zCounter.__iadd__cCs5x(|j�D]\}}|||8<q
W|j�S)z�Inplace subtract counter, but keep only results with positive counts.

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

        )rKr�)rrar�r�rrr�__isub__ s	zCounter.__isub__cCsGx:|j�D],\}}||}||kr
|||<q
W|j�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})

        )rKr�)rrar�r�r�rrr�__ior__-s
	
zCounter.__ior__cCsGx:|j�D],\}}||}||kr
|||<q
W|j�S)z�Inplace intersection is the minimum of corresponding counts.

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

        )rKr�)rrar�r�r�rrr�__iand__<s
	
zCounter.__iand__)rrrrbr2r�r�r�rhr[rdr�rUrXr:rSr�r�r�r�r�r�r�r�r�r�r�rr)rQrr�s0+
("

c@seZdZdZdd�Zdd�Zdd�Zdd	d
�Zdd�Zd
d�Z	dd�Z
dd�Ze�dd��Z
edd��Zdd�ZeZddd�Zedd��Zdd�Zdd �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|�pig|_dS)z�Initialize a ChainMap by setting *maps* to the given mappings.
        If no mappings are provided, a single empty dictionary is used.

        N)rR�maps)rr�rrrr2^szChainMap.__init__cCst|��dS)N)r?)rrrrrr�eszChainMap.__missing__cCsBx2|jD]'}y||SWq
tk
r0Yq
Xq
W|j|�S)N)r�r?r�)rrr�rrr�__getitem__hs
	zChainMap.__getitem__NcCs||kr||S|S)Nr)rrrNrrrr�pszChainMap.getcCstt�j|j��S)N)r(r��unionr�)rrrr�__len__sszChainMap.__len__cCstt�j|j��S)N)rVr�r�r�)rrrrr<vszChainMap.__iter__cs t�fdd�|jD��S)Nc3s|]}�|kVqdS)Nr)rv�m)rrrrwzsz(ChainMap.__contains__.<locals>.<genexpr>)�anyr�)rrr)rr�__contains__yszChainMap.__contains__cCs
t|j�S)N)r�r�)rrrr�__bool__|szChainMap.__bool__cCs%dj|djtt|j���S)Nz{0.__class__.__name__}({1})z, )rur�r_r�r�)rrrrrSszChainMap.__repr__cGs|tj||��S)z?Create a ChainMap with a single dict created from the iterable.)r>r[)rYrZr/rrrr[�szChainMap.fromkeyscCs*|j|jdj�|jdd��S)zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]r
r&N)rQr�rU)rrrrrU�sz
ChainMap.copycCs%|dkri}|j||j�S)zyNew ChainMap with a new map followed by all previous maps.
        If no map is provided, an empty dict is used.
        N)rQr�)rr�rrr�	new_child�szChainMap.new_childcCs|j|jdd��S)zNew ChainMap from maps[1:].r&N)rQr�)rrrr�parents�szChainMap.parentscCs||jd|<dS)Nr
)r�)rrr3rrrr6�szChainMap.__setitem__cCs@y|jd|=Wn'tk
r;tdj|���YnXdS)Nr
z(Key not found in the first mapping: {!r})r�r?ru)rrrrrr:�s
zChainMap.__delitem__cCs:y|jdj�SWntk
r5td��YnXdS)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?)rrrrr@�s
zChainMap.popitemcGsIy|jdj||�SWn'tk
rDtdj|���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)r�r7r?ru)rrr/rrrr7�s
zChainMap.popcCs|jdj�dS)z'Clear maps[0], leaving maps[1:] intact.r
N)r�r=)rrrrr=�szChainMap.clear)rrrrbr2r�r�r�r�r<r�r�rgrSrhr[rU�__copy__r��propertyr�r6r:r@r7r=rrrrr	Ps(c@s�eZdZdd�Zdd�Zdd�Zdd�Zd	d
�Zdd�Zd
d�Z	dd�Z
dd�Zeddd��Z
dS)rcOs�|std��|^}}t|�dkrFtdt|���|rY|d}nFd|kr�|jd�}ddl}|jdtdd�nd}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 deprecated�
stacklevelrC)r'r(r7�warnings�warn�PendingDeprecationWarning�datard)r/�kwargsrr>r�rrrr2�s$
		
zUserDict.__init__cCs
t|j�S)N)r(r�)rrrrr��szUserDict.__len__cCsO||jkr|j|St|jd�r?|jj||�St|��dS)Nr�)r��hasattrrQr�r?)rrrrrr��s
zUserDict.__getitem__cCs||j|<dS)N)r�)rr�itemrrrr6�szUserDict.__setitem__cCs|j|=dS)N)r�)rrrrrr:�szUserDict.__delitem__cCs
t|j�S)N)rVr�)rrrrr<�szUserDict.__iter__cCs
||jkS)N)r�)rrrrrr��szUserDict.__contains__cCs
t|j�S)N)r�r�)rrrrrS�szUserDict.__repr__cCsq|jtkr"t|jj��Sddl}|j}zi|_|j|�}Wd||_X|j|�|S)Nr
)rQrr�rUrd)rrUr��crrrrU�s		

z
UserDict.copyNcCs(|�}x|D]}|||<qW|S)Nr)rYrZr3�drrrrr[�s	
zUserDict.fromkeys)rrrr2r�r�r6r:r<r�rSrUrhr[rrrrr�sc@s~eZdZdZddd�Zdd�Zdd�Zd	d
�Zdd�Zd
d�Z	dd�Z
dd�Zdd�Zdd�Z
dd�Zdd�Zdd�Zdd�Zdd �Zd!d"�Zd#d$�ZeZd%d&�Zd'd(�Zd)d*�Zd>d,d-�Zd.d/�Zd0d1�Zd2d3�Zd4d5�Zd6d7�Zd8d9�Zd:d;�Z d<d=�Z!dS)?rzAA more or less complete user-defined wrapper around list objects.NcCs�g|_|dk	r�t|�t|j�krF||jdd�<nAt|t�rx|jdd�|jdd�<nt|�|_dS)N)r�r�r\rrR)r�initlistrrrr2s	#zUserList.__init__cCs
t|j�S)N)r�r�)rrrrrSszUserList.__repr__cCs|j|j|�kS)N)r��_UserList__cast)rrarrr�__lt__szUserList.__lt__cCs|j|j|�kS)N)r�r�)rrarrr�__le__
szUserList.__le__cCs|j|j|�kS)N)r�r�)rrarrrr]szUserList.__eq__cCs|j|j|�kS)N)r�r�)rrarrr�__gt__szUserList.__gt__cCs|j|j|�kS)N)r�r�)rrarrr�__ge__szUserList.__ge__cCst|t�r|jS|S)N)r\rr�)rrarrr�__castszUserList.__castcCs
||jkS)N)r�)rr�rrrr�szUserList.__contains__cCs
t|j�S)N)r(r�)rrrrr�szUserList.__len__cCs|j|S)N)r�)r�irrrr�szUserList.__getitem__cCs||j|<dS)N)r�)rr�r�rrrr6szUserList.__setitem__cCs|j|=dS)N)r�)rr�rrrr:szUserList.__delitem__cCslt|t�r&|j|j|j�St|t|j��rR|j|j|�S|j|jt|��S)N)r\rrQr�r�rR)rrarrrr�s
zUserList.__add__cCslt|t�r&|j|j|j�St|t|j��rR|j||j�S|jt|�|j�S)N)r\rrQr�r�rR)rrarrr�__radd__s
zUserList.__radd__cCsgt|t�r$|j|j7_n?t|t|j��rN|j|7_n|jt|�7_|S)N)r\rr�r�rR)rrarrrr�$szUserList.__iadd__cCs|j|j|�S)N)rQr�)rrGrrr�__mul__,szUserList.__mul__cCs|j|9_|S)N)r�)rrGrrr�__imul__/szUserList.__imul__cCs|jj|�dS)N)r��append)rr�rrrr�2szUserList.appendcCs|jj||�dS)N)r��insert)rr�r�rrrr�3szUserList.insertr&cCs|jj|�S)N)r�r7)rr�rrrr74szUserList.popcCs|jj|�dS)N)r��remove)rr�rrrr�5szUserList.removecCs|jj�dS)N)r�r=)rrrrr=6szUserList.clearcCs
|j|�S)N)rQ)rrrrrU7sz
UserList.copycCs|jj|�S)N)r�r�)rr�rrrr�8szUserList.countcGs|jj||�S)N)r�rz)rr�r/rrrrz9szUserList.indexcCs|jj�dS)N)r�r�)rrrrr�:szUserList.reversecOs|jj||�dS)N)r��sort)rr/r0rrrr�;sz
UserList.sortcCs9t|t�r%|jj|j�n|jj|�dS)N)r\rr��extend)rrarrrr�<szUserList.extendr})"rrrrbr2rSr�r�r]r�r�r�r�r�r�r6r:r�r�r�r��__rmul__r�r�r�r7r�r=rUr�rzr�r�r�rrrrr�s>
c@s�eZdZdd�Zdd�Zdd�Zdd�Zd	d
�Zdd�Zd
d�Z	dd�Z
dd�Zdd�Zdd�Z
dd�Zdd�Zdd�Zdd�Zdd �Zd!d"�Zd#d$�Zd%d&�ZeZd'd(�Zd)d*�Zd+d,�Zd-d.�Zd/d0�Zd1ejd2d3�Zd4d4d5d6�Zd1ejd7d8�Z d9d:d;�Z!d1ejd<d=�Z"d>d?�Z#d@dA�Z$d1ejdBdC�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_�Z3d4d`da�Z4e5j6Z6dbdc�Z7d�dedf�Z8d1ejdgdh�Z9d1ejdidj�Z:dkdl�Z;dmdn�Z<d4dodp�Z=d4d�dqdr�Z>d4d�dsdt�Z?dudvdw�Z@d1ejdxdy�ZAd4dzd{�ZBd|d}�ZCd~d�ZDd�d��ZEd�d��ZFd�d��ZGd4S)�rcCsVt|t�r||_n7t|t�rC|jdd�|_nt|�|_dS)N)r\r~r�r)r�seqrrrr2Is
zUserString.__init__cCs
t|j�S)N)r~r�)rrrr�__str__PszUserString.__str__cCs
t|j�S)N)r�r�)rrrrrSQszUserString.__repr__cCs
t|j�S)N)�intr�)rrrr�__int__RszUserString.__int__cCs
t|j�S)N)�floatr�)rrrr�	__float__SszUserString.__float__cCs
t|j�S)N)�complexr�)rrrr�__complex__TszUserString.__complex__cCs
t|j�S)N)�hashr�)rrrr�__hash__UszUserString.__hash__cCs|jdd�fS)N)r�)rrrr�__getnewargs__VszUserString.__getnewargs__cCs,t|t�r|j|jkS|j|kS)N)r\rr�)r�stringrrrr]YszUserString.__eq__cCs,t|t�r|j|jkS|j|kS)N)r\rr�)rr�rrrr�]szUserString.__lt__cCs,t|t�r|j|jkS|j|kS)N)r\rr�)rr�rrrr�aszUserString.__le__cCs,t|t�r|j|jkS|j|kS)N)r\rr�)rr�rrrr�eszUserString.__gt__cCs,t|t�r|j|jkS|j|kS)N)r\rr�)rr�rrrr�iszUserString.__ge__cCs%t|t�r|j}||jkS)N)r\rr�)r�charrrrr�ns	zUserString.__contains__cCs
t|j�S)N)r(r�)rrrrr�sszUserString.__len__cCs|j|j|�S)N)rQr�)rrzrrrr�tszUserString.__getitem__cCsct|t�r&|j|j|j�St|t�rI|j|j|�S|j|jt|��S)N)r\rrQr�r~)rrarrrr�us
zUserString.__add__cCs=t|t�r#|j||j�S|jt|�|j�S)N)r\r~rQr�)rrarrrr�{szUserString.__radd__cCs|j|j|�S)N)rQr�)rrGrrrr�szUserString.__mul__cCs|j|j|�S)N)rQr�)rr/rrrr��szUserString.__mod__cCs|j|t�S)N)rQr/)rrurrr�__rmod__�szUserString.__rmod__cCs|j|jj��S)N)rQr��
capitalize)rrrrr��szUserString.capitalizecCs|j|jj��S)N)rQr��casefold)rrrrr��szUserString.casefoldcGs|j|jj||��S)N)rQr��center)r�widthr/rrrr��szUserString.centerr
cCs.t|t�r|j}|jj|||�S)N)r\rr�r�)r�sub�start�endrrrr��s	zUserString.countNcCsW|rA|r(|j|jj||��S|j|jj|��S|j|jj��S)N)rQr��encode)r�encoding�errorsrrrr��s
zUserString.encodecCs|jj|||�S)N)r��endswith)r�suffixr�r�rrrr��szUserString.endswith�cCs|j|jj|��S)N)rQr��
expandtabs)r�tabsizerrrr�szUserString.expandtabscCs.t|t�r|j}|jj|||�S)N)r\rr��find)rr�r�r�rrrr�s	zUserString.findcOs|jj||�S)N)r�ru)rr/r0rrrru�szUserString.formatcCs|jj|�S)N)r��
format_map)rr�rrrr�szUserString.format_mapcCs|jj|||�S)N)r�rz)rr�r�r�rrrrz�szUserString.indexcCs
|jj�S)N)r��isalpha)rrrrr�szUserString.isalphacCs
|jj�S)N)r��isalnum)rrrrr�szUserString.isalnumcCs
|jj�S)N)r��	isdecimal)rrrrr�szUserString.isdecimalcCs
|jj�S)N)r��isdigit)rrrrr�szUserString.isdigitcCs
|jj�S)N)r�r�)rrrrr��szUserString.isidentifiercCs
|jj�S)N)r��islower)rrrrr	�szUserString.islowercCs
|jj�S)N)r��	isnumeric)rrrrr
�szUserString.isnumericcCs
|jj�S)N)r��isprintable)rrrrr�szUserString.isprintablecCs
|jj�S)N)r��isspace)rrrrr�szUserString.isspacecCs
|jj�S)N)r��istitle)rrrrr
�szUserString.istitlecCs
|jj�S)N)r��isupper)rrrrr�szUserString.isuppercCs|jj|�S)N)r�r�)rr�rrrr��szUserString.joincGs|j|jj||��S)N)rQr��ljust)rr�r/rrrr�szUserString.ljustcCs|j|jj��S)N)rQr��lower)rrrrr�szUserString.lowercCs|j|jj|��S)N)rQr��lstrip)r�charsrrrr�szUserString.lstripcCs|jj|�S)N)r��	partition)r�seprrrr�szUserString.partitionr&cCsOt|t�r|j}t|t�r0|j}|j|jj|||��S)N)r\rr�rQr)r�old�new�maxsplitrrrr�s
		zUserString.replacecCs.t|t�r|j}|jj|||�S)N)r\rr��rfind)rr�r�r�rrrr�s	zUserString.rfindcCs|jj|||�S)N)r��rindex)rr�r�r�rrrr�szUserString.rindexcGs|j|jj||��S)N)rQr��rjust)rr�r/rrrr�szUserString.rjustcCs|jj|�S)N)r��
rpartition)rrrrrr�szUserString.rpartitioncCs|j|jj|��S)N)rQr��rstrip)rrrrrr�szUserString.rstripcCs|jj||�S)N)r�r�)rrrrrrr��szUserString.splitcCs|jj||�S)N)r��rsplit)rrrrrrr�szUserString.rsplitFcCs|jj|�S)N)r��
splitlines)r�keependsrrrr�szUserString.splitlinescCs|jj|||�S)N)r�r�)r�prefixr�r�rrrr��szUserString.startswithcCs|j|jj|��S)N)rQr��strip)rrrrrr!�szUserString.stripcCs|j|jj��S)N)rQr��swapcase)rrrrr"�szUserString.swapcasecCs|j|jj��S)N)rQr��title)rrrrr#�szUserString.titlecGs|j|jj|��S)N)rQr��	translate)rr/rrrr$�szUserString.translatecCs|j|jj��S)N)rQr��upper)rrrrr%�szUserString.uppercCs|j|jj|��S)N)rQr��zfill)rr�rrrr&�szUserString.zfillr}r}r})Hrrrr2r�rSr�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�rrrurrzrrrrr�r	r
rrr
rr�rrrr~�	maketransrrrrrrrr�rrr�r!r"r#r$r%r&rrrrrHs�	)8rb�__all__�_collections_abc�operatorrr�r
r`�keywordrr��sysrD�heapqr��_weakrefrr,�	itertoolsrr�rr�rr��reprlibrrg�_collectionsr�ImportError�MutableSequence�registerr�KeysViewr�	ItemsViewr�
ValuesViewr rfr!r>rr�rtr{rr�rrcr	rr�Sequencerrrrr�<module>sZ




�
3^
��lCI

Zerion Mini Shell 1.0