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
// Copyright 2018 Stefan Kroboth
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://apache.org/licenses/LICENSE-2.0> or the MIT license <LICENSE-MIT or
// http://opensource.org/licenses/MIT>, at your option. This file may not be
// copied, modified, or distributed except according to those terms.
use crate::math::ArgminZeroLike;
impl<T> ArgminZeroLike for Vec<T>
where
T: ArgminZeroLike + Clone,
{
#[inline]
fn zero_like(&self) -> Vec<T> {
if !self.is_empty() {
vec![self[0].zero_like(); self.len()]
} else {
vec![]
}
}
}
#[cfg(test)]
mod tests {
use super::*;
use paste::item;
macro_rules! make_test {
($t:ty) => {
item! {
#[test]
fn [<test_zero_like_ $t>]() {
let t: Vec<$t> = vec![];
let a = t.zero_like();
assert_eq!(t, a);
}
}
item! {
#[test]
fn [<test_zero_like_2_ $t>]() {
let a = (vec![42 as $t; 4]).zero_like();
for i in 0..4 {
assert!(((0 as $t - a[i]) as f64).abs() < std::f64::EPSILON);
}
}
}
item! {
#[test]
fn [<test_2d_zero_like_ $t>]() {
let t: Vec<Vec<$t>> = vec![];
let a = t.zero_like();
assert_eq!(t, a);
}
}
item! {
#[test]
fn [<test_2d_zero_like_2_ $t>]() {
let a = (vec![vec![42 as $t; 2]; 2]).zero_like();
for i in 0..2 {
for j in 0..2 {
assert!(((0 as $t - a[i][j]) as f64).abs() < std::f64::EPSILON);
}
}
}
}
};
}
make_test!(isize);
make_test!(usize);
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!(f32);
make_test!(f64);
}