OwlCyberSecurity - MANAGER
Edit File: intranges.cpython-312.pyc
� #��gj � � � d Z ddlZddlmZmZ dee deedf fd�Zded edefd �Zd edeeef 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 �I/opt/hc_python/lib/python3.12/site-packages/pip/_vendor/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 " s � � �R�K�3� � r �rc � � | dz | dz fS )Nr l �� r )r s r � _decode_ranger & s � � ��G�q�M�*� +�+r �int_r c �� � t | d� }t j ||� }|dkD r!t ||dz � \ }}|| cxk r|k ry |t |� k rt || � \ }}|| k( ryy)z=Determine if `int_` falls into one of the ranges in `ranges`.r r TF)r �bisect� bisect_leftr r )r r �tuple_�pos�left�right�_s r �intranges_containr) * s� � � �4�� #�F� � � �V�V� ,�C� �Q�w�#�F�3��7�O�4� ��e� �4� �%� �� � �S��[�� ��s� �,���a� �4�<�� r ) �__doc__r" �typingr r �intr r r �boolr) r r r �<module>r. s� ��� � ��t�C�y� �U�3��8�_� �, �� �3� �3� �,�S� ,�U�3��8�_� ,��C� ��s�C�x� � �T� r