pythagore 0.8.3

Mathematics tools for simple geometry
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

use std::cmp::{max, min};
use std::ops::Bound;
use std::ops::Bound::{Excluded, Included, Unbounded};
use na::{Point, Scalar};

/// Compute greatest start bound
pub fn max_bound<N: PartialOrd>(a: Bound<N>, b: Bound<N>) -> Bound<N> {
    match (&a, &b) {
        (Included(va), Included(vb)) |
        (Excluded(va), Excluded(vb)) |
        (Excluded(va), Included(vb)) => if va < vb { b } else { a },
        (Included(va), Excluded(vb)) => if va <= vb { b } else { a },
        (_, Unbounded) => a,
        (Unbounded, _) => b,
    }
}

/// Compute point with maximum coordinates
pub fn max_point<N: Default + Copy + Ord + Scalar, const D: usize>(a: &Point<N, D>, b: &Point<N, D>) -> Point<N, D> {
    let mut coords = [N::default(); D];

    for (idx, x) in coords.iter_mut().enumerate() {
        *x = *max(
            unsafe { a.get_unchecked(idx) },
            unsafe { b.get_unchecked(idx) }
        );
    }

    Point::from(coords)
}

/// Compute smallest end bound
pub fn min_bound<N: PartialOrd>(a: Bound<N>, b: Bound<N>) -> Bound<N> {
    match (&a, &b) {
        (Included(va), Included(vb)) |
        (Excluded(va), Excluded(vb)) |
        (Included(va), Excluded(vb)) => if va < vb { a } else { b },
        (Excluded(va), Included(vb)) => if va <= vb { a } else { b },
        (_, Unbounded) => a,
        (Unbounded, _) => b,
    }
}

/// Compute point with minimum coordinates
pub fn min_point<N: Default + Copy + Ord + Scalar, const D: usize>(a: &Point<N, D>, b: &Point<N, D>) -> Point<N, D> {
    let mut coords = [N::default(); D];

    for (idx, x) in coords.iter_mut().enumerate() {
        *x = *min(
            unsafe { a.get_unchecked(idx) },
            unsafe { b.get_unchecked(idx) }
        );
    }

    Point::from(coords)
}

// Tests
#[cfg(test)]
mod tests {
    use na::point;
    use super::*;

    #[test]
    fn test_max_bound() {
        assert_eq!(max_bound(Included(0), Included(5)), Included(5));
        assert_eq!(max_bound(Included(0), Excluded(5)), Excluded(5));
        assert_eq!(max_bound(Included(0), Excluded(0)), Excluded(0));
        assert_eq!(max_bound(Excluded(0), Included(5)), Included(5));
        assert_eq!(max_bound(Excluded(0), Included(0)), Excluded(0));
        assert_eq!(max_bound(Excluded(0), Excluded(5)), Excluded(5));
        assert_eq!(max_bound(Excluded(0), Unbounded), Excluded(0));
        assert_eq!(max_bound(Unbounded, Included(5)), Included(5));
    }

    #[test]
    fn test_max_point() {
        assert_eq!(max_point(&point![0, 5], &point![5, 0]), point![5, 5]);
    }

    #[test]
    fn test_min_bound() {
        assert_eq!(min_bound(Included(0), Included(5)), Included(0));
        assert_eq!(min_bound(Included(0), Excluded(5)), Included(0));
        assert_eq!(min_bound(Included(0), Excluded(0)), Excluded(0));
        assert_eq!(min_bound(Excluded(0), Included(5)), Excluded(0));
        assert_eq!(min_bound(Excluded(0), Included(0)), Excluded(0));
        assert_eq!(min_bound(Excluded(0), Excluded(5)), Excluded(0));
        assert_eq!(min_bound(Excluded(0), Unbounded), Excluded(0));
        assert_eq!(min_bound(Unbounded, Included(5)), Included(5));
    }

    #[test]
    fn test_min_point() {
        assert_eq!(min_point(&point![0, 5], &point![5, 0]), point![0, 0]);
    }
}