oxineat 0.3.2

A Rust implementation of NeuroEvolution of Augmenting Topologies
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::{
    populations::{Population, PopulationConfig, Species},
    Genome, InnovationHistory,
};

/// Opaque token representing a genome
/// to get around borrow rules.
/// 
/// TODO: this representation will require `O(n)` 
/// replacement time, and force all GenomeTokens
/// to update, probably. Maybe reconsider?
#[derive(Clone, Copy, PartialEq, Eq, Hash, Debug)]
pub struct GenomeToken {
    species: usize,
    index: usize,
}

/// A `RealTimePopulation` supports rt-NEAT
/// through N-genome replacement without
/// generational evolution. 
/// 
/// If it makes more sense, this may become
/// the base Population class, and the generational
/// population a special case of this.
pub struct RealTimePopulation<C, H, G> {
    pop: Population<C, H, G>,
}

impl<C, H, G> RealTimePopulation<C, H, G>
where
    G: Genome<InnovationHistory = H, Config = C> + Clone,
{
    pub fn new(
        population_config: PopulationConfig,
        genetic_config: C,
    ) -> RealTimePopulation<C, H, G>
    where
        H: InnovationHistory<Config = C>,
    {
        unimplemented!()
    }

    pub fn remove_genomes<const N: usize>(&mut self, tokens: &[GenomeToken; N]) -> Option<G> {
        unimplemented!()
    }

    pub fn replace_genomes<F, P, T, const N: usize>(
        &mut self,
        tokens: &[GenomeToken; N],
        f: F,
        p: P,
    ) -> Option<(GenomeToken, T)>
    where
        F: Fn(GenomeToken) -> f32,
        P: Fn(&G) -> (GenomeToken, T),
    {
        unimplemented!()
    }

    pub fn add_child<P, T>(
        &mut self,
        parent1: GenomeToken,
        parent2: GenomeToken,
        p: P,
    ) -> Option<(GenomeToken, T)>
    where
        P: Fn(&G) -> (GenomeToken, T),
    {
        unimplemented!()
    }

    pub fn reset(&mut self)
    where
        C: Clone,
        H: InnovationHistory<Config = C>,
    {
        self.pop.reset();
    }

    pub fn get(&self, token: GenomeToken) -> Option<&G> {
        self.pop
            .species
            .get(token.species)
            .map(|s| s.genomes.get(token.index))
            .flatten()
    }

    pub fn genomes(&self) -> impl Iterator<Item = &G> {
        self.pop.genomes()
    }

    pub fn species(&self) -> impl Iterator<Item = &Species<G>> {
        self.pop.species.iter()
    }

    pub fn history(&self) -> &H
    where
        H: InnovationHistory<Config = C>,
    {
        &self.pop.history
    }
}