kson 0.2.0

Rust implementation of the kson sdvx chart format.
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
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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208

use crate::*;

pub trait Graph<T> {
    fn value_at(&self, tick: f64) -> T;
    fn direction_at(&self, tick: f64) -> T;
    fn wide_at(&self, tick: f64) -> u32;
}

impl Graph<f64> for Vec<GraphPoint> {
    fn value_at(&self, tick: f64) -> f64 {
        match self.binary_search_by(|g| g.y.cmp(&(tick as u32))) {
            Ok(i) =>
            //On a point
            {
                self[i].v
            }
            Err(i) =>
            //Between points
            {
                if i == 0 {
                    self.first().map_or(0.0, |g| g.v)
                } else if i >= self.len() {
                    self.last().map_or(0.0, |g| g.vf.unwrap_or(g.v))
                } else {
                    let start_p = self.get(i - 1).expect("Malformed graph");
                    let end_p = self[i];
                    assert!(start_p.y < end_p.y);
                    let start_v = match start_p.vf {
                        Some(v) => v,
                        None => start_p.v,
                    };
                    let x = (tick - start_p.y as f64) / (end_p.y - start_p.y) as f64;
                    let width = end_p.v - start_v;
                    let (a, b) = (start_p.a, start_p.b);
                    if (a - b).abs() > f64::EPSILON {
                        start_v + do_curve(x, a, b) * width
                    } else {
                        start_v + x * width
                    }
                }
            }
        }
    }

    fn direction_at(&self, tick: f64) -> f64 {
        match self.binary_search_by(|g| g.y.cmp(&(tick as u32))) {
            Ok(i) =>
            //On a point
            {
                let point = self[i];
                let v = point.vf.unwrap_or(point.v);

                if let Some(next) = self.get(i + 1) {
                    (next.v - v) / (next.y - point.y) as f64
                } else {
                    0.0
                }
            }
            Err(i) =>
            //Between points
            {
                if i == 0 || i >= self.len() {
                    //Before the first point or after the last point
                    0.0
                } else {
                    let start_p = self.get(i - 1).expect("Malformed graph");
                    let end_p = self[i];
                    assert!(start_p.y < end_p.y);
                    let start_v = match start_p.vf {
                        Some(v) => v,
                        None => start_p.v,
                    };

                    (end_p.v - start_v) / (end_p.y - start_p.y) as f64
                }
            }
        }
    }

    fn wide_at(&self, _tick: f64) -> u32 {
        1
    }
}

impl Graph<Option<f64>> for Vec<GraphSectionPoint> {
    fn value_at(&self, tick: f64) -> Option<f64> {
        match self.binary_search_by(|g| g.ry.cmp(&(tick as u32))) {
            Ok(p) /*On a point*/ => Some(self[p].v),
            Err(p) /*Between points*/ => {
                if p == 0 || p >= self.len() {
                    return None;
                }
                let start_p = self[p-1];
                let end_p = self[p];
                assert!(start_p.ry < end_p.ry);
                let start_v = match start_p.vf {
                    Some(v) => v,
                    None => start_p.v
                };
                let x = (tick - start_p.ry as f64) / (end_p.ry - start_p.ry) as f64;
                let width = end_p.v - start_v;
                let (a,b) =  (start_p.a, start_p.b);
                if (a-b).abs() > f64::EPSILON {
                    Some(start_v + do_curve(x, a, b) * width)
                }
                else {
                    Some(start_v + x * width)
                }
            }
        }
    }

    fn direction_at(&self, tick: f64) -> Option<f64> {
        match self.binary_search_by(|g| g.ry.cmp(&(tick as u32))) {
            Ok(i) =>
            //On a point
            {
                let point = self[i];
                let v = point.vf.unwrap_or(point.v);

                if let Some(next) = self.get(i + 1) {
                    Some((next.v - v) / (next.ry - point.ry) as f64)
                } else {
                    Some(0.0)
                }
            }
            Err(i) =>
            //Between points
            {
                if i == 0 || i >= self.len() {
                    //Before the first point or after the last point
                    Some(0.0)
                } else {
                    let start_p = self[i - 1];
                    let end_p = self[i];
                    assert!(start_p.ry < end_p.ry);
                    let start_v = match start_p.vf {
                        Some(v) => v,
                        None => start_p.v,
                    };

                    Some((end_p.v - start_v) / (end_p.ry - start_p.ry) as f64)
                }
            }
        }
    }

    fn wide_at(&self, _tick: f64) -> u32 {
        1
    }
}

impl Graph<Option<f64>> for LaserSection {
    fn value_at(&self, tick: f64) -> Option<f64> {
        let r_tick = tick - self.0 as f64;
        self.1.value_at(r_tick)
    }

    fn direction_at(&self, tick: f64) -> Option<f64> {
        let r_tick = tick - self.0 as f64;
        self.1.direction_at(r_tick)
    }

    fn wide_at(&self, _tick: f64) -> u32 {
        self.2 as _
    }
}

impl Graph<Option<f64>> for Vec<LaserSection> {
    fn value_at(&self, tick: f64) -> Option<f64> {
        match self.binary_search_by(|s| s.0.cmp(&(tick as u32))) {
            Ok(i) => self[i].value_at(tick),
            Err(i) => {
                if i > 0 {
                    self[i - 1].value_at(tick)
                } else {
                    None
                }
            }
        }
    }

    fn direction_at(&self, tick: f64) -> Option<f64> {
        match self.binary_search_by(|s| s.0.cmp(&(tick as u32))) {
            Ok(i) => self[i].value_at(tick),
            Err(i) => {
                if i > 0 {
                    self[i - 1].direction_at(tick)
                } else {
                    None
                }
            }
        }
    }

    fn wide_at(&self, tick: f64) -> u32 {
        match self.binary_search_by(|s| s.0.cmp(&(tick as u32))) {
            Ok(i) => self[i].2 as u32,
            Err(i) => {
                if i > 0 {
                    self[i - 1].2 as u32
                } else {
                    1
                }
            }
        }
    }
}