Server IP : 15.235.198.142 / Your IP : 216.73.216.61 Web Server : Apache/2.4.58 (Ubuntu) System : Linux ballsack 6.8.0-45-generic #45-Ubuntu SMP PREEMPT_DYNAMIC Fri Aug 30 12:02:04 UTC 2024 x86_64 User : www-data ( 33) PHP Version : 8.3.6 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : ON | Pkexec : OFF Directory : /snap/certbot/current/lib/python3.12/site-packages/idna/__pycache__/ |
Upload File : |
� N�gj � � � d Z ddlZddlmZmZ dee deedf fd�Zded edefd �Zdedeeef fd�Zd edeedf de fd�Z y)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_�return.c � � t | � }g }d}t t |� � D ]V }|dz t |� k r|| ||dz dz k( r�&||dz |dz }|j t |d |d dz � � |}�X 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 �sorted_list�ranges� last_write�i� current_ranges �~/build/snapcraft-certbot-2c33630aaf29c47357e5a1683f659d3d/parts/certbot/install/lib/python3.12/site-packages/idna/intranges.py�intranges_from_listr s� � � ��-�K� �F��J� �3�{�#� $� ���q�5�3�{�#�#��1�~��Q��U�!3�a�!7�7��#�J��N�Q��U�;� �� � �m�M�!�$4�m�B�6G�!�6K�L�M�� � � ��=�� �start�endc � � | dz |z S )N� � )r r s r r r "