+ n9e^RIHtHt^RIt^RIHtHt^RIHt]!RRR7t !RR ]] ,4t ]P!] 4]P!] 4] !]!44t R R lt R tR#) )SetHashableN)TypeVarGeneric)pmapT_coT) covariantcaa]tRt^ toRtRtV3RltRtRtRt Rt Rt Rt R t ]RR l4tR tR tR tRt!RR]4tRtRt]P2t]P4t]P6t]P8t]P:t]P<t]P>t]P@t ]PBt!]PDt"]t#]t$] t%]t&]!t']"t(]PRt)Rt*Vt+V;t,#)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]) c:<\\V` V4pWnV#N)superr __new___map)clsmself __class__s&& 2/usr/lib/python3/dist-packages/pyrsistent/_pset.pyr PSet.__new__!sT3',  cWP9#r rrelements&&r __contains__PSet.__contains__&s))##rc,\VP4#r )iterrrs&r__iter__ PSet.__iter__)DIIrc,\VP4#r )lenrr s&r__len__ PSet.__len__,s499~rcV'gR\\V44,#RP\\V44^R4#)pz pset([{0}]))strsetformatr s&r__repr__ PSet.__repr__/s8SY' '##CD N1R$899rc"VP4#r )r.r s&r__str__ PSet.__str__5s}}rc,\VP4#r )hashrr s&r__hash__ PSet.__hash__8r#rc&\\V433#r )psetlistr s&r __reduce__PSet.__reduce__;sd4j]""rcN\\\RV44VR74#)c3("TFqR3xK R#5i)TN).0ks& r &PSet._from_iterable..As4A$ispre_size)r rdict)ritrDs&&&r_from_iterablePSet._from_iterable?sD444xHIIrc \VP4PV4P4#)zV Return a new PSet with element added >>> s1 = s(1, 2) >>> s1.add(3) pset([1, 2, 3]) evolveradd persistentrs&&rrLPSet.addCs$||~!!'*5577rc vVP4pVFpVPV4K VP4#)zq Return a new PSet with elements in iterable added >>> s1 = s(1, 2) >>> s1.update([3, 4, 4]) pset([1, 2, 3, 4]) rJ)riterableers&& rupdate PSet.updateMs2 LLNG EE'N ||~rc WP9d.VP4PV4P4#\ R\ V4,4h)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)rrKremoverMKeyErrorreprrs&&rrU PSet.remove[sC ii <<>((1<<> >9DMIJJrc WP9d.VP4PV4P4#V#)zS Return a new PSet with element removed. Returns itself if element is not present. )rrKrUrMrs&&rdiscard PSet.discardhs3 ii <<>((1<<> > rcHa]tRt^qtoRtRtRtRtRtRt Rt Rt Vt R#) PSet._EvolvercPWnVPP4VnR#r )_original_psetrrK _pmap_evolver)r original_psets&&r__init__PSet._Evolver.__init__ts"/ !.!3!3!;!;!=D rc$RVPV&V#)Tr`rs&&rrLPSet._Evolver.addxs*.D  w 'Krc VPVV#r rers&&rrUPSet._Evolver.remove|s""7+Krc6VPP4#r )r`is_dirtyr s&rrjPSet._Evolver.is_dirtys%%..0 0rcVP4'g VP#\VPP 44#r )rjr_r r`rMr s&rrMPSet._Evolver.persistents3==??+++**5578 8rc,\VP4#r )r%r`r s&rr&PSet._Evolver.__len__st))* *r)r_r`N) __name__ __module__ __qualname____firstlineno__ __slots__rbrLrUrjrMr&__static_attributes____classdictcell__) __classdict__s@r_Evolverr]qs-7  >   1 9  + +rrxcV#r r>r s&rcopy PSet.copys rc ,\PV4#)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 rxr s&rrK PSet.evolvers:}}T""rr)r __weakref__))-rprqrrrs__doc__rtrrr!r&r.r1r5r: classmethodrGrLrRrUrZobjectrxrzrKr__le____lt____gt____ge____eq____ne____and____or____sub____xor__issubset issupersetunion intersection differencesymmetric_difference isdisjointrurv __classcell__)rrws@@rr r s*(I $: #JJ8  K+6+6#FZZF ZZF ZZF ZZF ZZF ZZFkkG ZZFkkGkkGHJ ELJ"JJrr cJV'g\#\PWR7#)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]) rC) _EMPTY_PSETr rG)rPrDs&&rr8r8s!    x  ;;rc\V4#)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]) )r8)elementss*rsrs >r)r>r)collections.abcrrsystypingrrpyrsistent._pmaprrr registerrr8rr>rrrsa) #!v&| 74=| | T$46l  < r