Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/sqlalchemy/util/__pycache__/_collections.cpython-39.pyc
Ðазад
a _�h#r � @ s. d Z ddlmZ ddlZddlZddlZddlmZ ddlmZ ddlm Z ddlm Z dd lm Z dd lm Z e � ZG d d � d e�ZG d d� de�ZG dd� de�ZG dd� de�ZG dd� dee�ZG dd� de�ZG dd� de�ZG dd� dee�ZG dd � d e�ZG d d � d e�Z G d d � d e�Z G d!d"� d"e�Z G d#d$� d$e �Z G d%d&� d&e�Z G d'd(� d(e�Z!eZ"eZ#e Z$e ej%�Z&e d)d*� �Z'dHd+d,�Z(G d-d.� d.e�Z)d/d0� Z*dId1d2�Z+d3d4� Z,d5d6� Z-d7d8� Z.dJd9d:�Z/d;d<� Z0G d=d>� d>e�Z1e1d?�Z2d@dA� Z3G dBdC� dCe�Z4G dDdE� dEe4�Z5dFdG� Z6dS )Kz Collection classes and helpers.� )�absolute_importN� )� binary_types)�collections_abc)�itertools_filterfalse)�py2k)� string_types)� threadingc @ s e Zd ZdZdd� ZdS )�AbstractKeyedTuple� c C s t | j�S )z�Return a list of string key names for this :class:`.KeyedTuple`. .. seealso:: :attr:`.KeyedTuple._fields` )�list�_fields��selfr r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/sqlalchemy/util/_collections.py�keys s zAbstractKeyedTuple.keysN)�__name__� __module__� __qualname__� __slots__r r r r r r s r c @ s6 e Zd ZdZd dd�Zedd� �Zdd� Zd d � ZdS ) � KeyedTuplea ``tuple`` subclass that adds labeled names. E.g.:: >>> k = KeyedTuple([1, 2, 3], labels=["one", "two", "three"]) >>> k.one 1 >>> k.two 2 Result rows returned by :class:`_query.Query` that contain multiple ORM entities and/or column expressions make use of this class to return rows. The :class:`.KeyedTuple` exhibits similar behavior to the ``collections.namedtuple()`` construct provided in the Python standard library, however is architected very differently. Unlike ``collections.namedtuple()``, :class:`.KeyedTuple` is does not rely on creation of custom subtypes in order to represent a new series of keys, instead each :class:`.KeyedTuple` instance receives its list of keys in place. The subtype approach of ``collections.namedtuple()`` introduces significant complexity and performance overhead, which is not necessary for the :class:`_query.Query` object's use case. .. seealso:: :ref:`ormtutorial_querying` Nc C s6 t �| |�}|r$|j�t||�� ng }||jd< |S )N�_labels)�tuple�__new__�__dict__�update�zip)�cls�vals�labels�tr r r r J s zKeyedTuple.__new__c C s t dd� | jD ��S )z�Return a tuple of string key names for this :class:`.KeyedTuple`. This method provides compatibility with ``collections.namedtuple()``. .. seealso:: :meth:`.KeyedTuple.keys` c S s g | ]}|d ur|�qS �Nr )�.0�lr r r � <listcomp>^ � z&KeyedTuple._fields.<locals>.<listcomp>)r r r r r r r S s zKeyedTuple._fieldsc C s t d| ��d S )NzCan't set attribute: %s)�AttributeError�r �key�valuer r r � __setattr__` s zKeyedTuple.__setattr__c s � fdd�� � � D �S )z�Return the contents of this :class:`.KeyedTuple` as a dictionary. This method provides compatibility with ``collections.namedtuple()``, with the exception that the dictionary returned is **not** ordered. c s i | ]}|� j | �qS r )r �r" r( r r r � <dictcomp>j r% z&KeyedTuple._asdict.<locals>.<dictcomp>)r r r r r �_asdictc s zKeyedTuple._asdict)N) r r r �__doc__r �propertyr r* r- r r r r r * s r c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) �_LWr c C s t �| |�S r! )r r )r r r r r r p s z _LW.__new__c C s t t| �| jffS r! )r r � _real_fieldsr r r r � __reduce__s s z_LW.__reduce__c C s t t| j| ��}|�dd� |S )zAReturn the contents of this :class:`.KeyedTuple` as a dictionary.N)�dictr r1 �pop�r �dr r r r- y s z _LW._asdictN)r r r r r r2 r- r r r r r0 m s r0 c @ s e Zd Zdd� Ze Z ZZdS )�ImmutableContainerc O s t d| jj ��d S )Nz%s object is immutable)� TypeError� __class__r �r �arg�kwr r r � _immutable� s z ImmutableContainer._immutableN)r r r r= � __delitem__� __setitem__r* r r r r r7 � s r7 c @ sJ e Zd Zej Z Z Z ZZ dd� Z dd� Z dd� Z dd� Z d d � Zd S ) � immutabledictc G s t �| �}t j|g|�R � |S r! )r3 r �__init__)r �args�newr r r r � s zimmutabledict.__new__c G s d S r! r )r rB r r r rA � s zimmutabledict.__init__c C s t t| �ffS r! )r@ r3 r r r r r2 � s zimmutabledict.__reduce__c C s@ |s| S | s$t |t�r|S t|�S nt| �}t�||� |S d S r! )� isinstancer@ r3 r )r r6 Zd2r r r �union� s zimmutabledict.unionc C s dt �| � S )Nzimmutabledict(%s))r3 �__repr__r r r r rF � s zimmutabledict.__repr__N)r r r r7 r= �clearr4 �popitem� setdefaultr r rA r2 rE rF r r r r r@ � s r@ c s� e Zd ZdZdZdd� Zdd� Zdd� Z� fd d �Zd d � Z d d� Z dd� Z dd� Z dd� Z dd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd.d"d#�Zd$d%� Zd&d'� Zd(d)� Zd*d+� Zd,d-� Z� ZS )/� Propertiesz8Provide a __getattr__/__setattr__ interface over a dict.��_datac C s t �| d|� d S �NrL ��objectr* )r �datar r r rA � s zProperties.__init__c C s t | j�S r! )�lenrL r r r r �__len__� s zProperties.__len__c C s t t| j�� ��S r! )�iterr rL �valuesr r r r �__iter__� s zProperties.__iter__c s" t tt| ��dd� | j�� D � S )Nc S s g | ] }t |��qS r )�str)r" �kr r r r$ � s z&Properties.__dir__.<locals>.<listcomp>)�dir�superrJ rL r r �r9 r r �__dir__� s �zProperties.__dir__c C s t | �t |� S r! �r �r �otherr r r �__add__� s zProperties.__add__c C s || j |< d S r! rK �r r( �objr r r r? � s zProperties.__setitem__c C s | j | S r! rK �r r( r r r � __getitem__� s zProperties.__getitem__c C s | j |= d S r! rK rb r r r r> � s zProperties.__delitem__c C s || j |< d S r! rK r` r r r r* � s zProperties.__setattr__c C s d| j iS rM rK r r r r � __getstate__� s zProperties.__getstate__c C s t �| d|d � d S rM rN )r �stater r r � __setstate__� s zProperties.__setstate__c C s, z | j | W S ty& t|��Y n0 d S r! )rL �KeyErrorr& rb r r r � __getattr__� s zProperties.__getattr__c C s || j v S r! rK rb r r r � __contains__� s zProperties.__contains__c C s t | j�S )z8Return an immutable proxy for this :class:`.Properties`.)�ImmutablePropertiesrL r r r r � as_immutable� s zProperties.as_immutablec C s | j �|� d S r! )rL r �r r) r r r r � s zProperties.updateNc C s || v r| | S |S d S r! r )r r( �defaultr r r �get� s zProperties.getc C s t | j�S r! )r rL r r r r r � s zProperties.keysc C s t | j�� �S r! )r rL rT r r r r rT � s zProperties.valuesc C s t | j�� �S r! )r rL �itemsr r r r ro � s zProperties.itemsc C s || j v S r! rK rb r r r �has_key� s zProperties.has_keyc C s | j �� d S r! )rL rG r r r r rG � s zProperties.clear)N)r r r r. r rA rR rU r[ r_ r? rc r> r* rd rf rh ri rk r rn r rT ro rp rG � __classcell__r r rZ r rJ � s. rJ c @ s e Zd ZdZdZdd� ZdS )�OrderedPropertieszUProvide a __getattr__/__setattr__ interface with an OrderedDict as backing store.r c C s t �| t� � d S r! )rJ rA � OrderedDictr r r r rA � s zOrderedProperties.__init__N)r r r r. r rA r r r r rr � s rr c @ s e Zd ZdZdZdS )rj zDProvide immutable dict/object attribute to an underlying dictionary.r N)r r r r. r r r r r rj s rj c @ s� e Zd ZdZdZdd� Zd*dd�Zdd � Zd d � Zd d � Z dd� Z d+dd�Z dd� Z dd� Z dd� Zdd� Zdd� Zer�d d � Zd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd(d)� ZdS ),rs zCA dict that returns keys/values/items in the order they were added.��_listc C s t | �� ffS r! )rs ro r r r r r2 s zOrderedDict.__reduce__Nc K s: g | _ |d u r$|r6| jf i |�� n| j|fi |�� d S r! )ru r )r �_OrderedDict____sequence�kwargsr r r rA s zOrderedDict.__init__c C s g | _ t�| � d S r! )ru r3 rG r r r r rG s zOrderedDict.clearc C s | � � S r! )�__copy__r r r r �copy s zOrderedDict.copyc C s t | �S r! )rs r r r r rx s zOrderedDict.__copy__c O s | j j|i |�� d S r! )ru �sortr: r r r rz ! s zOrderedDict.sortc K sZ |d urHt |d�r2|�� D ]}| �||| � qn|D ]\}}|| |< q6|rV| �|� d S )Nr )�hasattrr r? r )r rv rw r( r) r r r r $ s zOrderedDict.updatec C s& || vr| � ||� |S | �|�S d S r! )r? rc r' r r r rI / s zOrderedDict.setdefaultc C s t | j�S r! �rS ru r r r r rU 6 s zOrderedDict.__iter__c C s t | �S r! r\ r r r r r 9 s zOrderedDict.keysc s � fdd�� j D �S )Nc s g | ] }� | �qS r r r+ r r r r$ = r% z&OrderedDict.values.<locals>.<listcomp>rt r r r r rT < s zOrderedDict.valuesc s � fdd�� j D �S )Nc s g | ]}|� | f�qS r r r+ r r r r$ @ r% z%OrderedDict.items.<locals>.<listcomp>rt r r r r ro ? s zOrderedDict.itemsc C s t | �� �S r! )rS rT r r r r � itervaluesD s zOrderedDict.itervaluesc C s t | �S r! )rS r r r r �iterkeysG s zOrderedDict.iterkeysc C s t | �� �S r! )rS ro r r r r � iteritemsJ s zOrderedDict.iteritemsc C sF || vr4z| j �|� W n ty2 |g| _ Y n0 t�| ||� d S r! )ru �appendr& r3 r? r` r r r r? M s zOrderedDict.__setitem__c C s t �| |� | j�|� d S r! )r3 r> ru �removerb r r r r> W s zOrderedDict.__delitem__c G s0 || v }t j| |g|�R � }|r,| j�|� |S r! )r3 r4 ru r� )r r( rm Zpresentr) r r r r4 [ s zOrderedDict.popc C s t �| �}| j�|d � |S �Nr )r3 rH ru r� �r �itemr r r rH b s zOrderedDict.popitem)N)N)r r r r. r r2 rA rG ry rx rz r rI rU r rT ro r r} r~ r r? r> r4 rH r r r r rs s, rs c @ s� e Zd Zd&dd�Zdd� Zdd� Zdd � Zd d � Zd d � Zdd� Z dd� Z dd� Z dd� Z e Z dd� ZeZdd� ZeZdd� ZeZd d � ZeZd d � ZeZd d!� ZeZd"d#� ZeZd$d%� Z e Z dS )'� OrderedSetNc C s< t �| � g | _|d ur2t|�| _t �| | j� ng | _d S r! )�setrA ru � unique_listr r5 r r r rA i s zOrderedSet.__init__c C s$ || vr| j �|� t�| |� d S r! �ru r� r� �add�r �elementr r r r� r s zOrderedSet.addc C s t �| |� | j�|� d S r! )r� r� ru r� r r r r� w s zOrderedSet.removec C s& || vr| j �||� t�| |� d S r! )ru �insertr� r� )r �posr� r r r r� { s zOrderedSet.insertc C s$ || v r | j �|� t�| |� d S r! )ru r� r� r� r r r �discard� s zOrderedSet.discardc C s t �| � g | _d S r! )r� rG ru r r r r rG � s zOrderedSet.clearc C s | j | S r! rt rb r r r rc � s zOrderedSet.__getitem__c C s t | j�S r! r| r r r r rU � s zOrderedSet.__iter__c C s | � |�S r! )rE r] r r r r_ � s zOrderedSet.__add__c C s d| j j| jf S �Nz%s(%r))r9 r ru r r r r rF � s zOrderedSet.__repr__c C s. |D ]$}|| vr| j �|� t�| |� q| S r! r� )r �iterable�er r r r � s zOrderedSet.updatec C s | � | �}|�|� |S r! )r9 r �r r^ �resultr r r rE � s zOrderedSet.unionc s t � �� | �� fdd�| D ��S )Nc 3 s | ]}|� v r|V qd S r! r �r" �a�r^ r r � <genexpr>� r% z*OrderedSet.intersection.<locals>.<genexpr>�r� r9 r] r r� r � intersection� s zOrderedSet.intersectionc s< t � �� ��� fdd��D ��}|��fdd�� D �� |S )Nc 3 s | ]}|� vr|V qd S r! r r� r� r r r� � r% z2OrderedSet.symmetric_difference.<locals>.<genexpr>c 3 s | ]}|� vr|V qd S r! r r� r r r r� � r% )r� r9 r r� r )r^ r r �symmetric_difference� s z OrderedSet.symmetric_differencec s t � �� | �� fdd�| D ��S )Nc 3 s | ]}|� vr|V qd S r! r r� r� r r r� � r% z(OrderedSet.difference.<locals>.<genexpr>r� r] r r� r � difference� s zOrderedSet.differencec s. t � �� t �| � � � fdd�| jD �| _| S )Nc s g | ]}|� v r|�qS r r r� r� r r r$ � r% z2OrderedSet.intersection_update.<locals>.<listcomp>)r� �intersection_updateru r] r r� r r� � s z OrderedSet.intersection_updatec sD t �� |� � fdd�� jD �� _� j� fdd�|jD �7 _� S )Nc s g | ]}|� v r|�qS r r r� r r r r$ � r% z:OrderedSet.symmetric_difference_update.<locals>.<listcomp>c s g | ]}|� v r|�qS r r r� r r r r$ � r% )r� �symmetric_difference_updateru r] r r r r� � s z&OrderedSet.symmetric_difference_updatec s& t �� |� � fdd�� jD �� _� S )Nc s g | ]}|� v r|�qS r r r� r r r r$ � r% z0OrderedSet.difference_update.<locals>.<listcomp>)r� �difference_updateru r] r r r r� � s z OrderedSet.difference_update)N) r r r rA r� r� r� r� rG rc rU r_ rF �__str__r �__ior__rE �__or__r� �__and__r� �__xor__r� �__sub__r� �__iand__r� �__ixor__r� �__isub__r r r r r� h s6 r� c @ s> e Zd ZdZdMdd�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&� Zd'd(� Zd)d*� Zd+d,� Zd-d.� Zd/d0� Zd1d2� Zd3d4� Z d5d6� Z d7d8� Z d9d:� Z d;d<� Z d=d>� Z!d?d@� Z"dAdB� Z#dCdD� Z$e$Z%dEdF� Z&dGdH� Z'dIdJ� Z(dKdL� Z)dS )N� IdentitySetz�A set that considers only object id() for uniqueness. This strategy has edge cases for builtin types- it's possible to have two 'foo' strings in one of these sets, for example. Use sparingly. Nc C s t � | _|r| �|� d S r! )r3 �_membersr �r r� r r r rA � s zIdentitySet.__init__c C s || j t|�< d S r! �r� �idrl r r r r� � s zIdentitySet.addc C s t |�| jv S r! )r� r� rl r r r ri � s zIdentitySet.__contains__c C s | j t|�= d S r! r� rl r r r r� � s zIdentitySet.removec C s& z| � |� W n ty Y n0 d S r! )r� rg rl r r r r� � s zIdentitySet.discardc C s4 z| j �� }|d W S ty. td��Y n0 d S )Nr zpop from an empty set)r� rH rg )r �pairr r r r4 � s zIdentitySet.popc C s | j �� d S r! )r� rG r r r r rG � s zIdentitySet.clearc C s t d��d S )Nz cannot compare sets using cmp()�r8 r] r r r �__cmp__� s zIdentitySet.__cmp__c C s t |t�r| j|jkS dS d S )NF�rD r� r� r] r r r �__eq__� s zIdentitySet.__eq__c C s t |t�r| j|jkS dS d S �NTr� r] r r r �__ne__ s zIdentitySet.__ne__c C sD | � |�}t| �t|�kr dS t|jjt| j�� ��D ]} dS dS �NFT�r9 rQ r r� ri rS r �r r� r^ �mr r r �issubset s �zIdentitySet.issubsetc C s t |t�stS | �|�S r! )rD r� �NotImplementedr� r] r r r �__le__ s zIdentitySet.__le__c C s( t |t�stS t| �t|�k o&| �|�S r! )rD r� r� rQ r� r] r r r �__lt__ s zIdentitySet.__lt__c C sD | � |�}t| �t|�k r dS t| jjt|j�� ��D ]} dS dS r� r� r� r r r � issuperset s �zIdentitySet.issupersetc C s t |t�stS | �|�S r! )rD r� r� r� r] r r r �__ge__) s zIdentitySet.__ge__c C s( t |t�stS t| �t|�ko&| �|�S r! )rD r� r� rQ r� r] r r r �__gt__. s zIdentitySet.__gt__c C s4 | � � }| j}|j�|� |j�dd� |D �� |S )Nc s s | ]}t |�|fV qd S r! �r� �r" ra r r r r� 7 r% z$IdentitySet.union.<locals>.<genexpr>)r9 r� r �r r� r� �membersr r r rE 3 s zIdentitySet.unionc C s t |t�stS | �|�S r! )rD r� r� rE r] r r r r� : s zIdentitySet.__or__c C s | j �dd� |D �� d S )Nc s s | ]}t |�|fV qd S r! r� r� r r r r� @ r% z%IdentitySet.update.<locals>.<genexpr>)r� r r� r r r r ? s zIdentitySet.updatec C s t |t�stS | �|� | S r! )rD r� r� r r] r r r r� B s zIdentitySet.__ior__c s> | � � }| j}dd� |D �� |j�� fdd�|�� D �� |S )Nc S s h | ] }t |��qS r r� r� r r r � <setcomp>K r% z)IdentitySet.difference.<locals>.<setcomp>c 3 s" | ]\}}|� vr||fV qd S r! r �r" rW �vr� r r r� M r% z)IdentitySet.difference.<locals>.<genexpr>�r9 r� r ro r� r r� r r� H s �zIdentitySet.differencec C s t |t�stS | �|�S r! )rD r� r� r� r] r r r r� Q s zIdentitySet.__sub__c C s | � |�j| _d S r! )r� r� r� r r r r� V s z IdentitySet.difference_updatec C s t |t�stS | �|� | S r! )rD r� r� r� r] r r r r� Y s zIdentitySet.__isub__c s> | � � }| j}dd� |D �� |j�� fdd�|�� D �� |S )Nc S s h | ] }t |��qS r r� r� r r r r� b r% z+IdentitySet.intersection.<locals>.<setcomp>c 3 s" | ]\}}|� v r||fV qd S r! r r� r� r r r� c s z+IdentitySet.intersection.<locals>.<genexpr>r� r� r r� r r� _ s �zIdentitySet.intersectionc C s t |t�stS | �|�S r! )rD r� r� r� r] r r r r� h s zIdentitySet.__and__c C s | � |�j| _d S r! )r� r� r� r r r r� m s z IdentitySet.intersection_updatec C s t |t�stS | �|� | S r! )rD r� r� r� r] r r r r� p s zIdentitySet.__iand__c s\ | � � }| j� dd� |D ��|j��fdd�� �� D �� |j�� fdd���� D �� |S )Nc S s i | ]}t |�|�qS r r� r� r r r r, y r% z4IdentitySet.symmetric_difference.<locals>.<dictcomp>c 3 s" | ]\}}|� vr||fV qd S r! r r� r� r r r� { r% z3IdentitySet.symmetric_difference.<locals>.<genexpr>c 3 s" | ]\}}|� vr||fV qd S r! r r� )r� r r r� ~ r% r� )r r� r� r )r� r^ r r� v s ��z IdentitySet.symmetric_differencec C s t |t�stS | �|�S r! �rD r� r� r� r] r r r r� � s zIdentitySet.__xor__c C s | � |�j| _d S r! )r� r� r� r r r r� � s z'IdentitySet.symmetric_difference_updatec C s t |t�stS | �|� | S r! r� r] r r r r� � s zIdentitySet.__ixor__c C s t | �t| j�� ��S r! )�typerS r� rT r r r r ry � s zIdentitySet.copyc C s t | j�S r! )rQ r� r r r r rR � s zIdentitySet.__len__c C s t | j�� �S r! )rS r� rT r r r r rU � s zIdentitySet.__iter__c C s t d��d S )Nzset objects are unhashabler� r r r r �__hash__� s zIdentitySet.__hash__c C s dt | �jt| j�� �f S r� )r� r r r� rT r r r r rF � s zIdentitySet.__repr__)N)*r r r r. rA r� ri r� r� r4 rG r� r� r� r� r� r� r� r� r� rE r� r r� r� r� r� r� r� r� r� r� r� r� r� r� ry rx rR rU r� rF r r r r r� � sN r� c @ s6 e Zd Zd dd�Zdd� Zdd� Zdd � Zd d � Zd S )� WeakSequencer c s0 t �| �fdd�� � | _� fdd�|D �| _d S )Nc S s |� }|d ur|j �| � d S r! )�_storager� )r� �selfrefr r r r �_remove� s z&WeakSequence.__init__.<locals>._removec s g | ]}t �|� ��qS r )�weakref�ref)r" r� �r� r r r$ � s z)WeakSequence.__init__.<locals>.<listcomp>)r� r� r� r� )r Z_WeakSequence__elementsr r� r rA � s �zWeakSequence.__init__c C s | j �t�|| j�� d S r! )r� r� r� r� r� r� r r r r� � s zWeakSequence.appendc C s t | j�S r! )rQ r� r r r r rR � s zWeakSequence.__len__c C s dd� dd� | j D �D �S )Nc s s | ]}|d ur|V qd S r! r r� r r r r� � s z(WeakSequence.__iter__.<locals>.<genexpr>c s s | ] }|� V qd S r! r )r" r� r r r r� � r% )r� r r r r rU � s �zWeakSequence.__iter__c C s8 z| j | }W n ty, td| ��Y n0 |� S d S )NzIndex %s out of range)r� rg � IndexError)r �indexra r r r rc � s zWeakSequence.__getitem__N)r )r r r rA r� rR rU rc r r r r r� � s r� c @ s e Zd Zddd�ZdS )�OrderedIdentitySetNc C s. t �| � t� | _|r*|D ]}| �|� qd S r! )r� rA rs r� r� )r r� �or r r rA � s zOrderedIdentitySet.__init__)N)r r r rA r r r r r� � s r� c @ s e Zd ZdZdd� Zdd� ZdS )� PopulateDictz�A dict which populates missing values via a creation function. Note the creation function takes a key, unlike collections.defaultdict. c C s || _ d S r! ��creator)r r� r r r rA � s zPopulateDict.__init__c C s | � |� | |< }|S r! r� �r r( �valr r r � __missing__� s zPopulateDict.__missing__N�r r r r. rA r� r r r r r� � s r� c @ s e Zd ZdZdd� Zdd� ZdS )�WeakPopulateDictzaLike PopulateDict, but assumes a self + a method and does not create a reference cycle. c C s |j | _|j}t�|�| _d S r! )�__func__r� �__self__r� r� �weakself)r Zcreator_methodr� r r r rA � s zWeakPopulateDict.__init__c C s | � | �� |� | |< }|S r! )r� r� r� r r r r� � s z WeakPopulateDict.__missing__Nr� r r r r r� � s r� c C s t t�| ��S r! )r/ �operator� itemgetter)�idxr r r �<lambda>� r% r� c s> t � ��j�� s$��fdd�| D �S � ��fdd�| D �S d S )Nc s g | ]}|� vr�|�s|�qS r r �r" �x)�seen�seen_addr r r$ r% z unique_list.<locals>.<listcomp>c s( g | ] }� |��vr�� |��s|�qS r r r� ��hashfuncr� r� r r r$ s �)r� r� )�seqr� r r� r r� � s �r� c @ s* e Zd ZdZd dd�Zdd� Zdd� ZdS ) �UniqueAppenderz�Appends items to a collection ensuring uniqueness. Additional appends() of the same object are ignored. Membership is determined by identity (``is a``) not equality (``==``). Nc C sH || _ i | _|r t||�| _n&t|d�r2|j| _nt|d�rD|j| _d S )Nr� r� )rP �_unique�getattr�_data_appenderr{ r� r� )r rP Zviar r r rA s zUniqueAppender.__init__c C s* t |�}|| jvr&| �|� d| j|< d S r� )r� r� r� )r r� Zid_r r r r� s zUniqueAppender.appendc C s t | j�S r! )rS rP r r r r rU ! s zUniqueAppender.__iter__)N)r r r r. rA r� rU r r r r r� s r� c C s0 t | �dkr(t| d tj�r(t| d �S | S d S )Nr r )rQ rD �types� GeneratorTyper )r; r r r �coerce_generator_arg% s r� c C sF | d u r |S t | tj�r&t | tt �r,| gS t | t�r:| S t| �S d S r! )rD r �Iterabler r r )r� rm r r r �to_list, s � r� c C s t | �dd� |D ���S )z�return True if any items of set\_ are present in iterable. Goes through special effort to ensure __hash__ is not called on items in iterable that don't support it. c S s g | ]}|j r|�qS r )r� �r" �ir r r r$ A r% z$has_intersection.<locals>.<listcomp>)�boolr� )�set_r� r r r �has_intersection9 s r� c C s, | d u rt � S t| t �s$t t| ��S | S d S r! )r� rD r� �r� r r r �to_setD s r� c C s, | d u rt � S t| t �s$t t| ��S | S d S r! )� column_setrD r� r� r r r � to_column_setM s r� c K s* | � � } |r| �|� | jf i |�� | S )z5Copy the given dict and update with the given values.)ry r )r6 �_newr< r r r � update_copyV s r� c c s> | D ]4}t |t�s2t|d�r2t|�D ] }|V q$q|V qdS )z�Given an iterator of which further sub-elements may also be iterators, flatten the sub-elements into a single iterator. rU N)rD rV r{ �flatten_iterator)r� �elem�yr r r r� ` s r� c @ sd e Zd ZdZdZddd�Zdd � Zdd d �Zd d � Zdd� Z dd� Z dd� Z e dd� �Z dd� ZdS )�LRUCachez�Dictionary with 'squishy' removal of least recently used items. Note that either get() or [] should be used here, but generally its not safe to do an "in" check first as the dictionary can change subsequent to that call. )�capacity� threshold� size_alert�_counter�_mutex�d � �?Nc C s& || _ || _|| _d| _t�� | _d S r� )r r r r r �Lockr )r r r r r r r rA y s zLRUCache.__init__c C s | j d7 _ | j S �Nr )r r r r r � _inc_counter� s zLRUCache._inc_counterc C s2 t �| ||�}||ur*| �� |d< |d S |S d S �N� r )r3 rn r )r r( rm r� r r r rn � s z LRUCache.getc C s t �| |�}| �� |d< |d S r )r3 rc r )r r( r� r r r rc � s zLRUCache.__getitem__c C s dd� t �| �D �S )Nc S s g | ] }|d �qS )r r r� r r r r$ � r% z#LRUCache.values.<locals>.<listcomp>)r3 rT r r r r rT � s zLRUCache.valuesc C s || v r| | S || |< |S d S r! r r' r r r rI � s zLRUCache.setdefaultc C sF t �| |�}|d u r2||| �� g}t �| ||� n||d< | �� d S r )r3 rn r r? � _manage_size)r r( r) r� r r r r? � s zLRUCache.__setitem__c C s | j | j | j S r! )r r r r r r �size_threshold� s zLRUCache.size_thresholdc C s� | j �d�sd S z�t| j�}t| �| j| j| j kr�|rHd}| �| � tt� | �t � d�dd�}|| jd � D ]*}z| |d = W qp t y� Y qpY qp0 qpq W | j � � n | j � � 0 d S )NFr T)r( �reverser )r �acquirer� r rQ r r �sortedr3 rT r� r� rg �release)r r Z by_counterr� r r r r � s" � zLRUCache._manage_size)r r N)N)r r r r. r rA r rn rc rT rI r? r/ r r r r r r r m s r r c C sl | ft |� }t�|�}|r |S t| tftdd� t|�D �dg ��}||_t dd� |D ��|_|t|< |S )Nc S s$ g | ] \}}|d ur|t | f�qS r! )�_property_getters)r" r� �fieldr r r r$ � s �z+lightweight_named_tuple.<locals>.<listcomp>)r r c S s g | ]}|d ur|�qS r! r )r" �fr r r r$ � r% ) r � _lw_tuplesrn r� r0 r3 � enumerater1 r )�name�fields�hash_Ztp_clsr r r �lightweight_named_tuple� s& ���� r c @ s8 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd S ) �ScopedRegistrya� A Registry that can store one or multiple instances of a single class on the basis of a "scope" function. The object implements ``__call__`` as the "getter", so by calling ``myregistry()`` the contained object is returned for the current scope. :param createfunc: a callable that returns a new object to be placed in the registry :param scopefunc: a callable that will return a key to store/retrieve an object. c C s || _ || _i | _dS )aV Construct a new :class:`.ScopedRegistry`. :param createfunc: A creation function that will generate a new value for the current scope, if none is present. :param scopefunc: A function that returns a hashable token representing the current scope (such as, current thread identifier). N)� createfunc� scopefunc�registry)r r r r r r rA � s zScopedRegistry.__init__c C s> | � � }z | j| W S ty8 | j�|| �� � Y S 0 d S r! )r r! rg rI r rb r r r �__call__� s zScopedRegistry.__call__c C s | � � | jv S )z9Return True if an object is present in the current scope.)r r! r r r r �has s zScopedRegistry.hasc C s || j | �� < dS )z$Set the value for the current scope.N)r! r �r ra r r r r� s zScopedRegistry.setc C s( z| j | �� = W n ty" Y n0 dS )z Clear the current scope, if any.N)r! r rg r r r r rG s zScopedRegistry.clearN� r r r r. rA r" r# r� rG r r r r r � s r c @ s8 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd S ) �ThreadLocalRegistryz\A :class:`.ScopedRegistry` that uses a ``threading.local()`` variable for storage. c C s || _ t�� | _d S r! )r r �localr! )r r r r r rA s z ThreadLocalRegistry.__init__c C s6 z | j jW S ty0 | �� }| j _| Y S 0 d S r! )r! r) r& r )r r� r r r r" s z ThreadLocalRegistry.__call__c C s t | jd�S )Nr) )r{ r! r r r r r# $ s zThreadLocalRegistry.hasc C s || j _d S r! )r! r) r$ r r r r� ' s zThreadLocalRegistry.setc C s" z | j `W n ty Y n0 d S r! )r! r) r& r r r r rG * s zThreadLocalRegistry.clearNr% r r r r r& s r& c C s0 d}| D ]"}||u r|d7 }|dkr dS qdS )zrGiven a sequence and search object, return True if there's more than one, False if zero or one of them. r r TFr )�sequence�target�cr� r r r � has_dupes1 s r+ )N)N)N)7r. � __future__r r� r� r� �compatr r r r r r � frozenset� EMPTY_SETr r r r0 rO r7 r3 r@ rJ rr rj rs r� r� r� r� r� r� r� r� Z column_dictZordered_column_setr� Z_gettersr r� r� r� r� r� r� r� r� r� r r r r r& r+ r r r r �<module> sb C O ak P" � Q8
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка