ZIP olu?turuldu: wp-log/parcalar.zip
ZIP olu?turuldu: wp-log/parcalar.zip
ZIP olu?turuldu: wp-log/parcalar.zip
ZIP olu?turuldu: wp-log/parcalar.zip
ZIP olu?turuldu: wp-log/parcalar.zip
ZIP olu?turuldu: wp-log/parcalar.zip
ZIP olu?turuldu: wp-log/parcalar.zip
ZIP olu?turuldu: wp-log/parcalar.zip
a
i @ s& d Z g dZddlZddlZddlZddlmZ ddlm
Z ddlm Z
ddlmZ ddlmZ dd lmZ dd
lmZ dd lmZ zdd l m Z W n e y Y n0 ej e zdd
l m!Z! W n e y Y n0 dd Z"G dd dej#Z$G dd dej%Z&G dd dej'Z(G dd de)Z*G dd de+Z,zddl m,Z, W n e yZ Y n0 zddl m-Z- W n e y d d Z-Y n0 d ddd d d!Z.d"d# Z/zdd$l m/Z/ W n e y Y n0 G d%d& d&e+Z0G d'd( d(ej1Z2G d)d* d*ej1Z3G d+d, d,ej Z4G d-d. d.ej5Z6dS )/a? This module implements specialized container datatypes providing
alternatives to Python's general purpose built-in containers, dict,
list, set, and tuple.
* namedtuple factory function for creating tuple subclasses with named fields
* deque list-like container with fast appends and pops on either end
* ChainMap dict-like class for creating a single view of multiple mappings
* Counter dict subclass for counting hashable objects
* OrderedDict dict subclass that remembers the order entries were added
* defaultdict dict subclass that calls a factory function to supply missing values
* UserDict wrapper around dictionary objects for easier dict subclassing
* UserList wrapper around list objects for easier list subclassing
* UserString wrapper around string objects for easier string subclassing
) ChainMapCounter OrderedDictUserDictUserList
UserString defaultdictdeque
namedtuple N)chain)repeat)starmap) iskeyword)eq)
itemgetter)recursive_repr)proxy)r )r c C sR | t jv r:tt | }dd l}|jdtdd |t | < |S tdtd| d S )Nr
zUsing or importing the ABCs from 'collections' instead of from 'collections.abc' is deprecated since Python 3.3, and in 3.10 it will stop working )
stacklevelzmodule z has no attribute ) _collections_abc__all__getattrwarningswarnDeprecationWarningglobalsAttributeError__name__)nameobjr r ,/usr/lib64/python3.9/collections/__init__.py __getattr__7 s
r" c @ s e Zd Zdd ZdS )_OrderedDictKeysViewc c s t | jE d H d S Nreversed_mappingselfr r r! __reversed__M s z!_OrderedDictKeysView.__reversed__Nr
__module__ __qualname__r* r r r r! r# K s r# c @ s e Zd Zdd ZdS )_OrderedDictItemsViewc c s$ t | jD ]}|| j| fV q
d S r$ r% r) keyr r r! r* R s z"_OrderedDictItemsView.__reversed__Nr+ r r r r! r. P s r. c @ s e Zd Zdd ZdS )_OrderedDictValuesViewc c s t | jD ]}| j| V q
d S r$ r% r/ r r r! r* X s z#_OrderedDictValuesView.__reversed__Nr+ r r r r! r1 V s r1 c @ s e Zd ZdZdS )_Link)prevnextr0 __weakref__N)r r, r- __slots__r r r r! r2 \ s r2 c @ s e Zd ZdZd1ddZejeefddZej fddZ d d
Z
d d Z d
d Z d2ddZ
d3ddZdd Zejj ZZdd Zdd Zdd ZejjZe Zefd d Zd4d d Ze d!d" Z d#d$ Z d%d& Z e d5d'd(Z!d)d* Z"d+d, Z#d-d. Z$d/d0 Z%d S )6r z)Dictionary that remembers insertion orderr c K s^ z
| j W n< tyF t | _t| j | _ }| |_|_i | _Y n0 | j|fi | dS )zInitialize an ordered dictionary. The signature is the same as
regular dictionaries. Keyword argument order is preserved.
N) _OrderedDict__rootr r2 _OrderedDict__hardroot_proxyr3 r4 _OrderedDict__map_OrderedDict__update)r) otherkwdsrootr r r! __init__n s
zOrderedDict.__init__c C sZ || vrJ| | j |< }| j}|j}||| |_|_|_||_|||_|| || dS )z!od.__setitem__(i, y) <==> od[i]=yN)r: r7 r3 r4 r0 ) r) r0 valueZ dict_setitemr ZLinklinkr> lastr r r! __setitem__{ s
zOrderedDict.__setitem__c C s> || | | j |}|j}|j}||_||_d|_d|_dS )z od.__delitem__(y) <==> del od[y]N)r: popr3 r4 )r) r0 Z dict_delitemrA link_prev link_nextr r r! __delitem__ s
zOrderedDict.__delitem__c c s( | j }|j}||ur$|jV |j}q dS )zod.__iter__() <==> iter(od)N)r7 r4 r0 r) r> Zcurrr r r! __iter__ s
zOrderedDict.__iter__c c s( | j }|j}||ur$|jV |j}q dS )z#od.__reversed__() <==> reversed(od)N)r7 r3 r0 rH r r r! r* s
zOrderedDict.__reversed__c C s* | j }| |_|_| j t| dS )z.od.clear() -> None. Remove all items from od.N)r7 r3 r4 r: cleardict)r) r> r r r! rJ s
zOrderedDict.clearTc C sj | s t d| j}|r0|j}|j}||_||_n|j}|j}||_||_|j}| j|= t| |}||fS )zRemove and return a (key, value) pair from the dictionary.
Pairs are returned in LIFO order if last is true or FIFO order if false.
zdictionary is empty)KeyErrorr7 r3 r4 r0 r: rK rD )r) rB r> rA rE rF r0 r@ 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 is false).
Raise KeyError if the element does not exist.
N)r: r3 r4 r7 ) r) r0 rB rA rE rF Z soft_linkr> 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 )N r )_sys getsizeoflen__dict__r: r8 r7 )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)r1 r( r r r! values s zOrderedDict.valuesc C s0 || v r| | }| |= |S || j u r,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__markerrL )r) r0 defaultresultr r r! rD s
zOrderedDict.popNc C s || v r| | S || |< |S )zInsert key with a value of default if key is not in the dictionary.
Return the value for key if key is in the dictionary, else default.
r r) r0 r\ 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 listrY r( r r r! __repr__ s zOrderedDict.__repr__c C sD t | }t t D ]}||d q| jd|p4ddt| fS )z%Return state information for picklingNr )varscopyr rD r` iterrY )r) inst_dictkr r r!
__reduce__ s zOrderedDict.__reduce__c C s
| | S )z!od.copy() -> a shallow copy of odr` r( r r r! rd s zOrderedDict.copyc C s | }|D ] }|||< q
|S )zYCreate a new ordered dictionary with keys from iterable and values set to value.
r )clsiterabler@ r) r0 r r r! fromkeys$ s
zOrderedDict.fromkeysc C s2 t |tr&t| |o$ttt| |S t| |S )zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)
isinstancer rK __eq__allmap_eqr) r< r r r! rn - s
zOrderedDict.__eq__c C s | | | S r$ )updaterr r r r! __ior__6 s
zOrderedDict.__ior__c C s& t |tstS | | }|| |S r$ rm rK NotImplementedr` rs r) r< newr r r! __or__: s
zOrderedDict.__or__c C s& t |tstS | |}|| |S r$ ru rw r r r! __ror__A s
zOrderedDict.__ror__)r )T)T)N)N)&r r, r- __doc__r? rK rC r9 r2 rG rI r* rJ rM rO rW r MutableMappingrs r; rX rY rZ __ne__objectr[ rD r_ _recursive_reprrb rh rd classmethodrl rn rt ry rz r r r r! r _ s:
r )r ) _tuplegetterc C s t t| |dS )N)doc)property _itemgetter)indexr r r r! W r F)renamedefaultsmodulec s t trdd ttttt| } |rt }t D ]B\}}|
rrt |sr| dsr||v rd| |< |
| qH| g D ]D}t|turtd|
std|t |rtd|qt }D ]F}| dr
|s
td|||v r"td||
| qi }|d ur|t|}t|tkr^td
tttttt|}tttjtd } d kr| d7 } d
d dd D d tjtttttf\ i d| d}
d| d| d} t| |
} d| _d| d
| d| _|d urB|| _t fdd}
d| d|
j _fd d }d | d |_fd d!} fd"d#}fd$d%}| |
j ||||fD ]}| d&|j |_ q| d
| dd'|| |
||||d(
}t D ](\}}td)| }t ||||< qt| tf|}|d u rvzt d j!"d*d+}W n t#tfyt Y n0 |d ur||_$|S ),aC Returns a new subclass of tuple with named fields.
>>> Point = namedtuple('Point', ['x', 'y'])
>>> Point.__doc__ # docstring for the new class
'Point(x, y)'
>>> p = Point(11, y=22) # instantiate with positional args or keywords
>>> p[0] + p[1] # indexable like a plain tuple
33
>>> x, y = p # unpack like a regular tuple
>>> x, y
(11, 22)
>>> p.x + p.y # fields also accessible by name
33
>>> d = p._asdict() # convert to a dictionary
>>> d['x']
11
>>> Point(**d) # convert from a dictionary
Point(x=11, y=22)
>>> p._replace(x=100) # _replace() is like str.replace() but targets named fields
Point(x=100, y=22)
, _z*Type names and field names must be stringsz6Type names and field names must be valid identifiers: z0Type names and field names cannot be a keyword: z-Field names cannot start with an underscore: z"Encountered duplicate field name: Nz(Got more default values than field names, rP (c s s | ]}| d V qdS )z=%rNr ).0r r r r! r z namedtuple..) namedtuple_)
_tuple_new __builtins__r z
lambda _cls, z: _tuple_new(_cls, (z))__new__zCreate new instance of c s2 | |} |kr.t d dt| |S )Nz Expected z arguments, got ) TypeErrorrS )rj rk r] )_len
num_fields tuple_newr r! _make s
znamedtuple.._makez Make a new z# object from a sequence or iterablec s. | |j| }|r*tdt||S )Nz Got unexpected field names: )r rD
ValueErrorra )r) r= r] )_map 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! rb s z namedtuple..__repr__c s | j | S )z9Return a new dict which maps field names to their values.)_fieldsr( )_dict_zipr r! _asdict s znamedtuple.._asdictc s | S )z7Return self as a plain tuple. Used by copy and pickle.r r( )_tupler r! __getnewargs__ s z"namedtuple..__getnewargs__.r )
r{ r6 r _field_defaultsr r r rb r r zAlias for field number r __main__)%rm strreplacesplitra rp rQ internset enumerate isidentifier
_iskeyword
startswithaddtyper r tuplerS rK r& zipjoinr evalr r{ __defaults__r __func__r- r _getframe f_globalsgetr r, )typenamer r r r seenr r field_defaultsarg_list namespacecoder r r rb r r methodclass_namespacer r] r ) r r r r r r r r r r! r Y s
r c C s& | j }|D ]}||dd | |< q
dS )z!Tally elements from the iterable.r
rP N)r )mappingrk Z mapping_getelemr r r! _count_elements s r )r c s e Zd ZdZd/ fdd Zdd Zd0ddZd d
Zed1d d Z d2 fd
d Z
d3ddZ 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 )4r a Dict subclass for counting hashable items. Sometimes called a bag
or multiset. Elements are stored as dictionary keys and their counts
are stored as dictionary values.
>>> c = Counter('abcdeabcdabcaba') # count elements from a string
>>> c.most_common(3) # three most common elements
[('a', 5), ('b', 4), ('c', 3)]
>>> sorted(c) # list all unique elements
['a', 'b', 'c', 'd', 'e']
>>> ''.join(sorted(c.elements())) # list elements with repetitions
'aaaaabbbbcccdde'
>>> sum(c.values()) # total of all counts
15
>>> c['a'] # count of letter 'a'
5
>>> for elem in 'shazam': # update counts from an iterable
... c[elem] += 1 # by adding 1 to each element's count
>>> c['a'] # now there are seven 'a'
7
>>> del c['b'] # remove all 'b'
>>> c['b'] # now there are zero 'b'
0
>>> d = Counter('simsalabim') # make another counter
>>> c.update(d) # add in the second counter
>>> c['a'] # now there are nine 'a'
9
>>> c.clear() # empty the counter
>>> c
Counter()
Note: If a count is set to zero or reduced to zero, it will remain
in the counter until the entry is deleted or the counter is cleared:
>>> c = Counter('aaabbc')
>>> c['b'] -= 2 # reduce the count of 'b' by two
>>> c.most_common() # 'b' is still in, but its count is zero
[('a', 3), ('c', 1), ('b', 0)]
Nc s t | j|fi | dS )a Create a new, empty Counter object. And if given, count elements
from an input iterable. Or, initialize the count from another mapping
of elements to their counts.
>>> c = Counter() # a new, empty counter
>>> c = Counter('gallahad') # a new counter from an iterable
>>> c = Counter({'a': 4, 'b': 2}) # a new counter from a mapping
>>> c = Counter(a=4, b=2) # a new counter from keyword args
N)superr? rs )r) rk r= ri r r! r? E s
zCounter.__init__c C s dS )z1The count of elements not in the Counter is zero.r
r r/ r r r! __missing__S s zCounter.__missing__c C s6 |du r t | tdddS tj|| 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('abracadabra').most_common(3)
[('a', 5), ('b', 2), ('r', 2)]
NrP T)r0 reverser0 )sortedrY r _heapqnlargestr) rU r r r! most_commonX 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_repeatrY r( r r r! elementse s zCounter.elementsc C s t dd S )Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)NotImplementedError)rj rk vr r r! rl } s zCounter.fromkeysc sn |dur\t |tjrR| rD| j}| D ]\}}|||d | |< q&q\t | n
t| | |rj| | dS )a Like dict.update() but add counts instead of replacing them.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.update('witch') # add elements from another iterable
>>> d = Counter('watch')
>>> c.update(d) # add elements from another counter
>>> c['h'] # four 'h' in which, witch, and watch
4
Nr
)rm r Mappingr rY r rs r r) rk r= self_getr countri r r! rs s
zCounter.updatec K sn |dur\| j }t|tjr@| D ]\}}||d| | |< q"n |D ]}||dd | |< qD|rj| | dS )a Like dict.update() but subtracts counts instead of replacing them.
Counts can be reduced below zero. Both the inputs and outputs are
allowed to contain zero and negative counts.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.subtract('witch') # subtract elements from another iterable
>>> c.subtract(Counter('watch')) # subtract elements from another counter
>>> c['h'] # 2 in which, minus 1 in witch, minus 1 in watch
0
>>> c['w'] # 1 in which, minus 1 in witch, minus 1 in watch
-1
Nr
rP )r rm r r rY subtractr r r r! r s zCounter.subtractc C s
| | S )zReturn a shallow copy.ri r( r r r! rd s z Counter.copyc C s | j t| ffS r$ )r` rK r( r r r! rh s zCounter.__reduce__c s || v rt | dS )zGLike dict.__delitem__() but does not raise KeyError for missing values.N)r rG )r) r ri r r! rG s zCounter.__delitem__c C sR | s| j j dS zt| }W n ty< t| }Y n0 | j j d|dS )Nz()r r )r` r rK r r )r) dr r r! rb s zCounter.__repr__c C sp t |tstS t }| D ]$\}}||| }|dkr |||< q | D ] \}}|| vrJ|dkrJ|||< qJ|S )zAdd counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
r
rm r rv rY r) r< r] r r newcountr r r! __add__ s
zCounter.__add__c C st t |tstS t }| D ]$\}}||| }|dkr |||< q | D ]$\}}|| vrJ|dk rJd| ||< qJ|S )z Subtract count, but keep only results with positive counts.
>>> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
r
r r r r r! __sub__ s
zCounter.__sub__c C s| t |tstS t }| D ]0\}}|| }||k r8|n|}|dkr |||< q | D ] \}}|| vrV|dkrV|||< qV|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< r] r r other_countr r r r! ry s
zCounter.__or__c C sR t |tstS t }| D ]0\}}|| }||k r8|n|}|dkr |||< q |S )z Intersection is the minimum of corresponding counts.
>>> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
r
r r r r r! __and__' s
zCounter.__and__c C s, t }| D ]\}}|dkr|||< q|S )zEAdds an empty counter, effectively stripping negative and zero countsr
r rY r) r] r r r r r! __pos__8 s
zCounter.__pos__c C s0 t }| D ] \}}|dk rd| ||< q|S )z{Subtracts from an empty counter. Strips positive and zero counts,
and flips the sign on negative counts.
r
r r r r r! __neg__@ s
zCounter.__neg__c C s& dd | D }|D ]
}| |= q| 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!
M r z*Counter._keep_positive..)rY )r) nonpositiver r r r! _keep_positiveK s zCounter._keep_positivec C s* | D ]\}}| | |7 < q| S )zInplace add from another counter, keeping only positive counts.
>>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
rY r r) r< r r r r r! __iadd__R s zCounter.__iadd__c C s* | D ]\}}| | |8 < q| S )zInplace subtract counter, but keep only results with positive counts.
>>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
r r r r r! __isub___ s zCounter.__isub__c C s2 | D ] \}}| | }||kr|| |< q| 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})
r )r) r< r r r r r r! rt l s
zCounter.__ior__c C s2 | D ] \}}|| }||k r|| |< q| S )zInplace intersection is the minimum of corresponding counts.
>>> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
r )r) r< r r r r r r! __iand__{ s
zCounter.__iand__)N)N)N)N)N) r r, r- r{ r? r r r r rl rs r rd rh rG rb r r ry r r r r r r rt r
__classcell__r r ri r! r s0 2
"
r 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& Zd'd( Zd)d* Zd+d, Z dS )/r a A ChainMap groups multiple dicts (or other mappings) together
to create a single, updateable view.
The underlying mappings are stored in a list. That list is public and can
be accessed or updated using the *maps* attribute. There is no other
state.
Lookups search the underlying mappings successively until a key is found.
In contrast, writes, updates, and deletions only operate on the first
mapping.
c 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)ra maps)r) r r r r! r? s zChainMap.__init__c C s t |d S r$ )rL r/ r r r! r s zChainMap.__missing__c C s8 | j D ]&}z|| W S ty* Y q0 q| |S r$ )r rL r )r) r0 r r r r! __getitem__ s
zChainMap.__getitem__Nc C s || v r| | S |S r$ r r^ r r r! r s z ChainMap.getc C s t t j| j S r$ )rS r unionr r( r r r! __len__ s zChainMap.__len__c C s, i }t | jD ]}|t| qt|S r$ )r& r rs rK rl re )r) r r r r r! rI s zChainMap.__iter__c s t fdd| jD S )Nc 3 s | ]} |v V qd S r$ r )r mr r r! r r z(ChainMap.__contains__..anyr r/ r r r! __contains__ s zChainMap.__contains__c C s
t | jS r$ r r( r r r! __bool__ s zChainMap.__bool__c C s" | j j ddtt| j dS )Nr r r )r` r r rp reprr r( r r r! rb s zChainMap.__repr__c G s | t j|g|R S )z?Create a ChainMap with a single dict created from the iterable.)rK rl )rj rk argsr r r! rl s zChainMap.fromkeysc C s& | j | jd g| jdd R S )zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]r
rP N)r` r rd r( r r r! rd s z
ChainMap.copyc C s |du r i }| j |g| jR S )zyNew ChainMap with a new map followed by all previous maps.
If no map is provided, an empty dict is used.
Nr` r )r) r r r r! new_child s zChainMap.new_childc C s | j | jdd S )zNew ChainMap from maps[1:].rP Nr r( r r r! parents s zChainMap.parentsc C s || j d |< d S Nr
)r )r) r0 r@ r r r! rC s zChainMap.__setitem__c C s6 z| j d |= W n ty0 td|Y n0 d S )Nr
$Key not found in the first mapping: )r rL r/ r r r! rG s zChainMap.__delitem__c C s0 z| j d W S ty* tdY n0 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 rM rL r( r r r! rM s zChainMap.popitemc G s@ z| j d j|g|R W S ty: td|Y n0 dS )zWRemove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].r
r N)r rD rL )r) r0 r r r r! rD s z ChainMap.popc C s | j d dS )z'Clear maps[0], leaving maps[1:] intact.r
N)r rJ r( r r r! rJ s zChainMap.clearc C s | j d | | S r )r rs rr r r r! rt s zChainMap.__ior__c C s, t |tjstS | }|jd | |S r )rm r r rv rd r rs )r) r< r r r r! ry s
zChainMap.__or__c C s< t |tjstS t|}t| jD ]}|| q"| |S r$ ) rm r r rv rK r& r rs r` )r) r< r childr r r! rz s zChainMap.__ror__)N)N) r r, r- r{ r? r r r r rI r r r rb r rl rd __copy__r r r rC rG rM rD rJ rt ry rz r r r r! r s4
r c @ s e Zd Zd ddZdd Zdd Zdd Zd
d Zd d
Zdd Z dd Z
dd Z dd Z dd Z
dd Zdd Zed d d ZdS ) r Nc K s* i | _ |d ur| | |r&| | d S r$ )datars )r) rK kwargsr r r! r? s
zUserDict.__init__c C s
t | jS r$ rS r r( r r r! r s zUserDict.__len__c C s: || j v r| j | S t| jdr.| j| |S t|d S )Nr )r hasattrr` r rL r/ r r r! r s
zUserDict.__getitem__c C s || j |< d S r$ r )r) r0 itemr r r! rC $ s zUserDict.__setitem__c C s | j |= d S r$ r
r/ r r r! rG ' s zUserDict.__delitem__c C s
t | jS r$ )re r r( r r r! rI * s zUserDict.__iter__c C s
|| j v S r$ r
r/ r r r! r . s zUserDict.__contains__c C s
t | jS r$ r r r( r r r! rb 2 s zUserDict.__repr__c C s: t |tr | | j|jB S t |tr6| | j|B S tS r$ rm r r` r rK rv rr r r r! ry 5 s
zUserDict.__or__c C s: t |tr | |j| jB S t |tr6| || jB S tS r$ r
rr r r r! rz < s
zUserDict.__ror__c C s. t |tr | j|jO _n| j|O _| S r$ )rm r r rr r r r! rt C s
zUserDict.__ior__c C s4 | j | j }|j| j | jd |jd< |S Nr )r` r rT rs rd r) instr r r! r J s zUserDict.__copy__c C sX | j tu rt| j S dd l}| j}zi | _|| }W || _n|| _0 || |S r )r` r r rd rs )r) rd r cr r r! rd Q s
z
UserDict.copyc C s | }|D ] }|||< q
|S r$ r )rj rk r@ r r0 r r r! rl ^ s
zUserDict.fromkeys)N)N)r r, r- r? r r rC rG rI r rb ry rz rt r rd r rl r r r r! r s
r 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, 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 ur^t|t| j kr0|| j d d < n.t|trT|j d d | j d d < n
t|| _ d S r$ )r r rm r ra )r) initlistr r r! r? m s
zUserList.__init__c C s
t | jS r$ r r( r r r! rb x s zUserList.__repr__c C s | j | |k S r$ r _UserList__castrr r r r! __lt__{ s zUserList.__lt__c C s | j | |kS r$ r rr r r r! __le__~ s zUserList.__le__c C s | j | |kS r$ r rr r r r! rn s zUserList.__eq__c C s | j | |kS r$ r rr r r r! __gt__ s zUserList.__gt__c C s | j | |kS r$ r rr r r r! __ge__ s zUserList.__ge__c C s t |tr|jS |S r$ )rm r r rr r r r! __cast s zUserList.__castc C s
|| j v S r$ r
r) r r r r! r s zUserList.__contains__c C s
t | jS r$ r r( r r r! r s zUserList.__len__c C s( t |tr| | j| S | j| S d S r$ )rm slicer` r r) ir r r! r s
zUserList.__getitem__c C s || j |< d S r$ r
r) r r r r r! rC s zUserList.__setitem__c C s | j |= d S r$ r
r r r r! rG s zUserList.__delitem__c C sP t |tr | | j|j S t |t| jr<| | j| S | | jt| S r$ rm r r` r r ra rr r r r! r s
zUserList.__add__c C sP t |tr | |j| j S t |t| jr<| || j S | t|| j S r$ r rr r r r! __radd__ s
zUserList.__radd__c C sR t |tr | j|j7 _n2t |t| jr<| j|7 _n| jt|7 _| S r$ )rm r r r ra rr r r r! r s
zUserList.__iadd__c C s | | j| S r$ r` r r r r r! __mul__ s zUserList.__mul__c C s | j |9 _ | S r$ r
r r r r! __imul__ s zUserList.__imul__c C s8 | j | j }|j| j | jd d d |jd< |S r )r` r rT rs r r r r! r s zUserList.__copy__c C s | j | d S r$ )r appendr r r r! r$ s zUserList.appendc C s | j || d S r$ )r insertr r r r! r% s zUserList.insertc C s | j |S r$ )r rD r r r r! rD s z UserList.popc C s | j | d S r$ )r remover r r r! r' s zUserList.removec C s | j d S r$ )r rJ r( r r r! rJ s zUserList.clearc C s
| | S r$ ri r( r r r! rd s z
UserList.copyc C s | j |S r$ )r r r r r r! r s zUserList.countc G s | j j|g|R S r$ r r )r) r r r r r! r s zUserList.indexc C s | j d S r$ )r r r( r r r! r s zUserList.reversec O s | j j|i | d S r$ )r sortr) r r= r r r! r) s z
UserList.sortc C s* t |tr| j|j n | j| d S r$ )rm r r extendrr r r r! r+ s
zUserList.extend)N)r& )#r r, r- r{ r? rb r r rn r r r r r r rC rG r r r r" __rmul__r# r r$ r% rD r' rJ rd r r r r) r+ r r r r! r j s@
r c @ sx 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 d4d5 Z d6d7 Z dd:d;Z!d1e j fddudv Z?ddwdxZ@ddydzZAdd{d|ZBdd~dZCd1e j fddZDdddZEdd ZFdd ZGdd ZHdd ZIdd ZJdgS )r c C s< t |tr|| _n&t |tr.|jd d | _n
t|| _d S r$ )rm r r r r) seqr r r! r? s
zUserString.__init__c C s
t | jS r$ )r r r( r r r! __str__ s zUserString.__str__c C s
t | jS r$ r r( r r r! rb s zUserString.__repr__c C s
t | jS r$ )intr r( r r r! __int__ s zUserString.__int__c C s
t | jS r$ )floatr r( r r r! __float__ s zUserString.__float__c C s
t | jS r$ )complexr r( r r r! __complex__ s zUserString.__complex__c C s
t | jS r$ )hashr r( r r r! __hash__ s zUserString.__hash__c C s | j d d fS r$ r
r( r r r! r s zUserString.__getnewargs__c C s t |tr| j|jkS | j|kS r$ rm r r r) stringr r r! rn s
zUserString.__eq__c C s t |tr| j|jk S | j|k S r$ r8 r9 r r r! r s
zUserString.__lt__c C s t |tr| j|jkS | j|kS r$ r8 r9 r r r! r s
zUserString.__le__c C s t |tr| j|jkS | j|kS r$ r8 r9 r r r! r s
zUserString.__gt__c C s t |tr| j|jkS | j|kS r$ r8 r9 r r r! r " s
zUserString.__ge__c C s t |tr|j}|| jv S r$ r8 )r) charr r r! r ' s
zUserString.__contains__c C s
t | jS r$ r r( r r r! r , s zUserString.__len__c C s | | j| S r$ r! )r) r r r r! r / s zUserString.__getitem__c C sJ t |tr | | j|j S t |tr6| | j| S | | jt| S r$ )rm r r` r r rr r r r! r 2 s
zUserString.__add__c C s. t |tr| || j S | t|| j S r$ )rm r r` r rr r r r! r 9 s
zUserString.__radd__c C s | | j| S r$ r! r r r r! r" > s zUserString.__mul__c C s | | j| S r$ r! r) r r r r! __mod__C s zUserString.__mod__c C s | t|| S r$ )r` r )r) templater r r! __rmod__F s zUserString.__rmod__c C s | | j S r$ )r` r
capitalizer( r r r! r@ J s zUserString.capitalizec C s | | j S r$ )r` r casefoldr( r r r! rA M s zUserString.casefoldc G s | | jj|g|R S r$ )r` r centerr) widthr r r r! rB P s zUserString.centerr
c C s t |tr|j}| j|||S r$ )rm r r r r) substartendr r r! r S s
zUserString.countc C s" t |tr|j}| | j|S r$ )rm r r r` removeprefix)r) prefixr r r! rI X s
zUserString.removeprefixc C s" t |tr|j}| | j|S r$ )rm r r r` removesuffix)r) suffixr r r! rK ] s
zUserString.removesuffixutf-8strictc C s. |d u r dn|}|d u r dn|}| j ||S )NrM rN )r encode)r) encodingerrorsr r r! rO b s zUserString.encodec C s | j |||S r$ )r endswith)r) rL rG rH r r r! rR g s zUserString.endswith c C s | | j|S r$ )r` r
expandtabs)r) tabsizer r r! rT j s zUserString.expandtabsc C s t |tr|j}| j|||S r$ )rm r r findrE r r r! rV m s
zUserString.findc O s | j j|i |S r$ )r formatr* r r r! rW r s zUserString.formatc C s | j |S r$ )r
format_map)r) r r r r! rX u s zUserString.format_mapc C s | j |||S r$ r( rE r r r! r x s zUserString.indexc C s
| j S r$ )r isalphar( r r r! rY { s zUserString.isalphac C s
| j S r$ )r isalnumr( r r r! rZ ~ s zUserString.isalnumc C s
| j S r$ )r isasciir( r r r! r[ s zUserString.isasciic C s
| j S r$ )r isdecimalr( r r r! r\ s zUserString.isdecimalc C s
| j S r$ )r isdigitr( r r r! r] s zUserString.isdigitc C s
| j S r$ )r r r( r r r! r s zUserString.isidentifierc C s
| j S r$ )r islowerr( r r r! r^ s zUserString.islowerc C s
| j S r$ )r isnumericr( r r r! r_ s zUserString.isnumericc C s
| j S r$ )r isprintabler( r r r! r` s zUserString.isprintablec C s
| j S r$ )r isspacer( r r r! ra s zUserString.isspacec C s
| j S r$ )r istitler( r r r! rb s zUserString.istitlec C s
| j S r$ )r isupperr( r r r! rc s zUserString.isupperc C s | j |S r$ )r r r- r r r! r s zUserString.joinc G s | | jj|g|R S r$ )r` r ljustrC r r r! rd s zUserString.ljustc C s | | j S r$ )r` r lowerr( r r r! re s zUserString.lowerNc C s | | j|S r$ )r` r lstripr) charsr r r! rf s zUserString.lstripc C s | j |S r$ )r partitionr) sepr r r! ri s zUserString.partitionr& c C s6 t |tr|j}t |tr |j}| | j|||S r$ )rm r r r` r )r) oldrx maxsplitr r r! r s
zUserString.replacec C s t |tr|j}| j|||S r$ )rm r r rfindrE r r r! rn s
zUserString.rfindc C s | j |||S r$ )r rindexrE r r r! ro s zUserString.rindexc G s | | jj|g|R S r$ )r` r rjustrC r r r! rp s zUserString.rjustc C s | j |S r$ )r
rpartitionrj r r r! rq s zUserString.rpartitionc C s | | j|S r$ )r` r rstriprg r r r! rr s zUserString.rstripc C s | j ||S r$ )r r r) rk rm r r r! r s zUserString.splitc C s | j ||S r$ )r rsplitrs r r r! rt s zUserString.rsplitFc C s | j |S r$ )r
splitlines)r) keependsr r r! ru s zUserString.splitlinesc C s | j |||S r$ )r r )r) rJ rG rH r r r! r s zUserString.startswithc C s | | j|S r$ )r` r striprg r r r! rw s zUserString.stripc C s | | j S r$ )r` r swapcaser( r r r! rx s zUserString.swapcasec C s | | j S r$ )r` r titler( r r r! ry s zUserString.titlec G s | | jj| S r$ )r` r translater< r r r! rz s zUserString.translatec C s | | j S r$ )r` r upperr( r r r! r{ s zUserString.upperc C s | | j|S r$ )r` r zfill)r) rD r r r! r| s zUserString.zfill)rM rN )rS )N)r& )N)Nr& )Nr& )F)N)Kr r, r- r? r/ rb r1 r3 r5 r7 r rn r r r r r r r r r r" r, r= r? r@ rA rB rQ maxsizer rI rK rO rR rT rV rW rX r rY rZ r[ r\ r] r r^ r_ r` ra rb rc r rd re rf r maketransri r rn ro rp rq rr r rt ru r rw rx ry rz r{ r| r r r r! r s
r )7r{ r r heapqr sysrQ itertoolsr r r r r
r keywordr r operatorr rq r r reprlibr r _weakrefr r9 _collectionsr ImportErrorMutableSequenceregisterr r" KeysViewr# ItemsViewr.
ValuesViewr1 r~ r2 rK r r r r r r| r r r Sequencer r r r r! sj k / Z