Struct Bisector 

pub struct Bisector<T, K> { /* private fields */ }

A bisector that uses a custom accessor function.

Example

use d3rs::array::Bisector;

#[derive(Debug)]
struct Point { x: f64, y: f64 }

let bisector = Bisector::new(|p: &Point| p.x);

let data = vec![
    Point { x: 1.0, y: 2.0 },
    Point { x: 3.0, y: 4.0 },
    Point { x: 5.0, y: 6.0 },
];

assert_eq!(bisector.left(&data, 2.0), 1);
assert_eq!(bisector.right(&data, 3.0), 2);

Implementations

impl<T, K: PartialOrd> Bisector<T, K>

pub fn new<F>(accessor: F) -> Self

where F: Fn(&T) -> K + 'static,

Creates a new bisector with the given accessor function.

pub fn left(&self, data: &[T], x: K) -> usize

Returns the leftmost insertion point for value x.

pub fn right(&self, data: &[T], x: K) -> usize

Returns the rightmost insertion point for value x.

pub fn center<'a>(&self, data: &'a [T], x: K) -> Option<&'a T>

where K: Copy + Sub<Output = K>,

Returns the element in the slice that is closest to x.