parameters: (a, x, lo=0, hi=None)
docstring: 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.
docstring_summary: Insert item x in list a, and keep it sorted assuming a is sorted.
docstring_tokens: Insert item x in list a and keep it sorted assuming a is sorted .
function: def insort_left(a, x, lo=0, hi=None):
      """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.
      """
  
      lo = bisect_left(a, x, lo, hi)
      a.insert(lo, x)
function_tokens: def insort_left ( a , x , lo = 0 , hi = None ) : lo = bisect_left ( a , x , lo , hi ) a . insert ( lo , x )