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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
use interpolation::{Ease, EaseFunction, Spatial};
use num::{Float, NumCast};
use point::Point;
#[inline]
fn maybe_exact_point<X, Y, P>(x: &X, start: &P, end: &P) -> Option<Y> where
P: Point<X, Y>,
X: PartialEq,
Y: Spatial + PartialEq,
Y::Scalar: Float,
{
if start.y() == end.y() || start.x() == *x {
Some(start.y())
} else if end.x() == *x {
Some(end.y())
} else {
None
}
}
#[inline]
pub fn linear<X, Y, P>(x: X, start: &P, end: &P) -> Y where
P: Point<X, Y>,
X: PartialEq,
Y: Spatial + PartialEq,
Y::Scalar: Float,
{
maybe_exact_point(&x, start, end).unwrap_or_else(|| {
let x = P::x_to_scalar(x);
let start_x = P::x_to_scalar(start.x());
let end_x = P::x_to_scalar(end.x());
let scalar = (x - start_x) / (end_x - start_x);
let difference = end.y().sub(&start.y());
let interpolated_difference = difference.scale(&scalar);
start.y().add(&interpolated_difference)
})
}
#[inline]
pub fn ease<X, Y, P>(x: X, start: &P, end: &P, ease_fn: EaseFunction) -> Y where
P: Point<X, Y>,
X: PartialEq,
Y: Spatial + PartialEq,
Y::Scalar: Float + Ease,
{
maybe_exact_point(&x, start, end).unwrap_or_else(|| {
let x = P::x_to_scalar(x);
let start_x = P::x_to_scalar(start.x());
let end_x = P::x_to_scalar(end.x());
let scalar = (x - start_x) / (end_x - start_x);
let eased_scalar = Ease::calc(scalar, ease_fn);
let difference = end.y().sub(&start.y());
let interpolated_difference = difference.scale(&eased_scalar);
start.y().add(&interpolated_difference)
})
}
#[inline]
pub fn bezier<X, Y, P>(x: X, start: &P, end: &P, curve: Y::Scalar) -> Y where
P: Point<X, Y>,
X: PartialEq,
Y: Spatial + NumCast + PartialEq,
Y::Scalar: Float,
{
maybe_exact_point(&x, start, end).unwrap_or_else(|| {
#[inline]
fn bezier_pt<A>(n1: A, n2: A, perc: A) -> A where A: Float {
(n2 - n1) * perc + n1
}
#[inline]
fn two<F>() -> F where F: Float {
let one: F = F::one();
one + one
}
let x = P::x_to_scalar(x);
let start_x = P::x_to_scalar(start.x());
let end_x = P::x_to_scalar(end.x());
let x_pos = x - start_x;
let duration = end_x - start_x;
let end_y: Y::Scalar = NumCast::from(end.y()).unwrap();
let start_y: Y::Scalar = NumCast::from(start.y()).unwrap();
let gradient_y: Y::Scalar = end_y - start_y;
let half_gradient_y: Y::Scalar = gradient_y / two();
let y2 = half_gradient_y + curve * half_gradient_y;
let perc_x = x_pos / duration;
let zero: Y::Scalar = NumCast::from(0.0).unwrap();
let ya = bezier_pt(zero, y2, perc_x);
let yb = bezier_pt(y2, gradient_y, perc_x);
let y = NumCast::from(bezier_pt(ya, yb, perc_x)).unwrap();
start.y().add(&y)
})
}