��Re��@sFdZddlZdd�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}x�tt|��D]{}|dt|�krf||||ddkrfq+||d|d�}|jt|d|dd��|}q+Wt|�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��r)�sorted�range�len�append� _encode_range�tuple)�list_�sorted_list�ranges� last_write�i� current_range�r��/builddir/build/BUILDROOT/alt-python35-pip-20.2.4-5.el8.x86_64/opt/alt/python35/lib/python3.5/site-packages/pip/_vendor/idna/intranges.py�intranges_from_list s" rcCs|d>|BS)N� r)�start�endrrrrsrcCs|d?|d@fS)Nrrll��r)�rrrr� _decode_range"srcCs�t|d�}tj||�}|dkrgt||d�\}}||ko^|knrgdS|t|�kr�t||�\}}||kr�dSdS)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&sr )�__doc__rrrrr rrrr�s