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
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

use beehave::{ BehaviourResult, BehaviourNode };

#[derive(Clone, PartialEq, Eq)]
pub struct TestTarget {
    pub foo: bool,
    pub bar: u32
}

impl TestTarget {
    pub fn new() -> TestTarget {
        TestTarget {
            foo: false,
            bar: 1
        }
    }
}

pub struct SuccessBehaviourNode;

impl <T> BehaviourNode<T> for SuccessBehaviourNode {
    fn evaluate(&mut self, _: &mut T) -> BehaviourResult {
        BehaviourResult::Success
    }
}

pub struct FailureBehaviourNode;

impl <T> BehaviourNode<T> for FailureBehaviourNode {
    fn evaluate(&mut self, _: &mut T) -> BehaviourResult {
        BehaviourResult::Failure
    }
}

pub struct PendingBehaviourNode;

impl <T> BehaviourNode<T> for PendingBehaviourNode {
    fn evaluate(&mut self, _: &mut T) -> BehaviourResult {
        BehaviourResult::Pending
    }
}

pub struct RaiseErrorBehaviourNode;

impl <T> BehaviourNode<T> for RaiseErrorBehaviourNode {
    fn evaluate(&mut self, _: &mut T) -> BehaviourResult {
        panic!("I should not have been called...");
    }
}

pub fn success() -> SuccessBehaviourNode {
    SuccessBehaviourNode
}

pub fn failure() -> FailureBehaviourNode {
    FailureBehaviourNode
}

pub fn pending() -> PendingBehaviourNode {
    PendingBehaviourNode
}

pub fn raise_error() -> RaiseErrorBehaviourNode {
    RaiseErrorBehaviourNode
}

pub fn result_methods() -> [BehaviourResult;3] {
    [ BehaviourResult::Failure, BehaviourResult::Success, BehaviourResult::Pending ]
}