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)).
<EFBFBD>N<>list_<74>return.cCs<>t|<00>}g}d}tt|<01><01>D]1}|dt|<01>kr%||||ddkr%q||d|d<00>}|<02>t|d|dd<00><02>|}qt|<02>S)aRepresent 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.
<00>rcCs|d?|d@fS)Nrl<00><EFBFBD>r)rrrr<00>
_decode_range$sr<00>int_r
cCsvt|d<01>}t<01>||<02>}|dkr%t||d<00>\}}||kr$|kr%dS|t|<01>kr9t||<00>\}}||kr9dSdS)z=Determine if `int_` falls into one of the ranges in `ranges`.rrTF)r
