#[non_exhaustive]
pub enum Interpolation<T, V> { Step(T), Linear, Cosine, CatmullRom, Bezier(V), StrokeBezier(V, V), }
Expand description

Available kind of interpolations.

Feel free to visit each variant for more documentation.

Variants (Non-exhaustive)§

This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§

Step(T)

Hold a Key until the sampling value passes the normalized step threshold, in which case the next key is used.

Note: if you set the threshold to 0.5, the first key will be used until half the time between the two keys; the second key will be in used afterwards. If you set it to 1.0, the first key will be kept until the next key. Set it to 0. and the first key will never be used.

§

Linear

Linear interpolation between a key and the next one.

§

Cosine

Cosine interpolation between a key and the next one.

§

CatmullRom

Catmull-Rom interpolation, performing a cubic Hermite interpolation using four keys.

§

Bezier(V)

Bézier interpolation.

A control point that uses such an interpolation is associated with an extra point. The segmant connecting both is called the tangent of this point. The part of the spline defined between this control point and the next one will be interpolated across with Bézier interpolation. Two cases are possible:

  • The next control point also has a Bézier interpolation mode. In this case, its tangent is used for the interpolation process. This is called cubic Bézier interpolation and it kicks ass.
  • The next control point doesn’t have a Bézier interpolation mode set. In this case, the tangent used for the next control point is defined as the segment connecting that control point and the current control point’s associated point. This is called quadratic Bézer interpolation and it kicks ass too, but a bit less than cubic.
§

StrokeBezier(V, V)

A special Bézier interpolation using an input tangent and an output tangent.

With this kind of interpolation, a control point has an input tangent, which has the same role as the one defined by Interpolation::Bezier, and an output tangent, which has the same role defined by the next key’s Interpolation::Bezier if present, normally.

What it means is that instead of setting the output tangent as the next key’s Bézier tangent, this interpolation mode allows you to manually set the output tangent. That will yield more control on the tangents but might generate discontinuities. Use with care.

Stroke Bézier interpolation is always a cubic Bézier interpolation by default.

Trait Implementations§

source§

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

source§

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

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

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

source§

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

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

impl<T, V> Default for Interpolation<T, V>

source§

fn default() -> Self

Interpolation::Linear is the default.

source§

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

source§

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

Deserialize this value from the given Serde deserializer. Read more
source§

impl<T: PartialEq, V: PartialEq> PartialEq for Interpolation<T, V>

source§

fn eq(&self, other: &Interpolation<T, V>) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

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

source§

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

Serialize this value into the given Serde serializer. Read more
source§

impl<T: Copy, V: Copy> Copy for Interpolation<T, V>

source§

impl<T: Eq, V: Eq> Eq for Interpolation<T, V>

source§

impl<T, V> StructuralEq for Interpolation<T, V>

source§

impl<T, V> StructuralPartialEq for Interpolation<T, V>

Auto Trait Implementations§

§

impl<T, V> RefUnwindSafe for Interpolation<T, V>

§

impl<T, V> Send for Interpolation<T, V>
where T: Send, V: Send,

§

impl<T, V> Sync for Interpolation<T, V>
where T: Sync, V: Sync,

§

impl<T, V> Unpin for Interpolation<T, V>
where T: Unpin, V: Unpin,

§

impl<T, V> UnwindSafe for Interpolation<T, V>
where T: UnwindSafe, V: UnwindSafe,

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> 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> Same for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

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

§

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>,

§

type Error = Infallible

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

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

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

§

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.
source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,