17 lines
1.9 KiB
Plaintext
17 lines
1.9 KiB
Plaintext
|
o
|
|||
|
|
<00>ԄcY <00> @ s<> d Z ddlZddlmZmZ dee deedf fdd<08>Zd ed
|
|||
|
|
edefd d <0C>Zd
edeeef fdd<0F>Zdedeedf de fdd<13>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)).
|
|||
|
|
<EFBFBD> N)<02>List<73>Tuple<6C>list_<74>return.c C s<> t | <00>}g }d}tt|<01><01>D ]1}|d t|<01>k r%|| ||d d kr%q||d |d <00> }|<02>t|d |d d <00><02> |}qt|<02>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.
|
|||
|
|
<20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> r )<06>sorted<65>range<67>len<65>append<6E>
_encode_range<67>tuple)r <00> sorted_list<73>ranges<65>
|
|||
|
|
last_write<EFBFBD>i<>
current_range<67> r <00>a/home/infidel/Sync/Project/ocp-wg-backend/acer-env/lib/python3.10/site-packages/idna/intranges.py<70>intranges_from_list s r <00>start<72>endc C s | d> |B S )N<> r )r r r r r r s r <00>rc C s | d? | d@ fS )Nr l <00><EFBFBD> r )r r r r <00>
_decode_range# s r <00>int_r c C sv t | d<01>}t<01>||<02>}|dkr%t||d <00>\}}|| kr$|k r%dS |t|<01>k r9t|| <00>\}}|| kr9dS dS )z=Determine if `int_` falls into one of the ranges in `ranges`.r r TF)r <00>bisect<63> bisect_leftr r
|
|||
|
|
)r r <00>tuple_<65>pos<6F>left<66>right<68>_r r r <00>intranges_contain' s
|
|||
|
|
<02> r# ) <0B>__doc__r <00>typingr r <00>intr r r <00>boolr# r r r r <00><module> s "
|