eazing 0.0.1

The blazingly fast and mathematically optimized `easing functions` kit.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55

//! The Polynomial Cubic Interpolation.

use crate::easing::Curve;

use libm::{asinf, sinf};

/// The [`InCubic`] Curve.
///
/// ```
/// use eazing::Curve;
/// use eazing::interpolation::polynomial::cubic::InCubic;
///
/// let p = InCubic.y(1.0);
/// ```
#[derive(Debug)]
pub struct InCubic;

impl Curve for InCubic {
  #[inline]
  fn y(&self, p: f32) -> f32 {
    p * p * (3.0 - 2.0 * p)
  }
}

#[test]
fn test_in_cubic() {
  let p = InCubic.y(0.8);

  assert_eq!(p, 0.90450853);
}

/// The [`OutCubic`] Curve.
///
/// ```
/// use eazing::Curve;
/// use eazing::interpolation::polynomial::cubic::OutCubic;
///
/// let p = OutCubic.y(1.0);
/// ```
#[derive(Debug)]
pub struct OutCubic;

impl Curve for OutCubic {
  #[inline]
  fn y(&self, p: f32) -> f32 {
    0.5 - sinf(asinf(1.0 - 2.0 * p) / 3.0)
  }
}

#[test]
fn test_out_cubic() {
  let p = OutCubic.y(0.8);

  assert_eq!(p, 0.90450853);
}