£Á°è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áyMä9ÜÖUã !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!  abc@s:dZddlZdZdZdZdZdS(s  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)). iNcCst|}g}d}xtt|D]~}|dt|krl||||ddkrlq+qln||d|d!}|jt|d|dd|}q+Wt|S(sRepresent 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. iii(tsortedtrangetlentappendt _encode_rangettuple(tlist_t sorted_listtrangest last_writetit current_range((s>/usr/lib/python2.7/site-packages/pip/_vendor/idna/intranges.pytintranges_from_list s  " cCs |d>|BS(Ni ((tstarttend((s>/usr/lib/python2.7/site-packages/pip/_vendor/idna/intranges.pyRscCs|d?|d@fS(Ni iII((tr((s>/usr/lib/python2.7/site-packages/pip/_vendor/idna/intranges.pyt _decode_range"scCst|d}tj||}|dkrjt||d\}}||ko^|knrjtSn|t|krt||\}}||krtSntS(s=Determine if `int_` falls into one of the ranges in `ranges`.ii(Rtbisectt bisect_leftRtTrueRtFalse(tint_Rttuple_tpostlefttrightt_((s>/usr/lib/python2.7/site-packages/pip/_vendor/idna/intranges.pytintranges_contain&s  (t__doc__RR RRR(((s>/usr/lib/python2.7/site-packages/pip/_vendor/idna/intranges.pyts