|
Server : Apache System : Linux iad1-shared-b8-43 6.6.49-grsec-jammy+ #10 SMP Thu Sep 12 23:23:08 UTC 2024 x86_64 User : dh_edsupp ( 6597262) PHP Version : 8.2.26 Disable Function : NONE Directory : /lib/python3/dist-packages/pyrsistent/__pycache__/ |
Upload File : |
o
���a= � @ sh d dl mZmZ d dlZd dlmZ G dd� de�Ze�e� e�e� ee� �Z d dd �Z
d
d � Z dS )
� )�Set�HashableN)�pmapc 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__� �2/usr/lib/python3/dist-packages/pyrsistent/_pset.pyr
s z PSet.__new__c C s
|| j v S r )r �r
�elementr r r � __contains__# �
zPSet.__contains__c C �
t | j�S r )�iterr �r
r r r �__iter__& r z
PSet.__iter__c C r r )�lenr r r r r �__len__) r z PSet.__len__c C s. | s
dt t| �� S d�t t| ��dd� �S )N�pz pset([{0}])� ���)�str�set�formatr r r r �__repr__, s z
PSet.__repr__c C s | � � S r )r" r r r r �__str__2 s z PSet.__str__c C r r )�hashr r r r r �__hash__5 r z
PSet.__hash__c C s t t| �ffS r )�pset�listr r r r �
__reduce__8 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�
persistentr r r r r4 @ s zPSet.addc C s$ | � � }|D ]}|�|� q|�� 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])
r2 )r
�iterable�er r r r �updateJ s z PSet.updatec C s, || j v r| �� �|��� S tdt|� ��)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 PSet)r r3 �remover5 �KeyError�reprr r r r r9 X s
z PSet.removec C s || j v r| �� �|��� S | S )zc
Return a new PSet with element removed. Returns itself if element is not present.
)r r3 r9 r5 r r r r �discarde 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 r )r= r r3 r> )r
�
original_psetr r r �__init__q s zPSet._Evolver.__init__c C s d| j |< | S )NT�r> r r r r r4 u s
zPSet._Evolver.addc C s | j |= | S r rA r r r r r9 y s zPSet._Evolver.removec C s
| j �� S r )r> �is_dirtyr r r r rB } r zPSet._Evolver.is_dirtyc C s | � � s| jS t| j�� �S r )rB r= r r> r5 r r r r r5 � s zPSet._Evolver.persistentc C r r )r r> r r r r r � r zPSet._Evolver.__len__N)
�__name__�
__module__� __qualname__� __slots__r@ r4 r9 rB r5 r r r r r �_Evolvern s rG c C s | S r r 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 rG r r r r r3 � s
z PSet.evolver)r) )*rC rD rE �__doc__rF r
r r r r" r# r% r( � classmethodr1 r4 r8 r9 r< �objectrG rH r3 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 sJ
#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 r1 )r6 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
r` )r r) ) �collections.abcr r �sys�pyrsistent._pmapr rK r �registerr^ r& r` r r r r �<module> s
?