41     let it = v0.into_iter().interleave_shortest(v1.into_iter());  in interleave_shortest()
47     let it = v0.into_iter().interleave_shortest(v1.into_iter());  in interleave_shortest()
53     let it = i0.interleave_shortest(v1.into_iter());  in interleave_shortest()
58     let it = v0.into_iter().interleave_shortest(i1);  in interleave_shortest()
301     let results = bt1.into_iter().merge_by(bt2.into_iter(), |a, b| a.0 <= b.0 );  in merge_by_btree()
303     it::assert_equal(results, expected.into_iter());  in merge_by_btree()
317     let its = vec![3, 2, 1, 0].into_iter().map(|s| (s..10).step(4));  in kmerge_2()
392             v.into_iter()
608     let r = v.into_iter().pad_using(5, |n| n);  in pad_using()
612     let r = v.into_iter().pad_using(1, |_| panic!());  in pad_using()
638         let mut subs = groups.into_iter().collect_vec();  in group_by()
654     let mut subs = groups.into_iter().map(|(_, g)| g).collect_vec();  in group_by()
689         it::assert_equal(gr.into_iter().flat_map(|(_, sub)| sub), text.chars());  in group_by()
697     let gs = groups.into_iter().collect_vec();  in group_by_lazy_2()
698     it::assert_equal(data.iter(), gs.into_iter().flat_map(|(_k, g)| g));  in group_by_lazy_2()
702     let mut gs = groups.into_iter().collect_vec();  in group_by_lazy_2()
704     it::assert_equal(&[0, 0, 0, 1, 1], gs.into_iter().flat_map(|(_, g)| g));  in group_by_lazy_2()
718     for (i, (_, group)) in grouper.into_iter().enumerate() {  in group_by_lazy_2()
767     for (i, chunk) in grouper.into_iter().enumerate() {  in chunks()
781     assert_eq!(data.into_iter().concat(), Vec::new())  in concat_empty()
787     assert_eq!(data.into_iter().concat(), vec![1,2,3,4,5,6,7,8,9])  in concat_non_empty()
894     let b_map = b.into_iter().map(|f| f as i32);  in diff_mismatch()
908     let b_map = b.into_iter().map(|f| f as i32);  in diff_longer()
922     let b_map = b.into_iter().map(|f| f as i32);  in diff_shorter()
999     let sum = vec.into_iter().fold_while(0, |acc, item| {  in fold_while()