OXIESEC PANEL
- Current Dir:
/
/
opt
/
gsutil
/
third_party
/
idna
/
idna
/
__pycache__
Server IP: 2a02:4780:11:1594:0:ef5:22d7:a
Upload:
Create Dir:
Name
Size
Modified
Perms
📁
..
-
02/11/2025 08:19:49 AM
rwxr-xr-x
📄
__init__.cpython-39.pyc
800 bytes
02/11/2025 08:19:49 AM
rw-r--r--
📄
core.cpython-39.pyc
9.59 KB
02/11/2025 08:19:49 AM
rw-r--r--
📄
idnadata.cpython-39.pyc
41.05 KB
02/11/2025 08:19:49 AM
rw-r--r--
📄
intranges.cpython-39.pyc
1.9 KB
02/11/2025 08:19:49 AM
rw-r--r--
📄
package_data.cpython-39.pyc
160 bytes
02/11/2025 08:19:49 AM
rw-r--r--
Editing: intranges.cpython-39.pyc
Close
a U!�fj � @ s� d Z ddlZddlmZmZ ee eedf d�dd�Zeeed�d d �Zeeeef d �d d �Zeeedf e d�dd�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�Tuple.)�list_�returnc C s� t | �}g }d}tt|��D ]b}|d t|�k rJ|| ||d d krJq ||d |d � }|�t|d |d d �� |}q 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)r Z sorted_list�rangesZ last_write�iZ current_range� r �./opt/gsutil/third_party/idna/idna/intranges.py�intranges_from_list s r )�start�endr c C s | d> |B S )N� r )r r r r r r " s r )�rr c C s | d? | d@ fS )Nr l �� r )r r r r � _decode_range& s r )�int_r r c C sz t | d�}t�||�}|dkrNt||d �\}}|| krF|k rNn ndS |t|�k rvt|| �\}}|| krvdS dS )z=Determine if `int_` falls into one of the ranges in `ranges`.r r TF)r �bisect� bisect_leftr r )r r Ztuple_�pos�left�right�_r r r �intranges_contain* s r ) �__doc__r �typingr r �intr r r �boolr r r r r �<module> s