ó į’“Xc@s:dZddlZd„Zd„Zd„Zd„ZdS(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)). i’’’’NcCs·t|ƒ}g}d}x’tt|ƒƒ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. i’’’’ii(tsortedtrangetlentappendt _encode_rangettuple(tlist_t sorted_listtrangest last_writetit current_range((s2/usr/lib/python2.7/site-packages/idna/intranges.pytintranges_from_list s  " cCs |d>|BS(Ni ((tstarttend((s2/usr/lib/python2.7/site-packages/idna/intranges.pyRscCs|d?|d@fS(Ni iII’’’’((tr((s2/usr/lib/python2.7/site-packages/idna/intranges.pyt _decode_range"scCs©t|dƒ}tj||ƒ}|dkrjt||dƒ\}}||ko^|knrjtSn|t|ƒkr„t||ƒ\}}||kr„tSntS(s=Determine if `int_` falls into one of the ranges in `ranges`.ii(Rtbisectt bisect_leftRtTrueRtFalse(tint_Rttuple_tpostlefttrightt_((s2/usr/lib/python2.7/site-packages/idna/intranges.pytintranges_contain&s  (t__doc__RR RRR(((s2/usr/lib/python2.7/site-packages/idna/intranges.pyts