U oÏ aÕã@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}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)Úlist_Ú sorted_listÚrangesÚ last_writeÚiÚ current_range©rú[C:\Users\vtejo\AppData\Local\Temp\pip-unpacked-wheel-6mt8ur68\pip\_vendor\idna\intranges.pyÚintranges_from_list srcCs |d>|BS)Né r)ÚstartÚendrrrrsrcCs|d?|d@fS)Nrlÿÿr)ÚrrrrÚ _decode_range"srcCszt|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)Úint_r Útuple_ÚposÚleftÚrightÚ_rrrÚintranges_contain&s   r )Ú__doc__rrrrr rrrrÚs