radiate-gp 1.3.0

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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131

use super::{GraphNode, NodeStore, NodeType, NodeValue, TreeNode};
use crate::Arity;
use radiate_core::random_provider;

pub trait Factory<I, O> {
    fn new_instance(&self, input: I) -> O;
}

impl<T> Factory<(), T> for NodeValue<T>
where
    T: Factory<(), T>,
{
    fn new_instance(&self, _: ()) -> T {
        match self {
            NodeValue::Bounded(value, _) => value.new_instance(()),
            NodeValue::Unbound(value) => value.new_instance(()),
        }
    }
}

impl<T> Factory<NodeType, T> for NodeStore<T>
where
    T: Factory<(), T> + Default,
{
    fn new_instance(&self, input: NodeType) -> T {
        self.map_by_type(input, |values| {
            random_provider::choose(values).new_instance(())
        })
        .unwrap_or_default()
    }
}

impl<T: Default + Clone> Factory<(usize, NodeType), Option<GraphNode<T>>> for NodeStore<T> {
    fn new_instance(&self, (index, node_type): (usize, NodeType)) -> Option<GraphNode<T>> {
        self.map_by_type(node_type, |values| {
            let node_value = match node_type {
                NodeType::Input => &values[index % values.len()],
                _ => random_provider::choose(values),
            };

            match node_value {
                NodeValue::Bounded(value, arity) => {
                    (index, node_type, value.clone(), *arity).into()
                }
                NodeValue::Unbound(value) => (index, node_type, value.clone()).into(),
            }
        })
    }
}

impl<T, F> Factory<(usize, NodeType, F), Option<GraphNode<T>>> for NodeStore<T>
where
    T: Default + Clone,
    F: Fn(Arity) -> bool,
{
    fn new_instance(
        &self,
        (index, node_type, filter): (usize, NodeType, F),
    ) -> Option<GraphNode<T>> {
        self.map(|values| {
            let mapped_values = values
                .into_iter()
                .filter(|value| match value {
                    NodeValue::Bounded(_, arity) => filter(*arity),
                    _ => false,
                })
                .collect::<Vec<&NodeValue<T>>>();

            if mapped_values.is_empty() {
                self.new_instance((index, node_type))
            } else {
                let node_value = random_provider::choose(&mapped_values);

                match node_value {
                    NodeValue::Bounded(value, arity) => Some(GraphNode::with_arity(
                        index,
                        node_type,
                        value.clone(),
                        *arity,
                    )),
                    NodeValue::Unbound(value) => {
                        Some(GraphNode::new(index, node_type, value.clone()))
                    }
                }
            }
        })
        .flatten()
    }
}

impl<T, F> Factory<F, Option<TreeNode<T>>> for NodeStore<T>
where
    T: Default + Clone,
    F: Fn(Arity) -> bool,
{
    fn new_instance(&self, input: F) -> Option<TreeNode<T>> {
        self.map(|values| {
            let mapped_values = values
                .into_iter()
                .filter(|value| match value {
                    NodeValue::Bounded(_, arity) => input(*arity),
                    _ => false,
                })
                .collect::<Vec<&NodeValue<T>>>();

            if mapped_values.is_empty() {
                TreeNode::new(T::default())
            } else {
                let node_value = random_provider::choose(&mapped_values);

                match node_value {
                    NodeValue::Bounded(value, arity) => TreeNode::with_arity(value.clone(), *arity),
                    NodeValue::Unbound(value) => TreeNode::new(value.clone()),
                }
            }
        })
    }
}

impl<T: Clone + Default> Factory<NodeType, Option<TreeNode<T>>> for NodeStore<T> {
    fn new_instance(&self, input: NodeType) -> Option<TreeNode<T>> {
        self.map_by_type(input, |values| {
            let node_value = random_provider::choose(values);

            match node_value {
                NodeValue::Bounded(value, arity) => TreeNode::with_arity(value.clone(), *arity),
                NodeValue::Unbound(value) => TreeNode::new(value.clone()),
            }
        })
    }
}