CasperSecurity
o
��YaY � @ s� d Z ddlZddlmZmZ dee deedf fdd�Zd ed
edefd d �Zd
edeeef fdd�Zdedeedf de fdd�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_�return.c C s� t | �}g }d}tt|��D ]1}|d t|�k r%|| ||d d kr%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)r � sorted_list�ranges�
last_write�i�
current_range� r �0/usr/lib/python3/dist-packages/idna/intranges.py�intranges_from_list s r �start�endc C s | d> |B S )N� r )r r r r r r s r �rc C s | d? | d@ fS )Nr l �� r )r r r r �
_decode_range# s r �int_r c C sv t | d�}t�||�}|dkr%t||d �\}}|| kr$|k r%dS |t|�k r9t|| �\}}|| kr9dS dS )z=Determine if `int_` falls into one of the ranges in `ranges`.r r TF)r �bisect� bisect_leftr r
)r r �tuple_�pos�left�right�_r r r �intranges_contain' s
� r# ) �__doc__r �typingr r �intr r r �boolr# r r r r �<module> s "