Edit File: _collections.cpython-37.pyc
B ��4]�q � @ 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 eZ!eZ"e Z#e Z$e ej%�Z&e d'd(� �Z'dHd)d*�Z(G d+d,� d,e�Z)d-d.� Z*dId/d0�Z+d1d2� Z,d3d4� Z-d5d6� Z.dJd7d8�Z/d9d:� Z0G d;d<� d<e�Z1e1d=�Z2d>d?� Z3G d@dA� dAe�Z4G dBdC� dCe4�Z5dDdE� Z6dFdG� Z7dS )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 �O/opt/alt/python37/lib64/python3.7/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` 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` 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 k r|�qS )Nr )�.0�lr r r � <listcomp>^ s 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 s 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 )N)r r )r r r r r r p s z _LW.__new__c C s t t| �| jffS )N)r r � _real_fields)r 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 r, �pop)r �dr r r r( y s z _LW._asdictN)r r r r r r- r( r r r r r+ m s r+ 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 r6 � __delitem__� __setitem__r& r r r r r1 � s r1 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|f|�� |S )N)r. r �__init__)r �args�newr r r r � s zimmutabledict.__new__c G s d S )Nr )r r; r r r r: � s zimmutabledict.__init__c C s t t| �ffS )N)r9 r. )r r r r r- � s zimmutabledict.__reduce__c C s@ |s| S | s$t |t�r|S t|�S nt| �}t�||� |S d S )N)� isinstancer9 r. r )r r0 �d2r r r �union� s zimmutabledict.unionc C s dt �| � S )Nzimmutabledict(%s))r. �__repr__)r r r r r@ � s zimmutabledict.__repr__N)r r r r1 r6 �clearr/ �popitem� setdefaultr r r: r- r? r@ r r r r r9 � s r9 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 )NrE )�objectr& )r �datar r r r: � s zProperties.__init__c C s t | j�S )N)�lenrE )r r r r �__len__� s zProperties.__len__c C s t t| j�� ��S )N)�iterr rE �values)r 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�superrD rE r )r )r3 r r �__dir__� s zProperties.__dir__c C s t | �t |� S )N)r )r �otherr r r �__add__� s zProperties.__add__c C s || j |< d S )N)rE )r r$ �objr r r r8 � s zProperties.__setitem__c C s | j | S )N)rE )r r$ r r r � __getitem__� s zProperties.__getitem__c C s | j |= d S )N)rE )r r$ r r r r7 � s zProperties.__delitem__c C s || j |< d S )N)rE )r r$ rT r r r r& � s zProperties.__setattr__c C s d| j iS )NrE )rE )r r r r � __getstate__� s zProperties.__getstate__c C s t �| d|d � d S )NrE )rF r& )r �stater r r � __setstate__� s zProperties.__setstate__c C s, y | j | S tk r& t|��Y nX d S )N)rE �KeyErrorr# )r r$ r r r � __getattr__� s zProperties.__getattr__c C s || j kS )N)rE )r r$ r r r � __contains__� s zProperties.__contains__c C s t | j�S )z8Return an immutable proxy for this :class:`.Properties`.)�ImmutablePropertiesrE )r r r r � as_immutable� s zProperties.as_immutablec C s | j �|� d S )N)rE r )r r% r r r r � s zProperties.updateNc C s || kr| | S |S d S )Nr )r r$ �defaultr r r �get� s zProperties.getc C s t | j�S )N)r rE )r r r r r � s zProperties.keysc C s t | j�� �S )N)r rE rK )r r r r rK � s zProperties.valuesc C s t | j�� �S )N)r rE �items)r r r r r` � s zProperties.itemsc C s || j kS )N)rE )r r$ r r r �has_key� s zProperties.has_keyc C s | j �� d S )N)rE rA )r r r r rA � s zProperties.clear)N)r r r r) r r: rI rL rQ rS r8 rU r7 r& rV rX rZ r[ r] r r_ r rK r` ra rA � __classcell__r r )r3 r rD � s. rD 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 )N)rD r: � OrderedDict)r r r r r: � s zOrderedProperties.__init__N)r r r r) r r: r r r r rc � s rc c @ s e Zd ZdZdZdS )r\ zDProvide immutable dict/object attribute to an underlying dictionary.r N)r r r r) r r r r r r\ s r\ 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 ),rd zCA dict that returns keys/values/items in the order they were added.)�_listc C s t | �� ffS )N)rd r` )r r r r r- s zOrderedDict.__reduce__Nc K s2 g | _ |d kr |r.| jf |� n| j|f|� d S )N)re r )r �_OrderedDict____sequence�kwargsr r r r: s zOrderedDict.__init__c C s g | _ t�| � d S )N)re r. rA )r r r r rA s zOrderedDict.clearc C s | � � S )N)�__copy__)r r r r �copy s zOrderedDict.copyc C s t | �S )N)rd )r r r r rh s zOrderedDict.__copy__c O s | j j||� d S )N)re �sort)r r4 r5 r r r rj ! s zOrderedDict.sortc K sb |d k rPt |d�r6x<|�� D ]}| �||| � q W nx|D ]\}}|| |< q<W |r^| �|� d S )Nr )�hasattrr r8 r )r rf rg r$ r% r r r r $ s zOrderedDict.updatec C s& || kr| � ||� |S | �|�S d S )N)r8 rU )r r$ r% r r r rC / s zOrderedDict.setdefaultc C s t | j�S )N)rJ re )r r r r rL 6 s zOrderedDict.__iter__c C s t | �S )N)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" = s z&OrderedDict.values.<locals>.<listcomp>)re )r r )r r rK < s zOrderedDict.valuesc s � fdd�� j D �S )Nc s g | ]}|� | f�qS r r )r r$ )r r r r" @ s z%OrderedDict.items.<locals>.<listcomp>)re )r r )r r r` ? s zOrderedDict.itemsc C s t | �� �S )N)rJ rK )r r r r � itervaluesD s zOrderedDict.itervaluesc C s t | �S )N)rJ )r r r r �iterkeysG s zOrderedDict.iterkeysc C s t | �� �S )N)rJ r` )r r r r � iteritemsJ s zOrderedDict.iteritemsc C sH || kr6y| j �|� W n tk r4 |g| _ Y nX t�| ||� d S )N)re �appendr# r. r8 )r r$ rT r r r r8 M s zOrderedDict.__setitem__c C s t �| |� | j�|� d S )N)r. r7 re �remove)r r$ r r r r7 W s zOrderedDict.__delitem__c G s. || k}t j| |f|�� }|r*| j�|� |S )N)r. r/ re rp )r r$ r^ Zpresentr% r r r r/ [ s zOrderedDict.popc C s t �| �}| j�|d � |S )Nr )r. rB re rp )r �itemr r r rB b s zOrderedDict.popitem)N)N)r r r r) r r- r: rA ri rh rj r rC rL r rK r` r rl rm rn r8 r7 r/ rB r r r r rd s, rd 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 k r2t|�| _t �| | j� ng | _d S )N)�setr: re � unique_listr )r r0 r r r r: i s zOrderedSet.__init__c C s$ || kr| j �|� t�| |� d S )N)re ro rs �add)r �elementr r r ru r s zOrderedSet.addc C s t �| |� | j�|� d S )N)rs rp re )r rv r r r rp w s zOrderedSet.removec C s& || kr| j �||� t�| |� d S )N)re �insertrs ru )r �posrv r r r rw { s zOrderedSet.insertc C s$ || kr | j �|� t�| |� d S )N)re rp rs )r rv r r r �discard� s zOrderedSet.discardc C s t �| � g | _d S )N)rs rA re )r r r r rA � s zOrderedSet.clearc C s | j | S )N)re )r r$ r r r rU � s zOrderedSet.__getitem__c C s t | j�S )N)rJ re )r r r r rL � s zOrderedSet.__iter__c C s | � |�S )N)r? )r rR r r r rS � s zOrderedSet.__add__c C s d| j j| jf S )Nz%s(%r))r3 r re )r r r r r@ � s zOrderedSet.__repr__c C s2 x,|D ]$}|| kr| j �|� t�| |� qW | S )N)re ro rs ru )r �iterable�er r r r � s zOrderedSet.updatec C s | � | �}|�|� |S )N)r3 r )r rR �resultr r r r? � s zOrderedSet.unionc s t � �� | �� fdd�| D ��S )Nc 3 s | ]}|� kr|V qd S )Nr )r �a)rR r r � <genexpr>� s z*OrderedSet.intersection.<locals>.<genexpr>)rs r3 )r rR r )rR r � intersection� s zOrderedSet.intersectionc s< t � �� ��� fdd��D ��}|��fdd�� D �� |S )Nc 3 s | ]}|� kr|V qd S )Nr )r r} )rR r r r~ � s z2OrderedSet.symmetric_difference.<locals>.<genexpr>c 3 s | ]}|� kr|V qd S )Nr )r r} )r r r r~ � s )rs r3 r )r rR r| r )rR r r �symmetric_difference� s z OrderedSet.symmetric_differencec s t � �� | �� fdd�| D ��S )Nc 3 s | ]}|� kr|V qd S )Nr )r r} )rR r r r~ � s z(OrderedSet.difference.<locals>.<genexpr>)rs r3 )r rR r )rR r � difference� s zOrderedSet.differencec s. t � �� t �| � � � fdd�| jD �| _| S )Nc s g | ]}|� kr|�qS r r )r r} )rR r r r" � s z2OrderedSet.intersection_update.<locals>.<listcomp>)rs �intersection_updatere )r rR r )rR r r� � s z OrderedSet.intersection_updatec sD t �� |� � fdd�� jD �� _� j� fdd�|jD �7 _� S )Nc s g | ]}|� kr|�qS r r )r r} )r r r r" � s z:OrderedSet.symmetric_difference_update.<locals>.<listcomp>c s g | ]}|� kr|�qS r r )r r} )r r r r" � s )rs �symmetric_difference_updatere )r rR r )r r r� � s z&OrderedSet.symmetric_difference_updatec s& t �� |� � fdd�� jD �� _� S )Nc s g | ]}|� kr|�qS r r )r r} )r r r r" � s z0OrderedSet.difference_update.<locals>.<listcomp>)rs �difference_updatere )r rR r )r r r� � s z OrderedSet.difference_update)N) r r r r: ru rp rw ry rA rU rL rS r@ �__str__r �__ior__r? �__or__r �__and__r� �__xor__r� �__sub__r� �__iand__r� �__ixor__r� �__isub__r r r r rr h s6 rr c @ sJ e Zd ZdZeZdOdd�Zdd� Zdd� Zd d � Z d d � Z d d� Z dd� Z dd� Z dd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Zd+d,� Zd-d.� Zd/d0� Z d1d2� Z d3d4� Z d5d6� Z d7d8� Z d9d:� Z!d;d<� Z"d=d>� Z#d?d@� Z$dAdB� Z%dCdD� Z&dEdF� Z'e'Z(dGdH� Z)dIdJ� Z*dKdL� Z+dMdN� Z,dS )P� 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$x|D ]}| �|� qW d S )N)r. �_membersru )r rz �or r r r: � s zIdentitySet.__init__c C s || j t|�< d S )N)r� �id)r r% r r r ru � s zIdentitySet.addc C s t |�| jkS )N)r� r� )r r% r r r r[ � s zIdentitySet.__contains__c C s | j t|�= d S )N)r� r� )r r% r r r rp � s zIdentitySet.removec C s( y| � |� W n tk r" Y nX d S )N)rp rY )r r% r r r ry � s zIdentitySet.discardc C s4 y| j �� }|d S tk r. td��Y nX d S )Nr zpop from an empty set)r� rB rY )r �pairr r r r/ � s zIdentitySet.popc C s | j �� d S )N)r� rA )r r r r rA � s zIdentitySet.clearc C s t d��d S )Nz cannot compare sets using cmp())r2 )r rR r r r �__cmp__� s zIdentitySet.__cmp__c C s t |t�r| j|jkS dS d S )NF)r= r� r� )r rR r r r �__eq__� s zIdentitySet.__eq__c C s t |t�r| j|jkS dS d S )NT)r= r� r� )r rR r r r �__ne__ s zIdentitySet.__ne__c C sH t | �|�}t| �t|�kr dS x"t|jjt| j�� ��D ]}dS W dS )NFT)�typerH r r� r[ rJ r )r rz rR �mr r r �issubset s zIdentitySet.issubsetc C s t |t�stS | �|�S )N)r= r� �NotImplementedr� )r rR r r r �__le__ s zIdentitySet.__le__c C s( t |t�stS t| �t|�k o&| �|�S )N)r= r� r� rH r� )r rR r r r �__lt__ s zIdentitySet.__lt__c C sH t | �|�}t| �t|�k r dS x"t| jjt|j�� ��D ]}dS W dS )NFT)r� rH r r� r[ rJ r )r rz rR r� r r r � issuperset s zIdentitySet.issupersetc C s t |t�stS | �|�S )N)r= r� r� r� )r rR r r r �__ge__, s zIdentitySet.__ge__c C s( t |t�stS t| �t|�ko&| �|�S )N)r= r� r� rH r� )r rR r r r �__gt__1 s zIdentitySet.__gt__c C s6 t | �� }| �� }t|�}|j�| �|��|�� |S )N)r� �_member_id_tuples�_iter_idr� r � _working_setr? )r rz r| �membersrR r r r r? 6 s zIdentitySet.unionc C s t |t�stS | �|�S )N)r= r� r� r? )r rR r r r r� > s zIdentitySet.__or__c C s | � |�j| _d S )N)r? r� )r rz r r r r C s zIdentitySet.updatec C s t |t�stS | �|� | S )N)r= r� r� r )r rR r r r r� F s zIdentitySet.__ior__c C s6 t | �� }| �� }t|�}|j�| �|��|�� |S )N)r� r� r� r� r r� r� )r rz r| r� rR r r r r� L s zIdentitySet.differencec C s t |t�stS | �|�S )N)r= r� r� r� )r rR r r r r� T s zIdentitySet.__sub__c C s | � |�j| _d S )N)r� r� )r rz r r r r� Y s z IdentitySet.difference_updatec C s t |t�stS | �|� | S )N)r= r� r� r� )r rR r r r r� \ s zIdentitySet.__isub__c C s6 t | �� }| �� }t|�}|j�| �|��|�� |S )N)r� r� r� r� r r� r )r rz r| r� rR r r r r b s zIdentitySet.intersectionc C s t |t�stS | �|�S )N)r= r� r� r )r rR r r r r� j s zIdentitySet.__and__c C s | � |�j| _d S )N)r r� )r rz r r r r� o s z IdentitySet.intersection_updatec C s t |t�stS | �|� | S )N)r= r� r� r� )r rR r r r r� r s zIdentitySet.__iand__c C s6 t | �� }| �� }t|�}|j�| �|��|�� |S )N)r� r� r� r� r r� r� )r rz r| r� rR r r r r� x s z IdentitySet.symmetric_differencec C s dd� | j �� D �S )Nc s s | ]}t |�|fV qd S )N)r� )r �vr r r r~ � s z0IdentitySet._member_id_tuples.<locals>.<genexpr>)r� rK )r r r r r� � s z IdentitySet._member_id_tuplesc C s t |t�stS | �|�S )N)r= r� r� r� )r rR r r r r� � s zIdentitySet.__xor__c C s | � |�j| _d S )N)r� r� )r rz r r r r� � s z'IdentitySet.symmetric_difference_updatec C s t |t�stS | �|� | S )N)r= r� r� r� )r rR r r r r� � s zIdentitySet.__ixor__c C s t | �t| j�� ��S )N)r� rJ r� rK )r r r r ri � s zIdentitySet.copyc C s t | j�S )N)rH r� )r r r r rI � s zIdentitySet.__len__c C s t | j�� �S )N)rJ r� rK )r r r r rL � s zIdentitySet.__iter__c C s t d��d S )Nzset objects are unhashable)r2 )r r r r �__hash__� s zIdentitySet.__hash__c C s dt | �jt| j�� �f S )Nz%s(%r))r� r r r� rK )r r r r r@ � s zIdentitySet.__repr__)N)-r r r r) rs r� r: ru r[ rp ry r/ rA r� r� r� r� r� r� r� r� r� r? r� r r� r� r� r� r� r r� r� r� r� r� r� r� r� ri rh rI rL r� r@ r r r r r� � sR r� c @ s> e Zd Zddd�Zdd� Zdd� Zdd � Zd d � Zd d � ZdS )� WeakSequencer c s � fdd�|D �� _ d S )Nc s g | ]}t �|� j��qS r )�weakref�ref�_remove)r rv )r r r r" � s z)WeakSequence.__init__.<locals>.<listcomp>)�_storage)r Z_WeakSequence__elementsr )r r r: � s zWeakSequence.__init__c C s | j �t�|| j�� d S )N)r� ro r� r� r� )r rq r r r ro � s zWeakSequence.appendc C s | j �|� d S )N)r� rp )r r� r r r r� � s zWeakSequence._removec C s t | j�S )N)rH r� )r r r r rI � s zWeakSequence.__len__c C s dd� dd� | j D �D �S )Nc s s | ]}|d k r|V qd S )Nr )r rT r r r r~ � s z(WeakSequence.__iter__.<locals>.<genexpr>c s s | ] }|� V qd S )Nr )r r� r r r r~ � s )r� )r r r r rL � s zWeakSequence.__iter__c C s: y| j | }W n tk r. td| ��Y nX |� S d S )NzIndex %s out of range)r� rY � IndexError)r �indexrT r r r rU � s zWeakSequence.__getitem__N)r ) r r r r: ro r� rI rL rU r r r r r� � s r� c @ s& e Zd ZG dd� de�Zddd�ZdS )�OrderedIdentitySetc @ s e Zd ZdZdS )z OrderedIdentitySet._working_setTN)r r r Z__sa_hash_exempt__r r r r r� � s r� Nc C s2 t �| � t� | _|r.x|D ]}| �|� q W d S )N)r� r: rd r� ru )r rz r� r r r r: � s zOrderedIdentitySet.__init__)N)r r r rr r� r: 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 )N)�creator)r r� r r r r: � s zPopulateDict.__init__c C s | � |� | |< }|S )N)r� )r r$ �valr r r � __missing__� s zPopulateDict.__missing__N)r r r r) r: r� r r r r r� � s r� c C s t t�| ��S )N)r* �operator� itemgetter)�idxr r r �<lambda>� � r� c s> t � ��j�� s$��fdd�| D �S � ��fdd�| D �S d S )Nc s g | ]}|� kr�|�s|�qS r r )r �x)�seen�seen_addr r r" � s z unique_list.<locals>.<listcomp>c s( g | ] }� |��kr�� |��s|�qS r r )r r� )�hashfuncr� r� r r r" � s )rs ru )�seqr� r )r� r� r� r rt � s rt 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 )Nro ru )rG �_unique�getattr�_data_appenderrk ro ru )r rG Zviar r r r: s zUniqueAppender.__init__c C s* t |�}|| jkr&| �|� d| j|< d S )NT)r� r� r� )r rq Zid_r r r ro s zUniqueAppender.appendc C s t | j�S )N)rJ rG )r r r r rL s zUniqueAppender.__iter__)N)r r r r) r: ro rL r r r r r� s r� c C s0 t | �dkr(t| d tj�r(t| d �S | S d S )Nr r )rH r= �types� GeneratorTyper )r4 r r r �coerce_generator_arg s r� c C sF | d kr |S t | tj�r&t | tt �r,| gS t | t�r:| S t| �S d S )N)r= r �Iterabler r r )r� r^ 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" 7 s z$has_intersection.<locals>.<listcomp>)�boolr )�set_rz r r r �has_intersection/ s r� c C s, | d krt � S t| t �s$t t| ��S | S d S )N)rs r= r� )r� r r r �to_set: s r� c C s, | d krt � S t| t �s$t t| ��S | S d S )N)� column_setr= r� )r� r r r � to_column_setC s r� c K s& | � � } |r| �|� | jf |� | S )z5Copy the given dict and update with the given values.)ri r )r0 Z_newr5 r r r � update_copyL s r� c c sF x@| D ]8}t |t�s8t|d�r8x t|�D ] }|V q(W q|V qW dS )z�Given an iterator of which further sub-elements may also be iterators, flatten the sub-elements into a single iterator. rL N)r= rM rk �flatten_iterator)r� �elem�yr r r r� V 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 )Nr )r� r� r� r� r �Lockr� )r r� r� r� r r r r: o s zLRUCache.__init__c C s | j d7 _ | j S )Nr )r� )r r r r � _inc_counterv s zLRUCache._inc_counterc C s2 t �| ||�}||k r*| �� |d< |d S |S d S )N� r )r. r_ r� )r r$ r^ rq r r r r_ z s z LRUCache.getc C s t �| |�}| �� |d< |d S )Nr� r )r. rU r� )r r$ rq r r r rU � s zLRUCache.__getitem__c C s dd� t �| �D �S )Nc S s g | ] }|d �qS )r r )r r� r r r r" � s z#LRUCache.values.<locals>.<listcomp>)r. rK )r r r r rK � s zLRUCache.valuesc C s || kr| | S || |< |S d S )Nr )r r$ r% r r r rC � s zLRUCache.setdefaultc C sF t �| |�}|d kr2||| �� g}t �| ||� n||d< | �� d S )Nr )r. r_ r� r8 � _manage_size)r r$ r% rq r r r r8 � s zLRUCache.__setitem__c C s | j | j | j S )N)r� r� )r r r r �size_threshold� s zLRUCache.size_thresholdc C s� | j �d�sd S z�t| j�}x�t| �| j| j| j kr�|rJd}| �| � tt� | �t � d�dd�}x<|| jd � D ]*}y| |d = W qt t k r� wtY qtX qtW q W W d | j � � X d S )NFr� T)r$ �reverser )r� �acquirer� r� rH r� r� �sortedr. rK r� r� rY �release)r r� Z by_counterrq r r r r� � s zLRUCache._manage_size)r� r� N)N)r r r r) r r: r� r_ rU rK rC r8 r* r� r� r r r r r� c 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 k r|t | f�qS )N)�_property_getters)r r� �fieldr r r r" � s z+lightweight_named_tuple.<locals>.<listcomp>)r r c S s g | ]}|d k r|�qS )Nr )r �fr r r r" � s ) r � _lw_tuplesr_ r� r+ r. � enumerater, r )�name�fieldsZhash_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 r: � s zScopedRegistry.__init__c C s: | � � }y | j| S tk r4 | j�|| �� �S X d S )N)r� r� rY rC r� )r r$ r r r �__call__� s zScopedRegistry.__call__c C s | � � | jkS )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 rT r r r rs � s zScopedRegistry.setc C s* y| j | �� = W n tk r$ Y nX dS )z Clear the current scope, if any.N)r� r� rY )r r r r rA s zScopedRegistry.clearN) r r r r) r: r� r� rs rA 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 )N)r� r �localr� )r r� r r r r: s z ThreadLocalRegistry.__init__c C s2 y| j jS tk r, | �� }| j _|S X d S )N)r� r% r# r� )r r� r r r r� s z ThreadLocalRegistry.__call__c C s t | jd�S )Nr% )rk r� )r r r r r� s zThreadLocalRegistry.hasc C s || j _d S )N)r� r% )r rT r r r rs s zThreadLocalRegistry.setc C s$ y | j `W n tk r Y nX d S )N)r� r% r# )r r r r rA s zThreadLocalRegistry.clearN) r r r r) r: r� r� rs rA r r r r r� s r� c c s x| D ]}t |�|fV qW dS )z*Generator: ((id(o), o) for o in iterable).N)r� )rz rq r r r r� ' s r� c C s2 d}x(| D ] }||kr |d7 }|dkr dS q W dS )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�crq r r r � has_dupes. s r� )N)N)N)8r) � __future__r r� r� r� �compatr r r r r r � frozensetZ EMPTY_SETr r r r+ rF r1 r. r9 rD rc r\ rd rs rr r� r� r� r� r� Z column_dictZordered_column_setZpopulate_column_dictr� Z_gettersr� rt r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r �<module> sb C O ak S Q8