@@ -244,26 +244,30 @@ peeking_next_by_clone! { ['a, T] ::std::result::Iter<'a, T> }
244244peeking_next_by_clone ! { [ T ] :: std:: iter:: Empty <T > }
245245
246246#[ cfg( feature = "use_alloc" ) ]
247- const _ : ( ) = {
248- peeking_next_by_clone ! { [ ' a , T ] alloc :: collections :: linked_list :: Iter < ' a , T > }
249- peeking_next_by_clone ! { [ ' a, T ] alloc:: collections:: vec_deque:: Iter <' a, T > }
247+ peeking_next_by_clone ! { [ ' a , T ] alloc :: collections :: linked_list :: Iter < ' a , T > }
248+ # [ cfg ( feature = "use_alloc" ) ]
249+ peeking_next_by_clone ! { [ ' a, T ] alloc:: collections:: vec_deque:: Iter <' a, T > }
250250
251- peeking_next_by_clone ! { [ ' a, K , V ] alloc:: collections:: btree_map:: Iter <' a, K , V > }
252- peeking_next_by_clone ! { [ ' a, K , V ] alloc:: collections:: btree_map:: Keys <' a, K , V > }
253- peeking_next_by_clone ! { [ ' a, K , V ] alloc:: collections:: btree_map:: Values <' a, K , V > }
251+ #[ cfg( feature = "use_alloc" ) ]
252+ peeking_next_by_clone ! { [ ' a, K , V ] alloc:: collections:: btree_map:: Iter <' a, K , V > }
253+ #[ cfg( feature = "use_alloc" ) ]
254+ peeking_next_by_clone ! { [ ' a, K , V ] alloc:: collections:: btree_map:: Keys <' a, K , V > }
255+ #[ cfg( feature = "use_alloc" ) ]
256+ peeking_next_by_clone ! { [ ' a, K , V ] alloc:: collections:: btree_map:: Values <' a, K , V > }
254257
255- peeking_next_by_clone ! { [ ' a, T ] alloc:: collections:: btree_set:: Iter <' a, T > }
256- peeking_next_by_clone ! { [ ' a, T ] alloc:: collections:: binary_heap:: Iter <' a, T > }
257- } ;
258+ #[ cfg( feature = "use_alloc" ) ]
259+ peeking_next_by_clone ! { [ ' a, T ] alloc:: collections:: btree_set:: Iter <' a, T > }
260+ #[ cfg( feature = "use_alloc" ) ]
261+ peeking_next_by_clone ! { [ ' a, T ] alloc:: collections:: binary_heap:: Iter <' a, T > }
258262
259263#[ cfg( feature = "use_std" ) ]
260- const _: ( ) = {
261- peeking_next_by_clone ! { [ ' a, K , V ] std:: collections:: hash_map:: Iter <' a, K , V > }
262- peeking_next_by_clone ! { [ ' a, K , V ] std:: collections:: hash_map:: Keys <' a, K , V > }
263- peeking_next_by_clone ! { [ ' a, K , V ] std:: collections:: hash_map:: Values <' a, K , V > }
264+ peeking_next_by_clone ! { [ ' a, K , V ] std:: collections:: hash_map:: Iter <' a, K , V > }
265+ #[ cfg( feature = "use_std" ) ]
266+ peeking_next_by_clone ! { [ ' a, K , V ] std:: collections:: hash_map:: Keys <' a, K , V > }
267+ #[ cfg( feature = "use_std" ) ]
268+ peeking_next_by_clone ! { [ ' a, K , V ] std:: collections:: hash_map:: Values <' a, K , V > }
264269
265- peeking_next_by_clone ! { [ ' a, T ] std:: collections:: hash_set:: Iter <' a, T > }
266- } ;
270+ peeking_next_by_clone ! { [ ' a, T ] std:: collections:: hash_set:: Iter <' a, T > }
267271
268272// cloning a Rev has no extra overhead; peekable and put backs are never DEI.
269273peeking_next_by_clone ! { [ I : Clone + PeekingNext + DoubleEndedIterator ]
0 commit comments