6hSSKJr SSKJrJrJrJr SSKJr Sr "SS5r "SS \ 5r "S S \ 5r S r "S S\ 5r"SS\ 5r"SS\5r"SS\5rSSjr"SS\ 5r"SS\5rg)) annotations)encodingerrorpycompatutil) stringutilcr[R"[U5R5R S5$)N_)rsysbytestype__name__lstrip)os 4/usr/lib/python3/dist-packages/mercurial/smartset.py _typenamers(   T!W-- . 5 5d ;;c\rSrSrSr\rSrSrSrSr Sr Sr Sr S r S rS rS rS rSrSSjrSrSrSrSSjrSrSrSrg)abstractsmartsetc[5e)z!True if the smartset is not emptyNotImplementedErrorselfs r __nonzero__abstractsmartset.__nonzero__ !##rc[5e)zprovide fast membership testingr)rrevs r __contains__abstractsmartset.__contains__rrc[5e)z:iterate the set in the order it is supposed to be iteratedrrs r__iter__abstractsmartset.__iter__"rrNc[5e)z/True if the set will iterate in ascending orderrrs r isascendingabstractsmartset.isascending.rrc[5e)z0True if the set will iterate in descending orderrrs r isdescendingabstractsmartset.isdescending2rrc[5e)z3True if the set will iterate in topographical orderrrs ristopoabstractsmartset.istopo6rrc^URc [U5mO"UR5Hm O [S5eU4SjUlT$)z%return the minimum element in the setarg is an empty sequencec>T$Nvsr&abstractsmartset.min..C1r)fastascmin ValueErrorrr5s @rr:abstractsmartset.min:sC << D A\\^$!!<==rc^URc [U5$UR5Hm O [S5eU4SjUlT$)z%return the maximum element in the setr0c>T$r2r3r4srr6&abstractsmartset.max..Or8r)fastdescmaxr;r<s @rrBabstractsmartset.maxFsD == t9 ]]_%!!<==rc[5e)zareturn the first element in the set (user iteration perspective) Return None if the set is emptyrrs rfirstabstractsmartset.firstR "##rc[5e)z`return the last element in the set (user iteration perspective) Return None if the set is emptyrrs rlastabstractsmartset.lastXrGrc[5e)zcreturn the length of the smartsets This can be expensive on smartset that could be lazy otherwise.rrs r__len__abstractsmartset.__len__^rGrc[5e)z$reverse the expected iteration orderrrs rreverseabstractsmartset.reversedrrc[5e)z:get the set to iterate in an ascending or descending orderrrrOs rsortabstractsmartset.sorthrrcf[U[5(aU$URURUSS9$)zsReturns a new object with the intersection of the two collections. This is part of the mandatory API for smartset.Fcondreprcache) isinstance fullreposetfilterr!rothers r__and__abstractsmartset.__and__ls1 e[ ) )K{{5--U{KKrc[X5$)zlReturns a new object with the union of the two collections. This is part of the mandatory API for smartset.)addsetr\s r__add__abstractsmartset.__add__tsd""rcJ^URmURU4SjSU4SS9$)zsReturns a new object with the substraction of the two collections. This is part of the mandatory API for smartset.c>T"U5(+$r2r3)rcs rr6*abstractsmartset.__sub__..s !A$hrsFrV)r!r[)rr]rgs @r__sub__abstractsmartset.__sub__zs2   {{ +u)=U  rcvU(a'[US5(a[R"U5n[XU5$)aReturns this smartset filtered by condition as a new smartset. `condition` is a callable which takes a revision number and returns a boolean. Optional `condrepr` provides a printable representation of the given `condition`. This is part of the mandatory API for smartset.__code__)hasattrr cachefunc filteredset)r conditionrWrXs rr[abstractsmartset.filters. WY 33y1I4H55rchUS:dUS:a[R"S5eURX5$)zAReturn new smartset that contains selected elements from this setrsnegative index not allowed)rProgrammingError_slice)rstartstops rsliceabstractsmartset.slices0 19q(()FG G{{5''rc/n[U5n[U5Hn[US5nUbM O [X!- 5H%n[US5nUc OURU5 M' [ USXU4S9$)Nsslice=%d:%d %r)datarepr)iterrangenextappendbaseset)rrurvysitxys rrtabstractsmartset._slices{ $ZuARAyt|$ARAy IIaL % r%6T$JKKr)rBr:FNT)r __module__ __qualname____firstlineno__r__bool__r!r$r9rAr'r*r-r:rBrErIrLrOrSr^rbrir[rwrt__static_attributes__r3rrrrsv$H$$GH$$$  $ $ $ $$L#   6( LrrcL^\rSrSrSrSSjr\RS5r\RS5r \RS5r Sr Sr S r \RS 5rS r\rSS jrS rSrSrSrSrSrSrU4SjrSrSrSr\R<S5rSr U=r!$)raBasic data structure that represents a revset and contains the basic operation that it should be able to perform. Every method in this class should be implemented by any smartset class. This class could be constructed by an (unordered) set, or an (ordered) list-like object. If a set is provided, it'll be sorted lazily. >>> x = [4, 0, 7, 6] >>> y = [5, 6, 7, 3] Construct by a set: >>> xs = baseset(set(x)) >>> ys = baseset(set(y)) >>> [list(i) for i in [xs + ys, xs & ys, xs - ys]] [[0, 4, 6, 7, 3, 5], [6, 7], [0, 4]] >>> [type(i).__name__ for i in [xs + ys, xs & ys, xs - ys]] ['addset', 'baseset', 'baseset'] Construct by a list-like: >>> xs = baseset(x) >>> ys = baseset(i for i in y) >>> [list(i) for i in [xs + ys, xs & ys, xs - ys]] [[4, 0, 7, 6, 5, 3], [7, 6], [4, 0]] >>> [type(i).__name__ for i in [xs + ys, xs & ys, xs - ys]] ['addset', 'filteredset', 'filteredset'] Populate "_set" fields in the lists so set optimization may be used: >>> [1 in xs, 3 in ys] [False, True] Without sort(), results won't be changed: >>> [list(i) for i in [xs + ys, xs & ys, xs - ys]] [[4, 0, 7, 6, 5, 3], [7, 6], [4, 0]] >>> [type(i).__name__ for i in [xs + ys, xs & ys, xs - ys]] ['addset', 'filteredset', 'filteredset'] With sort(), set optimization could be used: >>> xs.sort(reverse=True) >>> [list(i) for i in [xs + ys, xs & ys, xs - ys]] [[7, 6, 4, 0, 5, 3], [7, 6], [4, 0]] >>> [type(i).__name__ for i in [xs + ys, xs & ys, xs - ys]] ['addset', 'baseset', 'baseset'] >>> ys.sort() >>> [list(i) for i in [xs + ys, xs & ys, xs - ys]] [[7, 6, 4, 0, 3, 5], [7, 6], [4, 0]] >>> [type(i).__name__ for i in [xs + ys, xs & ys, xs - ys]] ['addset', 'baseset', 'baseset'] istopo is preserved across set operations >>> xs = baseset(set(x), istopo=True) >>> rs = xs & ys >>> type(rs).__name__ 'baseset' >>> rs._istopo True cSUlX0l[U[5(aXlSUlO&[U[ 5(d [ U5nXlX lg)z datarepr: a tuple of (format, obj, ...), a function or an object that provides a printable representation of the given data. NT) _ascending_istoporYset_setlist_list _datarepr)rdatarzr-s r__init__baseset.__init__sI  dC I"DOdD))DzJ!rc,[UR5$r2)rrrs rr baseset._sets4::rcDURSSnUR5 U$r2)rrS)rasclists r_asclistbaseset._asclists**Q- rcPSUR;de[UR5$)Nr)__dict__rrrs rr baseset._lists$&&&DIIrcURc[UR5$UR(a[UR5$[ UR5$r2)rr{rrreversedrs rr$baseset.__iter__s@ ?? " # # __ & &DMM* *rc,[UR5$r2)r{rrs rr9baseset.fastasc sDMM""rc,[UR5$r2)rrrs rrAbaseset.fastdescs &&rc.URR$r2)rr!rs rr!baseset.__contains__syy%%%rc*[[U55$r2)boollenrs rrbaseset.__nonzero__sCIrc<[U5(+UlSUlgNF)rrrrRs rrS baseset.sorts"7m+ rcURcURR5 OUR(+UlSUlgr)rrrOrrs rrObaseset.reverse s1 ?? " JJ   "&//1DO rcvSUR;a[UR5$[UR5$)Nr)rrrrrs rrLbaseset.__len__'s* dmm #tzz? "tyy> !rcd[U5S::agURSL=(a UR$)zqReturns True if the collection is ascending order, False if not. This is part of the mandatory API for smartset.rTNrrrs rr'baseset.isascending-s* t9>d*>t>rcn[U5S::agURSL=(a UR(+$)zrReturns True if the collection is descending order, False if not. This is part of the mandatory API for smartset.rTNrrs rr*baseset.isdescending5s- t9>d*B4??/BBrc:[U5S::agUR$)zdIs the collection is in topographical order or not. This is part of the mandatory API for smartset.rT)rrrs rr-baseset.istopo=s t9>||rcU(aKURcURS$UR(aURS$URS$g)Nrrrrrs rrE baseset.firstEsE &zz!}$}}Q''}}R((rcU(aKURcURS$UR(aURS$URS$g)Nrrrrs rrI baseset.lastOsE &zz"~%}}R((}}Q''rcP>[U5[LaxSUR;ahSUR;aXURbK[[ UR U5"UR 5UR S9nURUlU$[ [5U5"U5nU$)Nr)rr-)r rrrgetattrrrsuper)rr]ops __class__s r _fastsetopbaseset._fastsetopYs K7 "%..($--'+TYY+EJJ7 A ??AL$U+Arc&URUS5$)Nr^rr\s rr^baseset.__and__iui00rc&URUS5$)Nrirr\s rribaseset.__sub__lrrcFURc [URXURS9$URnUR(d/[ [ U5U- S5[ [ U5U- S5p![X1UURS9nURUlU$)N)r-r)rrrrrrBr)rrurvrrs rrtbaseset._sliceos ?? "4::e1$,,G G}}c$i$.2CD E8I14M4 Dt$T\\ : rc SSSS.URn[R"UR5nU(d;URnURb UR n[ R"U5nS[U5X4-$)Nr-+NFTs <%s%s %s>) rr buildreprrrrrbytereprr)rdrls r__repr__baseset.__repr__{spt4 0 A   0 A*MM!!!$Ay555r)rrrrr)r3NFr)"rrrr__doc__rr propertycacherrrr$r9rAr!rrrSrOrLr'r*r-rErIrr^rirtr strmethodrr __classcell__rs@rrrs9v"$     +#' &&H" ?C 11  6 6rrc\rSrSrSrSS4SjrSrSrSr\ S 5r \ S 5r S r \ r S rSS jrSrSrSrSrSrSr\R.S5rSrg)roizDuck type for baseset class which iterates lazily over the revisions in the subset and contains a function which tests for membership in the revset cgrr3)rs rr6filteredset.s4rNc(XlX lX0lg)z condition: a function that decide whether a revision in the subset belongs to the revset or not. condrepr: a tuple of (format, obj, ...), a function or an object that provides a printable representation of the given condition. N)_subset _condition _condrepr)rsubsetrprWs rrfilteredset.__init__s #!rcNXR;=(a URU5$r2)rrrrs rr!filteredset.__contains__sLL 7T__Q%77rc8URUR5$r2) _iterfilterrrs rr$filteredset.__iter__s --rc#\# URnUHnU"U5(dMUv M g7fr2)r)rrcondrs rrfilteredset._iterfilters&AAwws, ,cH^^TRRmTcgUU4Sj$)Nc0>TRT"55$r2rrrsrr6%filteredset.fastasc..t''-r)rr9rrs`@rr9filteredset.fastascs \\ ! ! :--rcH^^TRRmTcgUU4Sj$)Nc0>TRT"55$r2rrsrr6&filteredset.fastdesc..rr)rrArs`@rrAfilteredset.fastdescs \\ " " :--rc SnUR5(a UROSUR5(a UROSURUR/nUH nUcMUn O UbU"5nOUnUHn g gNTF)r'r9r*rA)rfast candidates candidaterrfs rrfilteredset.__nonzero__s ,,..DLLD!..00DMMd LL MM  $I$ $  BBArc<[SU55n[U5$)Nc3$# UHov M g7fr2r3).0rfs r &filteredset.__len__..s$t!Ats)rr)rrs rrLfilteredset.__len__s $t$ $1v rc6URRUS9 g)NrO)rrSrRs rrSfilteredset.sorts '*rc8URR5 gr2)rrOrs rrOfilteredset.reverses rc6URR5$r2)rr'rs rr'filteredset.isascendings||''))rc6URR5$r2)rr*rs rr*filteredset.isdescendings||((**rc6URR5$r2)rr-rs rr-filteredset.istopos||""$$rcUHnUs $ gr2r3rs rrEfilteredset.firstAHrcSnUR5(a URnO!UR5(a URnUbU"5HnUs $ gSnUHnM U$r2)r'rAr*r9rrrs rrIfilteredset.lastsg      B    B >TAHrc[R"UR5/n[R"UR 5nU(aUR U5 S[U5SRU54-$)Ns<%s %s>s, ) rrrr rrr~rjoin)rxsrs rrfilteredset.__repr__sW - .   0 IIaLYt_ejjn===r)rrrr)rrrrrrr!r$rpropertyr9rArrrLrSrOr'r*r-rErIrrrrr3rrroros *8$ "8. .. .. ,H+*+%  >>rroc## [nU(a[nSnSnUc [U5nUc [U5nU"XE5nUv XF:XaSnXV:XaSnM8![a! UnUbUv UnOUbUv UShvN gf=f7f)zproduce an ordered iteration from two iterators with the same order The ascending is used to indicated the iteration direction. N)rBr:r} StopIteration) ascendingiter1iter2choiceval1val2nrs r _iterorderedr+s F D D|E{|E{t"AGyy     JB  J  s.B9A"A?6A97A?<B>A??Bc\rSrSrSrSSjrSrSr\r\ RS5r Sr S r \S 5r\S 5rS rSS jrSrSrSrSrSrSr\R4S5rSrg)rai&a'Represent the addition of two sets Wrapper structure for lazily adding two structures without losing much performance on the __contains__ method If the ascending attribute is set, that means the two structures are ordered in either an ascending or descending way. Therefore, we can add them maintaining the order by iterating over both at the same time >>> xs = baseset([0, 3, 2]) >>> ys = baseset([5, 2, 4]) >>> rs = addset(xs, ys) >>> bool(rs), 0 in rs, 1 in rs, 5 in rs, rs.first(), rs.last() (True, True, False, True, 0, 4) >>> rs = addset(xs, baseset([])) >>> bool(rs), 0 in rs, 1 in rs, rs.first(), rs.last() (True, True, False, 0, 2) >>> rs = addset(baseset([]), baseset([])) >>> bool(rs), 0 in rs, rs.first(), rs.last() (False, False, None, None) iterate unsorted: >>> rs = addset(xs, ys) >>> # (use generator because pypy could call len()) >>> list(x for x in rs) # without _genlist [0, 3, 2, 5, 4] >>> assert not rs._genlist >>> len(rs) 5 >>> [x for x in rs] # with _genlist [0, 3, 2, 5, 4] >>> assert rs._genlist iterate ascending: >>> rs = addset(xs, ys, ascending=True) >>> # (use generator because pypy could call len()) >>> list(x for x in rs), list(x for x in rs.fastasc()) # without _asclist ([0, 2, 3, 4, 5], [0, 2, 3, 4, 5]) >>> assert not rs._asclist >>> len(rs) 5 >>> [x for x in rs], [x for x in rs.fastasc()] ([0, 2, 3, 4, 5], [0, 2, 3, 4, 5]) >>> assert rs._asclist iterate descending: >>> rs = addset(xs, ys, ascending=False) >>> # (use generator because pypy could call len()) >>> list(x for x in rs), list(x for x in rs.fastdesc()) # without _asclist ([5, 4, 3, 2, 0], [5, 4, 3, 2, 0]) >>> assert not rs._asclist >>> len(rs) 5 >>> [x for x in rs], [x for x in rs.fastdesc()] ([5, 4, 3, 2, 0], [5, 4, 3, 2, 0]) >>> assert rs._asclist iterate ascending without fastasc: >>> rs = addset(xs, generatorset(ys), ascending=True) >>> assert rs.fastasc is None >>> [x for x in rs] [0, 2, 3, 4, 5] iterate descending without fastdesc: >>> rs = addset(generatorset(xs), ys, ascending=False) >>> assert rs.fastdesc is None >>> [x for x in rs] [5, 4, 3, 2, 0] NcRXlX lSUlX0lSUlSUlgr2)_r1_r2_iterr_genlistr)rrevs1revs2r$s rraddset.__init__ns& #  rc,[UR5$r2)rrrs rrLaddset.__len__vs4::rcd[UR5=(d [UR5$r2)rr.r/rs rraddset.__nonzero__ysDHH~/dhh/rcnUR(d[[U55UlUR$r2)r1rr{rs rr addset._list~s#}}#DJ/DM}}rc\^TRc3TR(a[TR5$U4SjnU"5$TR5 TR(aSnOSn[ TU5nUbU"5$[ TR U5nUc-[[ TR TR(+S95nOU"5n[ TRU5nUc-[[ TRTR(+S95nOU"5n[TRXE5$)amIterate over both collections without repeating elements If the ascending attribute is not set, iterate over the first one and then over the second one checking for membership on the first one so we dont yield any duplicates. If the ascending attribute is set, iterate over both collections at the same time, yielding only one value at a time in the given order. c3># TRHnUv M TRRnTRHnU"U5(aMUv M g7fr2)r.r!r/)rfinr1rs rarbitraryordergen*addset.__iter__..arbitraryordergensDAG"xx,,A77"s AA Ar9rAr ) rr1r{_trysetasclistrr.sortedr/r+)rr>attrrr%r&s` rr$addset.__iter__s ?? "}}DMM** %& &  ??DD T4  >4K$' =doo2EFGEGE$' =doo2EFGEGEDOOU::rcpURb)URc[UR5Ulggg)z9populate the _asclist attribute if possible and necessaryN)r1rrArs rr@addset._trysetasclists- == $)>"4==1DM*? $rc^^UR5 URbURR$URRmUR RmSTT4;agUU4Sj$)Nc2>[ST"5T"55$rr+r%r&srr6 addset.fastasc..s|D%'57;r)r@rr$r.r9r/rr%r&s @@rr9addset.fastascs\  == $==)) )     E5> !;;rc^^UR5 URbURR$URRmUR RmSTT4;agUU4Sj$)Nc2>[ST"5T"55$rrHrIsrr6!addset.fastdesc..s|E57EG !<t>rcNURSL=(a UR(+$r2rUrs rr*addset.isdescendingsd*B4??/BBrcgrr3rs rr- addset.istoporcURcURR5 gUR(+Ulgr2)rrrOrs rrOaddset.reverses* ?? " JJ   "&//1DOrcUHnUs $ gr2r3rs rrE addset.firstrrcfUR5 UR5nUR5 U$r2)rOrE)rvals rrI addset.lasts$ jjl  rcrSSSS.URnS[U5XRUR4-$)Nrrrrs <%s%s %r, %r>)rrr.r/rrs rraddset.__repr__s5t4 0 A9T?Axx"JJJr)rrr1r0r.r/r2r)rrrrrrrLrrrrrr$r@r!r9rAr!rSr'r*r-rOrErIrrrrr3rrrara&sEN0H  /;b2 <<==.&?C 2   KKrrac^\rSrSrSrSU4SjjrSSjrSr\rSr Sr Sr S r S r SS jrS rS rSrSrSrSr\R,S5rSrU=r$) generatorsetiaWrap a generator for lazy iteration Wrapper structure for generators that provides lazy membership and can be iterated more than once. When asked for membership it generates values until either it finds the requested one or has gone through all the elements in the generator >>> xs = generatorset([0, 1, 4], iterasc=True) >>> assert xs.last() == xs.last() >>> xs.last() # cached 4 cV>UcUnOU(a[nO[n[TU] U5$r2)_generatorsetasc_generatorsetdescr__new__)clsgeniterasctyprs rrmgeneratorset.__new__ s) ?C "C#Cws##rcVXlSUl0Ul/UlSUlSUlg)z= gen: a generator producing the values for the generatorset. NFT)_genr_cacher1 _finishedr)rrorps rrgeneratorset.__init__s,    rcVUR(agUR5Hn g gr)r1 _consumegenrrfs rrgeneratorset.__nonzero__!s' ==!!#A$rcXR;aURU$UR5H nX!:XdM g SURU'grruryrrrs rr!generatorset.__contains__-sI ;;q> !!!#Av$ ArcUR(a URnO URnUbU"5$UR5HnM [ U5$r2)rr9rAryr{rs rr$generatorset.__iter__9sI ??BB >4K!!#A $Dzrc^^^^UR(a[UR5$URmUR5m[[ smmUUUU4SjnU"5$)Nc3~># SnUT"T5:aTUv O T"T5v US- nM&![a gf=f7fNrr)r#)i_len_nextgenlistnextgens rro#generatorset._iterator..genTsVAtG}$!!*$#Gn,Q )s= -= :=:=)rvr{r1ryrr})rrorrrrs @@@@r _iteratorgeneratorset._iteratorFsP >> & &--""$4 e  u rc#V# URnURRnURHnSX'U"U5 Uv M UR(dOSUlURSSnUR 5 X@lURUlURUl gg7fr) rur1r~rtrvrSrr$r9rPrA)rrXritemascs rrygeneratorset._consumegenbs --&&IIDEK DMJ~~!DN--"C HHJM<)rrrfs rrgeneratorset.__repr__s) %doo 6IdOQ///r)rrrurvrtr1r9rAr2r)rrrrrrmrrrr!r$rryrLrSrOr'r*r-rErIrrrrrrs@rririst $ H  8 -" &.#    00rric6\rSrSrSr\R rSrSr g)rkiz@Special case of generatorset optimized for ascending generators.cXR;aURU$UR5HnX!:Xa gX!:dM O SURU'grr}r~s rr!_generatorsetasc.__contains__Q ;;q> !!!#Avu $  Arr3N) rrrrrrirr9r!rr3rrrkrksJ$$G rrkc6\rSrSrSr\R rSrSr g)rlizASpecial case of generatorset optimized for descending generators.cXR;aURU$UR5HnX!:Xa gX!:dM O SURU'grr}r~s rr!_generatorsetdesc.__contains__rrr3N) rrrrrrirrAr!rr3rrrlrlsK%%H rrlNcUc [U5nX:*nU(d US-US-p![XX0RR5$)zCreate a spanset that represents a range of repository revisions start: first revision included the set (default to 0) end: first revision excluded (last+1) (default to len(repo)) Spanset will be descending if `end` < `start`. r)r_spanset changelog filteredrevs)reporuendr$s rspansetrsB {$i I 1Weais E >>+F+F GGrc^\rSrSrSrSrSSjrSrSrSr Sr S r S r S r S r\rS rSrSrSrSrU4Sjr\R.S5rSrU=r$)riaCDuck type for baseset class which represents a range of revisions and can work lazily and without having all the range in memory Note that spanset(x, y) behave almost like range(x, y) except for two notable points: - when x < y it will be automatically descending, - revision filtered with this repoview will be skipped. c4XlX lX0lX@lgr2)_start_endr _hiddenrevs)rrurr$ hiddenrevss rr_spanset.__init__s  #%rcU(+Ulgr2rUrRs rrS _spanset.sortrrc0UR(+Ulgr2rUrs rrO_spanset.reverserrcgrr3rs rr-_spanset.istopor]rc#L# URnUHnX2;dM Uv M g7fr2)r)r iterrangerrfs rr_spanset._iterfilters$   Azs$ $cdUR(aUR5$UR5$r2rr9rArs rr$_spanset.__iter__s! ??<<> !==? "rc[URUR5nUR(aUR U5$[ U5$r2)r|rrrrr{rrs rr9_spanset.fastascs:$++tyy1   ##I. .Irc[URS- URS- S5nUR(aUR U5$[ U5$)Nrr)r|rrrrr{rs rrA_spanset.fastdesc sD$))a-q"=   ##I. .IrcURnURUs=:*=(a UR:Os =(a U=(a X;(+$r2)rrr)rr hiddens rr!_spanset.__contains__s>!! s..TYY.  $s}5  rcUHn g grr3rzs rr_spanset.__nonzero__sArcVUR(d"[URUR- 5$SnURnURnURH(nX4s=:aU::dO X$s=::aU:dMO M#US- nM* [URUR- 5U- $r)rabsrr)rcountrurr s rrL_spanset.__len__ styy4;;./ /EKKE))C''&&E,>3,>,>QJE(tyy4;;./%7 7rcUR$r2rUrs rr'_spanset.isascending,rrc$UR(+$r2rUrs rr*_spanset.isdescending/rrcxUR(a URnO URnU"5HnUs $ gr2rrs rrE_spanset.first2s/ ??BBAHrcxUR(a URnO URnU"5HnUs $ gr2)rrAr9rs rrI _spanset.last;s/ ??BBAHrc>UR(a[TU] X5$UR(aG[ UR U-UR 5n[ UR U-UR 5nOF[UR U- UR 5n[UR U- UR 5n[X4URUR5$r2) rrrtrr:rrrBr)rrurvrrrs rrt_spanset._sliceDs   7>%. . ??DKK%'3ADKK$& 2ADII$dkk2ADII%t{{3Adoot/?/?@@rcpSSS.URnS[U5XRUR4-$)Nrrrs <%s%s %d:%d>)rrrrrfs rr_spanset.__repr__Ps3 %doo 6)D/1kk499!MMMr)rrrrr)rrrrrrrSrOr-rr$r9rAr!rrrLr'r*rErIrtrrrrrrs@rrrs|& &.  #     H 8# ANNrrc2^\rSrSrSrU4SjrSrSrU=r$)rZiVza set containing all revisions in the repo This class exists to host special optimization and magic to handle virtual revisions such as "null". cd>[TU]S[U5SURR5 g)NrT)rrrrr)rrrs rrfullreposet.__init__]s$ CItT^^-H-HIrc[US5(d [U5nUR(aXR- nURUR 5S9 U$)zAs self contains the whole repo, all of the other set should also be in self. Therefore `self & other = other`. This boldly assumes the other contains valid revs only. r'r )rmrrrSr*r\s rr^fullreposet.__and__`sOum,, ENE   ,,,E 4,,. / rr3) rrrrrrr^rrrs@rrZrZVs JrrZ)rN) __future__rrrrrutilsr rrrror+rarirkrlrrrZr3rrrs# <MLML``6`6Fu>"u>p!HUK UKpe0#e0P|( ( H uNuNp(r