PNG  IHDR;IDATxܻn0K )(pA 7LeG{ §㻢|ذaÆ 6lذaÆ 6lذaÆ 6lom$^yذag5bÆ 6lذaÆ 6lذa{ 6lذaÆ `}HFkm,mӪôô! x|'ܢ˟;E:9&ᶒ}{v]n&6 h_tڠ͵-ҫZ;Z$.Pkž)!o>}leQfJTu іچ\X=8Rن4`Vwl>nG^is"ms$ui?wbs[m6K4O.4%/bC%t Mז -lG6mrz2s%9s@-k9=)kB5\+͂Zsٲ Rn~GRC wIcIn7jJhۛNCS|j08yiHKֶۛkɈ+;SzL/F*\Ԕ#"5m2[S=gnaPeғL lذaÆ 6l^ḵaÆ 6lذaÆ 6lذa; _ذaÆ 6lذaÆ 6lذaÆ RIENDB`  mfc@stdZdddZeZdddZeZdddZdddZyddlTWne k ronXdS( sBisection algorithms.icCs|dkrtdn|dkr6t|}nxA||kry||d}|||krl|}q9|d}q9W|j||dS(sInsert 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. islo must be non-negativeiiN(t ValueErrortNonetlentinsert(tatxtlothitmid((s/usr/lib64/python2.7/bisect.pyt insort_rights   cCs~|dkrtdn|dkr6t|}nxA||kry||d}|||krl|}q9|d}q9W|S(sReturn 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. islo must be non-negativeiiN(RRR(RRRRR((s/usr/lib64/python2.7/bisect.pyt bisect_rights   cCs|dkrtdn|dkr6t|}nxA||kry||d}|||krp|d}q9|}q9W|j||dS(sInsert 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. islo must be non-negativeiiN(RRRR(RRRRR((s/usr/lib64/python2.7/bisect.pyt insort_left/s    cCs~|dkrtdn|dkr6t|}nxA||kry||d}|||krp|d}q9|}q9W|S(sReturn 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. islo must be non-negativeiiN(RRR(RRRRR((s/usr/lib64/python2.7/bisect.pyt bisect_leftCs    i(t*N( t__doc__RR tinsortR tbisectR R t_bisectt ImportError(((s/usr/lib64/python2.7/bisect.pyts