beehave 0.0.4

A simple library for defining and evaluating a hierarchical state machine (behaviour tree).
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

use beehave::{ BehaviourResult, BehaviourNode, Node };
use helpers;
use helpers::TestTarget;

#[test]
fn constructor_new() {
    let node = Node::new("Test Node", |_: &mut TestTarget| { BehaviourResult::Success });
    assert!(node.name == "Test Node");
}

#[test]
fn evalute_returns_method_result() {
    let expected_results = helpers::result_methods();
    let mut target = TestTarget::new();

    for expected_result in expected_results.iter() {
        let mut node = Node::new("Test Node", |_: &mut TestTarget| { expected_result.clone() });

        let result = node.evaluate(&mut target);
        assert!(result == expected_result.clone());
    }

}

#[test]
fn evalute_mutates_target() {
    let mut target = TestTarget::new();
    assert!(target.foo != true);
    assert!(target.bar != 32);

    let mut node = Node::new("Test Node", |target: &mut TestTarget| {
        target.foo = true;
        target.bar = 32;
        BehaviourResult::Success
    });

    let _ = node.evaluate(&mut target);
    assert!(target.foo == true);
    assert!(target.bar == 32);
}