£Á°èZ¨Ä…–K§‚«“ô4“ÒÙ´dîfUÙÃÅ WKbyÊ¦•êŽ…È®FÒ¿ÊÎóCozá¬S@6{Í:›œêZÌ:Š•_%:¢¾¾~;‘Ã~èŠ©ÊÇí`ÔÑ©úë™µ'5I¿fš×WO%ø9¾«¾DK|€ùÍD”Ýs]nHÕ¶ê×Ó¼ãžªéUWŸÈË%DÒÕ¬ï‘]/Åcx ‰ï2ß]ä6G[]S£ÔÏ¯rs{úëóµmÒï#UQxo·õÞCe]"±/aÙ&Eã4ú9Jé_ÞåëdãöKë)AÞ ¯¹ægƒÛowÐø^d™ý½ßB7áyMä9ÜÖUã !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! 3 �Pf��@s0dZddlZdd�Zdd�Zdd�Zd d �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)). �NcCs�t|�}g}d}xrtt|��D]b}|dt|�krL||||ddkrLq||d|d�}|jt|d|dd��|}qWt|�S)aRepresent 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��r)�sorted�range�len�append� _encode_range�tuple)Zlist_Zsorted_list�rangesZ last_write�iZ current_range�r�/usr/lib/python3.6/intranges.py�intranges_from_list srcCs|d>|BS)N� r)�start�endrrr rsrcCs|d?|d@fS)Nrrll��r)�rrrr � _decode_range"srcCszt|d�}tj||�}|dkrNt||d�\}}||koD|knrNdS|t|�krvt||�\}}||krvdSdS)z=Determine if `int_` falls into one of the ranges in `ranges`.rrTF)r�bisectZbisect_leftrr)Zint_r Ztuple_�pos�left�right�_rrr �intranges_contain&s r)�__doc__rrrrrrrrr �s