@@ -31,7 +31,7 @@ fn check_specialized_count_last_nth_sizeh<IterItem, Iter>(
31
31
it : & Iter ,
32
32
known_expected_size : Option < usize > ,
33
33
) where
34
- IterItem : Eq + Debug ,
34
+ IterItem : Eq + Debug + Clone ,
35
35
Iter : Iterator < Item = IterItem > + Clone ,
36
36
{
37
37
let size = it. clone ( ) . count ( ) ;
@@ -54,13 +54,6 @@ fn check_specialized_count_last_nth_sizeh<IterItem, Iter>(
54
54
}
55
55
it_sh. next ( ) ;
56
56
}
57
- }
58
-
59
- fn check_specialized_fold < IterItem , Iter > ( it : & Iter )
60
- where
61
- IterItem : Eq + Debug + Clone ,
62
- Iter : Iterator < Item = IterItem > + Clone ,
63
- {
64
57
check_specialized ( it, |i| {
65
58
let mut parameters_from_fold = vec ! [ ] ;
66
59
let fold_result = i. fold ( vec ! [ ] , |mut acc, v : IterItem | {
@@ -77,13 +70,11 @@ fn put_back_test(test_vec: Vec<i32>, known_expected_size: Option<usize>) {
77
70
// Lexical lifetimes support
78
71
let pb = itertools:: put_back ( test_vec. iter ( ) ) ;
79
72
check_specialized_count_last_nth_sizeh ( & pb, known_expected_size) ;
80
- check_specialized_fold ( & pb) ;
81
73
}
82
74
83
75
let mut pb = itertools:: put_back ( test_vec. into_iter ( ) ) ;
84
76
pb. put_back ( 1 ) ;
85
77
check_specialized_count_last_nth_sizeh ( & pb, known_expected_size. map ( |x| x + 1 ) ) ;
86
- check_specialized_fold ( & pb)
87
78
}
88
79
89
80
#[ test]
@@ -102,12 +93,10 @@ fn merge_join_by_test(i1: Vec<usize>, i2: Vec<usize>, known_expected_size: Optio
102
93
let i2 = i2. into_iter ( ) ;
103
94
let mjb = i1. clone ( ) . merge_join_by ( i2. clone ( ) , std:: cmp:: Ord :: cmp) ;
104
95
check_specialized_count_last_nth_sizeh ( & mjb, known_expected_size) ;
105
- check_specialized_fold ( & mjb) ;
106
96
107
97
// And the other way around
108
98
let mjb = i2. merge_join_by ( i1, std:: cmp:: Ord :: cmp) ;
109
99
check_specialized_count_last_nth_sizeh ( & mjb, known_expected_size) ;
110
- check_specialized_fold ( & mjb) ;
111
100
}
112
101
113
102
#[ test]
0 commit comments