관리-도구
편집 파일: _pset.cpython-37.pyc
B +�[V � @ sv d dl mZmZ ddlZddlmZ ejd dk ZG dd� de�Z e� e � e� e � e e� �Z dd d �Z d d � Z dS )� )�Set�Hashable� N)�pmap� c s e Zd ZdZdZ� fdd�Zdd� Zdd� Zd d � Zd d � Z d d� Z dd� Z dd� Z e d$dd��Zdd� Zdd� Zdd� Zd d � ZG d d � d e�Zd d!� Zd"d#� ZejZejZejZejZej Z ej Z ej Z ej Z ej Z ej!Z!eZ"eZ#e Z$e Z%e Z&e!Z'ej(Z(� 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__c s t t| ��| �}||_|S )N)�superr �__new__r )�cls�m�self)� __class__� �C/opt/alt/python37/lib64/python3.7/site-packages/pyrsistent/_pset.pyr s z PSet.__new__c C s || j kS )N)r )r �elementr r r � __contains__% s zPSet.__contains__c C s t | j�S )N)�iterr )r r r r �__iter__( s z PSet.__iter__c C s t | j�S )N)�lenr )r r r r �__len__+ s z PSet.__len__c C s2 t s| sdtt| �� S d�tt| ��dd� �S )N�pz pset([{0}])r ���)�PY2�str�set�format)r r r r �__repr__. s z PSet.__repr__c C s | � � S )N)r )r r r r �__str__4 s z PSet.__str__c C s t | j�S )N)�hashr )r r r r �__hash__7 s z PSet.__hash__c C s t t| �ffS )N)�pset�list)r r r r � __reduce__: s zPSet.__reduce__� c C s t ttdd� |D ��|d��S )Nc s s | ]}|d fV qdS )TNr )�.0�kr r r � <genexpr>@ s z&PSet._from_iterable.<locals>.<genexpr>)�pre_size)r r �dict)r �itr) r r r �_from_iterable> s zPSet._from_iterablec C s | � � �|��� S )z~ Return a new PSet with element added >>> s1 = s(1, 2) >>> s1.add(3) pset([1, 2, 3]) )�evolver�add� persistent)r r r r r r. B s zPSet.addc C s( | � � }x|D ]}|�|� qW |�� 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�er r r r �updateL s z PSet.updatec C s, || j kr | �� �|��� S td| ��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)r r- �remover/ �KeyError)r r r r r r3 Z s z PSet.removec C s || j kr | �� �|��� S | S )zc Return a new PSet with element removed. Returns itself if element is not present. )r r- r3 r/ )r r r r r �discardg s z PSet.discardc @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd d � Z dS )z PSet._Evolver)�_original_pset� _pmap_evolverc C s || _ |j�� | _d S )N)r6 r r- r7 )r Z original_psetr r r �__init__s s zPSet._Evolver.__init__c C s d| j |< | S )NT)r7 )r r r r r r. w s zPSet._Evolver.addc C s | j |= | S )N)r7 )r r r r r r3 { s zPSet._Evolver.removec C s | j �� S )N)r7 �is_dirty)r r r r r9 s zPSet._Evolver.is_dirtyc C s | � � s| jS t| j�� �S )N)r9 r6 r r7 r/ )r r r r r/ � s zPSet._Evolver.persistentc C s t | j�S )N)r r7 )r r r r r � s zPSet._Evolver.__len__N) �__name__� __module__� __qualname__� __slots__r8 r. r3 r9 r/ r r r r r �_Evolverp s r> c C s | S )Nr )r r r r �copy� s z PSet.copyc C s t �| �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. )r r> )r r r r r- � s z PSet.evolver)r% )*r: r; r< �__doc__r= r r r r r r r! r$ � classmethodr, r. r2 r3 r5 �objectr> r? r- r �__le__�__lt__�__gt__�__ge__�__eq__�__ne__�__and__�__or__�__sub__�__xor__�issubset� issuperset�union� intersection� difference�symmetric_difference� isdisjoint� __classcell__r r )r r r sH #r r r% c C s | st S tj| |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_PSETr r, )r0 r) r r r r" � s r" c G s 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" )�elementsr r r �s� s rW )r r% )�_compatr r �sysZpyrsistent._pmapr � version_infor rB r �registerrU r" rW r r r r �<module> s ?