Struct InterpolationTable 

pub struct InterpolationTable<F: Fn(f64) -> f64> { /* private fields */ }

Fast lookup table for arbitrary floating point functions. This can be used to e.g., provide fast lookups of distribution values. Input values are sampled with a given precision and results are stored in a vector. During lookup, infimum and supremum of a given value are calculated and the result is interpolated.

Implementations

impl<F: Fn(f64) -> f64> InterpolationTable<F>

pub fn new(min_x: f64, max_x: f64, frac_digits: i32, func: F) -> Self

Create a new InterpolationTable.

Arguments

• min_x - minimum sample value
• max_x - maximum sample value
• frac_digits - number of fraction digits to store in sample
• func - Function to emulate.

If given value is outside of min_x and max_x, the lookup falls back to applying the function itself. The table size grows with the number of fraction digits. Space Complexity: O(m * 10^n), where m = max_x - min_x and n = frac_digits

pub fn get(&self, x: f64) -> f64

Lookup given value in table, and interpolate the result between the sampled values if necessary. This provides an approximation that is better the more fraction digits are used to generate this table. Time Complexity for lookup: O(1) if min_x <= x < max_x and O(func(x)) otherwise.

Trait Implementations

impl<F: Clone + Fn(f64) -> f64> Clone for InterpolationTable<F>

fn clone(&self) -> InterpolationTable<F>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: Debug + Fn(f64) -> f64> Debug for InterpolationTable<F>

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

Formats the value using the given formatter.

impl<F: Default + Fn(f64) -> f64> Default for InterpolationTable<F>

fn default() -> InterpolationTable<F>

Returns the “default value” for a type.

impl<'de, F> Deserialize<'de> for InterpolationTable<F>

where F: Deserialize<'de> + Fn(f64) -> f64,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<F: PartialEq + Fn(f64) -> f64> PartialEq for InterpolationTable<F>

fn eq(&self, other: &InterpolationTable<F>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<F: PartialOrd + Fn(f64) -> f64> PartialOrd for InterpolationTable<F>

fn partial_cmp(&self, other: &InterpolationTable<F>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<F> Serialize for InterpolationTable<F>

where F: Serialize + Fn(f64) -> f64,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<F: Fn(f64) -> f64> StructuralPartialEq for InterpolationTable<F>