math-differential-evolution 0.3.3

Non linear optimisation library with own DE solvers and interface to NLOpt and MetaHeuristics
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

use rand::Rng;
use std::collections::HashSet;

pub(crate) fn distinct_indices<R: Rng + ?Sized>(
    exclude: usize,
    count: usize,
    pool_size: usize,
    rng: &mut R,
) -> Vec<usize> {
    debug_assert!(count <= pool_size.saturating_sub(1));
    let mut selected: HashSet<usize> = HashSet::with_capacity(count);
    while selected.len() < count {
        let idx = rng.random_range(0..pool_size);
        if idx != exclude {
            selected.insert(idx);
        }
    }
    selected.into_iter().collect()
}