docs: def _find_bounds_1d(data, x):
          """
          Find the index of the lower bound where ``x`` should be inserted
          into ``a`` to maintain order.
  
          The index of the upper bound is the index of the lower bound
          plus 2.  Both bound indices must be within the array.
  
          Parameters
          ----------
          data : 1D `~numpy.ndarray`
              The 1D array to search.
  
          x : float
              The value to insert.
  
          Returns
          -------
          index : int
              The index of the lower bound.
          """
  
          idx = np.searchsorted(data, x)
          if idx == 0:
              idx0 = 0
          elif idx == len(data):  # pragma: no cover
              idx0 = idx - 2
          else:
              idx0 = idx - 1
  
          return idx0