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
use crate::ArgminMinMax;
use ndarray::{Array1, Array2};
macro_rules! make_minmax {
($t:ty) => {
impl ArgminMinMax for Array1<$t> {
#[inline]
fn min(x: &Self, y: &Self) -> Array1<$t> {
assert_eq!(x.shape(), y.shape());
x.iter()
.zip(y)
.map(|(&a, &b)| if a < b { a } else { b })
.collect()
}
#[inline]
fn max(x: &Self, y: &Self) -> Array1<$t> {
assert_eq!(x.shape(), y.shape());
x.iter()
.zip(y)
.map(|(&a, &b)| if a > b { a } else { b })
.collect()
}
}
impl ArgminMinMax for Array2<$t> {
#[inline]
fn min(x: &Self, y: &Self) -> Array2<$t> {
assert_eq!(x.shape(), y.shape());
let m = x.shape()[0];
let n = x.shape()[1];
let mut out = x.clone();
for i in 0..m {
for j in 0..n {
let a = x[(i, j)];
let b = y[(i, j)];
out[(i, j)] = if a < b { a } else { b };
}
}
out
}
#[inline]
fn max(x: &Self, y: &Self) -> Array2<$t> {
assert_eq!(x.shape(), y.shape());
let m = x.shape()[0];
let n = x.shape()[1];
let mut out = x.clone();
for i in 0..m {
for j in 0..n {
let a = x[(i, j)];
let b = y[(i, j)];
out[(i, j)] = if a > b { a } else { b };
}
}
out
}
}
};
}
make_minmax!(isize);
make_minmax!(usize);
make_minmax!(i8);
make_minmax!(u8);
make_minmax!(i16);
make_minmax!(u16);
make_minmax!(i32);
make_minmax!(u32);
make_minmax!(i64);
make_minmax!(u64);
make_minmax!(f32);
make_minmax!(f64);
#[cfg(test)]
mod tests {
use super::*;
use ndarray::array;
use paste::item;
macro_rules! make_test {
($t:ty) => {
item! {
#[test]
fn [<test_minmax_vec_vec_ $t>]() {
let a = array![1 as $t, 4 as $t, 8 as $t];
let b = array![2 as $t, 3 as $t, 4 as $t];
let target_max = array![2 as $t, 4 as $t, 8 as $t];
let target_min = array![1 as $t, 3 as $t, 4 as $t];
let res_max = <Array1<$t> as ArgminMinMax>::max(&a, &b);
let res_min = <Array1<$t> as ArgminMinMax>::min(&a, &b);
for i in 0..3 {
assert!(((target_max[i] - res_max[i]) as f64).abs() < std::f64::EPSILON);
assert!(((target_min[i] - res_min[i]) as f64).abs() < std::f64::EPSILON);
}
}
}
item! {
#[test]
fn [<test_minmax_mat_mat_ $t>]() {
let a = array![
[1 as $t, 4 as $t, 8 as $t],
[2 as $t, 5 as $t, 9 as $t]
];
let b = array![
[2 as $t, 3 as $t, 4 as $t],
[3 as $t, 4 as $t, 5 as $t]
];
let target_max = array![
[2 as $t, 4 as $t, 8 as $t],
[3 as $t, 5 as $t, 9 as $t]
];
let target_min = array![
[1 as $t, 3 as $t, 4 as $t],
[2 as $t, 4 as $t, 5 as $t]
];
let res_max = <Array2<$t> as ArgminMinMax>::max(&a, &b);
let res_min = <Array2<$t> as ArgminMinMax>::min(&a, &b);
for i in 0..3 {
for j in 0..2 {
assert!(((target_max[(j, i)] - res_max[(j, i)]) as f64).abs() < std::f64::EPSILON);
assert!(((target_min[(j, i)] - res_min[(j, i)]) as f64).abs() < std::f64::EPSILON);
}
}
}
}
};
}
make_test!(i8);
make_test!(u8);
make_test!(i16);
make_test!(u16);
make_test!(i32);
make_test!(u32);
make_test!(i64);
make_test!(u64);
make_test!(isize);
make_test!(usize);
make_test!(f32);
make_test!(f64);
}