Skip to main content

MinMaxIndex

Struct MinMaxIndex 

Source
pub struct MinMaxIndex { /* private fields */ }
Expand description

(min, max) pairs of a growing column with O(log n) range queries, O(log n) push and set_last.

Pairs with a NaN bound are empty (a gap) and never contribute.

§Examples

use ferrochart_core::plugin::MinMaxIndex;

let mut idx = MinMaxIndex::new();
for (lo, hi) in [(1.0, 2.0), (0.5, 3.0), (f64::NAN, f64::NAN), (2.0, 4.0)] {
    idx.push(lo, hi)?;
}
assert_eq!(idx.query(0, 2), Some((0.5, 3.0)));
idx.set_last(-1.0, 0.0);
let (lo, hi) = idx.query(0, 4).unwrap();
assert!(lo <= -1.0 && hi >= 3.0);
assert_eq!(idx.query(2, 3), None);

Implementations§

Source§

impl MinMaxIndex

Source

pub const fn new() -> Self

An empty index.

Source

pub fn len(&self) -> usize

Number of pairs.

Source

pub fn is_empty(&self) -> bool

Whether there are no pairs.

Source

pub fn clear(&mut self)

Removes all pairs, keeping the memory.

Source

pub fn heap_bytes(&self) -> usize

Bytes of heap memory in use.

Source

pub fn push(&mut self, min: f64, max: f64) -> Result<()>

Appends a pair (min, max); NaN in either makes it a gap.

§Errors

Error::OutOfMemory if memory cannot be reserved.

Source

pub fn set_last(&mut self, min: f64, max: f64)

Replaces the last pair (real-time updates); does nothing when empty. Does not allocate.

Source

pub fn query(&self, from: usize, to: usize) -> Option<(f64, f64)>

Minimum and maximum over pairs from..to (clamped to the data); None if they are all gaps. The interior of the range comes from the f32 levels, so the result may be wider than the exact extremes by one f32 ulp, never narrower.

Trait Implementations§

Source§

impl Clone for MinMaxIndex

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for MinMaxIndex

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Default for MinMaxIndex

Source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.