o 2c@s@dZddlZddlmZmZddZddZdd 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)). N)ListTuplecCst|}g}d}tt|D]1}|dt|kr%||||ddkr%q||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)list_ sorted_listranges last_writei current_rangerD/var/www/html/gps/gps/lib/python3.10/site-packages/idna/intranges.pyintranges_from_list s rcCs |d>|BS)N r)startendrrrr !s r cCs|d?|d@fS)Nrlr)rrrr _decode_range%srcCsvt|d}t||}|dkr%t||d\}}||kr$|kr%dS|t|kr9t||\}}||kr9dSdS)z=Determine if `int_` falls into one of the ranges in `ranges`.rrTF)r bisect bisect_leftrr)int_rtuple_posleftright_rrrintranges_contain*s   r") __doc__rtypingrrrr rr"rrrrs