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
|
use crate::{Number, Float};
use crate::vector::*;
pub struct Bound2<T: Number> {
pub min: Vector2<T>,
pub max: Vector2<T>
}
pub type Bound2i = Bound2<i32>;
pub type Bound2f = Bound2<Float>;
fn min<T: Number> (a: T, b: T) -> T {
if b < a {
return b;
}
a
}
fn max<T: Number> (a: T, b: T) -> T {
if b > a {
return b;
}
a
}
impl<T: Number> Bound2<T> {
fn new(p0: &Vector2<T>, p1: &Vector2<T>) -> Bound2<T> {
let min = Vector2::from_xy(min(p0.x, p1.x), min(p0.y, p1.y));
let max = Vector2::from_xy(max(p0.x, p1.x), max(p0.y, p1.y));
Bound2 { min, max }
}
fn diagonal(&self) -> Vector2<T> {
self.max - self.min
}
fn area(&self) -> T {
let diag = self.diagonal();
return diag.x * diag.y;
}
}
impl From<&Bound2i> for Bound2f {
fn from(b: &Bound2i) -> Self {
Self {
min: Vector2f::from(b.min),
max: Vector2f::from(b.max),
}
}
}
impl From<&Bound2f> for Bound2i {
fn from(b: &Bound2f) -> Self {
Self {
min: Vector2i::from(b.min),
max: Vector2i::from(b.max),
}
}
}
pub fn intersect<T: Number>(a: &Bound2<T>, b: &Bound2<T>) -> Bound2<T> {
Bound2::new(
&Vector2::from_xy(max(a.min.x, b.min.x), max(a.min.y, b.min.y)),
&Vector2::from_xy(min(a.max.x, b.max.x), min(a.max.y, b.max.y)),
)
}
#[cfg(test)]
mod tests {
use super::*;
fn create_test() -> Bound2<i32> {
Bound2::new(
&Vector2::from_xy(1, 2),
&Vector2::from_xy(10, 3)
)
}
#[test]
fn area() {
let b = create_test();
assert!(b.area() == 9);
}
}
|
