Find indices where elements should be inserted to maintain order.
Find the indices into a sorted array self (a) such that, if the corresponding elements in value were inserted before the indices, the order of self would be preserved.
Assuming that self is sorted:
side
returned index i satisfies
left
self[i-1] < value <= self[i]
right
self[i-1] <= value < self[i]
Value(s) to insert into self.
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 self).
Optional array of integer indices that sort array a into ascending order. They are typically the result of argsort.
If value is array-like, array of insertion points. If value is scalar, a single integer.
Examples
>>> arr = pd.array([1, 2, 3, 5]) >>> arr.searchsorted([4]) array([3])
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4