radiate-gp 1.3.1

Extensions for radiate. Genetic Programming implementations for graphs (neural networks) and trees.
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

use crate::{
    Eval, EvalIntoMut, EvalMut, Graph, GraphEvaluator, GraphIterator, graphs::GraphEvalCache,
};
#[cfg(feature = "serde")]
use serde::{Deserialize, Serialize};

#[derive(Clone, PartialEq)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub struct StatefulGraph<T, V> {
    inner: Graph<T>,
    state: Option<GraphEvalCache<V>>,
}

impl<T, V> StatefulGraph<T, V> {
    pub fn new(inner: Graph<T>) -> Self {
        StatefulGraph { inner, state: None }
    }

    pub fn reset(&mut self) {
        self.state = None;
    }

    pub fn input_dim(&self) -> usize {
        self.inner
            .get_nodes_of_type(crate::NodeType::Input)
            .collect::<Vec<_>>()
            .len()
    }

    pub fn output_dim(&self) -> usize {
        self.inner
            .get_nodes_of_type(crate::NodeType::Output)
            .collect::<Vec<_>>()
            .len()
    }

    pub fn eval_scoped<F, O>(&mut self, eval_fn: F) -> O
    where
        F: FnOnce(&mut Self) -> O,
    {
        let current_state = self.state.take();
        let output = eval_fn(self);
        self.state = current_state;
        output
    }
}

impl<T, V> EvalIntoMut<[V], [V]> for StatefulGraph<T, V>
where
    T: Eval<[V], V>,
    V: Copy + Default,
{
    fn eval_into_mut(&mut self, input: &[V], output: &mut [V]) {
        let mut evaluator = match self.state.take() {
            Some(c) => GraphEvaluator::from((&self.inner, c)),
            None => GraphEvaluator::new(&self.inner),
        };

        evaluator.eval_into_mut(input, output);
        self.state = Some(evaluator.take_cache());
    }
}

impl<T, V> EvalMut<[V], Vec<V>> for StatefulGraph<T, V>
where
    T: Eval<[V], V>,
    V: Copy + Default,
{
    fn eval_mut(&mut self, input: &[V]) -> Vec<V> {
        let mut evaluator = match self.state.take() {
            Some(c) => GraphEvaluator::from((&self.inner, c)),
            None => GraphEvaluator::new(&self.inner),
        };

        let result = evaluator.eval_mut(input);
        self.state = Some(evaluator.take_cache());
        result
    }
}

impl<T, V> AsRef<Graph<T>> for StatefulGraph<T, V> {
    fn as_ref(&self) -> &Graph<T> {
        &self.inner
    }
}

impl<T, V> From<Graph<T>> for StatefulGraph<T, V>
where
    T: Eval<[V], V>,
{
    fn from(inner: Graph<T>) -> Self {
        StatefulGraph { inner, state: None }
    }
}

#[cfg(test)]
mod tests {
    // use super::*;

    #[test]
    fn test_stateful_graph() {}
}