�
b�Nc@s�
dZd
Z
dZdZdZdef
d��YZee�
Zee	�
Z
def
d��YZed	kr�
ed
dfd�Z
ed
df�
Zed
dfdd
dfdddd�Ze
GHe
d@GHe
dBGHe
d
dfAGHe
dGHde
kGHe
je
�
GHeje
�
GHe
je
�
GHeje
�
GHxe
D]ZeGHq8
We
j�GHe
ekGHe
ekGHe
ekGHee
�
GHee�
GHee
�
GHe
j�GHndS(stImmutable integer set type.

Integer set class.

Copyright (C) 2006, Heiko Wundram.
Released under the MIT license.
s Heiko Wundram <me@modelnine.org>s0.2t
6s
2006-01-20t	_Infinityc
Bs_eZ
dZd
g
Zd�Zd�Zd�Zd�Zd�Zd�Z	d�Z
d	�ZRS(
s0Internal type used to represent infinity values.t_negcCs
|
|_dS(
N(
R(tselftneg((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt__init__s
cCs<t|
t
ttf�stS|jo;t|
t�o:|
jS(
N(t
isinstancetinttlongR
tNotImplementedR(Rtvalue((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt__lt__s


	
cCs#t|
t
ttf�stS|jS(
N(RRRR
R	R(RR
((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt__le__$s


cCs=t|
t
ttf�stS|jp;t|
t�o;|
jS(
N(RRRR
R	R(RR
((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt__gt__)s


	
cCs$t|
t
ttf�stS|jS(
N(RRRR
R	R(RR
((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt__ge__/s


cCs;t|
t
ttf�stSt|
t�o:|j|
jkS(
N(RRRR
R	R(RR
((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt__eq__4s


cCs<t|
t
ttf�stSt|
t�p;|j|
jkS(
N(RRRR
R	R(RR
((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt__ne__9s


c


Csd
S(NtNone((
R((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt__repr__>s
(t__name__t
__module__t__doc__t	__slots__RRRR
RRRR(((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyR
s
								tIntSetcBs�eZ
dZd
dddgZd�Zeed�Zd�Zd�Z	dJd	�
Zed
ddd
��Zedddd��Z
edddd��Zedddd��Zedddd��Zedddd��Zedddd��Zedddd��Zedddd��Zed dd!d"��Zed#dd!d$��Zed%dd!d&��Zed'd(d)d*��Zed+d(d,d-��Zed.d(d/d0�d1��Zed2d(d)d3��Zed4d(d5d6�d7��Zed8d(d9d:�d;��Zed<d(d=d>��Zed?d(d@dA�dB��Z[dC�Z e Z!dD�Z"dE�Z#dF�Z$dG�Z%dH�Z&dI�Z'RS(KsvInteger set class with efficient storage in a RLE format of ranges.
    Supports minus and plus infinity in the range.t_rangest_mint_maxt_hashc
Os�t|
�
d
kr~t
|
dt�r~|r:td�
�
n|
dj|_|
dj|_|
dj|_|
dj|_dSg|_|jdt	�|_|jdt
�|_|jdkr�t	|_n|jdkr�t
|_n|r�td�
�
nt
|jtt
f�p 
|jt	ks2
td�
�
nt
|jtt
f�pV
|jt
ksh
td	�
�
n|jt	k	r�
|jt
k	r�
|j|jkr�
td
�
�
nt
|jtt
f�r�
|jd
7_nx�
|
D]�
}t
|tt
f�r||d
}}n'
t
|t�r"t|�
dkr7td�
�
n|\}}|dkr[|j}n|dkrs|j}nt
|tt
f�p�|t	ks�td
�
�
nt
|tt
f�p�|t
ks�td�
�
n|t	k	r�|t
k	r�||kr�q�
nt
|tt
f�r.|d
7}q.ntd�
�
||jkrCq�
n||jkr^|j}n||jkrsq�
n||jkr�|j}n|jj||f�

q�
W|j�
dS(s�Initialize an integer set. The constructor accepts an unlimited
        number of arguments that may either be tuples in the form of
        (start,stop) where either start or stop may be a number or None to
        represent maximum/minimum in that direction. The range specified by
        (start,stop) is always inclusive (differing from the builtin range
        operator).

        Keyword arguments that can be passed to an integer set are min and
        max, which specify the minimum and maximum number in the set,
        respectively. You can also pass None here to represent minus or plus
        infinity, which is also the default.
        i
is*No keyword arguments for copy constructor.NtmintmaxsInvalid keyword argument.sInvalid type of min argument.sInvalid type of max argument.s$Minimum is not smaller than maximum.is$Invalid tuple, must be (start,stop).sInvalid type of tuple start.sInvalid type of tuple stop.sInvalid argument.(tlenRRt
ValueErrorRRRRtpopt_MININFt_MAXINFRRRt	TypeErrorttupletappendt
_normalize(Rtargstkwargstargtstarttstop((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRRsr%






	






'

'















!

!













ccs�
|}itd
6td6}dt
|
�
dt
|�
}}d\}	}
x
|	|ksb|
|kr^
|	|kr�|
|kr�|
|	d?|	d@||
d?|
d@ks�|
|kr�|
|	d?|	d@d
|	d@}}}
|	d7}	n3||
d?|
d@d|
d@}}}
|
d7}
||krQ
||kr7
Pn|||ffV
|}n|
||<qJW||kr
|||ffV
ndS(Ntr1tr2iii
(ii(tFalseR(RR,R-tminvaltmaxvaltcurvalt	curstatestimaxtjmaxt
it
jtcur_rtnewnametnewstate((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt_iterranges�s(


!



,

)

)






	


c
Cs�|jj
�
d
}
x�|
t|j�
kr�|j|
d|j|
d
d
kr�|j|
d
dt|j|
d
d
|j|
d
�f|j|
d
<|j|
=q|
d
7}
qWt|j�
|_t|j�
|_dS(Ni
i(RtsortRRR$thashR(RR5((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyR&�s




&


"



cCs�t|
t
�r||
fSt|
tttf�r`y||j|
�
fSWq�tk
r\


tSXn>t|
t�r�y||j|
�fSWq�tk
r�


tSXntS(
N(	RRRRR$t	__class__R#R	tlist(Rtother((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt
__coerce__�s













csy|
d
kr�f
d�}n-|
dkr?��
fd�}ntd�
�
y
||_
Wntk
rk


n
X||_|S(sKMakes a function to match two ranges. Accepts two types: either
        'set', which defines a function which returns a set with all ranges
        matching pall (pany is ignored), or 'bool', which returns True if pall
        matches for all ranges and pany matches for any one range. doc is the
        dostring to give this function. pany may be none to ignore the any
        match.

        The predicates get a dict with two keys, 'r1', 'r2', which denote
        whether the current range is present in range1 (self) and/or range2
        (other) or none of the two, respectively.tsetcs@
|j|
�
}|t
krt
S|d
}
|jj|j�
}t|j|
j�|_t|j|
j�|_g|_x�|j	|j|
j|j|j�D]x\}\}}�|�
r�|jr�|jdd
|kr�|jdd|f|jd<q
|jj
||f�

q�q�Wt|j�
|_t|j�
|_
|S(Ni
i����i(R@R	R=t__new__RRRRRR:R%R$R<R(RR?tcoercedtnewsettstatesR*R+(
tpall(sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt
f�s$








	


"

 
!


tboolc	s�|j|
�
}|t
krt
S|d
}
t|j|
j�}t|j|
j�}�
}xT|j|j|
j||�D]4\}\}}�|�
s�tS|p��
|�
}qyW|S(Ni
(	R@R	RRRRR:RR.(	RR?RCRRtfoundRER*R+(RFtpany(sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRG

s









.



s#Invalid type of function to create.(Rt	func_nameR#tfunc_doc(tnamettypetdocRFRJRG((RFRJsB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt_make_function�s








	
t__and__RAs&Intersection of two sets as a new set.c

Cs|d
o|dS(NR,R-((
t
s((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt<lambda>'
st__rand__c

Cs|d
o|dS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRS*
stintersectionc

Cs|d
o|dS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRS-
st__or__sUnion of two sets as a new set.c

Cs|d
p|dS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRS2
st__ror__c

Cs|d
p|dS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRS5
stunionc

Cs|d
p|dS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRS8
st__sub__s$Difference of two sets as a new set.c

Cs|d
o|dS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRS=
st__rsub__c

Cs|d
o|dS(NR-R,((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRS@
st
differencec

Cs|d
o|dS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSC
st__xor__s.Symmetric difference of two sets as a new set.c

Cs|d
|dAS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSH
st__rxor__c

Cs|d
|dAS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSK
stsymmetric_differencec

Cs|d
|dAS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSN
st__contains__RHs*Returns true if self is superset of other.c

Cs|d
p|dS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSS
stissubsets(Returns true if self is subset of other.c

Cs|d
p|dS(NR-R,((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSV
stistruesubsets-Returns true if self is true subset of other.c

Cs|d
p|dS(NR-R,((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSY
sc

Cs|d
o|dS(NR-R,((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSZ
st
issupersetc

Cs|d
p|dS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRS]
stistruesupersets/Returns true if self is true superset of other.c

Cs|d
p|dS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRS`
sc

Cs|d
o|dS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSa
stoverlapss)Returns true if self overlaps with other.c


CstS(
N(
tTrue(
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSd
sc

Cs|d
o|dS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSe
sRs'Returns true if self is equal to other.c

Cs|d
|dAS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSj
sRs+Returns true if self is different to other.c


CstS(
N(
Re(
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSm
sc

Cs|d
|dAS(NR,R-((
RR((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRSn
sc
Cs�|jj
|j�
}
|j|
_|j|
_g|
_|j}xH|jD]=}||d
krI|
jj||d
f�

|d}qIqIW||jkr�|
jj||jf�

n|
S(sInverse of set as a new set.ii
(R=RBRRRR%(RRDtlaststopt
r((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pytinverset
s


	
	






c


Cs|jS(
s�Returns a hash value representing this integer set. As the set is
        always stored normalized, the hash value is guaranteed to match for
        matching ranges.(
R(
R((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt__hash__�
sc
Cs�|js
d
S|jd
d
t
ks;|jddtkrJtd�
�
nd
}
x'|jD]}|
|d|d
7}
qZW|
dkr�td�
�
n|
S(	s�Get length of this integer set. In case the length is larger than
        2**31 (including infinitely sized integer sets), it raises an
        OverflowError. This is due to len() restricting the size to
        0 <= len < 2**31.ii����i
sInfinitely sized integer set.iisInteger set bigger than 2**31.I�(RR!R"t
OverflowError(RtrlenRg((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt__len__�
s	

.






c
Css|js
d
S|jd
d
t
ks;|jddtkr?dSd
}
x'|jD]}|
|d|d
7}
qOW|
S(s<
Returns the length of this integer set as an integer. In case the
        length is infinite, returns -1. This function exists because of a
        limitation of the builtin len() function which expects values in
        the range 0 <= len < 2**31. Use this function in case your integer
        set might be larger.ii����i
(RR!R"(RRkRg((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyR�
s	

.




c

Cs
t|j
�
S(
s<Returns true if this integer set contains at least one item.(RHR(
R((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt__nonzero__�
sc
cs
g}
x�|jD]�}|d
t
krv|dtkrX|
jd
dgddgf�

q�|
j|dddg�

q|dtkr�|
j|d
dg�

qx$t|d
|d�D]}|V
q�WqW|
r
x;tr
x+|
D]#}|d
V
|d
c|d7<q�Wq�WndS(s�Iterate over all values in this integer set. Iteration always starts
        by iterating from lowest to highest over the ranges that are bounded.
        After processing these, all ranges that are unbounded (maximum 2) are
        yielded intermixed.ii
i����N(RR!R"textendR%txrangeRe(RtubrangesRgtvaltubrange((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt__iter__�
s



"





	


	
c
Cs!
g}
x�|jD]�\}}t
|ttf�rjt
|ttf�rj||d
krj|
jd|�

qt
|ttf�r�|
jd||d
f�

q|
jd||f�

qW|jtk	r�|
jd|j�

n|jtk	r
|
jd|j�

nd|j	j
dj|
�
fS(srReturn a representation of this integer set. The representation is
        executable to get an equal integer set.i
s%rs(%r,%r)smin=%rsmax=%rs%s(%s)s
,(RRRRR%RR!RR"R=Rtjoin(RtrvR*R+((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyR�
s

*








N((RRRRRR!R"R:R&R@RRPRQRTRURVRWRXRYRZR[R\R]R^R_R`RaRbRcRdRRRht
__invert__RiRlRRmRsR(((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyRLs�	\		:	


	


	

	


	


	

	


	


	

	


	


	

	


	


	



	


	



	


	


	


		
				t__main__i
iiiiRiRi(iniiN(Rt
__author__t__version__t__revision__t__date__tobjectR
ReR!R.R"RRt
xt
yt
zR`RaRqRhR<R(((sB/opt/alt/python27/lib/python2.7/site-packages/paste/util/intset.pyt<module>sB


/
��

*