Stated explicit wrapping behavior of out of bound values of sorter per dpctl spec

Author: antonwolfy

dpnp/dpnp_iface_searching.py

@@ -244,9 +244,13 @@ def searchsorted(a, v, side="left", sorter=None):
         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`).
+        Default is ``'left'``.
     sorter : {dpnp.ndarray, usm_ndarray}, optional
         Optional 1-D array of integer indices that sort array a into ascending
         order. They are typically the result of argsort.
+        Out of bound index values of `sorter` array are treated using `"wrap"`
+        mode documented in :py:func:`dpnp.take`.
+        Default is ``None``.
 
     Returns
     -------

tests/test_sort.py

@@ -245,29 +245,6 @@ def test_invalid_sorter(self):
                 sorter=xp.array([1, 2, 3, 4, 5, 6]),
             )
 
-            # # bounds check
-            assert_raises(
-                ValueError,
-                xp.searchsorted,
-                a,
-                4,
-                sorter=xp.array([0, 1, 2, 3, 5]),
-            )
-            assert_raises(
-                ValueError,
-                xp.searchsorted,
-                a,
-                0,
-                sorter=xp.array([-1, 0, 1, 2, 3]),
-            )
-            assert_raises(
-                ValueError,
-                xp.searchsorted,
-                a,
-                0,
-                sorter=xp.array([4, 0, -1, 2, 3]),
-            )
-
     def test_v_scalar(self):
         v = 0
         a = numpy.array([-8, -5, -1, 3, 6, 10])