o

;j;�@s|dZd
dl
Z
deedeedffdd�Zded	edefd
d�Zdedeeeffd
d�Zdedeedfdefdd�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_�return.c
Cs�t|�
}
g}d
}t
t|
�
�
D]1}|dt|
�
kr%|
||
|ddkr%q|
|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)rZsorted_list�rangesZ
last_write�
iZ
current_range�r�B/opt/saltstack/salt/lib/python3.10/site-packages/idna/intranges.py�intranges_from_lists


(




r�start�endcCs|d
>|
BS)N� r)rrrrrr
 s
r
�
rc

Cs|d
?|d@fS)Nrl��r)
rrrr�
_decode_range$s
r�int_rcCsvt|d
�}t
�|
|�}|d
kr%t|
|d�
\}}||k
r$|kr%dS
|t|
�
kr9t|
|�
\}}||kr9dSdS)z=Determine if `int_` falls into one of the ranges in `ranges`.r
rTF)r
�bisect�bisect_leftrr)rrZtuple_�pos�left�right�
_rrr�intranges_contain(s




�



r)
�__doc__r�list�intrrr
r�boolrrrrr�<module>
s"