searchsorted(arr: 'ArrayLike', value: 'NumpyValueArrayLike | ExtensionArray', side: "Literal['left', 'right']" = 'left', sorter: 'NumpySorter' = None) -> 'npt.NDArray[np.intp] | np.intp'
Find the indices into a sorted array :None:None:`arr` (a) such that, if the corresponding elements in :None:None:`value` were inserted before the indices, the order of :None:None:`arr` would be preserved.
Assuming that :None:None:`arr` is sorted:
====== ================================ :None:None:`side` returned index i satisfies ====== ================================ left arr[i-1] < value <= self[i]
right arr[i-1] <= value < self[i]
====== ================================
Input array. If :None:None:`sorter` is None, then it must be sorted in ascending order, otherwise :None:None:`sorter` must be an array of indices that sort it.
Values to insert into :None:None:`arr`.
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 :None:None:`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.
Find indices where elements should be inserted to maintain order.
numpy.searchsorted
Similar method from NumPy.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them