U -eY@sdZddlZddlmZmZeeeedfdddZeeedd d Zeeeefd d d Zeeedfe dddZ 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)ListTuple.)list_returncCst|}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)sortedrangelenappend _encode_rangetuple)r sorted_listranges last_writei current_rangerO/var/www/html/Darija-Ai-Train/env/lib/python3.8/site-packages/idna/intranges.pyintranges_from_list sr)startendrcCs |d>|BS)N r)rrrrrr sr )rrcCs|d?|d@fS)Nrlr)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 )rrtuple_posleftright_rrrintranges_contain's   r#) __doc__rtypingrrintrr rboolr#rrrrs