]j= d dl mZmZ d dlZd dlmZ G d de Z ej e ej e e e Z d
dZ
d Z dS ) )SetHashableN)pmapc Z e Zd ZdZdZ fdZd Zd Zd Zd Z d Z
d Z d
Z e
dd Zd
Zd Zd Zd Z G d de Zd Zd Zej Zej Zej Zej Zej Z ej Z ej Z ej Z ej Z ej! Z!eZ"eZ#e Z$e Z%e Z&e!Z'ej( Z( xZ)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 f t t | | }||_ |S N)superr __new__r )clsmself __class__s p/builddir/build/BUILD/imunify360-venv-2.6.3/opt/imunify360/venv/lib/python3.11/site-packages/pyrsistent/_pset.pyr
z PSet.__new__ s, T3 '',, c || j v S r )r r elements r __contains__zPSet.__contains__# s $)##r c * t | j S r )iterr r s r __iter__z
PSet.__iter__& DI r c * t | j S r )lenr r s r __len__z PSet.__len__) s 49~~ r c | s dt t | z S d t t | dd S )Npz pset([{0}]) )strsetformatr s r __repr__z
PSet.__repr__, sJ (SYY ' ' ##CD NN1R4$8999r c * | S r )r' r s r __str__z PSet.__str__2 s }} r c * t | j S r )hashr r s r __hash__z
PSet.__hash__5 r r c 0 t t | ffS r )psetlistr s r
__reduce__zPSet.__reduce__8 s d4jj]""r c l t t t d |D | S )Nc 3 K | ]}|d fV dS )TN ).0ks r <genexpr>z&PSet._from_iterable.<locals>.<genexpr>> s& 4 4Aq$i 4 4 4 4 4 4r pre_size)r r dict)r itr9 s r _from_iterablezPSet._from_iterable< s4 D 4 4 4 4 444xHHHIIIr c t | | S )z~
Return a new PSet with element added
>>> s1 = s(1, 2)
>>> s1.add(3)
pset([1, 2, 3])
evolveradd
persistentr s r r@ zPSet.add@ s, ||~~!!'**55777r c | }|D ]}| | | 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 iterableer s r updatez PSet.updateJ s?
LLNN G
EE'NNNN||~~ r c || j v r9| | S t dt | z )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 r? removerA KeyErrorreprr s r rG z PSet.removeX sS di <<>>((11<<>> >9DMMIJJJr c || j v r9| | S | S )zc
Return a new PSet with element removed. Returns itself if element is not present.
)r r? rG rA r s r discardz PSet.discarde s> di <<>>((11<<>> > r c 6 e Zd ZdZd Zd Zd Zd Zd Zd Z dS )
PSet._Evolver)_original_pset
_pmap_evolverc P || _ |j | _ d S r )rN r r? rO )r
original_psets r __init__zPSet._Evolver.__init__q s' "/D !.!3!;!;!=!=D r c d| j |< | S )NTrO r s r r@ zPSet._Evolver.addu s *.D w 'Kr c | j |= | S r rT r s r rG zPSet._Evolver.removey s "7+Kr c 4 | j S r )rO is_dirtyr s r rW zPSet._Evolver.is_dirty} s %..00 0r c | s| j S t | j S r )rW rN r rO rA r s r rA zPSet._Evolver.persistent s8 ==??
, ++*557788 8r c * t | j S r )r rO r s r r zPSet._Evolver.__len__ s t)** *r N)
__name__
__module__ __qualname__ __slots__rR r@ rG rW rA r r4 r r _EvolverrM n ss 7 > > > 1 1 1 9 9 9 + + + + +r r^ c | S r r4 r s r copyz PSet.copy s r c 6 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 s r r? z PSet.evolver s : }}T"""r )r1 )*rZ r[ r\ __doc__r] r
r r r r' r) r, r0 classmethodr< r@ rE rG rK objectr^ r` r? r __le____lt____gt____ge____eq____ne____and____or____sub____xor__issubset
issupersetunion intersection
differencesymmetric_difference
isdisjoint
__classcell__)r s @r r r s * (I
$ $ $ : : : # # # J J J [J8 8 8 K K K + + + + +6 + + +6 # # #F ZF
ZF
ZF
ZF
ZF
ZFkG
ZFkGkGHJ ELJ" JJJJJr r r4 r1 c L | st S t | | 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])
r8 ) _EMPTY_PSETr r< )rC r9 s r r. r. s+ x( ; ;;r c 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. )elementss r sr{ s >>r )r4 r1 ) collections.abcr r syspyrsistent._pmapr rd r registerrx r. r{ r4 r r <module>r s ) ) ) ) ) ) ) )
! ! ! ! ! !| | | | | 6 | | | |
T $ d4466ll < < < <
r