o
    'èhj  ã                   @   sŒ   d Z ddlZddlmZmZ dee deedf fdd„Zd	ed
edefdd„Zdedeeef fdd„Zdedeedf de	fdd„Z
dS )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}tt|ƒƒD ]1}|d t|ƒk r%|| ||d  d kr%q||d |d … }| t|d |d d ƒ¡ |}qt|ƒ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   úJ/var/www/html/olx_land/venv/lib/python3.10/site-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@ fS )Nr   l   ÿÿ r   )r   r   r   r   Ú_decode_range&   s   r   Úint_r   c                 C   sv   t | dƒ}t ||¡}|dkr%t||d  ƒ\}}||   kr$|k r%dS  |t|ƒk r9t|| ƒ\}}|| kr9dS dS )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    "