Struct splines::spline::Spline

pub struct Spline<T, V>(_);

Spline curve used to provide interpolation between control points (keys).

Splines are made out of control points (Key). When creating a Spline with Spline::from_vec or Spline::from_iter, the keys don’t have to be sorted (they are sorted automatically by the sampling value).

You can sample from a spline with several functions:

• Spline::sample: allows you to sample from a spline. If not enough keys are available for the required interpolation mode, you get None.
• Spline::clamped_sample: behaves like Spline::sample but will return either the first or last key if out of bound; it will return None if not enough key.

Methods

impl<T, V> Spline<T, V>

pub fn from_vec(keys: Vec<Key<T, V>>) -> Self where
    T: PartialOrd, 

Create a new spline out of keys. The keys don’t have to be sorted even though it’s recommended to provide ascending sorted ones (for performance purposes).

pub fn from_iter<I>(iter: I) -> Self where
    I: Iterator<Item = Key<T, V>>,
    T: PartialOrd, 

Create a new spline by consuming an Iterater<Item = Key<T>>. They keys don’t have to be sorted.

Note on iterators

It’s valid to use any iterator that implements Iterator<Item = Key<T>>. However, you should use Spline::from_vec if you are passing a Vec.

pub fn keys(&self) -> &[Key<T, V>]

Retrieve the keys of a spline.

pub fn len(&self) -> usize

Number of keys.

pub fn is_empty(&self) -> bool

Check whether the spline has no key.

pub fn sample_with_key(
    &self,
    t: T
) -> Option<(V, &Key<T, V>, Option<&Key<T, V>>)> where
    T: Additive + One + Trigo + Mul<T, Output = T> + Div<T, Output = T> + PartialOrd,
    V: Interpolate<T>, 

Sample a spline at a given time, returning the interpolated value along with its associated key.

The current implementation, based on immutability, cannot perform in constant time. This means that sampling’s processing complexity is currently O(log n). It’s possible to achieve O(1) performance by using a slightly different spline type. If you are interested by this feature, an implementation for a dedicated type is foreseen yet not started yet.

Return

None if you try to sample a value at a time that has no key associated with. That can also happen if you try to sample between two keys with a specific interpolation mode that makes the sampling impossible. For instance, Interpolation::CatmullRom requires four keys. If you’re near the beginning of the spline or its end, ensure you have enough keys around to make the sampling.

pub fn sample(&self, t: T) -> Option<V> where
    T: Additive + One + Trigo + Mul<T, Output = T> + Div<T, Output = T> + PartialOrd,
    V: Interpolate<T>, 

Sample a spline at a given time.

pub fn clamped_sample_with_key(
    &self,
    t: T
) -> Option<(V, &Key<T, V>, Option<&Key<T, V>>)> where
    T: Additive + One + Trigo + Mul<T, Output = T> + Div<T, Output = T> + PartialOrd,
    V: Interpolate<T>, 

Sample a spline at a given time with clamping, returning the interpolated value along with its associated key.

Return

If you sample before the first key or after the last one, return the first key or the last one, respectively. Otherwise, behave the same way as Spline::sample.

Error

This function returns None if you have no key.

pub fn clamped_sample(&self, t: T) -> Option<V> where
    T: Additive + One + Trigo + Mul<T, Output = T> + Div<T, Output = T> + PartialOrd,
    V: Interpolate<T>, 

Sample a spline at a given time with clamping.

pub fn add(&mut self, key: Key<T, V>) where
    T: PartialOrd, 

Add a key into the spline.

pub fn remove(&mut self, index: usize) -> Option<Key<T, V>>

Remove a key from the spline.

pub fn replace<F>(&mut self, index: usize, f: F) -> Option<Key<T, V>> where
    F: FnOnce(&Key<T, V>) -> Key<T, V>,
    T: PartialOrd, 

Update a key and return the key already present.

The key is updated — if present — with the provided function.

Notes

That function makes sense only if you want to change the interpolator (i.e. Key::t) of your key. If you just want to change the interpolation mode or the carried value, consider using the Spline::get_mut method instead as it will be way faster.

pub fn get(&self, index: usize) -> Option<&Key<T, V>>

Get a key at a given index.

pub fn get_mut(&mut self, index: usize) -> Option<KeyMut<T, V>>

Mutably get a key at a given index.

Trait Implementations

impl<'a, T, V> IntoIterator for &'a Spline<T, V>

type Item = &'a Key<T, V>

The type of the elements being iterated over.

type IntoIter = Iter<'a, T, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Clone, V: Clone> Clone for Spline<T, V>

fn clone(&self) -> Spline<T, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug, V: Debug> Debug for Spline<T, V>

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

Formats the value using the given formatter.

impl<T, V> Serialize for Spline<T, V> where
    T: Serialize,
    V: Serialize, 

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

Serialize this value into the given Serde serializer.

impl<'de, T, V> Deserialize<'de> for Spline<T, V> where
    T: Deserialize<'de>,
    V: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.