linkage-blaze 0.1.10

No-std 3D turtle graphics for animated jointed figures
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
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
//! Reverse-kinematics controller for the armatron example.
//!
//! The solver performs a greedy coordinate search with step decay. It keeps a
//! private search state, spreads candidate evaluation across frames, and
//! interpolates the visible arm params toward the current best solution while a
//! solve is playing.
//!
//! Solver ownership is one-way: the live game loop owns exactly one
//! `ReverseKinematics` controller and calls its small API, but the internal
//! search state never leaks back out into `main.rs`. The manual
//! distance-to-target label remains owned by `main.rs`, because it is part of
//! the manual game even when the solver is idle.

use crate::examples::ui::{HoldButtonState, IconButton};

use super::{
    LinkageError,
    controls::{RK_RUN_BUTTON, RK_STOP_BUTTON},
};

const INITIAL_STEP: f32 = 0.125;
const MIN_STEP: f32 = 0.001;
const VISIBLE_PARAM_POINTS_PER_SECOND: f32 = 0.6;
const MAX_TICK_SECONDS: f32 = 0.1;
const SINGLE_STEP_VISIBLE_PARAM_STEP: f32 = 0.01;
const SEARCH_CANDIDATES_PER_SECOND: f32 = 36.0;
const HOLD_STEPS_PER_SECOND: f32 = 9.0;
const PAIRED_CANDIDATES: [(f32, f32); 4] = [(1.0, 1.0), (1.0, -1.0), (-1.0, 1.0), (-1.0, -1.0)];
const CANDIDATE_COUNT: usize = super::ARM_PARAM_INDEXES.len() + PAIRED_CANDIDATES.len();
const BEND_ELBOW_PARAM_INDEX: usize = super::LINKAGE.param_index("bend elbow", 0);
const SPIN_WHOLE_ARM_PARAM_INDEX: usize = super::LINKAGE.param_index("spin whole arm", 0);

/// Per-arm reverse-kinematics controller.
pub(super) struct ReverseKinematics {
    run: Option<Run>,
    playing: bool,
    search_candidate_budget: f32,
    hold_step_budget: f32,
}

impl ReverseKinematics {
    /// Idle controller: no run state, not playing.
    pub(super) const fn new() -> Self {
        Self {
            run: None,
            playing: false,
            search_candidate_budget: 0.0,
            hold_step_budget: 0.0,
        }
    }

    /// Play/stop. Starting seeds the search from the current params.
    pub(super) fn toggle(&mut self, params: &[f32; super::DOF]) -> Result<(), LinkageError> {
        self.search_candidate_budget = 0.0;
        self.hold_step_budget = 0.0;

        if self.playing {
            self.playing = false;
            return Ok(());
        }

        self.ensure_run(params)?;
        self.playing = true;
        Ok(())
    }

    /// Called once per frame with the step button's hold state.
    pub(super) fn hold_step(
        &mut self,
        params: &mut [f32; super::DOF],
        hold: HoldButtonState,
        dt_seconds: f32,
    ) -> Result<(), LinkageError> {
        match hold {
            HoldButtonState::Idle => {
                self.hold_step_budget = 0.0;
            }
            HoldButtonState::Pressed => {
                self.playing = false;
                self.ensure_run(params)?;
                self.hold_step_budget = 1.0;
                self.consume_hold_steps(params)?;
            }
            HoldButtonState::Held => {
                let dt_seconds = dt_seconds.clamp(0.0, MAX_TICK_SECONDS);
                self.hold_step_budget += dt_seconds * HOLD_STEPS_PER_SECOND;
                self.consume_hold_steps(params)?;
            }
        }
        Ok(())
    }

    /// Forget the run and stop playing (manual interference, target change).
    pub(super) fn clear(&mut self) {
        self.run = None;
        self.playing = false;
        self.search_candidate_budget = 0.0;
        self.hold_step_budget = 0.0;
    }

    /// Per-frame advance while playing.
    pub(super) fn tick(
        &mut self,
        params: &mut [f32; super::DOF],
        dt_seconds: f32,
    ) -> Result<(), LinkageError> {
        if !self.playing {
            return Ok(());
        }

        let Some(run) = self.run.as_mut() else {
            self.playing = false;
            return Ok(());
        };

        let dt_seconds = dt_seconds.clamp(0.0, MAX_TICK_SECONDS);
        self.search_candidate_budget += dt_seconds * SEARCH_CANDIDATES_PER_SECOND;

        while self.search_candidate_budget >= 1.0 {
            self.search_candidate_budget -= 1.0;
            if !run.tick_search_candidate()? {
                self.search_candidate_budget = 0.0;
                break;
            }
        }

        let visible_moving = move_params_toward(
            params,
            &run.best_params,
            dt_seconds * VISIBLE_PARAM_POINTS_PER_SECOND,
        );
        if run.search_exhausted && !visible_moving {
            self.playing = false;
        }
        Ok(())
    }

    /// The play or stop `IconButton` matching the current playing state.
    pub(super) const fn run_button(&self) -> &'static IconButton {
        if self.playing {
            &RK_STOP_BUTTON
        } else {
            &RK_RUN_BUTTON
        }
    }

    fn ensure_run(&mut self, params: &[f32; super::DOF]) -> Result<(), LinkageError> {
        if self.run.is_none() {
            self.run = Some(Run::new(params)?);
        }
        Ok(())
    }

    fn consume_hold_steps(&mut self, params: &mut [f32; super::DOF]) -> Result<(), LinkageError> {
        let Some(run) = self.run.as_mut() else {
            self.hold_step_budget = 0.0;
            return Ok(());
        };

        while self.hold_step_budget >= 1.0 {
            self.hold_step_budget -= 1.0;
            run.tick_search_candidate()?;
            let visible_moving =
                move_params_toward(params, &run.best_params, SINGLE_STEP_VISIBLE_PARAM_STEP);
            if run.search_exhausted && !visible_moving {
                self.run = None;
                self.hold_step_budget = 0.0;
                break;
            }
        }
        Ok(())
    }
}

#[derive(Clone, Copy)]
struct Run {
    search_params: [f32; super::DOF],
    best_params: [f32; super::DOF],
    best_distance: f32,
    step: f32,
    search_exhausted: bool,
    candidate_index: usize,
    sweep_improved: bool,
    phase: Phase,
}

#[derive(Clone, Copy)]
enum Phase {
    BeginCandidate,
    EvaluateSingleHigh {
        index: usize,
        original: f32,
    },
    EvaluateSingleLow {
        index: usize,
        original: f32,
    },
    EvaluatePair {
        bend_original: f32,
        spin_original: f32,
    },
}

impl Run {
    fn new(params: &[f32; super::DOF]) -> Result<Self, LinkageError> {
        Ok(Self {
            search_params: *params,
            best_params: *params,
            best_distance: super::target_distance(params)?,
            step: INITIAL_STEP,
            search_exhausted: false,
            candidate_index: 0,
            sweep_improved: false,
            phase: Phase::BeginCandidate,
        })
    }

    fn tick_search_candidate(&mut self) -> Result<bool, LinkageError> {
        let candidate_index = self.candidate_index;
        let mut searched = false;

        loop {
            if !self.tick_search()? {
                self.search_exhausted = true;
                return Ok(searched);
            }

            searched = true;
            if matches!(self.phase, Phase::BeginCandidate)
                && self.candidate_index != candidate_index
            {
                return Ok(true);
            }
        }
    }

    fn tick_search(&mut self) -> Result<bool, LinkageError> {
        loop {
            match self.phase {
                Phase::BeginCandidate => {
                    if !self.prepare_next_candidate() {
                        return Ok(false);
                    }

                    if self.candidate_index >= super::ARM_PARAM_INDEXES.len() {
                        let bend_original = self.search_params[BEND_ELBOW_PARAM_INDEX];
                        let spin_original = self.search_params[SPIN_WHOLE_ARM_PARAM_INDEX];
                        let pair_index = self.candidate_index - super::ARM_PARAM_INDEXES.len();
                        if apply_paired_candidate(&mut self.search_params, pair_index, self.step) {
                            self.phase = Phase::EvaluatePair {
                                bend_original,
                                spin_original,
                            };
                            return Ok(true);
                        }

                        self.finish_candidate();
                        continue;
                    }

                    let index = super::ARM_PARAM_INDEXES[self.candidate_index];
                    let original = self.search_params[index];
                    let high = (original + self.step).min(1.0);
                    if high != original {
                        self.search_params[index] = high;
                        self.phase = Phase::EvaluateSingleHigh { index, original };
                        return Ok(true);
                    }

                    self.phase = Phase::EvaluateSingleHigh { index, original };
                }
                Phase::EvaluateSingleHigh { index, original } => {
                    if self.keep_if_improved()? {
                        self.finish_candidate();
                        return Ok(true);
                    }

                    self.search_params[index] = original;
                    let low = (original - self.step).max(0.0);
                    if low != original {
                        self.search_params[index] = low;
                        self.phase = Phase::EvaluateSingleLow { index, original };
                        return Ok(true);
                    }

                    self.finish_candidate();
                    return Ok(true);
                }
                Phase::EvaluateSingleLow { index, original } => {
                    if !self.keep_if_improved()? {
                        self.search_params[index] = original;
                    }
                    self.finish_candidate();
                    return Ok(true);
                }
                Phase::EvaluatePair {
                    bend_original,
                    spin_original,
                } => {
                    if !self.keep_if_improved()? {
                        self.search_params[BEND_ELBOW_PARAM_INDEX] = bend_original;
                        self.search_params[SPIN_WHOLE_ARM_PARAM_INDEX] = spin_original;
                    }
                    self.finish_candidate();
                    return Ok(true);
                }
            }
        }
    }

    fn prepare_next_candidate(&mut self) -> bool {
        while self.candidate_index >= CANDIDATE_COUNT {
            if self.sweep_improved {
                self.sweep_improved = false;
            } else {
                self.step *= 0.5;
                if self.step < MIN_STEP {
                    return false;
                }
            }
            self.candidate_index = 0;
        }

        true
    }

    fn keep_if_improved(&mut self) -> Result<bool, LinkageError> {
        let distance = super::target_distance(&self.search_params)?;
        if distance < self.best_distance {
            self.best_distance = distance;
            self.best_params = self.search_params;
            self.sweep_improved = true;
            Ok(true)
        } else {
            Ok(false)
        }
    }

    fn finish_candidate(&mut self) {
        self.candidate_index += 1;
        self.phase = Phase::BeginCandidate;
    }
}

fn move_params_toward(
    params: &mut [f32; super::DOF],
    target_params: &[f32; super::DOF],
    max_change: f32,
) -> bool {
    let mut moved = false;

    for param_index in super::ARM_PARAM_INDEXES {
        let delta = target_params[param_index] - params[param_index];
        if delta == 0.0 {
            continue;
        }

        let change = delta.clamp(-max_change, max_change);
        params[param_index] = (params[param_index] + change).clamp(0.0, 1.0);
        moved = true;
    }

    moved
}

fn apply_paired_candidate(params: &mut [f32; super::DOF], pair_index: usize, step: f32) -> bool {
    let (bend_direction, spin_direction) = PAIRED_CANDIDATES[pair_index];
    let bend_original = params[BEND_ELBOW_PARAM_INDEX];
    let spin_original = params[SPIN_WHOLE_ARM_PARAM_INDEX];

    params[BEND_ELBOW_PARAM_INDEX] = (bend_original + bend_direction * step).clamp(0.0, 1.0);
    params[SPIN_WHOLE_ARM_PARAM_INDEX] = (spin_original + spin_direction * step).clamp(0.0, 1.0);

    params[BEND_ELBOW_PARAM_INDEX] != bend_original
        || params[SPIN_WHOLE_ARM_PARAM_INDEX] != spin_original
}

#[cfg(test)]
mod tests {
    use core::ptr;

    use super::*;

    fn default_params() -> [f32; super::super::DOF] {
        super::super::LINKAGE.param_defaults()
    }

    #[test]
    fn toggle_switches_between_play_and_stop() -> Result<(), LinkageError> {
        let params = default_params();
        let mut reverse_kinematics = ReverseKinematics::new();

        assert!(ptr::eq(reverse_kinematics.run_button(), &RK_RUN_BUTTON));
        reverse_kinematics.toggle(&params)?;
        assert!(reverse_kinematics.playing);
        assert!(ptr::eq(reverse_kinematics.run_button(), &RK_STOP_BUTTON));

        reverse_kinematics.toggle(&params)?;
        assert!(!reverse_kinematics.playing);
        assert!(ptr::eq(reverse_kinematics.run_button(), &RK_RUN_BUTTON));
        Ok(())
    }

    #[test]
    fn pressed_step_stops_playback_and_starts_a_run() -> Result<(), LinkageError> {
        let mut params = default_params();
        let mut reverse_kinematics = ReverseKinematics::new();
        reverse_kinematics.toggle(&params)?;

        reverse_kinematics.hold_step(&mut params, HoldButtonState::Pressed, 0.0)?;

        assert!(!reverse_kinematics.playing);
        assert!(reverse_kinematics.run.is_some());
        Ok(())
    }

    #[test]
    fn clear_stops_and_forgets_the_current_run() -> Result<(), LinkageError> {
        let params = default_params();
        let mut reverse_kinematics = ReverseKinematics::new();
        reverse_kinematics.toggle(&params)?;

        reverse_kinematics.clear();

        assert!(!reverse_kinematics.playing);
        assert!(reverse_kinematics.run.is_none());
        assert!(ptr::eq(reverse_kinematics.run_button(), &RK_RUN_BUTTON));
        Ok(())
    }
}