radiate-utils 1.2.22

A Rust library for genetic algorithms and artificial evolution.
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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151

use crate::Statistic;
#[cfg(feature = "serde")]
use serde::{Deserialize, Serialize};
use std::collections::HashMap;

#[derive(Clone, PartialEq, Default)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub struct Distribution {
    pub statistic: Statistic,
    pub last_sequence: Vec<f32>,
}

impl Distribution {
    #[inline(always)]
    pub fn add(&mut self, value: &[f32]) {
        self.clear();
        for v in value {
            self.statistic.add(*v);
            self.last_sequence.push(*v);
        }
    }

    pub fn last_sequence(&self) -> &[f32] {
        &self.last_sequence
    }

    pub fn count(&self) -> i32 {
        self.last_sequence.len() as i32
    }

    pub fn mean(&self) -> f32 {
        self.statistic.mean()
    }

    pub fn variance(&self) -> f32 {
        self.statistic.variance().unwrap()
    }

    pub fn standard_deviation(&self) -> f32 {
        self.statistic.std_dev().unwrap()
    }

    pub fn skewness(&self) -> f32 {
        self.statistic.skewness().unwrap()
    }

    pub fn kurtosis(&self) -> f32 {
        self.statistic.kurtosis().unwrap()
    }

    pub fn min(&self) -> f32 {
        self.statistic.min()
    }

    pub fn max(&self) -> f32 {
        self.statistic.max()
    }

    pub fn clear(&mut self) {
        self.statistic.clear();
        self.last_sequence.clear();
    }

    pub fn log2(&self) -> f32 {
        (self.last_sequence().len() as f32).log2()
    }

    #[inline(always)]
    pub fn entropy(&self) -> f32 {
        let bin_width = 0.01;
        let mut counts = HashMap::new();

        for &value in &self.last_sequence {
            let bin = (value / bin_width).floor();
            *counts.entry(bin as i32).or_insert(0) += 1;
        }

        let total = self.last_sequence.len() as f32;
        if total == 0.0 {
            return 0.0;
        }

        counts
            .values()
            .map(|&count| {
                let p = count as f32 / total;
                -p * p.log2()
            })
            .sum()
    }

    #[inline(always)]
    pub fn percentile(&self, p: f32) -> f32 {
        if p < 0.0 || p > 100.0 {
            panic!("Percentile must be between 0 and 100");
        }

        let count = self.last_sequence.len() as f32;
        if count == 0.0 {
            return 0.0;
        }

        let index = (p / 100.0) * count;

        let sorted_values = { &self.last_sequence };

        let index = index as usize;

        if index == 0 && !sorted_values.is_empty() {
            return sorted_values[0];
        } else if index == sorted_values.len() {
            return sorted_values[sorted_values.len() - 1];
        } else if index >= sorted_values.len() {
            panic!(
                "Index out of bounds for the sorted values {} >= {}",
                index,
                sorted_values.len()
            );
        }

        sorted_values[index]
    }
}

impl From<&[f32]> for Distribution {
    fn from(value: &[f32]) -> Self {
        let mut result = Distribution::default();
        result.add(value);
        result
    }
}

impl From<Vec<f32>> for Distribution {
    fn from(value: Vec<f32>) -> Self {
        let mut result = Distribution::default();
        result.add(&value);
        result
    }
}

impl From<&Vec<usize>> for Distribution {
    fn from(value: &Vec<usize>) -> Self {
        let mut dist = Distribution::default();
        for v in value.iter().map(|&v| v as f32) {
            dist.statistic.add(v);
            dist.last_sequence.push(v);
        }

        dist
    }
}