moors 0.2.10

Solving multi-objective optimization problems using genetic algorithms.
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

use crate::algorithms::AlgorithmBuilderError;

// Helper function for probability validation
pub(in crate::algorithms) fn validate_probability(
    value: f64,
    name: &str,
) -> Result<(), AlgorithmBuilderError> {
    if !(0.0..=1.0).contains(&value) {
        return Err(AlgorithmBuilderError::ValidationError(format!(
            "{} must be between 0 and 1, got {}",
            name, value
        )));
    }
    Ok(())
}

// Helper function for positive integer validation
pub(in crate::algorithms) fn validate_positive(
    value: usize,
    name: &str,
) -> Result<(), AlgorithmBuilderError> {
    if value == 0 {
        return Err(AlgorithmBuilderError::ValidationError(format!(
            "{} must be greater than 0",
            name
        )));
    }
    Ok(())
}

pub(in crate::algorithms) fn validate_bounds(
    lower_bound: f64,
    upper_bound: f64,
) -> Result<(), AlgorithmBuilderError> {
    if lower_bound >= upper_bound {
        return Err(AlgorithmBuilderError::ValidationError(format!(
            "Lower bound ({}) must be less than upper bound ({})",
            lower_bound, upper_bound
        )));
    }
    Ok(())
}