£Á°è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ã
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
<html>

f#
  c               @   s   d  Z  d d d d  Z e Z d d d d  Z e Z d d d d  Z d d d d	  Z y d d
 l TWn e	 k
 r| Yn Xd S(   u   Bisection algorithms.i    c             C   s   | d k  r t  d   n  | d k r6 t |   } n  xA | | k  ry | | d } | |  | k  rl | } q9 | d } q9 W|  j | |  d S(   u   Insert 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.
    i    u   lo must be non-negativei   i   N(   u
   ValueErroru   Noneu   lenu   insert(   u   au   xu   lou   hiu   mid(    (    u+   /opt/alt/python33/lib64/python3.3/bisect.pyu   insort_right   s    	 	u   insort_rightc             C   s~   | d k  r t  d   n  | d k r6 t |   } n  xA | | k  ry | | d } | |  | k  rl | } q9 | d } q9 W| S(   u  Return 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.
    i    u   lo must be non-negativei   i   N(   u
   ValueErroru   Noneu   len(   u   au   xu   lou   hiu   mid(    (    u+   /opt/alt/python33/lib64/python3.3/bisect.pyu   bisect_right   s     	u   bisect_rightc             C   s   | d k  r t  d   n  | d k r6 t |   } n  xA | | k  ry | | d } |  | | k  rp | d } q9 | } q9 W|  j | |  d S(   u   Insert 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.
    i    u   lo must be non-negativei   i   N(   u
   ValueErroru   Noneu   lenu   insert(   u   au   xu   lou   hiu   mid(    (    u+   /opt/alt/python33/lib64/python3.3/bisect.pyu   insort_left/   s    	 
u   insort_leftc             C   s~   | d k  r t  d   n  | d k r6 t |   } n  xA | | k  ry | | d } |  | | k  rp | d } q9 | } q9 W| S(   u  Return 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.
    i    u   lo must be non-negativei   i   N(   u
   ValueErroru   Noneu   len(   u   au   xu   lou   hiu   mid(    (    u+   /opt/alt/python33/lib64/python3.3/bisect.pyu   bisect_leftC   s     
u   bisect_left(   u   *N(
   u   __doc__u   Noneu   insort_rightu   insortu   bisect_rightu   bisectu   insort_leftu   bisect_leftu   _bisectu   ImportError(    (    (    u+   /opt/alt/python33/lib64/python3.3/bisect.pyu   <module>   s   