o a=@shddlmZmZddlZddlmZGdddeZeeeeeeZ d dd Z d d Z dS) )SetHashableN)pmapcseZdZdZdZfddZddZddZd d Zd d Z d dZ ddZ ddZ e d$ddZddZddZddZddZGdddeZd d!Zd"d#ZejZejZejZejZejZejZejZejZej Z ej!Z!eZ"eZ#eZ$eZ%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__cstt||}||_|SN)superr__new__r)clsmself __class__2/usr/lib/python3/dist-packages/pyrsistent/_pset.pyr sz PSet.__new__cCs ||jvSr)rr elementrrr __contains__# zPSet.__contains__cC t|jSr)iterrr rrr__iter__&rz PSet.__iter__cCrr)lenrrrrr__len__)rz PSet.__len__cCs.|s dtt|Sdtt|ddS)Npz pset([{0}]))strsetformatrrrr__repr__,sz PSet.__repr__cCs|Sr)r"rrrr__str__2sz PSet.__str__cCrr)hashrrrrr__hash__5rz PSet.__hash__cCstt|ffSr)psetlistrrrr __reduce__8szPSet.__reduce__cCstttdd|D|dS)Ncss|]}|dfVqdS)TNr).0krrr >sz&PSet._from_iterable..pre_size)rrdict)r itr.rrr_from_iterable<szPSet._from_iterablecCs||S)z~ Return a new PSet with element added >>> s1 = s(1, 2) >>> s1.add(3) pset([1, 2, 3]) evolveradd persistentrrrrr4@szPSet.addcCs$|}|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 iterableerrrrupdateJs z PSet.updatecCs,||jvr||Stdt|)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)rr3remover5KeyErrorreprrrrrr9Xs z PSet.removecCs ||jvr||S|S)zc Return a new PSet with element removed. Returns itself if element is not present. )rr3r9r5rrrrdiscardes z PSet.discardc@s@eZdZdZddZddZddZdd Zd d Zd d Z dS)z PSet._Evolver)_original_pset _pmap_evolvercCs||_|j|_dSr)r=rr3r>)r original_psetrrr__init__qszPSet._Evolver.__init__cCsd|j|<|S)NTr>rrrrr4us zPSet._Evolver.addcCs |j|=|SrrArrrrr9yszPSet._Evolver.removecCs |jSr)r>is_dirtyrrrrrB}rzPSet._Evolver.is_dirtycCs|s|jSt|jSr)rBr=rr>r5rrrrr5szPSet._Evolver.persistentcCrr)rr>rrrrrrzPSet._Evolver.__len__N) __name__ __module__ __qualname__ __slots__r@r4r9rBr5rrrrr_Evolverns rGcCs|Srrrrrrcopysz PSet.copycCs 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. )rrGrrrrr3s z PSet.evolver)r))*rCrDrE__doc__rFr rrrr"r#r%r( classmethodr1r4r8r9r<objectrGrHr3r__le____lt____gt____ge____eq____ne____and____or____sub____xor__issubset issupersetunion intersection differencesymmetric_difference isdisjoint __classcell__rrrrrsJ     #rrr)cCs|stStj||dS)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_PSETrr1)r6r.rrrr&s r&cGst|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&)elementsrrrss r`)rr)) collections.abcrrsyspyrsistent._pmaprrKrregisterr^r&r`rrrrs  ?