cunumeric.searchsorted#
- cunumeric.searchsorted(a: ndarray, v: int | float | ndarray, side: SortSide = 'left', sorter: ndarray | None = None) int | ndarray#
Find the indices into a sorted array a such that, if the corresponding elements in v were inserted before the indices, the order of a would be preserved.
- Parameters:
a (1-D array_like) – Input array. If sorter is None, then it must be sorted in ascending order, otherwise sorter must be an array of indices that sort it.
v (scalar or array_like) – Values to insert into a.
side (
{'left', 'right'}, optional) – If ‘left’, the index of the first suitable location found is given. If ‘right’, return the last such index. If there is no suitable index, return either 0 or N (where N is the length of a).sorter (1-D array_like, optional) – Optional array of integer indices that sort array a into ascending order. They are typically the result of argsort.
- Returns:
indices – Array of insertion points with the same shape as v, or an integer if v is a scalar.
- Return type:
- Availability:
Multiple GPUs, Multiple CPUs