max/splines
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add rustfmt.toml and reformat.

Browse Source
This commit is contained in:
Dimitri Sabadie 2020-03-19 01:22:26 +01:00
parent 1bcf1de99e
commit 89dfb61272
No known key found for this signature in database
GPG Key ID: 23CDFD7CAFBA2EDC
11 changed files with 751 additions and 745 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
examples/hello-world.rs
View File

@ -3,12 +3,12 @@ extern crate splines;
use splines::{Interpolation, Key, Spline}; use splines::{Interpolation, Key, Spline};
fn main() { fn main() {
let keys = vec![ let keys = vec![
Key::new(0., 0., Interpolation::default()), Key::new(0., 0., Interpolation::default()),
Key::new(5., 1., Interpolation::default()), Key::new(5., 1., Interpolation::default()),
]; ];
let spline = Spline::from_vec(keys); let spline = Spline::from_vec(keys);
println!("value at 0: {:?}", spline.clamped_sample(0.)); println!("value at 0: {:?}", spline.clamped_sample(0.));
println!("value at 3: {:?}", spline.clamped_sample(3.)); println!("value at 3: {:?}", spline.clamped_sample(3.));
} }

42
examples/serialization.rs
View File

@ -6,26 +6,26 @@ use serde_json::from_value;
use splines::Spline; use splines::Spline;
fn main() { fn main() {
let value = json! { let value = json! {
[ [
{ {
"t": 0, "t": 0,
"interpolation": "linear", "interpolation": "linear",
"value": 0 "value": 0
}, },
{ {
"t": 1, "t": 1,
"interpolation": { "step": 0.5 }, "interpolation": { "step": 0.5 },
"value": 1 "value": 1
}, },
{ {
"t": 5, "t": 5,
"interpolation": "cosine", "interpolation": "cosine",
"value": 10 "value": 10
}, },
] ]
}; };
let spline = from_value::<Spline<f32, f32>>(value); let spline = from_value::<Spline<f32, f32>>(value);
println!("{:?}", spline); println!("{:?}", spline);
} }

15
rustfmt.toml Normal file
View File

@ -0,0 +1,15 @@
edition = "2018"
fn_args_layout = "Tall"
force_explicit_abi = true
hard_tabs = false
max_width = 100
merge_derives = true
newline_style = "Unix"
remove_nested_parens = true
reorder_imports = true
reorder_modules = true
tab_spaces = 2
use_field_init_shorthand = true
use_small_heuristics = "Default"
use_try_shorthand = true

58
src/cgmath.rs
View File

@ -1,9 +1,9 @@
use cgmath::{ use cgmath::{
BaseFloat, BaseNum, InnerSpace, Quaternion, Vector1, Vector2, Vector3, Vector4, VectorSpace, BaseFloat, BaseNum, InnerSpace, Quaternion, Vector1, Vector2, Vector3, Vector4, VectorSpace,
}; };
use crate::interpolate::{ use crate::interpolate::{
cubic_bezier_def, cubic_hermite_def, quadratic_bezier_def, Additive, Interpolate, Linear, One, cubic_bezier_def, cubic_hermite_def, quadratic_bezier_def, Additive, Interpolate, Linear, One,
}; };
macro_rules! impl_interpolate_vec { macro_rules! impl_interpolate_vec {
@ -52,41 +52,41 @@ impl_interpolate_vec!(Vector4);
impl<T> Linear<T> for Quaternion<T> impl<T> Linear<T> for Quaternion<T>
where where
T: BaseFloat, T: BaseFloat,
{ {
#[inline(always)] #[inline(always)]
fn outer_mul(self, t: T) -> Self { fn outer_mul(self, t: T) -> Self {
self * t self * t
} }
#[inline(always)] #[inline(always)]
fn outer_div(self, t: T) -> Self { fn outer_div(self, t: T) -> Self {
self / t self / t
} }
} }
impl<T> Interpolate<T> for Quaternion<T> impl<T> Interpolate<T> for Quaternion<T>
where where
Self: InnerSpace<Scalar = T>, Self: InnerSpace<Scalar = T>,
T: Additive + BaseFloat + One, T: Additive + BaseFloat + One,
{ {
#[inline(always)] #[inline(always)]
fn lerp(a: Self, b: Self, t: T) -> Self { fn lerp(a: Self, b: Self, t: T) -> Self {
a.nlerp(b, t) a.nlerp(b, t)
} }
#[inline(always)] #[inline(always)]
fn cubic_hermite(x: (Self, T), a: (Self, T), b: (Self, T), y: (Self, T), t: T) -> Self { fn cubic_hermite(x: (Self, T), a: (Self, T), b: (Self, T), y: (Self, T), t: T) -> Self {
cubic_hermite_def(x, a, b, y, t) cubic_hermite_def(x, a, b, y, t)
} }
#[inline(always)] #[inline(always)]
fn quadratic_bezier(a: Self, u: Self, b: Self, t: T) -> Self { fn quadratic_bezier(a: Self, u: Self, b: Self, t: T) -> Self {
quadratic_bezier_def(a, u, b, t) quadratic_bezier_def(a, u, b, t)
} }
#[inline(always)] #[inline(always)]
fn cubic_bezier(a: Self, u: Self, v: Self, b: Self, t: T) -> Self { fn cubic_bezier(a: Self, u: Self, v: Self, b: Self, t: T) -> Self {
cubic_bezier_def(a, u, v, b, t) cubic_bezier_def(a, u, v, b, t)
} }
} }

324
src/interpolate.rs
View File

@ -54,23 +54,23 @@ use std::ops::{Add, Mul, Sub};
/// ///
/// [`Spline::sample`]: crate::spline::Spline::sample /// [`Spline::sample`]: crate::spline::Spline::sample
pub trait Interpolate<T>: Sized + Copy + Linear<T> { pub trait Interpolate<T>: Sized + Copy + Linear<T> {
/// Linear interpolation. /// Linear interpolation.
fn lerp(a: Self, b: Self, t: T) -> Self; fn lerp(a: Self, b: Self, t: T) -> Self;
/// Cubic hermite interpolation. /// Cubic hermite interpolation.
/// ///
/// Default to [`lerp`]. /// Default to [`lerp`].
/// ///
/// [`lerp`]: Interpolate::lerp /// [`lerp`]: Interpolate::lerp
fn cubic_hermite(_: (Self, T), a: (Self, T), b: (Self, T), _: (Self, T), t: T) -> Self { fn cubic_hermite(_: (Self, T), a: (Self, T), b: (Self, T), _: (Self, T), t: T) -> Self {
Self::lerp(a.0, b.0, t) Self::lerp(a.0, b.0, t)
} }
/// Quadratic Bézier interpolation. /// Quadratic Bézier interpolation.
fn quadratic_bezier(a: Self, u: Self, b: Self, t: T) -> Self; fn quadratic_bezier(a: Self, u: Self, b: Self, t: T) -> Self;
/// Cubic Bézier interpolation. /// Cubic Bézier interpolation.
fn cubic_bezier(a: Self, u: Self, v: Self, b: Self, t: T) -> Self; fn cubic_bezier(a: Self, u: Self, v: Self, b: Self, t: T) -> Self;
} }
/// Set of types that support additions and subtraction. /// Set of types that support additions and subtraction.
@ -82,44 +82,44 @@ impl<T> Additive for T where T: Copy + Add<Self, Output = Self> + Sub<Self, Outp
/// Set of additive types that support outer multiplication and division, making them linear. /// Set of additive types that support outer multiplication and division, making them linear.
pub trait Linear<T>: Additive { pub trait Linear<T>: Additive {
/// Apply an outer multiplication law. /// Apply an outer multiplication law.
fn outer_mul(self, t: T) -> Self; fn outer_mul(self, t: T) -> Self;
/// Apply an outer division law. /// Apply an outer division law.
fn outer_div(self, t: T) -> Self; fn outer_div(self, t: T) -> Self;
} }
macro_rules! impl_linear_simple { macro_rules! impl_linear_simple {
($t:ty) => { ($t:ty) => {
impl Linear<$t> for $t { impl Linear<$t> for $t {
fn outer_mul(self, t: $t) -> Self { fn outer_mul(self, t: $t) -> Self {
self * t self * t
} }
/// Apply an outer division law. /// Apply an outer division law.
fn outer_div(self, t: $t) -> Self { fn outer_div(self, t: $t) -> Self {
self / t self / t
} }
} }
}; };
} }
impl_linear_simple!(f32); impl_linear_simple!(f32);
impl_linear_simple!(f64); impl_linear_simple!(f64);
macro_rules! impl_linear_cast { macro_rules! impl_linear_cast {
($t:ty, $q:ty) => { ($t:ty, $q:ty) => {
impl Linear<$t> for $q { impl Linear<$t> for $q {
fn outer_mul(self, t: $t) -> Self { fn outer_mul(self, t: $t) -> Self {
self * t as $q self * t as $q
} }
/// Apply an outer division law. /// Apply an outer division law.
fn outer_div(self, t: $t) -> Self { fn outer_div(self, t: $t) -> Self {
self / t as $q self / t as $q
} }
} }
}; };
} }
impl_linear_cast!(f32, f64); impl_linear_cast!(f32, f64);
@ -127,19 +127,19 @@ impl_linear_cast!(f64, f32);
/// Types with a neutral element for multiplication. /// Types with a neutral element for multiplication.
pub trait One { pub trait One {
/// The neutral element for the multiplicative monoid — typically called `1`. /// The neutral element for the multiplicative monoid — typically called `1`.
fn one() -> Self; fn one() -> Self;
} }
macro_rules! impl_one_float { macro_rules! impl_one_float {
($t:ty) => { ($t:ty) => {
impl One for $t { impl One for $t {
#[inline(always)] #[inline(always)]
fn one() -> Self { fn one() -> Self {
1. 1.
} }
} }
}; };
} }
impl_one_float!(f32); impl_one_float!(f32);
@ -147,51 +147,51 @@ impl_one_float!(f64);
/// Types with a sane definition of π and cosine. /// Types with a sane definition of π and cosine.
pub trait Trigo { pub trait Trigo {
/// π. /// π.
fn pi() -> Self; fn pi() -> Self;
/// Cosine of the argument. /// Cosine of the argument.
fn cos(self) -> Self; fn cos(self) -> Self;
} }
impl Trigo for f32 { impl Trigo for f32 {
#[inline(always)] #[inline(always)]
fn pi() -> Self { fn pi() -> Self {
f32::consts::PI f32::consts::PI
}
#[inline(always)]
fn cos(self) -> Self {
#[cfg(feature = "std")]
{
self.cos()
} }
#[inline(always)] #[cfg(not(feature = "std"))]
fn cos(self) -> Self { {
#[cfg(feature = "std")] unsafe { cosf32(self) }
{
self.cos()
}
#[cfg(not(feature = "std"))]
{
unsafe { cosf32(self) }
}
} }
}
} }
impl Trigo for f64 { impl Trigo for f64 {
#[inline(always)] #[inline(always)]
fn pi() -> Self { fn pi() -> Self {
f64::consts::PI f64::consts::PI
}
#[inline(always)]
fn cos(self) -> Self {
#[cfg(feature = "std")]
{
self.cos()
} }
#[inline(always)] #[cfg(not(feature = "std"))]
fn cos(self) -> Self { {
#[cfg(feature = "std")] unsafe { cosf64(self) }
{
self.cos()
}
#[cfg(not(feature = "std"))]
{
unsafe { cosf64(self) }
}
} }
}
} }
/// Default implementation of [`Interpolate::cubic_hermite`]. /// Default implementation of [`Interpolate::cubic_hermite`].
@ -199,28 +199,28 @@ impl Trigo for f64 {
/// `V` is the value being interpolated. `T` is the sampling value (also sometimes called time). /// `V` is the value being interpolated. `T` is the sampling value (also sometimes called time).
pub fn cubic_hermite_def<V, T>(x: (V, T), a: (V, T), b: (V, T), y: (V, T), t: T) -> V pub fn cubic_hermite_def<V, T>(x: (V, T), a: (V, T), b: (V, T), y: (V, T), t: T) -> V
where where
V: Linear<T>, V: Linear<T>,
T: Additive + Mul<T, Output = T> + One, T: Additive + Mul<T, Output = T> + One,
{ {
// some stupid generic constants, because Rust doesn’t have polymorphic literals… // some stupid generic constants, because Rust doesn’t have polymorphic literals…
let one_t = T::one(); let one_t = T::one();
let two_t = one_t + one_t; // lolololol let two_t = one_t + one_t; // lolololol
let three_t = two_t + one_t; // megalol let three_t = two_t + one_t; // megalol
// sampler stuff // sampler stuff
let t2 = t * t; let t2 = t * t;
let t3 = t2 * t; let t3 = t2 * t;
let two_t3 = t3 * two_t; let two_t3 = t3 * two_t;
let three_t2 = t2 * three_t; let three_t2 = t2 * three_t;
// tangents // tangents
let m0 = (b.0 - x.0).outer_div(b.1 - x.1); let m0 = (b.0 - x.0).outer_div(b.1 - x.1);
let m1 = (y.0 - a.0).outer_div(y.1 - a.1); let m1 = (y.0 - a.0).outer_div(y.1 - a.1);
a.0.outer_mul(two_t3 - three_t2 + one_t) a.0.outer_mul(two_t3 - three_t2 + one_t)
+ m0.outer_mul(t3 - t2 * two_t + t) + m0.outer_mul(t3 - t2 * two_t + t)
+ b.0.outer_mul(three_t2 - two_t3) + b.0.outer_mul(three_t2 - two_t3)
+ m1.outer_mul(t3 - t2) + m1.outer_mul(t3 - t2)
} }
/// Default implementation of [`Interpolate::quadratic_bezier`]. /// Default implementation of [`Interpolate::quadratic_bezier`].
@ -228,12 +228,12 @@ where
/// `V` is the value being interpolated. `T` is the sampling value (also sometimes called time). /// `V` is the value being interpolated. `T` is the sampling value (also sometimes called time).
pub fn quadratic_bezier_def<V, T>(a: V, u: V, b: V, t: T) -> V pub fn quadratic_bezier_def<V, T>(a: V, u: V, b: V, t: T) -> V
where where
V: Linear<T>, V: Linear<T>,
T: Additive + Mul<T, Output = T> + One, T: Additive + Mul<T, Output = T> + One,
{ {
let one_t = T::one() - t; let one_t = T::one() - t;
let one_t_2 = one_t * one_t; let one_t_2 = one_t * one_t;
u + (a - u).outer_mul(one_t_2) + (b - u).outer_mul(t * t) u + (a - u).outer_mul(one_t_2) + (b - u).outer_mul(t * t)
} }
/// Default implementation of [`Interpolate::cubic_bezier`]. /// Default implementation of [`Interpolate::cubic_bezier`].
@ -241,83 +241,77 @@ where
/// `V` is the value being interpolated. `T` is the sampling value (also sometimes called time). /// `V` is the value being interpolated. `T` is the sampling value (also sometimes called time).
pub fn cubic_bezier_def<V, T>(a: V, u: V, v: V, b: V, t: T) -> V pub fn cubic_bezier_def<V, T>(a: V, u: V, v: V, b: V, t: T) -> V
where where
V: Linear<T>, V: Linear<T>,
T: Additive + Mul<T, Output = T> + One, T: Additive + Mul<T, Output = T> + One,
{ {
let one_t = T::one() - t; let one_t = T::one() - t;
let one_t_2 = one_t * one_t; let one_t_2 = one_t * one_t;
let one_t_3 = one_t_2 * one_t; let one_t_3 = one_t_2 * one_t;
let three = T::one() + T::one() + T::one(); let three = T::one() + T::one() + T::one();
a.outer_mul(one_t_3) a.outer_mul(one_t_3)
+ u.outer_mul(three * one_t_2 * t) + u.outer_mul(three * one_t_2 * t)
+ v.outer_mul(three * one_t * t * t) + v.outer_mul(three * one_t * t * t)
+ b.outer_mul(t * t * t) + b.outer_mul(t * t * t)
} }
macro_rules! impl_interpolate_simple { macro_rules! impl_interpolate_simple {
($t:ty) => { ($t:ty) => {
impl Interpolate<$t> for $t { impl Interpolate<$t> for $t {
fn lerp(a: Self, b: Self, t: $t) -> Self { fn lerp(a: Self, b: Self, t: $t) -> Self {
a * (1. - t) + b * t a * (1. - t) + b * t
} }
fn cubic_hermite( fn cubic_hermite(x: (Self, $t), a: (Self, $t), b: (Self, $t), y: (Self, $t), t: $t) -> Self {
x: (Self, $t), cubic_hermite_def(x, a, b, y, t)
a: (Self, $t), }
b: (Self, $t),
y: (Self, $t),
t: $t,
) -> Self {
cubic_hermite_def(x, a, b, y, t)
}
fn quadratic_bezier(a: Self, u: Self, b: Self, t: $t) -> Self { fn quadratic_bezier(a: Self, u: Self, b: Self, t: $t) -> Self {
quadratic_bezier_def(a, u, b, t) quadratic_bezier_def(a, u, b, t)
} }
fn cubic_bezier(a: Self, u: Self, v: Self, b: Self, t: $t) -> Self { fn cubic_bezier(a: Self, u: Self, v: Self, b: Self, t: $t) -> Self {
cubic_bezier_def(a, u, v, b, t) cubic_bezier_def(a, u, v, b, t)
} }
} }
}; };
} }
impl_interpolate_simple!(f32); impl_interpolate_simple!(f32);
impl_interpolate_simple!(f64); impl_interpolate_simple!(f64);
macro_rules! impl_interpolate_via { macro_rules! impl_interpolate_via {
($t:ty, $v:ty) => { ($t:ty, $v:ty) => {
impl Interpolate<$t> for $v { impl Interpolate<$t> for $v {
fn lerp(a: Self, b: Self, t: $t) -> Self { fn lerp(a: Self, b: Self, t: $t) -> Self {
a * (1. - t as $v) + b * t as $v a * (1. - t as $v) + b * t as $v
} }
fn cubic_hermite( fn cubic_hermite(
(x, xt): (Self, $t), (x, xt): (Self, $t),
(a, at): (Self, $t), (a, at): (Self, $t),
(b, bt): (Self, $t), (b, bt): (Self, $t),
(y, yt): (Self, $t), (y, yt): (Self, $t),
t: $t, t: $t,
) -> Self { ) -> Self {
cubic_hermite_def( cubic_hermite_def(
(x, xt as $v), (x, xt as $v),
(a, at as $v), (a, at as $v),
(b, bt as $v), (b, bt as $v),
(y, yt as $v), (y, yt as $v),
t as $v, t as $v,
) )
} }
fn quadratic_bezier(a: Self, u: Self, b: Self, t: $t) -> Self { fn quadratic_bezier(a: Self, u: Self, b: Self, t: $t) -> Self {
quadratic_bezier_def(a, u, b, t as $v) quadratic_bezier_def(a, u, b, t as $v)
} }
fn cubic_bezier(a: Self, u: Self, v: Self, b: Self, t: $t) -> Self { fn cubic_bezier(a: Self, u: Self, v: Self, b: Self, t: $t) -> Self {
cubic_bezier_def(a, u, v, b, t as $v) cubic_bezier_def(a, u, v, b, t as $v)
} }
} }
}; };
} }
impl_interpolate_via!(f32, f64); impl_interpolate_via!(f32, f64);

98
src/interpolation.rs
View File

@ -10,56 +10,56 @@ use serde_derive::{Deserialize, Serialize};
#[cfg_attr(feature = "serialization", derive(Deserialize, Serialize))] #[cfg_attr(feature = "serialization", derive(Deserialize, Serialize))]
#[cfg_attr(feature = "serialization", serde(rename_all = "snake_case"))] #[cfg_attr(feature = "serialization", serde(rename_all = "snake_case"))]
pub enum Interpolation<T, V> { pub enum Interpolation<T, V> {
/// Hold a [`Key`] until the sampling value passes the normalized step threshold, in which /// Hold a [`Key`] until the sampling value passes the normalized step threshold, in which
/// case the next key is used. /// 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 /// > 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 /// > 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 /// > first key will be kept until the next key. Set it to `0.` and the first key will never be
/// > used. /// > used.
/// ///
/// [`Key`]: crate::key::Key /// [`Key`]: crate::key::Key
Step(T), Step(T),
/// Linear interpolation between a key and the next one. /// Linear interpolation between a key and the next one.
Linear, Linear,
/// Cosine interpolation between a key and the next one. /// Cosine interpolation between a key and the next one.
Cosine, Cosine,
/// Catmull-Rom interpolation, performing a cubic Hermite interpolation using four keys. /// Catmull-Rom interpolation, performing a cubic Hermite interpolation using four keys.
CatmullRom, CatmullRom,
/// Bézier interpolation. /// Bézier interpolation.
/// ///
/// A control point that uses such an interpolation is associated with an extra point. The segmant /// 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 /// 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 /// this control point and the next one will be interpolated across with Bézier interpolation. Two
/// cases are possible: /// cases are possible:
/// ///
/// - The next control point also has a Bézier interpolation mode. In this case, its tangent is /// - 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 /// used for the interpolation process. This is called _cubic Bézier interpolation_ and it
/// kicks ass. /// kicks ass.
/// - The next control point doesn’t have a Bézier interpolation mode set. In this case, the /// - 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 /// 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 /// 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. /// interpolation_ and it kicks ass too, but a bit less than cubic.
Bezier(V), Bezier(V),
/// A special Bézier interpolation using an _input tangent_ and an _output tangent_. /// 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 /// 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 /// 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. /// 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, /// 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 /// 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. /// control on the tangents but might generate discontinuities. Use with care.
/// ///
/// Stroke Bézier interpolation is always a cubic Bézier interpolation by default. /// Stroke Bézier interpolation is always a cubic Bézier interpolation by default.
StrokeBezier(V, V), StrokeBezier(V, V),
#[doc(hidden)] #[doc(hidden)]
__NonExhaustive, __NonExhaustive,
} }
impl<T, V> Default for Interpolation<T, V> { impl<T, V> Default for Interpolation<T, V> {
/// [`Interpolation::Linear`] is the default. /// [`Interpolation::Linear`] is the default.
fn default() -> Self { fn default() -> Self {
Interpolation::Linear Interpolation::Linear
} }
} }

34
src/iter.rs
View File

@ -13,32 +13,32 @@ use crate::{Key, Spline};
/// This iterator type is guaranteed to iterate over sorted keys. /// This iterator type is guaranteed to iterate over sorted keys.
pub struct Iter<'a, T, V> pub struct Iter<'a, T, V>
where where
T: 'a, T: 'a,
V: 'a, V: 'a,
{ {
spline: &'a Spline<T, V>, spline: &'a Spline<T, V>,
i: usize, i: usize,
} }
impl<'a, T, V> Iterator for Iter<'a, T, V> { impl<'a, T, V> Iterator for Iter<'a, T, V> {
type Item = &'a Key<T, V>; type Item = &'a Key<T, V>;
fn next(&mut self) -> Option<Self::Item> { fn next(&mut self) -> Option<Self::Item> {
let r = self.spline.0.get(self.i); let r = self.spline.0.get(self.i);
if let Some(_) = r { if let Some(_) = r {
self.i += 1; self.i += 1;
}
r
} }
r
}
} }
impl<'a, T, V> IntoIterator for &'a Spline<T, V> { impl<'a, T, V> IntoIterator for &'a Spline<T, V> {
type Item = &'a Key<T, V>; type Item = &'a Key<T, V>;
type IntoIter = Iter<'a, T, V>; type IntoIter = Iter<'a, T, V>;
fn into_iter(self) -> Self::IntoIter { fn into_iter(self) -> Self::IntoIter {
Iter { spline: self, i: 0 } Iter { spline: self, i: 0 }
} }
} }

26
src/key.rs
View File

@ -22,21 +22,21 @@ use crate::interpolation::Interpolation;
#[cfg_attr(feature = "serialization", derive(Deserialize, Serialize))] #[cfg_attr(feature = "serialization", derive(Deserialize, Serialize))]
#[cfg_attr(feature = "serialization", serde(rename_all = "snake_case"))] #[cfg_attr(feature = "serialization", serde(rename_all = "snake_case"))]
pub struct Key<T, V> { pub struct Key<T, V> {
/// Interpolation parameter at which the [`Key`] should be reached. /// Interpolation parameter at which the [`Key`] should be reached.
pub t: T, pub t: T,
/// Carried value. /// Carried value.
pub value: V, pub value: V,
/// Interpolation mode. /// Interpolation mode.
pub interpolation: Interpolation<T, V>, pub interpolation: Interpolation<T, V>,
} }
impl<T, V> Key<T, V> { impl<T, V> Key<T, V> {
/// Create a new key. /// Create a new key.
pub fn new(t: T, value: V, interpolation: Interpolation<T, V>) -> Self { pub fn new(t: T, value: V, interpolation: Interpolation<T, V>) -> Self {
Key { Key {
t, t,
value, value,
interpolation, interpolation,
}
} }
}
} }

2
src/nalgebra.rs
View File

@ -4,7 +4,7 @@ use num_traits as nt;
use std::ops::Mul; use std::ops::Mul;
use crate::interpolate::{ use crate::interpolate::{
cubic_bezier_def, cubic_hermite_def, quadratic_bezier_def, Additive, Interpolate, Linear, One, cubic_bezier_def, cubic_hermite_def, quadratic_bezier_def, Additive, Interpolate, Linear, One,
}; };
macro_rules! impl_interpolate_vector { macro_rules! impl_interpolate_vector {

547
src/spline.rs
View File

@ -34,268 +34,265 @@ use crate::key::Key;
pub struct Spline<T, V>(pub(crate) Vec<Key<T, V>>); pub struct Spline<T, V>(pub(crate) Vec<Key<T, V>>);
impl<T, V> Spline<T, V> { impl<T, V> Spline<T, V> {
/// Internal sort to ensure invariant of sorting keys is valid. /// Internal sort to ensure invariant of sorting keys is valid.
fn internal_sort(&mut self) fn internal_sort(&mut self)
where where
T: PartialOrd, T: PartialOrd,
{ {
self.0 self
.sort_by(|k0, k1| k0.t.partial_cmp(&k1.t).unwrap_or(Ordering::Less)); .0
} .sort_by(|k0, k1| k0.t.partial_cmp(&k1.t).unwrap_or(Ordering::Less));
}
/// Create a new spline out of keys. The keys don’t have to be sorted even though it’s recommended /// 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). /// to provide ascending sorted ones (for performance purposes).
pub fn from_vec(keys: Vec<Key<T, V>>) -> Self pub fn from_vec(keys: Vec<Key<T, V>>) -> Self
where where
T: PartialOrd, T: PartialOrd,
{ {
let mut spline = Spline(keys); let mut spline = Spline(keys);
spline.internal_sort(); spline.internal_sort();
spline spline
} }
/// Create a new spline by consuming an `Iterater<Item = Key<T>>`. They keys don’t have to be /// Create a new spline by consuming an `Iterater<Item = Key<T>>`. They keys don’t have to be
/// sorted. /// sorted.
/// ///
/// # Note on iterators /// # Note on iterators
/// ///
/// It’s valid to use any iterator that implements `Iterator<Item = Key<T>>`. However, you should /// 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`]. /// use [`Spline::from_vec`] if you are passing a [`Vec`].
pub fn from_iter<I>(iter: I) -> Self pub fn from_iter<I>(iter: I) -> Self
where where
I: Iterator<Item = Key<T, V>>, I: Iterator<Item = Key<T, V>>,
T: PartialOrd, T: PartialOrd,
{ {
Self::from_vec(iter.collect()) Self::from_vec(iter.collect())
} }
/// Retrieve the keys of a spline. /// Retrieve the keys of a spline.
pub fn keys(&self) -> &[Key<T, V>] { pub fn keys(&self) -> &[Key<T, V>] {
&self.0 &self.0
} }
/// Number of keys. /// Number of keys.
#[inline(always)] #[inline(always)]
pub fn len(&self) -> usize { pub fn len(&self) -> usize {
self.0.len() self.0.len()
} }
/// Check whether the spline has no key. /// Check whether the spline has no key.
#[inline(always)] #[inline(always)]
pub fn is_empty(&self) -> bool { pub fn is_empty(&self) -> bool {
self.0.is_empty() self.0.is_empty()
} }
/// Sample a spline at a given time, returning the interpolated value along with its associated /// Sample a spline at a given time, returning the interpolated value along with its associated
/// key. /// key.
/// ///
/// The current implementation, based on immutability, cannot perform in constant time. This means /// 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)* /// 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, /// 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. /// an implementation for a dedicated type is foreseen yet not started yet.
/// ///
/// # Return /// # Return
/// ///
/// `None` if you try to sample a value at a time that has no key associated with. That can also /// `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 /// 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 /// 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 /// you’re near the beginning of the spline or its end, ensure you have enough keys around to make
/// the sampling. /// the sampling.
pub fn sample_with_key(&self, t: T) -> Option<(V, &Key<T, V>, Option<&Key<T, V>>)> pub fn sample_with_key(&self, t: T) -> Option<(V, &Key<T, V>, Option<&Key<T, V>>)>
where where
T: Additive + One + Trigo + Mul<T, Output = T> + Div<T, Output = T> + PartialOrd, T: Additive + One + Trigo + Mul<T, Output = T> + Div<T, Output = T> + PartialOrd,
V: Additive + Interpolate<T>, V: Additive + Interpolate<T>,
{ {
let keys = &self.0; let keys = &self.0;
let i = search_lower_cp(keys, t)?; let i = search_lower_cp(keys, t)?;
let cp0 = &keys[i]; let cp0 = &keys[i];
match cp0.interpolation { match cp0.interpolation {
Interpolation::Step(threshold) => { Interpolation::Step(threshold) => {
let cp1 = &keys[i + 1]; let cp1 = &keys[i + 1];
let nt = normalize_time(t, cp0, cp1); let nt = normalize_time(t, cp0, cp1);
let value = if nt < threshold { cp0.value } else { cp1.value }; let value = if nt < threshold { cp0.value } else { cp1.value };
Some((value, cp0, Some(cp1))) Some((value, cp0, Some(cp1)))
} }
Interpolation::Linear => { Interpolation::Linear => {
let cp1 = &keys[i + 1]; let cp1 = &keys[i + 1];
let nt = normalize_time(t, cp0, cp1); let nt = normalize_time(t, cp0, cp1);
let value = Interpolate::lerp(cp0.value, cp1.value, nt); let value = Interpolate::lerp(cp0.value, cp1.value, nt);
Some((value, cp0, Some(cp1))) Some((value, cp0, Some(cp1)))
} }
Interpolation::Cosine => { Interpolation::Cosine => {
let two_t = T::one() + T::one(); let two_t = T::one() + T::one();
let cp1 = &keys[i + 1]; let cp1 = &keys[i + 1];
let nt = normalize_time(t, cp0, cp1); let nt = normalize_time(t, cp0, cp1);
let cos_nt = (T::one() - (nt * T::pi()).cos()) / two_t; let cos_nt = (T::one() - (nt * T::pi()).cos()) / two_t;
let value = Interpolate::lerp(cp0.value, cp1.value, cos_nt); let value = Interpolate::lerp(cp0.value, cp1.value, cos_nt);
Some((value, cp0, Some(cp1))) Some((value, cp0, Some(cp1)))
} }
Interpolation::CatmullRom => { Interpolation::CatmullRom => {
// We need at least four points for Catmull Rom; ensure we have them, otherwise, return // We need at least four points for Catmull Rom; ensure we have them, otherwise, return
// None. // None.
if i == 0 || i >= keys.len() - 2 { if i == 0 || i >= keys.len() - 2 {
None None
} else {
let cp1 = &keys[i + 1];
let cpm0 = &keys[i - 1];
let cpm1 = &keys[i + 2];
let nt = normalize_time(t, cp0, cp1);
let value = Interpolate::cubic_hermite(
(cpm0.value, cpm0.t),
(cp0.value, cp0.t),
(cp1.value, cp1.t),
(cpm1.value, cpm1.t),
nt,
);
Some((value, cp0, Some(cp1)))
}
}
Interpolation::Bezier(u) | Interpolation::StrokeBezier(_, u) => {
// We need to check the next control point to see whether we want quadratic or cubic Bezier.
let cp1 = &keys[i + 1];
let nt = normalize_time(t, cp0, cp1);
let value = match cp1.interpolation {
Interpolation::Bezier(v) => Interpolate::cubic_bezier(
cp0.value,
u,
cp1.value + cp1.value - v,
cp1.value,
nt,
),
Interpolation::StrokeBezier(v, _) => {
Interpolate::cubic_bezier(cp0.value, u, v, cp1.value, nt)
}
_ => Interpolate::quadratic_bezier(cp0.value, u, cp1.value, nt),
};
Some((value, cp0, Some(cp1)))
}
Interpolation::__NonExhaustive => unreachable!(),
}
}
/// Sample a spline at a given time.
///
pub fn sample(&self, t: T) -> Option<V>
where
T: Additive + One + Trigo + Mul<T, Output = T> + Div<T, Output = T> + PartialOrd,
V: Additive + Interpolate<T>,
{
self.sample_with_key(t).map(|(v, _, _)| v)
}
/// 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_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: Additive + Interpolate<T>,
{
if self.0.is_empty() {
return None;
}
self.sample_with_key(t).or_else(move || {
let first = self.0.first().unwrap();
if t <= first.t {
let second = if self.0.len() >= 2 {
Some(&self.0[1])
} else {
None
};
Some((first.value, &first, second))
} else {
let last = self.0.last().unwrap();
if t >= last.t {
Some((last.value, &last, None))
} else {
None
}
}
})
}
/// Sample a spline at a given time with clamping.
pub fn clamped_sample(&self, t: T) -> Option<V>
where
T: Additive + One + Trigo + Mul<T, Output = T> + Div<T, Output = T> + PartialOrd,
V: Additive + Interpolate<T>,
{
self.clamped_sample_with_key(t).map(|(v, _, _)| v)
}
/// Add a key into the spline.
pub fn add(&mut self, key: Key<T, V>)
where
T: PartialOrd,
{
self.0.push(key);
self.internal_sort();
}
/// Remove a key from the spline.
pub fn remove(&mut self, index: usize) -> Option<Key<T, V>> {
if index >= self.0.len() {
None
} else { } else {
Some(self.0.remove(index)) let cp1 = &keys[i + 1];
let cpm0 = &keys[i - 1];
let cpm1 = &keys[i + 2];
let nt = normalize_time(t, cp0, cp1);
let value = Interpolate::cubic_hermite(
(cpm0.value, cpm0.t),
(cp0.value, cp0.t),
(cp1.value, cp1.t),
(cpm1.value, cpm1.t),
nt,
);
Some((value, cp0, Some(cp1)))
} }
}
Interpolation::Bezier(u) | Interpolation::StrokeBezier(_, u) => {
// We need to check the next control point to see whether we want quadratic or cubic Bezier.
let cp1 = &keys[i + 1];
let nt = normalize_time(t, cp0, cp1);
let value = match cp1.interpolation {
Interpolation::Bezier(v) => {
Interpolate::cubic_bezier(cp0.value, u, cp1.value + cp1.value - v, cp1.value, nt)
}
Interpolation::StrokeBezier(v, _) => {
Interpolate::cubic_bezier(cp0.value, u, v, cp1.value, nt)
}
_ => Interpolate::quadratic_bezier(cp0.value, u, cp1.value, nt),
};
Some((value, cp0, Some(cp1)))
}
Interpolation::__NonExhaustive => unreachable!(),
}
}
/// Sample a spline at a given time.
///
pub fn sample(&self, t: T) -> Option<V>
where
T: Additive + One + Trigo + Mul<T, Output = T> + Div<T, Output = T> + PartialOrd,
V: Additive + Interpolate<T>,
{
self.sample_with_key(t).map(|(v, _, _)| v)
}
/// 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_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: Additive + Interpolate<T>,
{
if self.0.is_empty() {
return None;
} }
/// Update a key and return the key already present. self.sample_with_key(t).or_else(move || {
/// let first = self.0.first().unwrap();
/// The key is updated — if present — with the provided function. if t <= first.t {
/// let second = if self.0.len() >= 2 {
/// # Notes Some(&self.0[1])
/// } else {
/// That function makes sense only if you want to change the interpolator (i.e. [`Key::t`]) of None
/// 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. Some((first.value, &first, second))
pub fn replace<F>(&mut self, index: usize, f: F) -> Option<Key<T, V>> } else {
where let last = self.0.last().unwrap();
F: FnOnce(&Key<T, V>) -> Key<T, V>,
T: PartialOrd,
{
let key = self.remove(index)?;
self.add(f(&key));
Some(key)
}
/// Get a key at a given index. if t >= last.t {
pub fn get(&self, index: usize) -> Option<&Key<T, V>> { Some((last.value, &last, None))
self.0.get(index) } else {
} None
}
}
})
}
/// Mutably get a key at a given index. /// Sample a spline at a given time with clamping.
pub fn get_mut(&mut self, index: usize) -> Option<KeyMut<T, V>> { pub fn clamped_sample(&self, t: T) -> Option<V>
self.0.get_mut(index).map(|key| KeyMut { where
value: &mut key.value, T: Additive + One + Trigo + Mul<T, Output = T> + Div<T, Output = T> + PartialOrd,
interpolation: &mut key.interpolation, V: Additive + Interpolate<T>,
}) {
self.clamped_sample_with_key(t).map(|(v, _, _)| v)
}
/// Add a key into the spline.
pub fn add(&mut self, key: Key<T, V>)
where
T: PartialOrd,
{
self.0.push(key);
self.internal_sort();
}
/// Remove a key from the spline.
pub fn remove(&mut self, index: usize) -> Option<Key<T, V>> {
if index >= self.0.len() {
None
} else {
Some(self.0.remove(index))
} }
}
/// 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 replace<F>(&mut self, index: usize, f: F) -> Option<Key<T, V>>
where
F: FnOnce(&Key<T, V>) -> Key<T, V>,
T: PartialOrd,
{
let key = self.remove(index)?;
self.add(f(&key));
Some(key)
}
/// Get a key at a given index.
pub fn get(&self, index: usize) -> Option<&Key<T, V>> {
self.0.get(index)
}
/// Mutably get a key at a given index.
pub fn get_mut(&mut self, index: usize) -> Option<KeyMut<T, V>> {
self.0.get_mut(index).map(|key| KeyMut {
value: &mut key.value,
interpolation: &mut key.interpolation,
})
}
} }
/// A mutable [`Key`]. /// A mutable [`Key`].
@ -304,54 +301,54 @@ impl<T, V> Spline<T, V> {
/// interpolator value as it would invalidate the internal structure of the [`Spline`]. If you /// interpolator value as it would invalidate the internal structure of the [`Spline`]. If you
/// want to achieve this, you’re advised to use [`Spline::replace`]. /// want to achieve this, you’re advised to use [`Spline::replace`].
pub struct KeyMut<'a, T, V> { pub struct KeyMut<'a, T, V> {
/// Carried value. /// Carried value.
pub value: &'a mut V, pub value: &'a mut V,
/// Interpolation mode to use for that key. /// Interpolation mode to use for that key.
pub interpolation: &'a mut Interpolation<T, V>, pub interpolation: &'a mut Interpolation<T, V>,
} }
// Normalize a time ([0;1]) given two control points. // Normalize a time ([0;1]) given two control points.
#[inline(always)] #[inline(always)]
pub(crate) fn normalize_time<T, V>(t: T, cp: &Key<T, V>, cp1: &Key<T, V>) -> T pub(crate) fn normalize_time<T, V>(t: T, cp: &Key<T, V>, cp1: &Key<T, V>) -> T
where where
T: Additive + Div<T, Output = T> + PartialEq, T: Additive + Div<T, Output = T> + PartialEq,
{ {
assert!(cp1.t != cp.t, "overlapping keys"); assert!(cp1.t != cp.t, "overlapping keys");
(t - cp.t) / (cp1.t - cp.t) (t - cp.t) / (cp1.t - cp.t)
} }
// Find the lower control point corresponding to a given time. // Find the lower control point corresponding to a given time.
fn search_lower_cp<T, V>(cps: &[Key<T, V>], t: T) -> Option<usize> fn search_lower_cp<T, V>(cps: &[Key<T, V>], t: T) -> Option<usize>
where where
T: PartialOrd, T: PartialOrd,
{ {
let mut i = 0; let mut i = 0;
let len = cps.len(); let len = cps.len();
if len < 2 { if len < 2 {
return None;
}
loop {
let cp = &cps[i];
let cp1 = &cps[i + 1];
if t >= cp1.t {
if i >= len - 2 {
return None; return None;
}
i += 1;
} else if t < cp.t {
if i == 0 {
return None;
}
i -= 1;
} else {
break; // found
} }
}
loop { Some(i)
let cp = &cps[i];
let cp1 = &cps[i + 1];
if t >= cp1.t {
if i >= len - 2 {
return None;
}
i += 1;
} else if t < cp.t {
if i == 0 {
return None;
}
i -= 1;
} else {
break; // found
}
}
Some(i)
} }

336
tests/mod.rs
View File

@ -7,249 +7,249 @@ use nalgebra as na;
#[test] #[test]
fn step_interpolation_f32() { fn step_interpolation_f32() {
let start = Key::new(0., 0., Interpolation::Step(0.)); let start = Key::new(0., 0., Interpolation::Step(0.));
let end = Key::new(1., 10., Interpolation::default()); let end = Key::new(1., 10., Interpolation::default());
let spline = Spline::<f32, _>::from_vec(vec![start, end]); let spline = Spline::<f32, _>::from_vec(vec![start, end]);
assert_eq!(spline.sample(0.), Some(10.)); assert_eq!(spline.sample(0.), Some(10.));
assert_eq!(spline.sample(0.1), Some(10.)); assert_eq!(spline.sample(0.1), Some(10.));
assert_eq!(spline.sample(0.2), Some(10.)); assert_eq!(spline.sample(0.2), Some(10.));
assert_eq!(spline.sample(0.5), Some(10.)); assert_eq!(spline.sample(0.5), Some(10.));
assert_eq!(spline.sample(0.9), Some(10.)); assert_eq!(spline.sample(0.9), Some(10.));
assert_eq!(spline.sample(1.), None); assert_eq!(spline.sample(1.), None);
assert_eq!(spline.clamped_sample(1.), Some(10.)); assert_eq!(spline.clamped_sample(1.), Some(10.));
assert_eq!(spline.sample_with_key(0.2), Some((10., &start, Some(&end)))); assert_eq!(spline.sample_with_key(0.2), Some((10., &start, Some(&end))));
assert_eq!(spline.clamped_sample_with_key(1.), Some((10., &end, None))); assert_eq!(spline.clamped_sample_with_key(1.), Some((10., &end, None)));
} }
#[test] #[test]
fn step_interpolation_f64() { fn step_interpolation_f64() {
let start = Key::new(0., 0., Interpolation::Step(0.)); let start = Key::new(0., 0., Interpolation::Step(0.));
let end = Key::new(1., 10., Interpolation::default()); let end = Key::new(1., 10., Interpolation::default());
let spline = Spline::<f64, _>::from_vec(vec![start, end]); let spline = Spline::<f64, _>::from_vec(vec![start, end]);
assert_eq!(spline.sample(0.), Some(10.)); assert_eq!(spline.sample(0.), Some(10.));
assert_eq!(spline.sample(0.1), Some(10.)); assert_eq!(spline.sample(0.1), Some(10.));
assert_eq!(spline.sample(0.2), Some(10.)); assert_eq!(spline.sample(0.2), Some(10.));
assert_eq!(spline.sample(0.5), Some(10.)); assert_eq!(spline.sample(0.5), Some(10.));
assert_eq!(spline.sample(0.9), Some(10.)); assert_eq!(spline.sample(0.9), Some(10.));
assert_eq!(spline.sample(1.), None); assert_eq!(spline.sample(1.), None);
assert_eq!(spline.clamped_sample(1.), Some(10.)); assert_eq!(spline.clamped_sample(1.), Some(10.));
assert_eq!(spline.sample_with_key(0.2), Some((10., &start, Some(&end)))); assert_eq!(spline.sample_with_key(0.2), Some((10., &start, Some(&end))));
assert_eq!(spline.clamped_sample_with_key(1.), Some((10., &end, None))); assert_eq!(spline.clamped_sample_with_key(1.), Some((10., &end, None)));
} }
#[test] #[test]
fn step_interpolation_0_5() { fn step_interpolation_0_5() {
let start = Key::new(0., 0., Interpolation::Step(0.5)); let start = Key::new(0., 0., Interpolation::Step(0.5));
let end = Key::new(1., 10., Interpolation::default()); let end = Key::new(1., 10., Interpolation::default());
let spline = Spline::from_vec(vec![start, end]); let spline = Spline::from_vec(vec![start, end]);
assert_eq!(spline.sample(0.), Some(0.)); assert_eq!(spline.sample(0.), Some(0.));
assert_eq!(spline.sample(0.1), Some(0.)); assert_eq!(spline.sample(0.1), Some(0.));
assert_eq!(spline.sample(0.2), Some(0.)); assert_eq!(spline.sample(0.2), Some(0.));
assert_eq!(spline.sample(0.5), Some(10.)); assert_eq!(spline.sample(0.5), Some(10.));
assert_eq!(spline.sample(0.9), Some(10.)); assert_eq!(spline.sample(0.9), Some(10.));
assert_eq!(spline.sample(1.), None); assert_eq!(spline.sample(1.), None);
assert_eq!(spline.clamped_sample(1.), Some(10.)); assert_eq!(spline.clamped_sample(1.), Some(10.));
} }
#[test] #[test]
fn step_interpolation_0_75() { fn step_interpolation_0_75() {
let start = Key::new(0., 0., Interpolation::Step(0.75)); let start = Key::new(0., 0., Interpolation::Step(0.75));
let end = Key::new(1., 10., Interpolation::default()); let end = Key::new(1., 10., Interpolation::default());
let spline = Spline::from_vec(vec![start, end]); let spline = Spline::from_vec(vec![start, end]);
assert_eq!(spline.sample(0.), Some(0.)); assert_eq!(spline.sample(0.), Some(0.));
assert_eq!(spline.sample(0.1), Some(0.)); assert_eq!(spline.sample(0.1), Some(0.));
assert_eq!(spline.sample(0.2), Some(0.)); assert_eq!(spline.sample(0.2), Some(0.));
assert_eq!(spline.sample(0.5), Some(0.)); assert_eq!(spline.sample(0.5), Some(0.));
assert_eq!(spline.sample(0.9), Some(10.)); assert_eq!(spline.sample(0.9), Some(10.));
assert_eq!(spline.sample(1.), None); assert_eq!(spline.sample(1.), None);
assert_eq!(spline.clamped_sample(1.), Some(10.)); assert_eq!(spline.clamped_sample(1.), Some(10.));
} }
#[test] #[test]
fn step_interpolation_1() { fn step_interpolation_1() {
let start = Key::new(0., 0., Interpolation::Step(1.)); let start = Key::new(0., 0., Interpolation::Step(1.));
let end = Key::new(1., 10., Interpolation::default()); let end = Key::new(1., 10., Interpolation::default());
let spline = Spline::from_vec(vec![start, end]); let spline = Spline::from_vec(vec![start, end]);
assert_eq!(spline.sample(0.), Some(0.)); assert_eq!(spline.sample(0.), Some(0.));
assert_eq!(spline.sample(0.1), Some(0.)); assert_eq!(spline.sample(0.1), Some(0.));
assert_eq!(spline.sample(0.2), Some(0.)); assert_eq!(spline.sample(0.2), Some(0.));
assert_eq!(spline.sample(0.5), Some(0.)); assert_eq!(spline.sample(0.5), Some(0.));
assert_eq!(spline.sample(0.9), Some(0.)); assert_eq!(spline.sample(0.9), Some(0.));
assert_eq!(spline.sample(1.), None); assert_eq!(spline.sample(1.), None);
assert_eq!(spline.clamped_sample(1.), Some(10.)); assert_eq!(spline.clamped_sample(1.), Some(10.));
} }
#[test] #[test]
fn linear_interpolation() { fn linear_interpolation() {
let start = Key::new(0., 0., Interpolation::Linear); let start = Key::new(0., 0., Interpolation::Linear);
let end = Key::new(1., 10., Interpolation::default()); let end = Key::new(1., 10., Interpolation::default());
let spline = Spline::from_vec(vec![start, end]); let spline = Spline::from_vec(vec![start, end]);
assert_eq!(spline.sample(0.), Some(0.)); assert_eq!(spline.sample(0.), Some(0.));
assert_eq!(spline.sample(0.1), Some(1.)); assert_eq!(spline.sample(0.1), Some(1.));
assert_eq!(spline.sample(0.2), Some(2.)); assert_eq!(spline.sample(0.2), Some(2.));
assert_eq!(spline.sample(0.5), Some(5.)); assert_eq!(spline.sample(0.5), Some(5.));
assert_eq!(spline.sample(0.9), Some(9.)); assert_eq!(spline.sample(0.9), Some(9.));
assert_eq!(spline.sample(1.), None); assert_eq!(spline.sample(1.), None);
assert_eq!(spline.clamped_sample(1.), Some(10.)); assert_eq!(spline.clamped_sample(1.), Some(10.));
} }
#[test] #[test]
fn linear_interpolation_several_keys() { fn linear_interpolation_several_keys() {
let start = Key::new(0., 0., Interpolation::Linear); let start = Key::new(0., 0., Interpolation::Linear);
let k1 = Key::new(1., 5., Interpolation::Linear); let k1 = Key::new(1., 5., Interpolation::Linear);
let k2 = Key::new(2., 0., Interpolation::Linear); let k2 = Key::new(2., 0., Interpolation::Linear);
let k3 = Key::new(3., 1., Interpolation::Linear); let k3 = Key::new(3., 1., Interpolation::Linear);
let k4 = Key::new(10., 2., Interpolation::Linear); let k4 = Key::new(10., 2., Interpolation::Linear);
let end = Key::new(11., 4., Interpolation::default()); let end = Key::new(11., 4., Interpolation::default());
let spline = Spline::from_vec(vec![start, k1, k2, k3, k4, end]); let spline = Spline::from_vec(vec![start, k1, k2, k3, k4, end]);
assert_eq!(spline.sample(0.), Some(0.)); assert_eq!(spline.sample(0.), Some(0.));
assert_eq!(spline.sample(0.1), Some(0.5)); assert_eq!(spline.sample(0.1), Some(0.5));
assert_eq!(spline.sample(0.2), Some(1.)); assert_eq!(spline.sample(0.2), Some(1.));
assert_eq!(spline.sample(0.5), Some(2.5)); assert_eq!(spline.sample(0.5), Some(2.5));
assert_eq!(spline.sample(0.9), Some(4.5)); assert_eq!(spline.sample(0.9), Some(4.5));
assert_eq!(spline.sample(1.), Some(5.)); assert_eq!(spline.sample(1.), Some(5.));
assert_eq!(spline.sample(1.5), Some(2.5)); assert_eq!(spline.sample(1.5), Some(2.5));
assert_eq!(spline.sample(2.), Some(0.)); assert_eq!(spline.sample(2.), Some(0.));
assert_eq!(spline.sample(2.75), Some(0.75)); assert_eq!(spline.sample(2.75), Some(0.75));
assert_eq!(spline.sample(3.), Some(1.)); assert_eq!(spline.sample(3.), Some(1.));
assert_eq!(spline.sample(6.5), Some(1.5)); assert_eq!(spline.sample(6.5), Some(1.5));
assert_eq!(spline.sample(10.), Some(2.)); assert_eq!(spline.sample(10.), Some(2.));
assert_eq!(spline.clamped_sample(11.), Some(4.)); assert_eq!(spline.clamped_sample(11.), Some(4.));
} }
#[test] #[test]
fn several_interpolations_several_keys() { fn several_interpolations_several_keys() {
let start = Key::new(0., 0., Interpolation::Step(0.5)); let start = Key::new(0., 0., Interpolation::Step(0.5));
let k1 = Key::new(1., 5., Interpolation::Linear); let k1 = Key::new(1., 5., Interpolation::Linear);
let k2 = Key::new(2., 0., Interpolation::Step(0.1)); let k2 = Key::new(2., 0., Interpolation::Step(0.1));
let k3 = Key::new(3., 1., Interpolation::Linear); let k3 = Key::new(3., 1., Interpolation::Linear);
let k4 = Key::new(10., 2., Interpolation::Linear); let k4 = Key::new(10., 2., Interpolation::Linear);
let end = Key::new(11., 4., Interpolation::default()); let end = Key::new(11., 4., Interpolation::default());
let spline = Spline::from_vec(vec![start, k1, k2, k3, k4, end]); let spline = Spline::from_vec(vec![start, k1, k2, k3, k4, end]);
assert_eq!(spline.sample(0.), Some(0.)); assert_eq!(spline.sample(0.), Some(0.));
assert_eq!(spline.sample(0.1), Some(0.)); assert_eq!(spline.sample(0.1), Some(0.));
assert_eq!(spline.sample(0.2), Some(0.)); assert_eq!(spline.sample(0.2), Some(0.));
assert_eq!(spline.sample(0.5), Some(5.)); assert_eq!(spline.sample(0.5), Some(5.));
assert_eq!(spline.sample(0.9), Some(5.)); assert_eq!(spline.sample(0.9), Some(5.));
assert_eq!(spline.sample(1.), Some(5.)); assert_eq!(spline.sample(1.), Some(5.));
assert_eq!(spline.sample(1.5), Some(2.5)); assert_eq!(spline.sample(1.5), Some(2.5));
assert_eq!(spline.sample(2.), Some(0.)); assert_eq!(spline.sample(2.), Some(0.));
assert_eq!(spline.sample(2.05), Some(0.)); assert_eq!(spline.sample(2.05), Some(0.));
assert_eq!(spline.sample(2.099), Some(0.)); assert_eq!(spline.sample(2.099), Some(0.));
assert_eq!(spline.sample(2.75), Some(1.)); assert_eq!(spline.sample(2.75), Some(1.));
assert_eq!(spline.sample(3.), Some(1.)); assert_eq!(spline.sample(3.), Some(1.));
assert_eq!(spline.sample(6.5), Some(1.5)); assert_eq!(spline.sample(6.5), Some(1.5));
assert_eq!(spline.sample(10.), Some(2.)); assert_eq!(spline.sample(10.), Some(2.));
assert_eq!(spline.clamped_sample(11.), Some(4.)); assert_eq!(spline.clamped_sample(11.), Some(4.));
} }
#[cfg(feature = "cgmath")] #[cfg(feature = "cgmath")]
#[test] #[test]
fn stroke_bezier_straight() { fn stroke_bezier_straight() {
use float_cmp::approx_eq; use float_cmp::approx_eq;
let keys = vec![ let keys = vec![
Key::new( Key::new(
0.0, 0.0,
cg::Vector2::new(0., 1.), cg::Vector2::new(0., 1.),
Interpolation::StrokeBezier(cg::Vector2::new(0., 1.), cg::Vector2::new(0., 1.)), Interpolation::StrokeBezier(cg::Vector2::new(0., 1.), cg::Vector2::new(0., 1.)),
), ),
Key::new( Key::new(
5.0, 5.0,
cg::Vector2::new(5., 1.), cg::Vector2::new(5., 1.),
Interpolation::StrokeBezier(cg::Vector2::new(5., 1.), cg::Vector2::new(5., 1.)), Interpolation::StrokeBezier(cg::Vector2::new(5., 1.), cg::Vector2::new(5., 1.)),
), ),
]; ];
let spline = Spline::from_vec(keys); let spline = Spline::from_vec(keys);
assert!(approx_eq!(f32, spline.clamped_sample(0.0).unwrap().y, 1.)); assert!(approx_eq!(f32, spline.clamped_sample(0.0).unwrap().y, 1.));
assert!(approx_eq!(f32, spline.clamped_sample(1.0).unwrap().y, 1.)); assert!(approx_eq!(f32, spline.clamped_sample(1.0).unwrap().y, 1.));
assert!(approx_eq!(f32, spline.clamped_sample(2.0).unwrap().y, 1.)); assert!(approx_eq!(f32, spline.clamped_sample(2.0).unwrap().y, 1.));
assert!(approx_eq!(f32, spline.clamped_sample(3.0).unwrap().y, 1.)); assert!(approx_eq!(f32, spline.clamped_sample(3.0).unwrap().y, 1.));
assert!(approx_eq!(f32, spline.clamped_sample(4.0).unwrap().y, 1.)); assert!(approx_eq!(f32, spline.clamped_sample(4.0).unwrap().y, 1.));
assert!(approx_eq!(f32, spline.clamped_sample(5.0).unwrap().y, 1.)); assert!(approx_eq!(f32, spline.clamped_sample(5.0).unwrap().y, 1.));
} }
#[cfg(feature = "cgmath")] #[cfg(feature = "cgmath")]
#[test] #[test]
fn cgmath_vector_interpolation() { fn cgmath_vector_interpolation() {
use splines::Interpolate; use splines::Interpolate;
let start = cg::Vector2::new(0.0, 0.0); let start = cg::Vector2::new(0.0, 0.0);
let mid = cg::Vector2::new(0.5, 0.5); let mid = cg::Vector2::new(0.5, 0.5);
let end = cg::Vector2::new(1.0, 1.0); let end = cg::Vector2::new(1.0, 1.0);
assert_eq!(Interpolate::lerp(start, end, 0.0), start); assert_eq!(Interpolate::lerp(start, end, 0.0), start);
assert_eq!(Interpolate::lerp(start, end, 1.0), end); assert_eq!(Interpolate::lerp(start, end, 1.0), end);
assert_eq!(Interpolate::lerp(start, end, 0.5), mid); assert_eq!(Interpolate::lerp(start, end, 0.5), mid);
} }
#[cfg(feature = "nalgebra")] #[cfg(feature = "nalgebra")]
#[test] #[test]
fn nalgebra_vector_interpolation() { fn nalgebra_vector_interpolation() {
use splines::Interpolate; use splines::Interpolate;
let start = na::Vector2::new(0.0, 0.0); let start = na::Vector2::new(0.0, 0.0);
let mid = na::Vector2::new(0.5, 0.5); let mid = na::Vector2::new(0.5, 0.5);
let end = na::Vector2::new(1.0, 1.0); let end = na::Vector2::new(1.0, 1.0);
assert_eq!(Interpolate::lerp(start, end, 0.0), start); assert_eq!(Interpolate::lerp(start, end, 0.0), start);
assert_eq!(Interpolate::lerp(start, end, 1.0), end); assert_eq!(Interpolate::lerp(start, end, 1.0), end);
assert_eq!(Interpolate::lerp(start, end, 0.5), mid); assert_eq!(Interpolate::lerp(start, end, 0.5), mid);
} }
#[test] #[test]
fn add_key_empty() { fn add_key_empty() {
let mut spline: Spline<f32, f32> = Spline::from_vec(vec![]); let mut spline: Spline<f32, f32> = Spline::from_vec(vec![]);
spline.add(Key::new(0., 0., Interpolation::Linear)); spline.add(Key::new(0., 0., Interpolation::Linear));
assert_eq!(spline.keys(), &[Key::new(0., 0., Interpolation::Linear)]); assert_eq!(spline.keys(), &[Key::new(0., 0., Interpolation::Linear)]);
} }
#[test] #[test]
fn add_key() { fn add_key() {
let start = Key::new(0., 0., Interpolation::Step(0.5)); let start = Key::new(0., 0., Interpolation::Step(0.5));
let k1 = Key::new(1., 5., Interpolation::Linear); let k1 = Key::new(1., 5., Interpolation::Linear);
let k2 = Key::new(2., 0., Interpolation::Step(0.1)); let k2 = Key::new(2., 0., Interpolation::Step(0.1));
let k3 = Key::new(3., 1., Interpolation::Linear); let k3 = Key::new(3., 1., Interpolation::Linear);
let k4 = Key::new(10., 2., Interpolation::Linear); let k4 = Key::new(10., 2., Interpolation::Linear);
let end = Key::new(11., 4., Interpolation::default()); let end = Key::new(11., 4., Interpolation::default());
let new = Key::new(2.4, 40., Interpolation::Linear); let new = Key::new(2.4, 40., Interpolation::Linear);
let mut spline = Spline::from_vec(vec![start, k1, k2.clone(), k3, k4, end]); let mut spline = Spline::from_vec(vec![start, k1, k2.clone(), k3, k4, end]);
assert_eq!(spline.keys(), &[start, k1, k2, k3, k4, end]); assert_eq!(spline.keys(), &[start, k1, k2, k3, k4, end]);
spline.add(new); spline.add(new);
assert_eq!(spline.keys(), &[start, k1, k2, new, k3, k4, end]); assert_eq!(spline.keys(), &[start, k1, k2, new, k3, k4, end]);
} }
#[test] #[test]
fn remove_element_empty() { fn remove_element_empty() {
let mut spline: Spline<f32, f32> = Spline::from_vec(vec![]); let mut spline: Spline<f32, f32> = Spline::from_vec(vec![]);
let removed = spline.remove(0); let removed = spline.remove(0);
assert_eq!(removed, None); assert_eq!(removed, None);
assert!(spline.is_empty()); assert!(spline.is_empty());
} }
#[test] #[test]
fn remove_element() { fn remove_element() {
let start = Key::new(0., 0., Interpolation::Step(0.5)); let start = Key::new(0., 0., Interpolation::Step(0.5));
let k1 = Key::new(1., 5., Interpolation::Linear); let k1 = Key::new(1., 5., Interpolation::Linear);
let k2 = Key::new(2., 0., Interpolation::Step(0.1)); let k2 = Key::new(2., 0., Interpolation::Step(0.1));
let k3 = Key::new(3., 1., Interpolation::Linear); let k3 = Key::new(3., 1., Interpolation::Linear);
let k4 = Key::new(10., 2., Interpolation::Linear); let k4 = Key::new(10., 2., Interpolation::Linear);
let end = Key::new(11., 4., Interpolation::default()); let end = Key::new(11., 4., Interpolation::default());
let mut spline = Spline::from_vec(vec![start, k1, k2.clone(), k3, k4, end]); let mut spline = Spline::from_vec(vec![start, k1, k2.clone(), k3, k4, end]);
let removed = spline.remove(2); let removed = spline.remove(2);
assert_eq!(removed, Some(k2)); assert_eq!(removed, Some(k2));
assert_eq!(spline.len(), 5); assert_eq!(spline.len(), 5);
} }