|
45 | 45 | Shape, |
46 | 46 | npt, |
47 | 47 | ) |
| 48 | + |
48 | 49 | if TYPE_CHECKING: |
49 | 50 | from pandas._typing import ( |
50 | 51 | NumpySorter, |
@@ -3792,23 +3793,23 @@ def searchsorted( |
3792 | 3793 | self, |
3793 | 3794 | value: ScalarLike_co, |
3794 | 3795 | side: Literal["left", "right"] = ..., |
3795 | | - sirter:NumpySorter = ..., |
3796 | | - ) -> np.intp:... |
| 3796 | + sorter: NumpySorter = ..., |
| 3797 | + ) -> np.intp: ... |
3797 | 3798 |
|
3798 | 3799 | @overload |
3799 | 3800 | def searchsorted( |
3800 | 3801 | self, |
3801 | 3802 | value: npt.ArrayLike | ExtensionArray, |
3802 | 3803 | side: Literal["left", "right"] = ..., |
3803 | 3804 | sorter: NumpySorter = ..., |
3804 | | - ) -> npt.NDArray[np.intp]:... |
| 3805 | + ) -> npt.NDArray[np.intp]: ... |
3805 | 3806 |
|
3806 | 3807 | def searchsorted( |
3807 | 3808 | self, |
3808 | 3809 | value: NumpyValueArrayLike | ExtensionArray, |
3809 | 3810 | side: Literal["left", "right"] = "left", |
3810 | 3811 | sorter: npt.NDArray[np.intp] | None = None, |
3811 | | - ) -> npt.NDArray[np.intp]: |
| 3812 | + ) -> np.intp | npt.NDArray[np.intp]: |
3812 | 3813 | """ |
3813 | 3814 | Find the indices where elements should be inserted to maintain order. |
3814 | 3815 |
|
@@ -3856,7 +3857,6 @@ def searchsorted( |
3856 | 3857 |
|
3857 | 3858 | for v, i in zip(value, indexer): |
3858 | 3859 | if i != -1: |
3859 | | - |
3860 | 3860 | result.append(i if side == "left" else i + 1) |
3861 | 3861 | else: |
3862 | 3862 | dtype = np.dtype( |
|
0 commit comments