node_tree 0.15.0

An extendable scene graph made up of autonomous execution services known as nodes organized in a tree of processes. Inspired by Godot!
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

use std::collections::HashMap;

use node_tree::prelude::*;
use node_tree::trees::TreeSimple;


class! {
    declare Unit;
}

class! {
    declare Crawler;

    hk process(&mut self, _delta: f32) {
        let paths_and_targets: HashMap<NodePath, &str> = vec![
            (nodepath!("Child"),            "Child"),
            (nodepath!("Child/Grandchild"), "Grandchild"),
            (nodepath!("."),                "Self"),
            (nodepath!(".."),               "Parent"),
            (nodepath!("../Sibling"),       "Sibling"),
            (nodepath!("../.."),            "Grandparent"),
            (nodepath!("/Grandparent"),     "Grandparent")
        ].into_iter().collect();
        
        for (path, target) in paths_and_targets {
            if target != "Self" {
                assert_eq!(self.get_node::<Unit>(path).unwrap().name(), target);
            } else {
                assert_eq!(self.get_node::<Crawler>(path).unwrap().name(), target);
            }
        }
        self.tree_mut()
            .unwrap()
            .queue_termination();
    }
}


#[test]
fn test_nodepaths() {
    let scene: NodeScene = scene! {
        Unit: "Grandparent" [
            Unit: "Parent" [
                Crawler: "Self" [
                    Unit: "Child" [
                        Unit: "Grandchild"
                    ]
                ],
                Unit: "Sibling"
            ]
        ]
    };

    let mut tree: Box<TreeSimple> = TreeSimple::new(scene, LoggerVerbosity::All);
    while tree.process().is_active() {}
}