17 lines
1.7 KiB
Plaintext
17 lines
1.7 KiB
Plaintext
|
B
|
|||
|
|
#U<>]<5D> <00> @ s0 d Z ddlZdd<04> Zdd<06> Zdd<08> Zd d
|
|||
|
|
<EFBFBD> ZdS ) 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> Nc C s<> t | <00>}g }d}xrtt|<01><01>D ]b}|d t|<01>k rL|| ||d d krLq ||d |d <00> }|<02>t|d |d d <00><02> |}q W t|<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)<06>list_<74> sorted_list<73>ranges<65>
|
|||
|
|
last_write<EFBFBD>i<>
current_range<67> r <00>0/tmp/pip-install-zuyyrlx8/idna/idna/intranges.py<70>intranges_from_list
|
|||
|
|
s r c C s | d> |B S )N<> r )<02>start<72>endr r r r s r c C s | d? | d@ fS )Nr l <00><EFBFBD> r )<01>rr r r <00>
_decode_range" s r c C sz t | d<01>}t<01>||<02>}|dkrNt||d <00>\}}|| krF|k rNn ndS |t|<01>k rvt|| <00>\}}|| krvdS dS )z=Determine if `int_` falls into one of the ranges in `ranges`.r r TF)r <00>bisect<63> bisect_leftr r )<07>int_r <00>tuple_<65>pos<6F>left<66>right<68>_r r r <00>intranges_contain& s
|
|||
|
|
r )<06>__doc__r r r r r r r r r <00><module> s
|
|||
|
|
|