File manager - Edit - /opt/saltstack/salt/lib/python3.10/site-packages/idna/__pycache__/intranges.cpython-310.pyc
Back
o ;j; � @ s| d Z ddlZdee deedf fdd�Zded edefd d�Zdedeeef fd d�Zdedeedf defdd�Z 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�list_�return.c C s� t | �}g }d}tt|��D ]1}|d t|�k r%|| ||d d kr%q||d |d � }|�t|d |d d �� |}qt|�S )a Represent 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)r Zsorted_list�rangesZ last_write�iZ current_range� r �B/opt/saltstack/salt/lib/python3.10/site-packages/idna/intranges.py�intranges_from_list s (r �start�endc C s | d>