parameters: (
      idx: Union[GenericIndex, cudf.MultiIndex],
      key_as_table: Frame,
      is_sorted: bool,
  )
return_statement: return lower_bound, upper_bound, sort_inds
docstring: Get equal range for key in lexicographically sorted index. If index
      is not sorted when called, a sort will take place and `sort_inds` is
      returned. Otherwise `None` is returned in that position.
docstring_summary: Get equal range for key in lexicographically sorted index. If index
      is not sorted when called, a sort will take place and `sort_inds` is
      returned. Otherwise `None` is returned in that position.
docstring_tokens: Get equal range for key in lexicographically sorted index . If index is not sorted when called a sort will take place and sort_inds is returned . Otherwise None is returned in that position .
function: def _lexsorted_equal_range(
      idx: Union[GenericIndex, cudf.MultiIndex],
      key_as_table: Frame,
      is_sorted: bool,
  ) -> Tuple[int, int, Optional[ColumnBase]]:
      """Get equal range for key in lexicographically sorted index. If index
      is not sorted when called, a sort will take place and `sort_inds` is
      returned. Otherwise `None` is returned in that position.
      """
      if not is_sorted:
          sort_inds = idx._get_sorted_inds()
          sort_vals = idx._gather(sort_inds)
      else:
          sort_inds = None
          sort_vals = idx
      lower_bound = search_sorted(
          sort_vals, key_as_table, side="left"
      ).element_indexing(0)
      upper_bound = search_sorted(
          sort_vals, key_as_table, side="right"
      ).element_indexing(0)
  
      return lower_bound, upper_bound, sort_inds
function_tokens: def _lexsorted_equal_range ( idx : Union [ GenericIndex , cudf . MultiIndex ] , key_as_table : Frame , is_sorted : bool , ) -> Tuple [ int , int , Optional [ ColumnBase ] ] : if not is_sorted : sort_inds = idx . _get_sorted_inds ( ) sort_vals = idx . _gather ( sort_inds ) else : sort_inds = None sort_vals = idx lower_bound = search_sorted ( sort_vals , key_as_table , side = "left" ) . element_indexing ( 0 ) upper_bound = search_sorted ( sort_vals , key_as_table , side = "right" ) . element_indexing ( 0 ) return lower_bound , upper_bound , sort_inds