U
    …cUhj  ã                   @   s€   d Z ddlZddlmZmZ ee eedf dœdd„Zeeedœd	d
„Zeeeef dœdd„Zeeedf e	dœ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_Úreturnc                 C   sˆ   t | ƒ}g }d}tt|ƒƒD ]b}|d t|ƒk rJ|| ||d  d krJq||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   Zsorted_listÚrangesZ
last_writeÚiZcurrent_range© r   úZ/opt/bot/vods_filmes/script/venv/lib/python3.8/site-packages/pip/_vendor/idna/intranges.pyÚintranges_from_list   s    r   )ÚstartÚendr   c                 C   s   | d> |B S )Né    r   )r   r   r   r   r   r   "   s    r   )Úrr   c                 C   s   | d? | d@ fS )Nr   l   ÿÿ r   )r   r   r   r   Ú_decode_range&   s    r   )Úint_r   r   c                 C   sz   t | dƒ}t ||¡}|dkrNt||d  ƒ\}}||   krF|k rNn ndS |t|ƒk rvt|| ƒ\}}|| krvd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   Z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   