­ ­ ­ ­ ­ ­ ­ ­ ­ ­ ­ ­ ­ ­ ­ ­ ­ ­ 3 'X@s0dZddlZddZddZddZd 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)). NcCst|}g}d}xrtt|D]b}|dt|krL||||ddkrLq||d|d}|jt|d|dd|}qWt|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. rr)sortedrangelenappend _encode_rangetuple)Zlist_Z sorted_listrangesZ last_writeiZ current_ranger /usr/lib/python3.6/intranges.pyintranges_from_list srcCs |d>|BS)N r )startendr r r rsrcCs|d?|d@fS)Nrrllr )rr r r _decode_range"srcCszt|d}tj||}|dkrNt||d\}}||koD|knrNdS|t|krvt||\}}||krvdSdS)z=Determine if `int_` falls into one of the ranges in `ranges`.rrTF)rbisectZ bisect_leftrr)Zint_r Ztuple_posleftright_r r r intranges_contain&s   r)__doc__rrrrrr r r r s