| Server IP : 66.29.153.156 / Your IP : 216.73.216.114 Web Server : LiteSpeed System : Linux premium322.web-hosting.com 4.18.0-553.50.1.lve.el8.x86_64 #1 SMP Thu Apr 17 19:10:24 UTC 2025 x86_64 User : lastyfjz ( 1521) PHP Version : 8.1.34 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : ON | Sudo : OFF | Pkexec : OFF Directory : /opt/alt/python35/lib/python3.5/site-packages/pip/_vendor/idna/__pycache__/ |
Upload File : |
��Re� � @ sF d Z d d l Z d d � Z d d � Z d d � Z d d
� Z d S)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 } x� t t | � � D]{ } | d t | � k rf | | | | d d k rf q+ | | d | d � } | j t | d | d d � � | } q+ Wt | � 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 ���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 "
r c C s | d >| BS)N� r )�start�endr r r r s r c C s | d ?| d @f S)Nr r l l �� r )�rr r r �
_decode_range"