prodef 0.1.0

A simple Rust crate for handling probability distributions.
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
152
153
154
155
156
157
158
159
160
161
162

use crate::Domain;
use nalgebra::{Dim, RealField, SVector, Scalar, U1, VectorView};
use serde::{Deserialize, Serialize};

/// A simple, 1-dimensional, function domain.
///
/// This domain can represent bounded, unbounded, constant, and discrete value ranges.
#[allow(missing_docs)]
#[derive(Clone, Debug, Deserialize, PartialEq, Serialize)]
pub enum SDomain<T> {
    Bounded(T, T),
    Constant(T),
    LeftBounded(T),
    RightBounded(T),
    Unbounded,
}

impl<T> SDomain<T>
where
    T: Clone + PartialOrd,
{
    /// Create a new [`SDomain`].
    pub fn new(opt_min: Option<T>, opt_max: Option<T>) -> Option<Self> {
        Some(match (opt_min, opt_max) {
            (None, None) => Self::Unbounded,
            (Some(a), None) => Self::LeftBounded(a),
            (None, Some(b)) => Self::RightBounded(b),
            (Some(a), Some(b)) => {
                if a > b {
                    return None;
                }

                if a == b {
                    Self::Constant(a)
                } else {
                    Self::Bounded(a, b)
                }
            }
        })
    }

    /// Returns an unbounded domain.
    pub fn unbounded() -> Self {
        Self::Unbounded
    }
}

impl<T> Domain<T, U1> for SDomain<T>
where
    T: PartialOrd + Scalar + Send + Sync,
{
    fn clip<RStride: Dim, CStride: Dim>(
        &self,
        sample: &VectorView<T, U1, RStride, CStride>,
    ) -> SVector<T, 1> {
        (&self).clip(sample)
    }

    fn contains<RStride: Dim, CStride: Dim>(
        &self,
        sample: &VectorView<T, U1, RStride, CStride>,
    ) -> bool {
        (&self).contains(sample)
    }

    fn maximum_values(&self) -> Option<SVector<T, 1>> {
        (&self).maximum_values()
    }

    fn minimum_values(&self) -> Option<SVector<T, 1>> {
        (&self).minimum_values()
    }

    fn size(&self) -> SVector<Option<T>, 1>
    where
        T: RealField,
    {
        (&self).size()
    }
}

impl<T> Domain<T, U1> for &SDomain<T>
where
    T: PartialOrd + Scalar + Send + Sync,
{
    fn clip<RStride: Dim, CStride: Dim>(
        &self,
        sample: &VectorView<T, U1, RStride, CStride>,
    ) -> SVector<T, 1> {
        let value = sample.clone_owned();

        match self {
            SDomain::Bounded(a, b) => {
                if value[0] < *a {
                    SVector::from([a.clone()])
                } else if value[0] > *b {
                    SVector::from([b.clone()])
                } else {
                    value
                }
            }
            SDomain::Constant(a) => SVector::from([a.clone()]),
            SDomain::LeftBounded(a) => {
                if value[0] < *a {
                    SVector::from([a.clone()])
                } else {
                    value
                }
            }
            SDomain::RightBounded(b) => {
                if value[0] > *b {
                    SVector::from([b.clone()])
                } else {
                    value
                }
            }
            SDomain::Unbounded => value,
        }
    }

    fn contains<RStride: Dim, CStride: Dim>(
        &self,
        sample: &VectorView<T, U1, RStride, CStride>,
    ) -> bool {
        match self {
            SDomain::Bounded(a, b) => (sample[0] > *a) & (sample[0] < *b),
            SDomain::Constant(a) => sample[0] == *a,
            SDomain::LeftBounded(a) => sample[0] > *a,
            SDomain::RightBounded(b) => sample[0] < *b,
            SDomain::Unbounded => true,
        }
    }

    fn maximum_values(&self) -> Option<SVector<T, 1>> {
        match self {
            SDomain::Bounded(_, b) => Some(SVector::from([b.clone()])),
            SDomain::Constant(value) => Some(SVector::from([value.clone()])),
            SDomain::RightBounded(b) => Some(SVector::from([b.clone()])),
            _ => None,
        }
    }

    fn minimum_values(&self) -> Option<SVector<T, 1>> {
        match self {
            SDomain::Bounded(a, _) => Some(SVector::from([a.clone()])),
            SDomain::Constant(value) => Some(SVector::from([value.clone()])),
            SDomain::LeftBounded(a) => Some(SVector::from([a.clone()])),
            _ => None,
        }
    }

    fn size(&self) -> SVector<Option<T>, 1>
    where
        T: RealField,
    {
        SVector::from([match self {
            SDomain::Bounded(a, b) => Some(b.clone() - a.clone()),
            SDomain::Constant(..) => Some(T::zero()),
            _ => None,
        }])
    }
}