B

L��gY�@s�dZd
dl
Z
d
dlmZmZ
eeeedfd�dd�Zeeed�d	d
�Zeeeefd�dd
�Zeeedfe	d�dd�Z
dS)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)).
�N)�List�Tuple.)�list_�returnc
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)r�sorted_list�ranges�
last_write�
i�
current_range�r�>/tmp/pip-unpacked-wheel-hv55ucu3/pip/_vendor/idna/intranges.py�intranges_from_lists








r)�start�endrcCs|d
>|
BS)N� r)rrrrrr s
r)�
rrc

Cs|d
?|d@fS)Nrl��r)
rrrr�
_decode_range#s
r)�int_rrcCszt|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
)rr�tuple_�pos�left�right�
_rrr�intranges_contain's








r#)�__doc__r�typingrr�intrrr�boolr#rrrr�<module>s