U ö üeYã@s€dZddlZddlmZmZeeeedfdœdd„Zeeedœd d „Zeeeefd œd d „Zeeedfe dœdd„Z dS)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)). éN)ÚListÚTuple.)Úlist_ÚreturncCsˆt|ƒ}g}d}tt|ƒƒD]b}|dt|ƒkrJ||||ddkrJq||d|d…}| t|d|ddƒ¡|}qt|ƒ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)ÚsortedÚrangeÚlenÚappendÚ _encode_rangeÚtuple)rÚ sorted_listÚrangesÚ last_writeÚiÚ current_range©rú|BS)Né r)rrrrrr sr )ÚrrcCs|d?|d@fS)Nrlÿÿr)rrrrÚ _decode_range#sr)Úint_rrcCszt|dƒ}t ||¡}|dkrNt||dƒ\}}||krF|krNnndS|t|ƒkrvt||ƒ\}}||krvdSdS)z=Determine if `int_` falls into one of the ranges in `ranges`.rrTF)r ÚbisectÚ bisect_leftrr )rrÚtuple_ÚposÚleftÚrightÚ_rrrÚintranges_contain's   r#) Ú__doc__rÚtypingrrÚintrr rÚboolr#rrrrÚs