3
™©Þ[Õ  ã               @   s0   d Z ddlZdd„ Zdd„ Zdd„ Z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)).
é    Nc             C   sŒ   t | ƒ}g }d}xrtt|ƒƒD ]b}|d t|ƒk rL|| ||d  d krLq||d |d … }|jt|d |d d ƒƒ |}qW 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   éÿÿÿÿr   )ÚsortedÚrangeÚlenÚappendÚ_encode_rangeÚtuple)Úlist_Úsorted_listÚrangesÚ
last_writeÚiÚcurrent_range© r   ú;/tmp/pip-install-65viz3iy/pip/pip/_vendor/idna/intranges.pyÚintranges_from_list
   s    r   c             C   s   | d> |B S )Né    r   )ÚstartÚendr   r   r   r      s    r   c             C   s   | d? | d@ fS )Nr   r   l        l   ÿÿ r   )Úrr   r   r   Ú_decode_range"   s    r   c             C   sz   t | dƒ}tj||ƒ}|dkrNt||d  ƒ\}}||   koD|k n  rNd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   )Úint_r   Útuple_ÚposÚleftÚrightÚ_r   r   r   Úintranges_contain&   s    
r    )Ú__doc__r   r   r   r   r    r   r   r   r   Ú<module>   s
   