U ì·êfj ã @ s€ d Z ddlZddlmZmZ ee eedf dœdd„Zeeedœd d „Zeeeef dœdd „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 ƒ¡ |}qt|ƒ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_range© r ú?/opt/alt/python38/lib/python3.8/site-packages/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&