mop-solvers 0.5.0

Solvers for MOP
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

use core::ops::{Mul, Range, Sub};
use num_traits::{NumCast, Pow, Zero};
use rand::{distributions::uniform::SampleUniform, Rng};

pub fn euclidean_distance<T>(first: &[T], second: &[T]) -> Option<T>
where
  T: Copy + Mul<T, Output = T> + NumCast + Pow<T, Output = T> + Sub<T, Output = T> + Zero,
{
  let mut distance = T::zero();
  for (a, b) in first.iter().copied().zip(second.iter().copied()) {
    let diff = b - a;
    distance = distance + diff * diff;
  }
  Some(distance.pow(NumCast::from(0.5)?))
}

/// Two ascending random numbers
pub fn two_asc_rnd_num<R, T>(rng: &mut R, range: Range<T>) -> [T; 2]
where
  R: Rng,
  T: Copy + SampleUniform + PartialOrd,
{
  let [first, second] = two_dist_rnd_num(rng, range);
  if first < second {
    [first, second]
  } else {
    [second, first]
  }
}

/// Two distinct random numbers
pub fn two_dist_rnd_num<R, T>(rng: &mut R, range: Range<T>) -> [T; 2]
where
  R: Rng,
  T: Copy + SampleUniform + PartialOrd,
{
  let first = rng.gen_range(range.start, range.end);
  let mut second = rng.gen_range(range.start, range.end);
  while first == second {
    second = rng.gen_range(range.start, range.end);
  }
  [first, second]
}