@@ -21,8 +21,8 @@ impl<D: Decoder, A: Array<Item: Decodable<D>>> Decodable<D> for SmallVec<A> {
2121 d. read_seq ( |d, len| {
2222 let mut vec = SmallVec :: with_capacity ( len) ;
2323 // 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) ) ?) ;
2626 }
2727 Ok ( vec)
2828 } )
@@ -44,8 +44,8 @@ impl<D: Decoder, T: Decodable<D>> Decodable<D> for LinkedList<T> {
4444 fn decode ( d : & mut D ) -> Result < LinkedList < T > , D :: Error > {
4545 d. read_seq ( |d, len| {
4646 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) ) ?) ;
4949 }
5050 Ok ( list)
5151 } )
@@ -67,8 +67,8 @@ impl<D: Decoder, T: Decodable<D>> Decodable<D> for VecDeque<T> {
6767 fn decode ( d : & mut D ) -> Result < VecDeque < T > , D :: Error > {
6868 d. read_seq ( |d, len| {
6969 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) ) ?) ;
7272 }
7373 Ok ( deque)
7474 } )
8484 e. emit_map ( self . len ( ) , |e| {
8585 for ( i, ( key, val) ) in self . iter ( ) . enumerate ( ) {
8686 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) ) ?;
8888 }
8989 Ok ( ( ) )
9090 } )
9999 fn decode ( d : & mut D ) -> Result < BTreeMap < K , V > , D :: Error > {
100100 d. read_map ( |d, len| {
101101 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) ) ?;
105105 map. insert ( key, val) ;
106106 }
107107 Ok ( map)
@@ -130,8 +130,8 @@ where
130130 fn decode ( d : & mut D ) -> Result < BTreeSet < T > , D :: Error > {
131131 d. read_seq ( |d, len| {
132132 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) ) ?) ;
135135 }
136136 Ok ( set)
137137 } )
@@ -148,7 +148,7 @@ where
148148 e. emit_map ( self . len ( ) , |e| {
149149 for ( i, ( key, val) ) in self . iter ( ) . enumerate ( ) {
150150 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) ) ?;
152152 }
153153 Ok ( ( ) )
154154 } )
@@ -165,9 +165,9 @@ where
165165 d. read_map ( |d, len| {
166166 let state = Default :: default ( ) ;
167167 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) ) ?;
171171 map. insert ( key, val) ;
172172 }
173173 Ok ( map)
@@ -209,8 +209,8 @@ where
209209 d. read_seq ( |d, len| {
210210 let state = Default :: default ( ) ;
211211 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) ) ?) ;
214214 }
215215 Ok ( set)
216216 } )
@@ -227,7 +227,7 @@ where
227227 e. emit_map ( self . len ( ) , |e| {
228228 for ( i, ( key, val) ) in self . iter ( ) . enumerate ( ) {
229229 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) ) ?;
231231 }
232232 Ok ( ( ) )
233233 } )
@@ -244,9 +244,9 @@ where
244244 d. read_map ( |d, len| {
245245 let state = Default :: default ( ) ;
246246 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) ) ?;
250250 map. insert ( key, val) ;
251251 }
252252 Ok ( map)
@@ -278,8 +278,8 @@ where
278278 d. read_seq ( |d, len| {
279279 let state = Default :: default ( ) ;
280280 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) ) ?) ;
283283 }
284284 Ok ( set)
285285 } )
0 commit comments