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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
use crate::lerp;
#[derive(Debug, Copy, Clone, Default)]
pub struct FloatCurvePoint {
pub time: f32,
pub value: f32,
pub arrive_tangent: f32,
pub leave_tangent: f32,
}
impl FloatCurvePoint {
pub fn new(time: f32, value: f32, arrive_tangent: f32, leave_tangent: f32) -> Self {
Self { time, value, arrive_tangent, leave_tangent }
}
}
#[derive(Debug, Clone, Default)]
pub struct FloatCurve {
points: Vec<FloatCurvePoint>,
}
impl FloatCurve {
pub fn new() -> Self {
Self {
points: Vec::new(),
}
}
pub fn add_point_auto(&mut self, time: f32, value: f32) -> usize {
let idx = self.add_point(time, value, 0.0, 0.0);
self.calc_auto_tangent_for_point(idx);
if idx > 0 {
self.calc_auto_tangent_for_point(idx-1);
}
if idx < self.points.len()-1 {
self.calc_auto_tangent_for_point(idx+1);
}
idx
}
pub fn add_point(&mut self, time: f32, value: f32, arrive_tangent: f32, leave_tangent: f32) -> usize {
if self.points.is_empty() {
self.points.push(FloatCurvePoint::new(time, value, arrive_tangent, leave_tangent));
return 0;
}
if self.points[0].time > time {
self.points.insert(0, FloatCurvePoint::new(time, value, arrive_tangent, leave_tangent));
return 0;
}
let mut passed_index = None;
for (i, p) in self.points.iter().enumerate() {
if p.time < time {
passed_index = Some(i);
}
}
if let Some(i) = passed_index {
if i == self.points.len() - 1 {
self.points.push(FloatCurvePoint::new(time, value, arrive_tangent, leave_tangent));
return i+1;
}
else {
self.points.insert(i+1, FloatCurvePoint::new(time, value, arrive_tangent, leave_tangent));
return i+1;
}
}
unreachable!();
}
pub fn remove_point(&mut self, time: f32) {
let mut index = None;
for (i, p) in self.points.iter().enumerate() {
if (p.time - time).abs() < 0.0001 {
index = Some(i);
break;
}
}
if let Some(i) = index {
self.points.remove(i);
}
}
pub fn clear_points(&mut self) {
self.points.clear();
}
pub fn get_value(&self, time: f32) -> f32 {
if self.points.is_empty() {
return 0.0;
}
if time < self.points[0].time {
return self.points[0].value;
}
let mut i = 0;
loop {
if (self.points[i].time - time).abs() < 0.000_001 {
return self.points[i].value;
}
if self.points[i].time > time {
break;
}
if i == self.points.len()-1 {
break;
}
i += 1;
}
if i == self.points.len()-1 {
if self.points[self.points.len()-1].time > time {
return solve_two_points(self.points[i-1], self.points[i], time);
}
else {
return self.points[self.points.len()-1].value;
}
}
solve_two_points(self.points[i-1], self.points[i], time)
}
fn calc_auto_tangent_for_point(&mut self, i: usize) {
if i == 0 || i == self.points.len() - 1 {
self.points[i].leave_tangent = 0.0;
self.points[i].arrive_tangent = 0.0;
}
else {
let x1 = self.points[i-1].time;
let x2 = self.points[i+1].time;
let y1 = self.points[i-1].value;
let y2 = self.points[i+1].value;
let slope = (y2-y1)/(x2-x1).max(0.00001);
self.points[i].leave_tangent = slope;
self.points[i].arrive_tangent = slope;
}
}
}
fn solve_two_points(a: FloatCurvePoint, b: FloatCurvePoint, time: f32) -> f32 {
let diff = b.time - a.time;
let alpha = (time - a.time) / diff;
let p0 = a.value;
let p3 = b.value;
let p1 = p0 + (a.leave_tangent * diff * 0.3333);
let p2 = p3 - (b.arrive_tangent * diff * 0.3333);
interp_bezier_points(p0, p1, p2, p3, alpha)
}
fn interp_bezier_points(p0: f32, p1: f32, p2: f32, p3: f32, alpha: f32) -> f32 {
let p01 = lerp(p0, p1, alpha);
let p12 = lerp(p1, p2, alpha);
let p23 = lerp(p2, p3, alpha);
let p012 = lerp(p01, p12, alpha);
let p123 = lerp(p12, p23, alpha);
lerp(p012, p123, alpha)
}