| Server IP : 162.19.112.25 / Your IP : 216.73.217.36 Web Server : LiteSpeed System : Linux qamar.tasjeel.ae 5.14.0-611.55.1.el9_7.x86_64 #1 SMP PREEMPT_DYNAMIC Tue May 19 15:19:29 EDT 2026 x86_64 User : archiart ( 1428) PHP Version : 8.2.33 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : /opt/alt/python37/lib/python3.7/site-packages/pip/_vendor/idna/__pycache__/ |
Upload File : |
B
s;hyR��� @ s0 d Z ddlZdd� 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)).
� Nc C s� t | �}g }d}xrtt|��D ]b}|d t|�k rL|| ||d d krLq||d |d � }|�t|d |d d �� |}qW t|�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)�list_�sorted_list�ranges�
last_write�i�
current_range� r ��/builddir/build/BUILDROOT/alt-python37-pip-20.2.4-6.el9.x86_64/opt/alt/python37/lib/python3.7/site-packages/pip/_vendor/idna/intranges.py�intranges_from_list
s r c C s | d>