3 ‡'¾XÕã@s0dZddlZdd„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)). éNcCsŒt|ƒ}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. éréÿÿÿÿr)ÚsortedÚrangeÚlenÚappendÚ _encode_rangeÚtuple)Zlist_Z sorted_listÚrangesZ last_writeÚiZ current_range©r ú/usr/lib/python3.6/intranges.pyÚintranges_from_list srcCs |d>|BS)Né r )ÚstartÚendr r r rsrcCs|d?|d@fS)Nrrllÿÿr )Ú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)rÚbisectZ bisect_leftrr)Zint_r Ztuple_ÚposÚleftÚrightÚ_r r r Úintranges_contain&s   r)Ú__doc__rrrrrr r r r Ús