ó âžYc@s(dZddlZd„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!}|d|ddf}|j|ƒ|}q+Wt|ƒS(sĚ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. i˙˙˙˙ii(tsortedtrangetlentappendttuple(tlist_t sorted_listtrangest last_writetit current_ranget range_tuple((sY/data/av2000/soap/soapenv/lib/python2.7/site-packages/requests/packages/idna/intranges.pytintranges_from_list s    cCsš||f}tj||ƒ}|dkra||d\}}||koU|knratSn|t|ƒkr–||\}}||kr–tSntS(s=Determine if `int_` falls into one of the ranges in `ranges`.ii(tbisectt bisect_lefttTrueRtFalse(tint_Rttuple_tpostlefttrightt_((sY/data/av2000/soap/soapenv/lib/python2.7/site-packages/requests/packages/idna/intranges.pytintranges_contains   (t__doc__R R R(((sY/data/av2000/soap/soapenv/lib/python2.7/site-packages/requests/packages/idna/intranges.pyts