Skip to content

Commit dcf720b

Browse files
committed
add type annotations to test sums
1 parent 68aabe9 commit dcf720b

File tree

1 file changed

+23
-23
lines changed

1 file changed

+23
-23
lines changed

src/iter/test.rs

Lines changed: 23 additions & 23 deletions
Original file line numberDiff line numberDiff line change
@@ -280,7 +280,7 @@ pub fn check_skip() {
280280
.map(|&n| num.fetch_add(n, Ordering::Relaxed))
281281
.skip(512)
282282
.count();
283-
assert_eq!(num.load(Ordering::Relaxed), a.iter().sum());
283+
assert_eq!(num.load(Ordering::Relaxed), a.iter().sum::<usize>());
284284
}
285285

286286
#[test]
@@ -308,7 +308,7 @@ pub fn check_inspect() {
308308
use std::sync::atomic::{AtomicUsize, Ordering};
309309

310310
let a = AtomicUsize::new(0);
311-
let b =
311+
let b: usize =
312312
(0_usize..1024).into_par_iter().inspect(|&i| { a.fetch_add(i, Ordering::Relaxed); }).sum();
313313

314314
assert_eq!(a.load(Ordering::Relaxed), b);
@@ -997,19 +997,19 @@ pub fn check_windows() {
997997
pub fn check_options() {
998998
let mut a = vec![None, Some(1), None, None, Some(2), Some(4)];
999999

1000-
assert_eq!(7, a.par_iter().flat_map(|opt| opt).sum());
1001-
assert_eq!(7, a.par_iter().flat_map(|opt| opt).sum());
1000+
assert_eq!(7, a.par_iter().flat_map(|opt| opt).sum::<i32>());
1001+
assert_eq!(7, a.par_iter().flat_map(|opt| opt).sum::<i32>());
10021002

10031003
a.par_iter_mut().flat_map(|opt| opt).for_each(|x| *x = *x * *x);
10041004

1005-
assert_eq!(21, a.into_par_iter().flat_map(|opt| opt).sum());
1005+
assert_eq!(21, a.into_par_iter().flat_map(|opt| opt).sum::<i32>());
10061006
}
10071007

10081008
#[test]
10091009
pub fn check_results() {
10101010
let mut a = vec![Err(()), Ok(1i32), Err(()), Err(()), Ok(2), Ok(4)];
10111011

1012-
assert_eq!(7, a.par_iter().flat_map(|res| res).sum());
1012+
assert_eq!(7, a.par_iter().flat_map(|res| res).sum::<i32>());
10131013

10141014
assert_eq!(Err::<i32, ()>(()), a.par_iter().cloned().sum());
10151015
assert_eq!(Ok(7),
@@ -1027,7 +1027,7 @@ pub fn check_results() {
10271027

10281028
a.par_iter_mut().flat_map(|res| res).for_each(|x| *x = *x * *x);
10291029

1030-
assert_eq!(21, a.into_par_iter().flat_map(|res| res).sum());
1030+
assert_eq!(21, a.into_par_iter().flat_map(|res| res).sum::<i32>());
10311031
}
10321032

10331033
#[test]
@@ -1036,8 +1036,8 @@ pub fn check_binary_heap() {
10361036

10371037
let a: BinaryHeap<i32> = (0..10).collect();
10381038

1039-
assert_eq!(45, a.par_iter().sum());
1040-
assert_eq!(45, a.into_par_iter().sum());
1039+
assert_eq!(45, a.par_iter().sum::<i32>());
1040+
assert_eq!(45, a.into_par_iter().sum::<i32>());
10411041
}
10421042

10431043
#[test]
@@ -1046,12 +1046,12 @@ pub fn check_btree_map() {
10461046

10471047
let mut a: BTreeMap<i32, i32> = (0..10).map(|i| (i, -i)).collect();
10481048

1049-
assert_eq!(45, a.par_iter().map(|(&k, _)| k).sum());
1050-
assert_eq!(-45, a.par_iter().map(|(_, &v)| v).sum());
1049+
assert_eq!(45, a.par_iter().map(|(&k, _)| k).sum::<i32>());
1050+
assert_eq!(-45, a.par_iter().map(|(_, &v)| v).sum::<i32>());
10511051

10521052
a.par_iter_mut().for_each(|(k, v)| *v += *k);
10531053

1054-
assert_eq!(0, a.into_par_iter().map(|(_, v)| v).sum());
1054+
assert_eq!(0, a.into_par_iter().map(|(_, v)| v).sum::<i32>());
10551055
}
10561056

10571057
#[test]
@@ -1060,8 +1060,8 @@ pub fn check_btree_set() {
10601060

10611061
let a: BTreeSet<i32> = (0..10).collect();
10621062

1063-
assert_eq!(45, a.par_iter().sum());
1064-
assert_eq!(45, a.into_par_iter().sum());
1063+
assert_eq!(45, a.par_iter().sum::<i32>());
1064+
assert_eq!(45, a.into_par_iter().sum::<i32>());
10651065
}
10661066

10671067
#[test]
@@ -1070,12 +1070,12 @@ pub fn check_hash_map() {
10701070

10711071
let mut a: HashMap<i32, i32> = (0..10).map(|i| (i, -i)).collect();
10721072

1073-
assert_eq!(45, a.par_iter().map(|(&k, _)| k).sum());
1074-
assert_eq!(-45, a.par_iter().map(|(_, &v)| v).sum());
1073+
assert_eq!(45, a.par_iter().map(|(&k, _)| k).sum::<i32>());
1074+
assert_eq!(-45, a.par_iter().map(|(_, &v)| v).sum::<i32>());
10751075

10761076
a.par_iter_mut().for_each(|(k, v)| *v += *k);
10771077

1078-
assert_eq!(0, a.into_par_iter().map(|(_, v)| v).sum());
1078+
assert_eq!(0, a.into_par_iter().map(|(_, v)| v).sum::<i32>());
10791079
}
10801080

10811081
#[test]
@@ -1084,8 +1084,8 @@ pub fn check_hash_set() {
10841084

10851085
let a: HashSet<i32> = (0..10).collect();
10861086

1087-
assert_eq!(45, a.par_iter().sum());
1088-
assert_eq!(45, a.into_par_iter().sum());
1087+
assert_eq!(45, a.par_iter().sum::<i32>());
1088+
assert_eq!(45, a.into_par_iter().sum::<i32>());
10891089
}
10901090

10911091
#[test]
@@ -1094,11 +1094,11 @@ pub fn check_linked_list() {
10941094

10951095
let mut a: LinkedList<i32> = (0..10).collect();
10961096

1097-
assert_eq!(45, a.par_iter().sum());
1097+
assert_eq!(45, a.par_iter().sum::<i32>());
10981098

10991099
a.par_iter_mut().for_each(|x| *x = -*x);
11001100

1101-
assert_eq!(-45, a.into_par_iter().sum());
1101+
assert_eq!(-45, a.into_par_iter().sum::<i32>());
11021102
}
11031103

11041104
#[test]
@@ -1111,11 +1111,11 @@ pub fn check_vec_deque() {
11111111
a.drain(..5);
11121112
a.extend(0..5);
11131113

1114-
assert_eq!(45, a.par_iter().sum());
1114+
assert_eq!(45, a.par_iter().sum::<i32>());
11151115

11161116
a.par_iter_mut().for_each(|x| *x = -*x);
11171117

1118-
assert_eq!(-45, a.into_par_iter().sum());
1118+
assert_eq!(-45, a.into_par_iter().sum::<i32>());
11191119
}
11201120

11211121
#[test]

0 commit comments

Comments
 (0)