@@ -21,8 +21,8 @@ impl<D: Decoder, A: Array<Item: Decodable<D>>> Decodable<D> for SmallVec<A> {
21
21
d. read_seq ( |d, len| {
22
22
let mut vec = SmallVec :: with_capacity ( len) ;
23
23
// FIXME(#48994) - could just be collected into a Result<SmallVec, D::Error>
24
- for i in 0 ..len {
25
- vec. push ( d. read_seq_elt ( i , |d| Decodable :: decode ( d) ) ?) ;
24
+ for _ in 0 ..len {
25
+ vec. push ( d. read_seq_elt ( |d| Decodable :: decode ( d) ) ?) ;
26
26
}
27
27
Ok ( vec)
28
28
} )
@@ -44,8 +44,8 @@ impl<D: Decoder, T: Decodable<D>> Decodable<D> for LinkedList<T> {
44
44
fn decode ( d : & mut D ) -> Result < LinkedList < T > , D :: Error > {
45
45
d. read_seq ( |d, len| {
46
46
let mut list = LinkedList :: new ( ) ;
47
- for i in 0 ..len {
48
- list. push_back ( d. read_seq_elt ( i , |d| Decodable :: decode ( d) ) ?) ;
47
+ for _ in 0 ..len {
48
+ list. push_back ( d. read_seq_elt ( |d| Decodable :: decode ( d) ) ?) ;
49
49
}
50
50
Ok ( list)
51
51
} )
@@ -67,8 +67,8 @@ impl<D: Decoder, T: Decodable<D>> Decodable<D> for VecDeque<T> {
67
67
fn decode ( d : & mut D ) -> Result < VecDeque < T > , D :: Error > {
68
68
d. read_seq ( |d, len| {
69
69
let mut deque: VecDeque < T > = VecDeque :: with_capacity ( len) ;
70
- for i in 0 ..len {
71
- deque. push_back ( d. read_seq_elt ( i , |d| Decodable :: decode ( d) ) ?) ;
70
+ for _ in 0 ..len {
71
+ deque. push_back ( d. read_seq_elt ( |d| Decodable :: decode ( d) ) ?) ;
72
72
}
73
73
Ok ( deque)
74
74
} )
84
84
e. emit_map ( self . len ( ) , |e| {
85
85
for ( i, ( key, val) ) in self . iter ( ) . enumerate ( ) {
86
86
e. emit_map_elt_key ( i, |e| key. encode ( e) ) ?;
87
- e. emit_map_elt_val ( i , |e| val. encode ( e) ) ?;
87
+ e. emit_map_elt_val ( |e| val. encode ( e) ) ?;
88
88
}
89
89
Ok ( ( ) )
90
90
} )
99
99
fn decode ( d : & mut D ) -> Result < BTreeMap < K , V > , D :: Error > {
100
100
d. read_map ( |d, len| {
101
101
let mut map = BTreeMap :: new ( ) ;
102
- for i in 0 ..len {
103
- let key = d. read_map_elt_key ( i , |d| Decodable :: decode ( d) ) ?;
104
- let val = d. read_map_elt_val ( i , |d| Decodable :: decode ( d) ) ?;
102
+ for _ in 0 ..len {
103
+ let key = d. read_map_elt_key ( |d| Decodable :: decode ( d) ) ?;
104
+ let val = d. read_map_elt_val ( |d| Decodable :: decode ( d) ) ?;
105
105
map. insert ( key, val) ;
106
106
}
107
107
Ok ( map)
@@ -130,8 +130,8 @@ where
130
130
fn decode ( d : & mut D ) -> Result < BTreeSet < T > , D :: Error > {
131
131
d. read_seq ( |d, len| {
132
132
let mut set = BTreeSet :: new ( ) ;
133
- for i in 0 ..len {
134
- set. insert ( d. read_seq_elt ( i , |d| Decodable :: decode ( d) ) ?) ;
133
+ for _ in 0 ..len {
134
+ set. insert ( d. read_seq_elt ( |d| Decodable :: decode ( d) ) ?) ;
135
135
}
136
136
Ok ( set)
137
137
} )
@@ -148,7 +148,7 @@ where
148
148
e. emit_map ( self . len ( ) , |e| {
149
149
for ( i, ( key, val) ) in self . iter ( ) . enumerate ( ) {
150
150
e. emit_map_elt_key ( i, |e| key. encode ( e) ) ?;
151
- e. emit_map_elt_val ( i , |e| val. encode ( e) ) ?;
151
+ e. emit_map_elt_val ( |e| val. encode ( e) ) ?;
152
152
}
153
153
Ok ( ( ) )
154
154
} )
@@ -165,9 +165,9 @@ where
165
165
d. read_map ( |d, len| {
166
166
let state = Default :: default ( ) ;
167
167
let mut map = HashMap :: with_capacity_and_hasher ( len, state) ;
168
- for i in 0 ..len {
169
- let key = d. read_map_elt_key ( i , |d| Decodable :: decode ( d) ) ?;
170
- let val = d. read_map_elt_val ( i , |d| Decodable :: decode ( d) ) ?;
168
+ for _ in 0 ..len {
169
+ let key = d. read_map_elt_key ( |d| Decodable :: decode ( d) ) ?;
170
+ let val = d. read_map_elt_val ( |d| Decodable :: decode ( d) ) ?;
171
171
map. insert ( key, val) ;
172
172
}
173
173
Ok ( map)
@@ -209,8 +209,8 @@ where
209
209
d. read_seq ( |d, len| {
210
210
let state = Default :: default ( ) ;
211
211
let mut set = HashSet :: with_capacity_and_hasher ( len, state) ;
212
- for i in 0 ..len {
213
- set. insert ( d. read_seq_elt ( i , |d| Decodable :: decode ( d) ) ?) ;
212
+ for _ in 0 ..len {
213
+ set. insert ( d. read_seq_elt ( |d| Decodable :: decode ( d) ) ?) ;
214
214
}
215
215
Ok ( set)
216
216
} )
@@ -227,7 +227,7 @@ where
227
227
e. emit_map ( self . len ( ) , |e| {
228
228
for ( i, ( key, val) ) in self . iter ( ) . enumerate ( ) {
229
229
e. emit_map_elt_key ( i, |e| key. encode ( e) ) ?;
230
- e. emit_map_elt_val ( i , |e| val. encode ( e) ) ?;
230
+ e. emit_map_elt_val ( |e| val. encode ( e) ) ?;
231
231
}
232
232
Ok ( ( ) )
233
233
} )
@@ -244,9 +244,9 @@ where
244
244
d. read_map ( |d, len| {
245
245
let state = Default :: default ( ) ;
246
246
let mut map = indexmap:: IndexMap :: with_capacity_and_hasher ( len, state) ;
247
- for i in 0 ..len {
248
- let key = d. read_map_elt_key ( i , |d| Decodable :: decode ( d) ) ?;
249
- let val = d. read_map_elt_val ( i , |d| Decodable :: decode ( d) ) ?;
247
+ for _ in 0 ..len {
248
+ let key = d. read_map_elt_key ( |d| Decodable :: decode ( d) ) ?;
249
+ let val = d. read_map_elt_val ( |d| Decodable :: decode ( d) ) ?;
250
250
map. insert ( key, val) ;
251
251
}
252
252
Ok ( map)
@@ -278,8 +278,8 @@ where
278
278
d. read_seq ( |d, len| {
279
279
let state = Default :: default ( ) ;
280
280
let mut set = indexmap:: IndexSet :: with_capacity_and_hasher ( len, state) ;
281
- for i in 0 ..len {
282
- set. insert ( d. read_seq_elt ( i , |d| Decodable :: decode ( d) ) ?) ;
281
+ for _ in 0 ..len {
282
+ set. insert ( d. read_seq_elt ( |d| Decodable :: decode ( d) ) ?) ;
283
283
}
284
284
Ok ( set)
285
285
} )
0 commit comments