$19 GRAYBYTE WORDPRESS FILE MANAGER $55

3

�'�X��@s0dZd
dl
Z
dd�Zdd�Zdd�Zd	d
�ZdS)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
Cs�t|�
}
g}d}xrt
t|
�
�
D]b}|d
t|
�
krL|
||
|d
d
krLq|
|d
|d
�}|jt|d|dd
��

|}qWt|�
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)Zlist_Zsorted_list�rangesZ
last_write�
iZ
current_range�r�/usr/lib/python3.6/intranges.py�intranges_from_list
s








rcCs|d
>|
BS)N� r)�start�endrrr
rs
rc

Cs|d
?|d@fS)Nrrll��r)
�
rrrr
�
_decode_range"s
rcCszt|d
�}t
j|
|�}|d
krNt|
|d�
\}}||k
oD|kn
rNdS|t|
�
krvt|
|�
\}}||krvdSdS)z=Determine if `int_` falls into one of the ranges in `ranges`.r
rTF)r�bisectZbisect_leftrr)Zint_r
Ztuple_�pos�left�right�
_rrr
�intranges_contain&s








r)�__doc__rrrrrrrrr
�<module>s