+ n9eJJ^RIHtHt^RIHt^RIHtHt^RIH t ^RI H t ]!R4t ]!RRR 7t !R R 4t!R R ]4t!RR]4t!RR]] ] 3,4t]P$!]4]P$!]4Rt]!/^4t/^3RltRtR#))MappingHashable)chain)GenericTypeVar)pvector transformKTVT_coT) covariantc<a]tRt^ toRtRtRtRtRtRt Vt R#)PMapViewa{View type for the persistent map/dict type `PMap`. Provides an equivalent of Python's built-in `dict_values` and `dict_items` types that result from expreessions such as `{}.values()` and `{}.items()`. The equivalent for `{}.keys()` is absent because the keys are instead represented by a `PSet` object, which can be created in `O(1)` time. The `PMapView` class is overloaded by the `PMapValues` and `PMapItems` classes which handle the specific case of values and items, respectively Parameters ---------- m : mapping The mapping/dict-like object of which a view is to be created. This should generally be a `PMap` object. c\V\4'g.\V\4'd \V4pM \ R4h\ P VRV4R#)z"PViewMap requires a Mapping object_mapN) isinstancePMaprpmap TypeErrorobject __setattr__)selfms&&2/usr/lib/python3/dist-packages/pyrsistent/_pmap.py__init__PMapView.__init__sC!T""!W%%G DEE4+c,\VP4#N)lenrrs&r__len__PMapView.__len__&s499~rc2\\V4: R24h)z is immutable)rtype)rkvs&&&rrPMapView.__setattr__)sT$Z9::rc\R4hz"Persistent maps are not reversiblerr!s&r __reversed__PMapView.__reversed__,<==rN) __name__ __module__ __qualname____firstlineno____doc__rr"rr,__static_attributes____classdictcell__ __classdict__s@rrr s#",;>>rrcBa]tRt^/toRtRtRtRtRtRt Rt Vt R#) PMapValuesa_View type for the values of the persistent map/dict type `PMap`. Provides an equivalent of Python's built-in `dict_values` type that result from expreessions such as `{}.values()`. See also `PMapView`. Parameters ---------- m : mapping The mapping/dict-like object of which a view is to be created. This should generally be a `PMap` object. c6VPP4#rr itervaluesr!s&r__iter__PMapValues.__iter__;syy##%%rc:WPP49#rr<)rargs&&r __contains__PMapValues.__contains__>sii**,,,rc2R\\V44 R2#z pmap_values()listiterr!s&r__str__PMapValues.__str__Bd4:./q11rc2R\\V44 R2#rErGr!s&r__repr__PMapValues.__repr__ErLrcWJdR#R#TFr/rxs&&r__eq__PMapValues.__eq__Hs 9Trr/N r0r1r2r3r4r>rBrJrNrTr5r6r7s@rr:r:/s( &-22rr:cBa]tRt^NtoRtRtRtRtRtRt Rt Vt R#) PMapItemsa\View type for the items of the persistent map/dict type `PMap`. Provides an equivalent of Python's built-in `dict_items` type that result from expreessions such as `{}.items()`. See also `PMapView`. Parameters ---------- m : mapping The mapping/dict-like object of which a view is to be created. This should generally be a `PMap` object. c6VPP4#r)r iteritemsr!s&rr>PMapItems.__iter__Zsyy""$$rcVwr#Y P9;'dTPT,T8H# \dR#i;i)F) Exceptionr)rrAr&r's&& rrBPMapItems.__contains__]s9UaII~33$))A,!"33&&s1 AAc2R\\V44 R2#z pmap_items(rFrGr!s&rrJPMapItems.__str__cT$t*-.a00rc2R\\V44 R2#r`rGr!s&rrNPMapItems.__repr__frbrc|WJdR#\V\V44'gR#VPVP8H#rQ)rr%rrRs&&rrTPMapItems.__eq__is/ 9TAtDz**5YY!&&((rr/NrVr7s@rrXrXNs( %4 11))rrXcbaa]tRt^ntoRtR$tV3Rlt]R4t]R4t Rt ]R4t Rt ] PtRtR tR tR tR tR tRtRtRtRtRtRt] P6tRt]t]t]tRt Rt!Rt"Rt#Rt$Rt%Rt&Rt']'t(Rt)Rt*Rt+!R R!],4t-R"t.R#t/Vt0V;t1#)%rat Persistent map/dict. Tries to follow the same naming conventions as the built in dict where feasible. Do not instantiate directly, instead use the factory functions :py:func:`m` or :py:func:`pmap` to create an instance. Was originally written as a very close copy of the Clojure equivalent but was later rewritten to closer re-assemble the python dict. This means that a sparse vector (a PVector) of buckets is used. The keys are hashed and the elements inserted at position hash % len(bucket_vector). Whenever the map size exceeds 2/3 of the containing vectors size the map is reallocated to a vector of double the size. This is done to avoid excessive hash collisions. This structure corresponds most closely to the built in dict type and is intended as a replacement. Where the semantics are the same (more or less) the same function names have been used but for some cases it is not possible, for example assignments and deletion of values. PMap implements the Mapping protocol and is Hashable. It also supports dot-notation for element access. Random access and insert is log32(n) where n is the size of the map. The following are examples of some common operations on persistent maps >>> m1 = m(a=1, b=3) >>> m2 = m1.set('c', 3) >>> m3 = m2.remove('a') >>> m1 == {'a': 1, 'b': 3} True >>> m2 == {'a': 1, 'b': 3, 'c': 3} True >>> m3 == {'b': 3, 'c': 3} True >>> m3['c'] 3 >>> m3.c 3 cF<\\V` V4pWnW#nV#r)superr__new___size_buckets)clssizebucketsr __class__s&&& rrj PMap.__new__s#T3',   rcN\V4\V4,pW,pW#3#r)hashr )rokeyindexbuckets&& r _get_bucketPMap._get_buckets#S CL(}rc\PW4wr#V'dVFwrEWA8XgK Vu# \V4hr)rrwKeyError)rort_rvr&r's&& r_getitem PMap._getitems9$$W2  8HsmrcB\PVPV4#r)rr|rlrrts&&r __getitem__PMap.__getitem__s}}T]]C00rcp\PW4wr#V'dVFwrBWA8XgK R# R#R#rQ)rrw)rortr{rvr&s&& r _containsPMap._containss3$$W2  8rc:VPVPV4#r)rrlrs&&rrBPMap.__contains__s~~dmmS11rc"VP4#r)iterkeysr!s&rr> PMap.__iter__}}rc\R4hr*r+r!s&rr,PMap.__reversed__r.rcW,# \d5p\RP\T4PT44ThRp?ii;i)z{0} has no attribute '{1}'N)rzAttributeErrorformatr%r0)rrtes&& r __getattr__PMap.__getattr__sI 9   ,33DJ4G4GM  s A /AA c#H"VP4F wrVxK R#5irrZ)rr&r{s& rr PMap.iterkeysNN$DAG% "c#H"VP4F wrVxK R#5irr)rr{r's& rr=PMap.itervaluesrrc#h"VPFpV'gK VF wr#W#3xK K R#5ir)rl)rrvr&r's& rrZPMap.iteritemss+mmFv"DA$J#$s22c\V4#r)r:r!s&rvalues PMap.valuess $rc^RIHpV!V4#))PSet)_psetr)rrs& rkeys PMap.keyssDzrc\V4#r)rXr!s&ritems PMap.itemss rcVP#rrkr!s&rr" PMap.__len__s zzrcHRP\\V444#)z pmap({0}))rstrdictr!s&rrN PMap.__repr__s!!#d4j/22rcWJdR#\V\4'g\#\V4\V48wdR#\V\4'd\ VR4'd0\ VR4'dVP VP 8wdR#VPVP8XdR#\VP44\VP448H#\V\4'd\VP44V8H#\VP44\VP448H#)TF _cached_hash) rrNotImplementedr rhasattrrrlrrZrrothers&&rrT PMap.__eq__s =%))! ! t9E " eT " "n--'%2P2P))U-?-??}}.()T%//2C-DD D t $ $()U2 2DNN$%ekkm)<<>> m1 = m(a=1, b=2) >>> m2 = m1.set('a', 3) >>> m3 = m1.set('c' ,4) >>> m1 == {'a': 1, 'b': 2} True >>> m2 == {'a': 3, 'b': 2} True >>> m3 == {'a': 1, 'b': 2, 'c': 4} True )evolverset persistentrrtvals&&&rrPMap.sets$||~!!#+6688rc \VP4PV4P4#)z Return a new PMap without the element specified by key. Raises KeyError if the element is not present. >>> m1 = m(a=1, b=2) >>> m1.remove('a') pmap({'b': 2}) )rremoverrs&&rr PMap.remove%s$||~$$S)4466rc LVPV4# \dTu#i;i)z Return a new PMap without the element specified by key. Returns reference to itself if element is not present. >>> m1 = m(a=1, b=2) >>> m1.discard('a') pmap({'b': 2}) >>> m1 is m1.discard('c') True )rrzrs&&rdiscard PMap.discard0s* ;;s# # K s  ##c ,VP!R.VO5!#)z Return a new PMap with the items in Mappings inserted. If the same key is present in multiple maps the rightmost (last) value is inserted. >>> m1 = m(a=1, b=2) >>> m1.update(m(a=2, c=3), {'a': 17, 'd': 35}) == {'a': 17, 'b': 2, 'c': 3, 'd': 35} True cV#rr/)lrs&&rPMap.update..IsQr) update_with)rmapss&*rupdate PMap.update@s666rc  VP4pVFCpVP4F,wrVTPYUV9dV!W5,V4MT4K. KE VP4#)a Return a new PMap with the items in Mappings maps inserted. If the same key is present in multiple maps the values will be merged using merge_fn going from left to right. >>> from operator import add >>> m1 = m(a=1, b=2) >>> m1.update_with(add, m(a=2)) == {'a': 3, 'b': 2} True The reverse behaviour of the regular merge. Keep the leftmost element instead of the rightmost. >>> m1 = m(a=1) >>> m1.update_with(lambda l, r: l, m(a=2), {'a':3}) pmap({'a': 1}) )rrrr)r update_fnrrmaprtvalues&&* rrPMap.update_withKsZ ,,.C!iik  C'>7<!?W\]*!!##rc$VPV4#r)rrs&&r__add__ PMap.__add__bs{{5!!rc&\\V433#r)rrr!s&r __reduce__PMap.__reduce__gsd4j]""rc \W4#)aW Transform arbitrarily complex combinations of PVectors and PMaps. A transformation consists of two parts. One match expression that specifies which elements to transform and one transformation function that performs the actual transformation. >>> from pyrsistent import freeze, ny >>> news_paper = freeze({'articles': [{'author': 'Sara', 'content': 'A short article'}, ... {'author': 'Steve', 'content': 'A slightly longer article'}], ... 'weather': {'temperature': '11C', 'wind': '5m/s'}}) >>> short_news = news_paper.transform(['articles', ny, 'content'], lambda c: c[:25] + '...' if len(c) > 25 else c) >>> very_short_news = news_paper.transform(['articles', ny, 'content'], lambda c: c[:15] + '...' if len(c) > 15 else c) >>> very_short_news.articles[0].content 'A short article' >>> very_short_news.articles[1].content 'A slightly long...' When nothing has been transformed the original data structure is kept >>> short_news is news_paper True >>> very_short_news is news_paper False >>> very_short_news.articles[0] is news_paper.articles[0] True r )rtransformationss&*rr PMap.transformks4//rcV#rr/r!s&rcopy PMap.copys rcfa]tRtRtoRtRtRtRtRtRt Rt Rt R t R t R tR tR tVtR#) PMap._EvolvericrWnVPP4VnVPVnR#r)_original_pmaprlr_buckets_evolverrk)r original_pmaps&&rrPMap._Evolver.__init__s,"/ $1$:$:$B$B$DD !&,,DJrcB\PVPV4#r)rr|rrs&&rrPMap._Evolver.__getitem__s==!6!6<  AR$R !"DAx,PMap._Evolver._reallocate..s+Dw!!AAws  ) r rrr from_iterablersappendrrr)rnew_sizenew_listror&r'rus& rrPMap._Evolver._reallocates3t4455H4&(H++668G+++Dw+DDQ(*??O**A62()vhHO E%,I$5$5$7D !  ! ! ( ( 2rc6VPP4#r)ris_dirtyr!s&rrPMap._Evolver.is_dirtys((113 3rcVP4'd4\VPVPP 44VnVP #r)rrrkrrrr!s&rrPMap._Evolver.persistents;}}&*4::t7L7L7W7W7Y&Z#&& &rcVP#rrr!s&rr"PMap._Evolver.__len__s :: rcB\PVPV4#r)rrrrs&&rrBPMap._Evolver.__contains__s>>$"7"7= =rc(VPV4R#r)rrs&&r __delitem__PMap._Evolver.__delitem__s KK rc~\PVPV4wr#V'duVUUu.uFwrEWA8XdK WE3NK ppp\V4\V4, pV^8d5V'dTMRVPV&V;PV,unV#\ RP V44huuppi)rNz{0})rrwrr rkrzr)rrtrurvr&r'r size_diffs&& rrPMap._Evolver.removes ,,T-B-BCHME39L6!!(fqf6 LK#j/9 q=AK:QUD))%0JJ)+JK5<<,- -Ms B9B9)rrrkN)rrkr)r0r1r2r3 __slots__rrrrrrrr"rBrrr5r6r7s@r_EvolverrsGC  -  =  D 3  4 '   >  . .rrc $VPV4#)a Create a new evolver for this pmap. For a discussion on evolvers in general see the documentation for the pvector evolver. Create the evolver and perform various mutating updates to it: >>> m1 = m(a=1, b=2) >>> e = m1.evolver() >>> e['c'] = 3 >>> len(e) 3 >>> del e['a'] The underlying pmap remains the same: >>> m1 == {'a': 1, 'b': 2} True The changes are kept in the evolver. An updated pmap can be created using the persistent() function on the evolver. >>> m2 = e.persistent() >>> m2 == {'b': 2, 'c': 3} True The new pmap will share data with the original pmap in the same way that would have been done if only using operations on the pmap. )rr!s&rr PMap.evolvers:}}T""r)rlrrk)rkrl __weakref__r)2r0r1r2r3r4rrj staticmethodrwr|rrrBrgetr>r,rrr=rZrrrr"rNrT__ne__r__le____gt____ge__rJrrrrrrr__or__rr rrrrr5r6 __classcell__)rpr8s@@rrrns$JEI  1  2 ++C >  3=$^^F3F F F! 9 7 7$."F#08^.6^.@##rrcV'dTpM^\V4,;'g^pVR.,p\V\4'g \ V4pVP 4FBwrE\ V4pWb,pW7,pV'dVPWE34K<WE3.W7&KD \\V4\4PV44# \d^pLi;i)rN) r r]rrrrrsrrrr) initialpre_sizernror&r'hrurvs && r_turbo_mappingr' s s7|#((qD dVmG gw ' 'w-  G  MM1& ! fXGN  G gi..w7 88/ D sCC C&%C&cBV'gV^8Xd\#\W4#)a Create new persistent map, inserts all elements in initial into the newly created map. The optional argument pre_size may be used to specify an initial size of the underlying bucket vector. This may have a positive performance impact in the cases where you know beforehand that a large number of elements will be inserted into the map eventually since it will reduce the number of reallocations required. >>> pmap({'a': 13, 'b': 14}) == {'a': 13, 'b': 14} True ) _EMPTY_PMAPr')r$r%s&&rrr0s x1} ' ,,rc \V4#)z Creates a new persistent map. Inserts all key value arguments into the newly created map. >>> m(a=13, b=14) == {'a': 13, 'b': 14} True )r)kwargss,rrr@s <rN)collections.abcrr itertoolsrtypingrrpyrsistent._pvectorrpyrsistent._transformationsr r r rr:rXrregisterr'r)rrr/rrr2s-#'1 T]4(#>#>J>))@Y#72u9 Y#v $9@R# a - r