simsam 0.1.0

Sample from custom discrete and continuous distributions (SciPy-like API)
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

use crate::error::BuildError;

/// Axis-aligned bounded support in R^n: `lo[i] <= x[i] <= hi[i]`.
#[derive(Debug, Clone, PartialEq)]
pub struct HyperRect {
    pub lo: Vec<f64>,
    pub hi: Vec<f64>,
}

impl HyperRect {
    pub fn new(lo: Vec<f64>, hi: Vec<f64>) -> Result<Self, BuildError> {
        let rect = Self { lo, hi };
        rect.validate()?;
        Ok(rect)
    }

    pub fn dim(&self) -> usize {
        self.lo.len()
    }

    pub fn validate(&self) -> Result<(), BuildError> {
        if self.lo.is_empty() || self.hi.is_empty() {
            return Err(BuildError::InvalidSupport("hyper-rect cannot be empty"));
        }
        if self.lo.len() != self.hi.len() {
            return Err(BuildError::InvalidSupport(
                "hyper-rect lo/hi must have same dimension",
            ));
        }
        for i in 0..self.lo.len() {
            let lo = self.lo[i];
            let hi = self.hi[i];
            if !lo.is_finite() || !hi.is_finite() {
                return Err(BuildError::NonFiniteValue("hyper-rect bounds"));
            }
            if lo >= hi {
                return Err(BuildError::InvalidSupport("each lo must be < hi"));
            }
        }
        Ok(())
    }

    pub fn contains(&self, x: &[f64]) -> bool {
        if x.len() != self.dim() {
            return false;
        }
        for i in 0..x.len() {
            if x[i] < self.lo[i] || x[i] > self.hi[i] {
                return false;
            }
        }
        true
    }
}