beetry-node 0.2.0

Beetry library with reusable behavior tree nodes.
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

mod fallback;
mod parallel;
mod sequence;

use std::collections::BTreeSet;

use beetry_core::BoxNode;
pub use fallback::Fallback;
pub use parallel::{Parallel, ParallelParams};
pub use sequence::{MemorySequence, Sequence};

struct RunningNodesAborter {
    running: BTreeSet<usize>,
}

impl RunningNodesAborter {
    fn new() -> Self {
        Self {
            running: BTreeSet::new(),
        }
    }

    fn is_any_tracked(&self) -> bool {
        !self.running.is_empty()
    }

    fn track(&mut self, idx: usize) {
        self.running.insert(idx);
    }

    fn clear(&mut self) {
        self.running.clear();
    }

    fn untrack(&mut self, idx: usize) {
        self.running.take(&idx);
    }

    fn abort_if_other_running(&mut self, nodes: &mut [BoxNode], idx: usize) {
        if !self.running.contains(&idx) {
            self.abort_all(nodes);
        }
    }

    fn abort_all(&mut self, nodes: &mut [BoxNode]) {
        while let Some(idx) = self.running.pop_first() {
            nodes[idx].abort();
        }
    }
}