ÿØÿà JFIF    ÿÛ „  ( %!1!%)+//.383,7(-.+  -%%-////---/-.+/--+------/------/--0+--/-/-----.-----ÿÀ  ¥2" ÿÄ     ÿÄ J    ! 1AQ"aq2‘#BR‚¡ÁÑ3br’¢±Âð$CSƒ²á4c“%DsÓñÿÄ   ÿÄ *  !1AQa‘"2q3±ð#b¡ÿÚ   ? ¼QxJQaÍuò¸Zö Úü8,ÐÚú "SSn<rçù–´âE—^ªBÖ9À\†¸ÔÁT­ÃÛ5 ëd´³Í#Ý;Þ38œî ¶H£M:wÎ3…³…âpÔF&‚FK¸9„â4àGEõªfÿ ‘ñ(ßw­pŽF|È¥ù®häðÍѶ¹‘[ÒinÙW¶ùñY˜Q{›K"išÒ[Ú8žë\F¹@-?v"ÔU”,ìöžkÿ {I‡£šÍ?e ríV .............................................................................................................................................................................. ............................................................................. ÿØÿà JFIF    ÿÛ „  ( %!1!%)+//.383,7(-.+  -%%-////---/-.+/--+------/------/--0+--/-/-----.-----ÿÀ  ¥2" ÿÄ     ÿÄ J    ! 1AQ"aq2‘#BR‚¡ÁÑ3br’¢±Âð$CSƒ²á4c“%DsÓñÿÄ   ÿÄ *  !1AQa‘"2q3±ð#b¡ÿÚ   ? ¼QxJQaÍuò¸Zö Úü8,ÐÚú "SSn<rçù–´âE—^ªBÖ9À\†¸ÔÁT­ÃÛ5 ëd´³Í#Ý;Þ38œî ¶H£M:wÎ3…³…âpÔF&‚FK¸9„â4àGEõªfÿ ‘ñ(ßw­pŽF|È¥ù®häðÍѶ¹‘[ÒinÙW¶ùñY˜Q{›K"išÒ[Ú8žë\F¹@-?v"ÔU”,ìöžkÿ {I‡£šÍ?e ríV .............................................................................................................................................................................. ............................................................................. f# c @sdZdd ddZeZdd ddZeZdd ddZdd dd Zydd lTWne k r|YnXd S( uBisection algorithms.icCs|dkrtdn|dkr6t|}nxA||kry||d}|||krl|}q9|d}q9W|j||dS(uInsert item x in list a, and keep it sorted assuming a is sorted. If x is already in a, insert it to the right of the rightmost x. Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched. iulo must be non-negativeiiN(u ValueErroruNoneulenuinsert(uauxulouhiumid((u+/opt/alt/python33/lib64/python3.3/bisect.pyu insort_rights   u insort_rightcCs~|dkrtdn|dkr6t|}nxA||kry||d}|||krl|}q9|d}q9W|S(uReturn the index where to insert item x in list a, assuming a is sorted. The return value i is such that all e in a[:i] have e <= x, and all e in a[i:] have e > x. So if x already appears in the list, a.insert(x) will insert just after the rightmost x already there. Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched. iulo must be non-negativeiiN(u ValueErroruNoneulen(uauxulouhiumid((u+/opt/alt/python33/lib64/python3.3/bisect.pyu bisect_rights   u bisect_rightcCs|dkrtdn|dkr6t|}nxA||kry||d}|||krp|d}q9|}q9W|j||dS(uInsert item x in list a, and keep it sorted assuming a is sorted. If x is already in a, insert it to the left of the leftmost x. Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched. iulo must be non-negativeiiN(u ValueErroruNoneulenuinsert(uauxulouhiumid((u+/opt/alt/python33/lib64/python3.3/bisect.pyu insort_left/s    u insort_leftcCs~|dkrtdn|dkr6t|}nxA||kry||d}|||krp|d}q9|}q9W|S(uReturn the index where to insert item x in list a, assuming a is sorted. The return value i is such that all e in a[:i] have e < x, and all e in a[i:] have e >= x. So if x already appears in the list, a.insert(x) will insert just before the leftmost x already there. Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched. iulo must be non-negativeiiN(u ValueErroruNoneulen(uauxulouhiumid((u+/opt/alt/python33/lib64/python3.3/bisect.pyu bisect_leftCs    u bisect_left(u*N( u__doc__uNoneu insort_rightuinsortu bisect_rightubisectu insort_leftu bisect_leftu_bisectu ImportError(((u+/opt/alt/python33/lib64/python3.3/bisect.pyus