a ��Re��@s@dZddlZddlmZmZdd�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)). �N)�List�TuplecCs�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��/builddir/build/BUILDROOT/alt-python39-pip-21.3.1-2.el8.x86_64/opt/alt/python39/lib/python3.9/site-packages/pip/_vendor/idna/intranges.py�intranges_from_lists rcCs|d>|BS)N� r)�start�endrrrr !sr cCs|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__r�typingrrrr rr"rrrr�s