Name	Size	Mode	Actions
codec.cpython-38.pyc	2876	0644	editdlrm
compat.cpython-38.pyc	594	0644	editdlrm
core.cpython-38.pyc	8825	0644	editdlrm
idnadata.cpython-38.pyc	17142	0644	editdlrm
intranges.cpython-38.pyc	1774	0644	editdlrm
uts46data.cpython-38.pyc	162489	0644	editdlrm
__init__.cpython-38.pyc	174	0644	editdlrm

U ‡'¾XÕã@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
}t
t|
ƒ
ƒ
D]b}|dt|
ƒ
krJ|
||
|ddkrJq|
|d|d…}| t|d|d
dƒ¡

|}qt|ƒ
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)Zlist_Zsorted_listÚrangesZ last_writeÚ
iZ current_range©rú?/opt/alt/python38/lib/python3.8/site-packages/idna/intranges.pyÚintranges_from_list s








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

Cs|d
?|d@fS)Nrlÿÿr)
Ú
rrrr Ú _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)Zint_r Ztuple_ÚposÚleftÚrightÚ
_rrr Úintranges_contain&s







r)Ú__doc__rrrrrrrrr Ú
s