B

s;hyRœãšã@s0dZd
dl
Z
dd„Zdd„Zdd„Zd	d
„ZdS)a	

Given a list of integers, made up of (hopefully) a small number of long runs
of consecutive integers, compute a representation of the form
((start1, end1), (start2, end2) ...). Then answer the question "was x present
in the original list?" in time O(log(# runs)).
éNc
CsŒt|ƒ
}
g}d
}xrt
t|
ƒ
ƒ
D]b}|dt|
ƒ
krL|
||
|ddkrLq|
|d|d…}| t|d|d
dƒ¡

|}qWt|ƒ
S)a
Represent a list of integers as a sequence of ranges:
    ((start_0, end_0), (start_1, end_1), ...), such that the original
    integers are exactly those x such that start_i <= x < end_i for some i.

    Ranges are encoded as single integers (start << 32 | end), not as tuples.
    éÿÿÿÿé
r
)ÚsortedÚrangeÚlenÚappendÚ
_encode_rangeÚtuple)Úlist_Úsorted_listÚrangesÚ
last_writeÚ
iÚ
current_range©rú0/tmp/pip-install-fdhvs41_/idna/idna/intranges.pyÚintranges_from_list
s








rcCs|d
>|
BS)Né r)ÚstartÚendrrrrs
rc

Cs|d
?|d@fS)Nrlÿÿr)
Ú
rrrrÚ
_decode_range"s
rcCszt|d
ƒ}t
 |
|¡}|d
krNt|
|dƒ
\}}||k
rF|krNn
ndS|t|
ƒ
krvt|
|ƒ
\}}||krvdSdS)z=Determine if `int_` falls into one of the ranges in `ranges`.r
rTF)rÚbisectÚbisect_leftrr)Úint_rÚtuple_ÚposÚleftÚrightÚ
_rrrÚintranges_contain&s








r )Ú__doc__rrrrr rrrrÚ<module>s