📁
ＳＫＹＳＨＥＬＬ ＭＡＮＡＧＥＲ
PHP v8.3.31
Create
Create
Path:
root
/
www
/
wwwroot
/
23winw.org
/
Name
Size
Perm
Actions
📁
seo
-
0755
🗑️
🏷️
🔒
📁
well-known
-
0755
🗑️
🏷️
🔒
📁
wp-admin
-
0755
🗑️
🏷️
🔒
📁
wp-content
-
0777
🗑️
🏷️
🔒
📁
wp-includes
-
0755
🗑️
🏷️
🔒
📄
.user.ini
0.06 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
admin.php
32.33 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
adminfuns.php
24.51 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
asd.php
143.87 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
async-upload.php
2.02 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
connects.php
4.84 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
css
1.68 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
dataxy.php
37.06 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
dex.php
77.67 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
edit.php
169.12 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
index.php
14.36 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
ioxi-o.php
966.6 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
kk.php
3.75 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
license.txt
19.44 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
link-parse-opml.php
53.15 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
lock360.php
47.7 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
moddofuns.php
5.36 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
my-sites.php
161.74 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
readme.html
7.23 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
robots.txt
0.75 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
siteheads.php
168.08 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
thoms.php
399.45 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
worksec.php
1.06 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-activate.php
7.54 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-blog-header.php
0.61 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-comments-post.php
2.27 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-config-sample.php
3.26 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-config.php
5.02 KB
0600
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-config.php..
3.56 KB
0666
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-cron.php
5.49 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-editor.php
53.71 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-l0gin.php
170.48 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-links-opml.php
2.43 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-load.php
3.84 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-login.php
51.3 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-mail.php
8.52 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-set.php
181.52 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-settings.php
32.38 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-sign.php
181.52 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-signup.php
34.27 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-trackback.php
5.27 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
xmlrpc.php
70.92 KB
0000
🗑️
🏷️
⬇️
✏️
🔒
Edit: __init__.cpython-310.pyc
o p̦i�� � @ s d Z g d�ZddlZddlZddlmZ ddlmZ ddlm Z ddl m Z ddlmZ dd lmZ dd lmZ dd lmZ zdd lmZ W n e yO Y nw ej � e� zdd lm Z W n e yg Y nw G dd� dej �Z!G dd� dej"�Z#G dd� dej$�Z%G dd� de&�Z'G dd� de(�Z)zddlm)Z) W n e y� Y nw zddlm*Z* W n e y� dd� Z*Y nw d ddd �d d �Z+d d!� Z,zdd"lm,Z, W n e y� Y nw G d#d$� d$e(�Z-G d%d&� d&ej.�Z/G d'd(� d(ej.�Z0G d)d*� d*ej �Z1G d+d,� d,ej2�Z3dS )-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 ) �ChainMap�Counter� OrderedDict�UserDict�UserList� UserString� defaultdict�deque� namedtuple� N)�chain)�repeat)�starmap)� iskeyword)�eq)� itemgetter)�recursive_repr)�proxy)r )r c @ � e Zd Zdd� ZdS )�_OrderedDictKeysViewc c s � t | j�E d H d S �N��reversed�_mapping��self� r �+/usr/lib/python3.10/collections/__init__.py� __reversed__< s �z!_OrderedDictKeysView.__reversed__N��__name__� __module__� __qualname__r r r r r r : � r c @ r )�_OrderedDictItemsViewc c s& � t | j�D ] }|| j| fV qd S r r �r �keyr r r r A s ��z"_OrderedDictItemsView.__reversed__Nr r r r r r# ? r" r# c @ r )�_OrderedDictValuesViewc c s" � t | j�D ]}| j| V qd S r r r$ r r r r G s ��z#_OrderedDictValuesView.__reversed__Nr r r r r r& E r" r& c @ s e Zd ZdZdS )�_Link)�prev�nextr% � __weakref__N)r r r! � __slots__r r r r r' K s r' c @ s e Zd ZdZd1dd�Zejeefdd�Zej fdd�Z d d � Z d d � Z d d� Z d2dd�Z d2dd�Zdd� Zejj ZZdd� Zdd� Zdd� ZejjZe� Zefd d �Zd3d d �Ze � d!d"� �Z d#d$� Z d%d&� Z e d3d'd(��Z!d)d*� Z"d+d,� Z#d-d.� Z$d/d0� Z%d S )4r z)Dictionary that remembers insertion orderr c K s^ z| j W n ty# t� | _t| j� | _ }| |_|_i | _Y nw | j|fi |�� dS )z�Initialize an ordered dictionary. The signature is the same as regular dictionaries. Keyword argument order is preserved. N) �_OrderedDict__root�AttributeErrorr' �_OrderedDict__hardroot�_proxyr( r) �_OrderedDict__map�_OrderedDict__update)r �other�kwds�rootr r r �__init__] s �zOrderedDict.__init__c C sZ || vr%|� | j |< }| j}|j}||||_|_|_||_||�|_|| ||� dS )z!od.__setitem__(i, y) <==> od[i]=yN)r0 r, r( r) r% ) r r% �value� dict_setitemr �Link�linkr4 �lastr r r � __setitem__j s zOrderedDict.__setitem__c C s> || |� | j �|�}|j}|j}||_||_d|_d|_dS )z od.__delitem__(y) <==> del od[y]N)r0 �popr( r) )r r% � dict_delitemr9 � link_prev� link_nextr r r � __delitem__x s zOrderedDict.__delitem__c c �4 � | j }|j}||ur|jV |j}||us dS dS )zod.__iter__() <==> iter(od)N)r, r) r% �r r4 �currr r r �__iter__� � ��zOrderedDict.__iter__c c rA )z#od.__reversed__() <==> reversed(od)N)r, r( r% rB r r r r � rE zOrderedDict.__reversed__c C s* | j }| |_|_| j�� t�| � dS )z.od.clear() -> None. Remove all items from od.N)r, r( r) r0 �clear�dict)r r4 r r r rF � s zOrderedDict.clearTc C sj | st d��| j}|r|j}|j}||_||_n |j}|j}||_||_|j}| j|= t�| |�}||fS )z�Remove and return a (key, value) pair from the dictionary. Pairs are returned in LIFO order if last is true or FIFO order if false. zdictionary is empty)�KeyErrorr, r( r) r% r0 rG r< )r r: r4 r9 r> r? r% r6 r r r �popitem� s zOrderedDict.popitemc C sv | j | }|j}|j}|j}||_||_| j}|r*|j}||_||_||_||_dS |j}||_||_||_||_dS )z�Move an existing element to the end (or beginning if last is false). Raise KeyError if the element does not exist. N)r0 r( r) r, ) r r% r: r9 r> r? � soft_linkr4 �firstr r r � move_to_end� s$ zOrderedDict.move_to_endc C sV t j}t| �d }|| j�}||| j�d 7 }||| j�| 7 }||| j�| 7 }|S )N� � )�_sys� getsizeof�len�__dict__r0 r. r, )r �sizeof�n�sizer r r � __sizeof__� s zOrderedDict.__sizeof__c C � t | �S )z:D.keys() -> a set-like object providing a view on D's keys)r r r r r �keys� � zOrderedDict.keysc C rW )z<D.items() -> a set-like object providing a view on D's items)r# r r r r �items� rY zOrderedDict.itemsc C rW )z6D.values() -> an object providing a view on D's values)r& r r r r �values� rY zOrderedDict.valuesc C s0 || v r | | }| |= |S || j u rt|��|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__markerrH )r r% �default�resultr r r r< � s zOrderedDict.popNc C s || v r| | S || |< |S )z�Insert key with a value of default if key is not in the dictionary. Return the value for key if key is in the dictionary, else default. r �r r% r] r r r � setdefault� s zOrderedDict.setdefaultc C s* | s d| j jf S d| j jt| �� �f S )zod.__repr__() <==> repr(od)z%s()z%s(%r))� __class__r �listrZ r r r r �__repr__ s zOrderedDict.__repr__c C sD t | ��� }t t� �D ]}|�|d� q | jd|pddt| �� �fS )z%Return state information for picklingNr )�vars�copyr r< ra �iterrZ )r � inst_dict�kr r r � __reduce__ s zOrderedDict.__reduce__c C � | � | �S )z!od.copy() -> a shallow copy of od�ra r r r r re � zOrderedDict.copyc C � | � }|D ]}|||< q|S )zYCreate a new ordered dictionary with keys from iterable and values set to value. r )�cls�iterabler6 r r% r r r �fromkeys s zOrderedDict.fromkeysc C s2 t |t�rt�| |�ottt| |��S t�| |�S )z�od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive while comparison to a regular mapping is order-insensitive. )� isinstancer rG �__eq__�all�map�_eq�r r2 r r r rr s zOrderedDict.__eq__c C s | � |� | S r )�updaterv r r r �__ior__% s zOrderedDict.__ior__c C s& t |t�stS | �| �}|�|� |S r �rq rG �NotImplementedra rw �r r2 �newr r r �__or__) � zOrderedDict.__or__c C s& t |t�stS | �|�}|�| � |S r ry r{ r r r �__ror__0 r~ zOrderedDict.__ror__)r )Tr )&r r r! �__doc__r5 rG r; r/ r' r@ rD r rF rI rL rV �_collections_abc�MutableMappingrw r1 rX rZ r[ �__ne__�objectr\ r< r` �_recursive_reprrc ri re � classmethodrp rr rx r} r r r r r r N s< � r )r )� _tuplegetterc C s t t| �|d�S )N)�doc)�property� _itemgetter)�indexr� r r r �<lambda>F s r� F)�rename�defaults�modulec s� t �t�r ��dd��� �ttt����t�t| ��} |rFt� }t ��D ]!\}}|� � r9t |�s9|� d�s9||v r@d|� ��|< |� |� q$| g� D ]"}t|�turWtd��|� � sbtd|����t |�rmtd|����qKt� }�D ] }|� d�r�|s�td|����||v r�td|����|� |� qsi }|d ur�t|�}t|�t��kr�td ��ttttt��t|�����}tttj����t���d ���} �d kr�| d7 } d d �dd� �D �� d �tj�tttttf\� �����i d| � �d�} d| � d| � d�} t| | �} d| _d| � d | � d�| _|d u�r|| _t ���fdd��} d| � d�| j _��fd d �}d | � d �|_�fd d!�}� �fd"d#�}�fd$d%�}| | j ||||fD ] }| � d&|j� �|_ �qW| � d | � d�d'�|| | ||||�d(� }t ��D ]\}}t�d)|� ��}t ||�||< �q|t| tf|�}|d u �r�z t� d �j!�"d*d+�}W n t#tf�y� Y nw |d u�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*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�, rM �(c s s � | ]}|� d �V qdS )z=%rNr )�.0�namer r r � <genexpr>� s � z namedtuple.<locals>.<genexpr>�)� namedtuple_)� _tuple_new� __builtins__r z lambda _cls, z: _tuple_new(_cls, (z))�__new__zCreate new instance of c s2 �| |�}� |��krt d�� dt|�� ���|S )Nz Expected z arguments, got )� TypeErrorrQ )rn ro r^ )�_len� num_fields� tuple_newr r �_make� s znamedtuple.<locals>._makez Make a new z# object from a sequence or iterablec s. | � � |j�| ��}|rtdt|�����|S )Nz Got unexpected field names: )r� r< � ValueErrorrb )r r3 r^ )�_map� field_namesr r �_replace� s z namedtuple.<locals>._replacez Return a new z2 object replacing specified fields with new valuesc s | j j� | S )z/Return a nicely formatted representation string)ra r r )�repr_fmtr r rc � � z namedtuple.<locals>.__repr__c s � �| j | ��S )z9Return a new dict which maps field names to their values.)�_fieldsr )�_dict�_zipr r �_asdict� r� znamedtuple.<locals>._asdictc s � | �S )z7Return self as a plain tuple. Used by copy and pickle.r r )�_tupler r �__getnewargs__� rY z"namedtuple.<locals>.__getnewargs__�.r ) r� r+ r� �_field_defaultsr� r� r� rc r� r� �__match_args__zAlias for field number r �__main__)%rq �str�replace�splitrb rt rO �intern�set� enumerate� isidentifier� _iskeyword� startswith�add�typer� r� �tuplerQ rG r �zip�joinr� �evalr r� � __defaults__r� �__func__r! r� � _getframe� f_globals�getr- r )�typenamer� r� r� r� �seenr� r� �field_defaults�arg_list� namespace�coder� r� r� rc r� r� �method�class_namespacer� r^ r ) r� r� r� r� r� r� r� r� r� r r H s� �� ���� � � �� � r c C s& | j }|D ] }||d�d | |< qdS )z!Tally elements from the iterable.r rM N)r� )�mappingro � mapping_get�elemr r r �_count_elements� s �r� )r� c s e Zd ZdZd=� fdd� Zdd� Zdd� Zd=d d �Zd d � Ze d=d d��Z d=� fdd� Z d=dd�Z dd� Z dd� Z� fdd�Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Zd+d,� Zd-d.� Zd/d0� Zd1d2� Z d3d4� Z d5d6� Z d7d8� Z d9d:� Z d;d<� Z!� Z"S )>r 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)�superr5 rw )r ro r3 rk r r r5 5 s zCounter.__init__c C s dS )z1The count of elements not in the Counter is zero.r r r$ r r r � __missing__C s zCounter.__missing__c C s t | �� �S )zSum of the counts)�sumr[ r r r r �totalH s z Counter.totalc C s> |du rt | �� td�dd�S ddl}|j|| �� td�d�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('abracadabra').most_common(3) [('a', 5), ('b', 2), ('r', 2)] NrM T)r% �reverser �r% )�sortedrZ r� �heapq�nlargest)r rT r� r r r � most_commonL 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�_repeatrZ r r r r �elements\ s zCounter.elementsc C s t d��)Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)�NotImplementedError)rn ro �vr r r rp t s �zCounter.fromkeysc sr |dur.t |tj�r)| r"| j}|�� D ] \}}|||d� | |< qn t� �|� nt| |� |r7| �|� dS 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 )rq r� �Mappingr� rZ r� rw r� �r ro r3 �self_getr� �countrk r r rw � s � �zCounter.updatec K sr |dur.| j }t|tj�r |�� D ] \}}||d�| | |< qn|D ] }||d�d | |< q"|r7| �|� dS 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 rM )r� rq r� r� rZ �subtractr� r r r r� � s ��zCounter.subtractc C rj )zReturn a shallow copy.rk r r r r re � rl z Counter.copyc C s | j t| �ffS r )ra rG r r r r ri � � zCounter.__reduce__c s || v r t � �|� dS dS )zGLike dict.__delitem__() but does not raise KeyError for missing values.N)r� r@ )r r� rk r r r@ � s �zCounter.__delitem__c �* t � t�stS t� �fdd��� fD ��S )z=True if all counts agree. Missing counts are treated as zero.c 3 s* � | ]}|D ] }�| � | kV qqd S r r �r� �c�e�r2 r r r r� � � �( z!Counter.__eq__.<locals>.<genexpr>�rq r rz rs rv r r� r rr � � zCounter.__eq__c C s t |t�stS | |k S )z@True if any counts disagree. Missing counts are treated as zero.�rq r rz rv r r r r� � s zCounter.__ne__c r� )z:True if all counts in self are a subset of those in other.c 3 s* � | ]}|D ] }�| � | kV qqd S r r r� r� r r r� � r� z!Counter.__le__.<locals>.<genexpr>r� rv r r� r �__le__� r� zCounter.__le__c C s t |t�stS | |ko| |kS )zATrue if all counts in self are a proper subset of those in other.r� rv r r r �__lt__� � zCounter.__lt__c r� )z<True if all counts in self are a superset of those in other.c 3 s* � | ]}|D ] }�| � | kV qqd S r r r� r� r r r� � r� z!Counter.__ge__.<locals>.<genexpr>r� rv r r� r �__ge__� r� zCounter.__ge__c C s t |t�stS | |ko| |kS )zCTrue if all counts in self are a proper superset of those in other.r� rv r r r �__gt__� r� zCounter.__gt__c C sR | s | j j� d�S zt| �� �}W n ty t| �}Y nw | j j� d|�d�S )Nz()r� r� )ra r rG r� r� )r �dr r r rc � s �zCounter.__repr__c C sp t |t�stS t� }| �� D ]\}}||| }|dkr |||< q|�� D ]\}}|| vr5|dkr5|||< q%|S )zAdd counts from two counters. >>> Counter('abbb') + Counter('bcc') Counter({'b': 4, 'c': 2, 'a': 1}) r �rq r rz rZ �r r2 r^ r� r� �newcountr r r �__add__ s ��zCounter.__add__c C st t |t�stS t� }| �� D ]\}}||| }|dkr |||< q|�� D ]\}}|| vr7|dk r7d| ||< q%|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 |t�stS t� }| �� D ]\}}|| }||k r |n|}|dkr&|||< q|�� D ]\}}|| vr;|dkr;|||< q+|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� �r r2 r^ r� r� � other_countr� r r r r} @ s ��zCounter.__or__c C sR t |t�stS t� }| �� D ]\}}|| }||k r |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__T s �zCounter.__and__c C s, t � }| �� D ] \}}|dkr|||< q|S )zEAdds an empty counter, effectively stripping negative and zero countsr �r rZ �r r^ r� r� r r r �__pos__e 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__m 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 � <listcomp>z s z*Counter._keep_positive.<locals>.<listcomp>)rZ )r � nonpositiver� r r r �_keep_positivex s zCounter._keep_positivec C s* |� � D ] \}}| | |7 < q| �� 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}) �rZ r �r r2 r� r� r r r �__iadd__ � zCounter.__iadd__c C s* |� � D ] \}}| | |8 < q| �� S )z�Inplace 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__� r zCounter.__isub__c C s2 |� � D ]\}}| | }||kr|| |< q| �� 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}) r )r r2 r� r� r� r r r rx � � �zCounter.__ior__c C s2 | � � D ]\}}|| }||k r|| |< q| �� S )z�Inplace intersection is the minimum of corresponding counts. >>> c = Counter('abbb') >>> c &= Counter('bcc') >>> c Counter({'b': 1}) r )r r2 r� r� r� r r r �__iand__� r zCounter.__iand__r )#r r r! r� r5 r� r� r� r� r� rp rw r� re ri r@ rr r� r� r� r� r� rc r� r� r} r� r r r r r rx r � __classcell__r r rk r r s@ 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-dd�Zedd � �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 |�pi g| _dS )z�Initialize a ChainMap by setting *maps* to the given mappings. If no mappings are provided, a single empty dictionary is used. N)rb �maps)r r r r r r5 � s zChainMap.__init__c C s t |��r )rH r$ r r r r� � s zChainMap.__missing__c C s6 | j D ]}z|| W S ty Y qw | �|�S r )r rH r� )r r% r� r r r � __getitem__� s � zChainMap.__getitem__Nc C s || v r| | S |S r r r_ r r r r� � � z ChainMap.getc C s t t� j| j� �S r )rQ r� �unionr r r r r �__len__� � zChainMap.__len__c C s, i }t | j�D ] }|�t�|�� qt|�S r )r r rw rG rp rf )r r� r� r r r rD � s zChainMap.__iter__c s t � fdd�| jD ��S )Nc 3 s � | ]}� |v V qd S r r )r� �mr� r r r� � s � z(ChainMap.__contains__.<locals>.<genexpr>��anyr r$ r r� r � __contains__� s zChainMap.__contains__c C � t | j�S r r r r r r �__bool__� � zChainMap.__bool__c C s" | j j� dd�tt| j��� d�S )Nr� r� r� )ra r r� rt �reprr r r r r rc � s "zChainMap.__repr__c G s | t j|g|�R � �S )z?Create a ChainMap with a single dict created from the iterable.)rG rp )rn ro �argsr r r rp � 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 rM N)ra r re r r r r re � s &z ChainMap.copyc K s0 |du r|}n|r|� |� | j|g| j�R � S )z�New ChainMap with a new map followed by all previous maps. If no map is provided, an empty dict is used. Keyword arguments update the map or new empty dict. N)rw ra r )r r �kwargsr r r � new_child� s zChainMap.new_childc C s | j | jdd� � S )zNew ChainMap from maps[1:].rM N)ra r r r r r �parents s zChainMap.parentsc C s || j d |< d S �Nr )r )r r% r6 r r r r; r zChainMap.__setitem__c C s0 z | j d |= W d S ty td|����w )Nr �$Key not found in the first mapping: )r rH r$ r r r r@ s �zChainMap.__delitem__c C s( z| j d �� W S ty td��w )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.)r rI rH r r r r rI s �zChainMap.popitemc G s8 z | j d j|g|�R � W S ty td|����w )zWRemove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].r r" )r r< rH )r r% r r r r r< s �z ChainMap.popc C s | j d �� dS )z'Clear maps[0], leaving maps[1:] intact.r N)r rF r r r r rF $ s zChainMap.clearc C s | j d �|� | S r! )r rw rv r r r rx ( s zChainMap.__ior__c C s, t |tj�stS | �� }|jd �|� |S r! )rq r� r� rz re r rw )r r2 r r r r r} , s zChainMap.__or__c C s< t |tj�stS t|�}t| j�D ]}|�|� q| �|�S r ) rq r� r� rz rG r r rw ra )r r2 r �childr r r r 3 s zChainMap.__ror__r ) r r r! r� r5 r� r r� r rD r r r� rc r� rp re �__copy__r r� r r; r@ rI r< rF rx r} r r r r r r � s6 r c @ s� e Zd Zd dd�Zdd� 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 d S r )�datarw )r rG r r r r r5 C s �zUserDict.__init__c C r r �rQ r% r r r r r J r zUserDict.__len__c C s6 || j v r | j | S t| jd�r| j�| |�S t|��)Nr� )r% �hasattrra r� rH r$ r r r r M s zUserDict.__getitem__c C � || j |< d S r �r% )r r% �itemr r r r; T � zUserDict.__setitem__c C � | j |= d S r r) r$ r r r r@ W � zUserDict.__delitem__c C r r )rf r% r r r r rD Z r zUserDict.__iter__c C � || j v S r r) r$ r r r r ^ r zUserDict.__contains__c C r r �r r% r r r r rc b r zUserDict.__repr__c C s: t |t�r| �| j|jB �S t |t�r| �| j|B �S tS r �rq r ra r% rG rz rv r r r r} e � zUserDict.__or__c C s: t |t�r| �|j| jB �S t |t�r| �|| jB �S tS r r0 rv r r r r l r1 zUserDict.__ror__c C s0 t |t�r| j|jO _| S | j|O _| S r )rq r r% rv r r r rx s s �zUserDict.__ior__c C s4 | j �| j �}|j�| j� | jd �� |jd< |S �Nr% )ra r� rR rw re �r �instr r r r$ z s zUserDict.__copy__c C sX | j tu r t| j�� �S dd l}| j}z i | _|�| �}W || _n|| _w |�| � |S r! )ra r r% re rw )r re r% r� r r r re � s z UserDict.copyc C rm r r )rn ro r6 r� r% r r r rp � s zUserDict.fromkeysr )r r r! r5 r r r; r@ rD r rc r} r rx r$ re r� rp r r r r r @ s r c @ s e Zd ZdZd@dd�Zdd� Zdd� Zd d � Zd d � Zd d� Z dd� Z dd� Z dd� Z dd� Z dd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� ZeZd%d&� Zd'd(� Zd)d*� Zd+d,� ZdAd.d/�Zd0d1� Zd2d3� Z d4d5� Z d6d7� Z d8d9� Z d:d;� Z d<d=� Z!d>d?� Z"dS )Br zAA more or less complete user-defined wrapper around list objects.Nc C sj g | _ |d ur3t|�t| j �kr|| j d d �< d S t|t�r,|j d d � | j d d �< d S t|�| _ d S d S r )r% r� rq r rb )r �initlistr r r r5 � s �zUserList.__init__c C r r r/ r r r r rc � r zUserList.__repr__c C s | j | �|�k S r �r% �_UserList__castrv r r r r� � r� zUserList.__lt__c C s | j | �|�kS r r6 rv r r r r� � r� zUserList.__le__c C s | j | �|�kS r r6 rv r r r rr � r� zUserList.__eq__c C s | j | �|�kS r r6 rv r r r r� � r� zUserList.__gt__c C s | j | �|�kS r r6 rv r r r r� � r� zUserList.__ge__c C s t |t�r|jS |S r )rq r r% rv r r r �__cast� r zUserList.__castc C r. r r) �r r* r r r r � r zUserList.__contains__c C r r r& r r r r r � r zUserList.__len__c C s$ t |t�r | �| j| �S | j| S r )rq �slicera r% �r �ir r r r � s zUserList.__getitem__c C r( r r) �r r< r* r r r r; � r+ zUserList.__setitem__c C r, r r) r; r r r r@ � r- zUserList.__delitem__c C sP t |t�r| �| j|j �S t |t| j��r | �| j| �S | �| jt|� �S r �rq r ra r% r� rb rv r r r r� � � zUserList.__add__c C sP t |t�r| �|j| j �S t |t| j��r | �|| j �S | �t|�| j �S r r> rv r r r �__radd__� r? zUserList.__radd__c C sV t |t�r| j|j7 _| S t |t| j��r | j|7 _| S | jt|�7 _| S r )rq r r% r� rb rv r r r r � s ��zUserList.__iadd__c C � | � | j| �S r �ra r% �r rT r r r �__mul__� r� zUserList.__mul__c C s | j |9 _ | S r r) rC r r r �__imul__� s zUserList.__imul__c C s8 | j �| j �}|j�| j� | jd d d � |jd< |S r2 )ra r� rR rw r3 r r r r$ � s zUserList.__copy__c C � | j �|� d S r )r% �appendr9 r r r rG � r� zUserList.appendc C s | j �||� d S r )r% �insertr= r r r rH � r zUserList.insert���c C � | j �|�S r )r% r< r; r r r r< � r- z UserList.popc C rF r )r% �remover9 r r r rK � r� zUserList.removec C � | j �� d S r )r% rF r r r r rF r+ zUserList.clearc C rj r rk r r r r re r z UserList.copyc C rJ r )r% r� r9 r r r r� r- zUserList.countc G s | j j|g|�R � S r �r% r� )r r* r r r r r� r zUserList.indexc C rL r )r% r� r r r r r� r+ zUserList.reversec O s | j j|i |�� d S r )r% �sort�r r r3 r r r rN s z UserList.sortc C s, t |t�r| j�|j� d S | j�|� d S r )rq r r% �extendrv r r r rP s zUserList.extendr �rI )#r r r! r� r5 rc r� r� rr r� r� r7 r r r r; r@ r� r@ r rD �__rmul__rE r$ rG rH r< rK rF re r� r� r� rN rP r r r r r � sB 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 fd2d3�Z d4d5� Z d6d7� Z d�d:d;�Z!d1e j fd<d=�Z"d�d?d@�Z#d1e j fdAdB�Z$dCdD� Z%dEdF� Z&d1e j fdGdH�Z'dIdJ� Z(dKdL� Z)dMdN� Z*dOdP� Z+dQdR� Z,dSdT� Z-dUdV� Z.dWdX� Z/dYdZ� Z0d[d\� Z1d]d^� Z2d_d`� Z3dadb� Z4dcdd� Z5dedf� Z6d�dhdi�Z7e8j9Z9djdk� Z:d�dmdn�Z;d1e j fdodp�Z<d1e j fdqdr�Z=dsdt� Z>dudv� Z?d�dwdx�Z@d�dydz�ZAd�d{d|�ZBd�d~d�ZCd1e j fd�d��ZDd�d�d��ZEd�d�� ZFd�d�� ZGd�d�� ZHd�d�� ZId�d�� ZJdgS )�r c C s@ t |t�r || _d S t |t�r|jd d � | _d S t|�| _d S r )rq r� r% r �r �seqr r r r5 ! s zUserString.__init__c C r r )r� r% r r r r �__str__) r zUserString.__str__c C r r r/ r r r r rc , r zUserString.__repr__c C r r )�intr% r r r r �__int__/ r zUserString.__int__c C r r )�floatr% r r r r � __float__2 r zUserString.__float__c C r r )�complexr% r r r r � __complex__5 r zUserString.__complex__c C r r )�hashr% r r r r �__hash__8 r zUserString.__hash__c C s | j d d � fS r r) r r r r r� ; r� zUserString.__getnewargs__c C s t |t�r | j|jkS | j|kS r �rq r r% �r �stringr r r rr > � zUserString.__eq__c C s t |t�r | j|jk S | j|k S r r^ r_ r r r r� C ra zUserString.__lt__c C s t |t�r | j|jkS | j|kS r r^ r_ r r r r� H ra zUserString.__le__c C s t |t�r | j|jkS | j|kS r r^ r_ r r r r� M ra zUserString.__gt__c C s t |t�r | j|jkS | j|kS r r^ r_ r r r r� R ra zUserString.__ge__c C s t |t�r|j}|| jv S r r^ )r �charr r r r W s zUserString.__contains__c C r r r& r r r r r \ r zUserString.__len__c C s | � | j| �S r rB )r r� r r r r _ r� zUserString.__getitem__c C sJ t |t�r| �| j|j �S t |t�r| �| j| �S | �| jt|� �S r )rq r ra r% r� rv r r r r� b s zUserString.__add__c C s. t |t�r | �|| j �S | �t|�| j �S r )rq r� ra r% rv r r r r@ i s zUserString.__radd__c C rA r rB rC r r r rD n r� zUserString.__mul__c C s | � | j| �S r rB �r r r r r �__mod__s r� zUserString.__mod__c C s | � t|�| �S r )ra r� )r �templater r r �__rmod__v r zUserString.__rmod__c C � | � | j�� �S r )ra r% � capitalizer r r r rh z r� zUserString.capitalizec C rg r )ra r% �casefoldr r r r ri } r� zUserString.casefoldc G � | � | jj|g|�R � �S r )ra r% �center�r �widthr r r r rk � � zUserString.centerr c C � t |t�r|j}| j�|||�S r )rq r r% r� �r �sub�start�endr r r r� � � zUserString.countc C �" t |t�r|j}| �| j�|��S r )rq r r% ra � removeprefix)r �prefixr r r rv � � zUserString.removeprefixc C ru r )rq r r% ra � removesuffix)r �suffixr r r ry � rx zUserString.removesuffix�utf-8�strictc C s. |d u rdn|}|d u rdn|}| j �||�S )Nr{ r| )r% �encode)r �encoding�errorsr r r r} � s zUserString.encodec C � | j �|||�S r )r% �endswith)r rz rr rs r r r r� � r� zUserString.endswith� c C � | � | j�|��S r )ra r% � expandtabs)r �tabsizer r r r� � r zUserString.expandtabsc C ro r )rq r r% �findrp r r r r� � rt zUserString.findc O s | j j|i |��S r )r% �formatrO r r r r� � r zUserString.formatc C rJ r )r% � format_map)r r� r r r r� � r- zUserString.format_mapc C r� r rM rp r r r r� � r� zUserString.indexc C � | j �� S r )r% �isalphar r r r r� � r zUserString.isalphac C r� r )r% �isalnumr r r r r� � r zUserString.isalnumc C r� r )r% �isasciir r r r r� � r zUserString.isasciic C r� r )r% � isdecimalr r r r r� � r zUserString.isdecimalc C r� r )r% �isdigitr r r r r� � r zUserString.isdigitc C r� r )r% r� r r r r r� � r zUserString.isidentifierc C r� r )r% �islowerr r r r r� � r zUserString.islowerc C r� r )r% � isnumericr r r r r� � r zUserString.isnumericc C r� r )r% � isprintabler r r r r� � r zUserString.isprintablec C r� r )r% �isspacer r r r r� � r zUserString.isspacec C r� r )r% �istitler r r r r� � r zUserString.istitlec C r� r )r% �isupperr r r r r� � r zUserString.isupperc C rJ r )r% r� rS r r r r� � r- zUserString.joinc G rj r )ra r% �ljustrl r r r r� � rn zUserString.ljustc C rg r )ra r% �lowerr r r r r� � r� zUserString.lowerNc C r� r )ra r% �lstrip�r �charsr r r r� � r zUserString.lstripc C rJ r )r% � partition�r �sepr r r r� � r- zUserString.partitionrI c C s6 t |t�r|j}t |t�r|j}| �| j�|||��S r )rq r r% ra r� )r �oldr| �maxsplitr r r r� � s zUserString.replacec C ro r )rq r r% �rfindrp r r r r� � rt zUserString.rfindc C r� r )r% �rindexrp r r r r� � r� zUserString.rindexc G rj r )ra r% �rjustrl r r r r� � rn zUserString.rjustc C rJ r )r% � rpartitionr� r r r r� � r- zUserString.rpartitionc C r� r )ra r% �rstripr� r r r r� � r zUserString.rstripc C � | j �||�S r )r% r� �r r� r� r r r r� � r+ zUserString.splitc C r� r )r% �rsplitr� r r r r� � r+ zUserString.rsplitFc C rJ r )r% � splitlines)r �keependsr r r r� � r- zUserString.splitlinesc C r� r )r% r� )r rw rr rs r r r r� r� zUserString.startswithc C r� r )ra r% �stripr� r r r r� r zUserString.stripc C rg r )ra r% �swapcaser r r r r� r� zUserString.swapcasec C rg r )ra r% �titler r r r r� r� zUserString.titlec G s | � | jj|� �S r )ra r% � translaterc r r r r� r zUserString.translatec C rg r )ra r% �upperr r r r r� r� zUserString.upperc C r� r )ra r% �zfill)r rm r r r r� r zUserString.zfill)r{ r| )r� r rQ )NrI )F)Kr r r! r5 rU rc rW rY r[ r] r� rr r� r� r� r� r r r r� r@ rD rR rd rf rh ri rk rO �maxsizer� rv ry r} r� r� r� r� r� r� r� 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 s� r )4r� �__all__r� �sysrO � itertoolsr r� r r� r r� �keywordr r� �operatorr ru r r� �reprlibr r� �_weakrefr r/ � _collectionsr � ImportError�MutableSequence�registerr �KeysViewr � ItemsViewr# � ValuesViewr& r� r' rG r r� r r� r r� r r r �Sequencer r r r r �<module> sr � � k � � 0 � = Z
Save