Your IP : 216.73.216.213

Current Path : /opt/alt/python35/lib64/python3.5/site-packages/pyrsistent/__pycache__/
Upload File :
Current File : //opt/alt/python35/lib64/python3.5/site-packages/pyrsistent/__pycache__/_pset.cpython-35.pyc



+�[V�@s�ddlmZmZddlZddlmZejddkZGdd�de�Z	ej
e	�ej
e	�e	e��Zfdd	d
�Zdd�Z
dS)
�)�Set�Hashable�N)�pmap�cs|eZdZdZd%Z�fdd�Zdd�Zdd	�Zd
d�Zdd
�Z	dd�Z
dd�Zdd�Ze
ddd��Zdd�Zdd�Zdd�Zdd�ZGdd �d e�Zd!d"�Zd#d$�ZejZejZejZejZejZejZejZejZej Z ej!Z!eZ"eZ#eZ$eZ%e Z&e!Z'ej(Z(�S)&�PSeta!
    Persistent set implementation. Built on top of the persistent map. The set supports all operations
    in the Set protocol and is Hashable.

    Do not instantiate directly, instead use the factory functions :py:func:`s` or :py:func:`pset`
    to create an instance.

    Random access and insert is log32(n) where n is the size of the set.

    Some examples:

    >>> s = pset([1, 2, 3, 1])
    >>> s2 = s.add(4)
    >>> s3 = s2.remove(2)
    >>> s
    pset([1, 2, 3])
    >>> s2
    pset([1, 2, 3, 4])
    >>> s3
    pset([1, 3, 4])
    �_map�__weakref__cs%tt|�j|�}||_|S)N)�superr�__new__r)�cls�m�self)�	__class__��C/opt/alt/python35/lib64/python3.5/site-packages/pyrsistent/_pset.pyr s	zPSet.__new__cCs
||jkS)N)r)r�elementrrr�__contains__%szPSet.__contains__cCs
t|j�S)N)�iterr)rrrr�__iter__(sz
PSet.__iter__cCs
t|j�S)N)�lenr)rrrr�__len__+szPSet.__len__cCsDts
|r!dtt|��Sdjtt|��dd��S)N�pzpset([{0}])r���)�PY2�str�set�format)rrrr�__repr__.s
z
PSet.__repr__cCs
|j�S)N)r)rrrr�__str__4szPSet.__str__cCs
t|j�S)N)�hashr)rrrr�__hash__7sz
PSet.__hash__cCstt|�ffS)N)�pset�list)rrrr�
__reduce__:szPSet.__reduce__�cCs)tttdd�|D��d|��S)Ncss|]}|dfVqdS)TNr)�.0�krrr�	<genexpr>@sz&PSet._from_iterable.<locals>.<genexpr>�pre_size)rr�dict)r�itr)rrr�_from_iterable>szPSet._from_iterablecCs|j�j|�j�S)z~
        Return a new PSet with element added

        >>> s1 = s(1, 2)
        >>> s1.add(3)
        pset([1, 2, 3])
        )�evolver�add�
persistent)rrrrrr.BszPSet.addcCs4|j�}x|D]}|j|�qW|j�S)z�
        Return a new PSet with elements in iterable added

        >>> s1 = s(1, 2)
        >>> s1.update([3, 4, 4])
        pset([1, 2, 3, 4])
        )r-r.r/)r�iterable�errrr�updateLs
zPSet.updatecCs<||jkr(|j�j|�j�Std|��dS)z�
        Return a new PSet with element removed. Raises KeyError if element is not present.

        >>> s1 = s(1, 2)
        >>> s1.remove(2)
        pset([1])
        z Element '%s' not present in PSetN)rr-�remover/�KeyError)rrrrrr3ZszPSet.removecCs,||jkr(|j�j|�j�S|S)zc
        Return a new PSet with element removed. Returns itself if element is not present.
        )rr-r3r/)rrrrr�discardgszPSet.discardc@s^eZdZdZdd�Zdd�Zdd�Zd	d
�Zdd�Zd
d�Z	dS)z
PSet._Evolver�_original_pset�
_pmap_evolvercCs||_|jj�|_dS)N)r6rr-r7)rZ
original_psetrrr�__init__ss	zPSet._Evolver.__init__cCsd|j|<|S)NT)r7)rrrrrr.ws
zPSet._Evolver.addcCs|j|=|S)N)r7)rrrrrr3{s
zPSet._Evolver.removecCs
|jj�S)N)r7�is_dirty)rrrrr9szPSet._Evolver.is_dirtycCs&|j�s|jSt|jj��S)N)r9r6rr7r/)rrrrr/�szPSet._Evolver.persistentcCs
t|j�S)N)rr7)rrrrr�szPSet._Evolver.__len__N)r6r7)
�__name__�
__module__�__qualname__�	__slots__r8r.r3r9r/rrrrr�_Evolverpsr>cCs|S)Nr)rrrr�copy�sz	PSet.copycCs
tj|�S)a!
        Create a new evolver for this pset. For a discussion on evolvers in general see the
        documentation for the pvector evolver.

        Create the evolver and perform various mutating updates to it:

        >>> s1 = s(1, 2, 3)
        >>> e = s1.evolver()
        >>> _ = e.add(4)
        >>> len(e)
        4
        >>> _ = e.remove(1)

        The underlying pset remains the same:

        >>> s1
        pset([1, 2, 3])

        The changes are kept in the evolver. An updated pmap can be created using the
        persistent() function on the evolver.

        >>> s2 = e.persistent()
        >>> s2
        pset([2, 3, 4])

        The new pset will share data with the original pset in the same way that would have
        been done if only using operations on the pset.
        )rr>)rrrrr-�szPSet.evolver)rr	))r:r;r<�__doc__r=rrrrrrr!r$�classmethodr,r.r2r3r5�objectr>r?r-r�__le__�__lt__�__gt__�__ge__�__eq__�__ne__�__and__�__or__�__sub__�__xor__�issubset�
issuperset�union�intersection�
difference�symmetric_difference�
isdisjointrr)rrrsH

	#										rr%cCs|s
tStj|d|�S)z�
    Creates a persistent set from iterable. Optionally takes a sizing parameter equivalent to that
    used for :py:func:`pmap`.

    >>> s1 = pset([1, 2, 3, 2])
    >>> s1
    pset([1, 2, 3])
    r))�_EMPTY_PSETrr,)r0r)rrrr"�s	r"cGs
t|�S)z�
    Create a persistent set.

    Takes an arbitrary number of arguments to insert into the new set.

    >>> s1 = s(1, 2, 3, 2)
    >>> s1
    pset([1, 2, 3])
    )r")�elementsrrr�s�s
rV)�_compatrr�sysZpyrsistent._pmapr�version_inforrBr�registerrTr"rVrrrr�<module>s�