???<!-- GIF89;a -->
123123123123
.....................................................................................................................................???<!-- GIF89;a -->
123123123123
.....................................................................................................................................
Yf#
                 @   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)zBisection algorithms.    Nc             C   s   | d k  r t  d   | d k r0 t |   } xA | | k  rs | | d } | |  | k  rf | } q3 | d } q3 W|  j | |  d S)zInsert 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.
    r   zlo must be non-negativeN      )
ValueErrorleninsert)axlohimid r   +/opt/alt/python35/lib64/python3.5/bisect.pyinsort_right   s    	 	r   c             C   sx   | d k  r t  d   | d k r0 t |   } xA | | k  rs | | d } | |  | k  rf | } q3 | d } q3 W| S)a  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.
    r   zlo must be non-negativeNr   r   )r   r   )r   r   r	   r
   r   r   r   r   bisect_right   s     	r   c             C   s   | d k  r t  d   | d k r0 t |   } xA | | k  rs | | d } |  | | k  rj | d } q3 | } q3 W|  j | |  d S)zInsert 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.
    r   zlo must be non-negativeNr   r   )r   r   r   )r   r   r	   r
   r   r   r   r   insort_left/   s    	 
r   c             C   sx   | d k  r t  d   | d k r0 t |   } xA | | k  rs | | d } |  | | k  rj | d } q3 | } q3 W| S)a  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.
    r   zlo must be non-negativeNr   r   )r   r   )r   r   r	   r
   r   r   r   r   bisect_leftC   s     
r   )*)	__doc__r   Zinsortr   Zbisectr   r   Z_bisectImportErrorr   r   r   r   <module>   s   