Trait SearchSortedFn

pub trait SearchSortedFn<A: Copy> {
    // Required method
    fn search_sorted(
        &self,
        array: A,
        value: &Scalar,
        side: SearchSortedSide,
    ) -> VortexResult<SearchResult>;

    // Provided method
    fn search_sorted_many(
        &self,
        array: A,
        values: &[Scalar],
        side: SearchSortedSide,
    ) -> VortexResult<Vec<SearchResult>> { ... }
}

Searches for value assuming the array is sorted.

Returned indices satisfy following condition if the search for value was to be inserted into the array at found positions

side	result satisfies
left	array[i-1] < value <= array[i]
right	array[i-1] <= value < array[i]

Required Methods

fn search_sorted( &self, array: A, value: &Scalar, side: SearchSortedSide, ) -> VortexResult<SearchResult>

Provided Methods

fn search_sorted_many( &self, array: A, values: &[Scalar], side: SearchSortedSide, ) -> VortexResult<Vec<SearchResult>>

Bulk search for many values.

Implementors

impl SearchSortedFn<&ConstantArray> for ConstantEncoding

impl SearchSortedFn<&PrimitiveArray> for PrimitiveEncoding

impl<E> SearchSortedFn<&dyn Array> for E

where E: for<'a> SearchSortedFn<&'a E::Array> + Encoding,