Lines Matching refs:collect
28 let a: Vec<i32> = (0..1024).collect(); in execute()
31 let c: Vec<i32> = (0..1024).map(|i| i + 1).collect(); in execute()
37 let a: Vec<i32> = (0..1024).collect(); in execute_cloned()
40 let c: Vec<i32> = (0..1024).collect(); in execute_cloned()
49 let c: Vec<i32> = (0..1024).map(|i| i + 1).collect(); in execute_range()
56 let b: LinkedList<i64> = a.into_par_iter().map(|i| i + 1).collect(); in execute_unindexed_range()
57 let c: LinkedList<i64> = (0..1024).map(|i| i + 1).collect(); in execute_unindexed_range()
70 let b: Vec<i128> = a.map(|i| i + 1).collect(); in execute_pseudo_indexed_range()
71 let c: Vec<i128> = range.map(|i| i + 1).collect(); in execute_pseudo_indexed_range()
83 let a: Vec<i32> = (0..1024).collect(); in map_sum()
91 let a: Vec<i32> = (0..1024).collect(); in map_reduce()
99 let a: Vec<i32> = (0..1024).collect(); in map_reduce_with()
187 let a: Vec<i32> = (0..1024).step_by(2).collect(); in check_step_by()
188 let b: Vec<i32> = (0..1024).into_par_iter().step_by(2).collect(); in check_step_by()
195 let a: Vec<i32> = (0..1029).step_by(10).collect(); in check_step_by_unaligned()
196 let b: Vec<i32> = (0..1029).into_par_iter().step_by(10).collect(); in check_step_by_unaligned()
203 let a: Vec<i32> = (0..1024).step_by(2).rev().collect(); in check_step_by_rev()
204 let b: Vec<i32> = (0..1024).into_par_iter().step_by(2).rev().collect(); in check_step_by_rev()
211 let a: Vec<usize> = (0..1024).rev().collect(); in check_enumerate()
223 let a: Vec<usize> = (0..1024).rev().collect(); in check_enumerate_rev()
236 let a: Vec<i32> = (0..1024).collect(); in check_indices_after_enumerate_split()
261 let mut a: Vec<usize> = (0..1024).rev().collect(); in check_increment()
270 let a: Vec<usize> = (0..1024).collect(); in check_skip()
274 let v2 = a.iter().skip(16).collect::<Vec<_>>(); in check_skip()
279 let v2 = a.iter().skip(2048).collect::<Vec<_>>(); in check_skip()
284 let v2 = a.iter().skip(0).collect::<Vec<_>>(); in check_skip()
299 let a: Vec<usize> = (0..1024).collect(); in check_take()
303 let v2 = a.iter().take(16).collect::<Vec<_>>(); in check_take()
308 let v2 = a.iter().take(2048).collect::<Vec<_>>(); in check_take()
313 let v2 = a.iter().take(0).collect::<Vec<_>>(); in check_take()
427 let a: Vec<i32> = rng.sample_iter(&Standard).take(1024).collect(); in check_cmp_rng_to_seq()
428 let b: Vec<i32> = rng.sample_iter(&Standard).take(1024).collect(); in check_cmp_rng_to_seq()
581 let a: Vec<i32> = rng.sample_iter(&Standard).take(1024).collect(); in check_partial_cmp_rng_to_seq()
582 let b: Vec<i32> = rng.sample_iter(&Standard).take(1024).collect(); in check_partial_cmp_rng_to_seq()
804 let mut a: Vec<usize> = (0..1024).rev().collect(); in check_zip()
805 let b: Vec<usize> = (0..1024).collect(); in check_zip()
814 let mut a: Vec<usize> = (0..1024).rev().collect(); in check_zip_into_par_iter()
815 let b: Vec<usize> = (0..1024).collect(); in check_zip_into_par_iter()
826 let a: Vec<usize> = (0..1024).rev().collect(); in check_zip_into_mut_par_iter()
827 let mut b: Vec<usize> = (0..1024).collect(); in check_zip_into_mut_par_iter()
836 let mut a: Vec<usize> = (0..1024).rev().collect(); in check_zip_range()
847 let mut a: Vec<usize> = (0..1024).rev().collect(); in check_zip_eq()
848 let b: Vec<usize> = (0..1024).collect(); in check_zip_eq()
857 let mut a: Vec<usize> = (0..1024).rev().collect(); in check_zip_eq_into_par_iter()
858 let b: Vec<usize> = (0..1024).collect(); in check_zip_eq_into_par_iter()
869 let a: Vec<usize> = (0..1024).rev().collect(); in check_zip_eq_into_mut_par_iter()
870 let mut b: Vec<usize> = (0..1024).collect(); in check_zip_eq_into_mut_par_iter()
879 let mut a: Vec<usize> = (0..1024).rev().collect(); in check_zip_eq_range()
930 let a: Vec<i32> = (0..1024).collect(); in check_empty_flat_map_sum()
944 let a: Vec<i32> = (0..1024).collect(); in check_flatten_vec()
946 let c: Vec<i32> = b.par_iter().flatten().cloned().collect(); in check_flatten_vec()
958 let b: Vec<i32> = a.par_iter().flatten().cloned().collect(); in check_flatten_vec_empty()
965 let v: Vec<_> = (0..1000).collect(); in check_slice_split()
967 let a: Vec<_> = v.split(|x| x % m == 0).collect(); in check_slice_split()
968 let b: Vec<_> = v.par_split(|x| x % m == 0).collect(); in check_slice_split()
974 let v: Vec<_> = slice.par_split(|num| num % 3 == 0).collect(); in check_slice_split()
978 let v: Vec<_> = slice.par_split(|num| num % 3 == 0).collect(); in check_slice_split()
982 let v: Vec<_> = slice.par_split(|num| num % 3 == 0).collect(); in check_slice_split()
988 let mut v1: Vec<_> = (0..1000).collect(); in check_slice_split_mut()
991 let a: Vec<_> = v1.split_mut(|x| x % m == 0).collect(); in check_slice_split_mut()
992 let b: Vec<_> = v2.par_split_mut(|x| x % m == 0).collect(); in check_slice_split_mut()
1037 let a: Vec<i32> = (0..1024).collect(); in check_windows()
1038 let par: Vec<_> = a.par_windows(2).collect(); in check_windows()
1039 let seq: Vec<_> = a.windows(2).collect(); in check_windows()
1042 let par: Vec<_> = a.par_windows(100).collect(); in check_windows()
1043 let seq: Vec<_> = a.windows(100).collect(); in check_windows()
1046 let par: Vec<_> = a.par_windows(1_000_000).collect(); in check_windows()
1047 let seq: Vec<_> = a.windows(1_000_000).collect(); in check_windows()
1054 .collect(); in check_windows()
1059 .collect(); in check_windows()
1100 let a: BinaryHeap<i32> = (0..10).collect(); in check_binary_heap()
1110 let mut a: BTreeMap<i32, i32> = (0..10).map(|i| (i, -i)).collect(); in check_btree_map()
1124 let a: BTreeSet<i32> = (0..10).collect(); in check_btree_set()
1134 let mut a: HashMap<i32, i32> = (0..10).map(|i| (i, -i)).collect(); in check_hash_map()
1148 let a: HashSet<i32> = (0..10).collect(); in check_hash_set()
1158 let mut a: LinkedList<i32> = (0..10).collect(); in check_linked_list()
1171 let mut a: VecDeque<i32> = (0..10).collect(); in check_vec_deque()
1231 .collect(); in check_chain()
1232 let other: Vec<i32> = (0..100).filter(|x| x & 1 == 1).collect(); in check_chain()
1236 let res: Vec<i32> = Some(1i32).into_par_iter().chain(None).collect(); in check_chain()
1252 let a: Vec<i32> = (0..1024).collect(); in find_any()
1277 let a: Vec<i32> = (0..1024).collect(); in find_first_or_last()
1322 a = (-1024..-3).collect(); in find_map_first_or_last_or_any()
1335 a.append(&mut (2..1025).collect()); in find_map_first_or_last_or_any()
1405 let a: Option<Vec<_>> = (0_i32..2048).map(Some).collect(); in par_iter_collect_option()
1406 let b: Option<Vec<_>> = (0_i32..2048).into_par_iter().map(Some).collect(); in par_iter_collect_option()
1412 .collect(); in par_iter_collect_option()
1418 let a: Result<Vec<_>, ()> = (0_i32..2048).map(Ok).collect(); in par_iter_collect_result()
1419 let b: Result<Vec<_>, ()> = (0_i32..2048).into_par_iter().map(Ok).collect(); in par_iter_collect_result()
1425 .collect(); in par_iter_collect_result()
1431 .collect(); in par_iter_collect_result()
1437 let a: Vec<i32> = (0..1024).collect(); in par_iter_collect()
1438 let b: Vec<i32> = a.par_iter().map(|&i| i + 1).collect(); in par_iter_collect()
1439 let c: Vec<i32> = (0..1024).map(|i| i + 1).collect(); in par_iter_collect()
1445 let a: Vec<i32> = (0..1024).collect(); in par_iter_collect_vecdeque()
1446 let b: VecDeque<i32> = a.par_iter().cloned().collect(); in par_iter_collect_vecdeque()
1447 let c: VecDeque<i32> = a.iter().cloned().collect(); in par_iter_collect_vecdeque()
1453 let a: Vec<i32> = (0..1024).collect(); in par_iter_collect_binaryheap()
1454 let mut b: BinaryHeap<i32> = a.par_iter().cloned().collect(); in par_iter_collect_binaryheap()
1465 let a: Vec<i32> = (0..1024).collect(); in par_iter_collect_hashmap()
1466 let b: HashMap<i32, String> = a.par_iter().map(|&i| (i, format!("{}", i))).collect(); in par_iter_collect_hashmap()
1473 let a: Vec<i32> = (0..1024).collect(); in par_iter_collect_hashset()
1474 let b: HashSet<i32> = a.par_iter().cloned().collect(); in par_iter_collect_hashset()
1480 let a: Vec<i32> = (0..1024).collect(); in par_iter_collect_btreemap()
1481 let b: BTreeMap<i32, String> = a.par_iter().map(|&i| (i, format!("{}", i))).collect(); in par_iter_collect_btreemap()
1488 let a: Vec<i32> = (0..1024).collect(); in par_iter_collect_btreeset()
1489 let b: BTreeSet<i32> = a.par_iter().cloned().collect(); in par_iter_collect_btreeset()
1495 let a: Vec<i32> = (0..1024).collect(); in par_iter_collect_linked_list()
1496 let b: LinkedList<_> = a.par_iter().map(|&i| (i, format!("{}", i))).collect(); in par_iter_collect_linked_list()
1497 let c: LinkedList<_> = a.iter().map(|&i| (i, format!("{}", i))).collect(); in par_iter_collect_linked_list()
1507 .collect(); in par_iter_collect_linked_list_flat_map_filter()
1511 .collect(); in par_iter_collect_linked_list_flat_map_filter()
1522 let a: Cow<'_, [i32]> = (0..1024).collect(); in par_iter_collect_cows()
1523 let b: Cow<'_, [i32]> = a.par_iter().cloned().collect(); in par_iter_collect_cows()
1527 let a: Cow<'_, str> = s.chars().collect(); in par_iter_collect_cows()
1528 let b: Cow<'_, str> = s.par_chars().collect(); in par_iter_collect_cows()
1532 let a: Cow<'_, str> = s.split_whitespace().collect(); in par_iter_collect_cows()
1533 let b: Cow<'_, str> = s.par_split_whitespace().collect(); in par_iter_collect_cows()
1537 let a: Cow<'_, str> = s.split_whitespace().map(str::to_owned).collect(); in par_iter_collect_cows()
1538 let b: Cow<'_, str> = s.par_split_whitespace().map(str::to_owned).collect(); in par_iter_collect_cows()
1544 let b: Vec<i64> = (0_i64..1024).into_par_iter().flat_map(Some).collect(); in par_iter_unindexed_flat_map()
1545 let c: Vec<i64> = (0_i64..1024).flat_map(Some).collect(); in par_iter_unindexed_flat_map()
1552 let a: Vec<i32> = rng.sample_iter(&Standard).take(1024).collect(); in min_max()
1564 let r: Vec<i32> = rng.sample_iter(&Standard).take(512).collect(); in min_max_by()
1565 let a: Vec<(i32, u16)> = r.iter().chain(&r).cloned().zip(0..).collect(); in min_max_by()
1583 let r: Vec<i32> = rng.sample_iter(&Standard).take(512).collect(); in min_max_by_key()
1584 let a: Vec<(i32, u16)> = r.iter().chain(&r).cloned().zip(0..).collect(); in min_max_by_key()
1600 let a: Vec<usize> = (0..1024).rev().collect(); in check_rev()
1601 let b: Vec<usize> = (0..1024).collect(); in check_rev()
1614 let a: Vec<i32> = (0..1024).collect(); in scope_mix()
1648 assert_eq!(a.collect::<Vec<_>>(), b.collect::<Vec<_>>()); in check_split()
1684 let a: HashSet<_> = (0..1024).collect(); in check_map_with()
1691 let b: HashSet<_> = receiver.iter().collect(); in check_map_with()
1698 let a: HashSet<_> = (0..1024).collect(); in check_fold_with()
1708 let b: HashSet<_> = receiver.iter().collect(); in check_fold_with()
1715 let a: HashSet<_> = (0..1024).collect(); in check_for_each_with()
1721 let b: HashSet<_> = receiver.iter().collect(); in check_for_each_with()
1741 let v: Vec<_> = (0..128).collect(); in check_extend_items()
1765 let v: Vec<_> = (0..128).collect(); in check_extend_heap()
1795 let m: HashMap<_, _> = (0..128).enumerate().collect(); in check_extend_pairs()
1801 let v: Vec<(_, _)> = (-128..0).enumerate().collect(); in check_extend_pairs()
1883 let v: Vec<i32> = (0..1024).collect(); in check_either()
1902 let v: Vec<i32> = (0..1024).collect(); in check_either_extend()
1912 assert_eq!(right, Either::Right(v.iter().cloned().collect())); in check_either_extend()
1917 let xs: Vec<usize> = (0..10).collect(); in check_interleave_eq()
1918 let ys: Vec<usize> = (10..20).collect(); in check_interleave_eq()
1929 .collect(); in check_interleave_eq()
1937 (0..9).collect(), in check_interleave_uneven()
1943 (0..9).collect(), in check_interleave_uneven()
1947 (0..5).collect(), in check_interleave_uneven()
1948 (5..10).collect(), in check_interleave_uneven()
1952 .collect(), in check_interleave_uneven()
1954 (vec![], (0..9).collect(), (0..9).collect()), in check_interleave_uneven()
1955 ((0..9).collect(), vec![], (0..9).collect()), in check_interleave_uneven()
1957 (0..50).collect(), in check_interleave_uneven()
1958 (50..100).collect(), in check_interleave_uneven()
1962 .collect(), in check_interleave_uneven()
1981 expected.into_iter().rev().collect::<Vec<usize>>(), in check_interleave_uneven()
1992 ((0..9).collect(), vec![10], vec![0, 10, 1]), in check_interleave_shortest()
1993 (vec![10], (0..9).collect(), vec![10, 0]), in check_interleave_shortest()
1995 (0..5).collect(), in check_interleave_shortest()
1996 (5..10).collect(), in check_interleave_shortest()
2000 .collect(), in check_interleave_shortest()
2002 (vec![], (0..9).collect(), vec![]), in check_interleave_shortest()
2003 ((0..9).collect(), vec![], vec![0]), in check_interleave_shortest()
2005 (0..50).collect(), in check_interleave_shortest()
2006 (50..100).collect(), in check_interleave_shortest()
2010 .collect(), in check_interleave_shortest()
2029 expected.into_iter().rev().collect::<Vec<usize>>(), in check_interleave_shortest()
2040 let _: Vec<Vec<i32>> = vec![1, 2, 3].into_par_iter().chunks(0).collect(); in check_chunks_zero_size()
2047 (1..10).into_par_iter().chunks(3).collect::<Vec<Vec<i32>>>() in check_chunks_even_size()
2057 v.into_par_iter().chunks(2).collect::<Vec<Vec<i32>>>() in check_chunks_empty()
2073 ((0..5).collect(), 3, vec![vec![0, 1, 2], vec![3, 4]]), in check_chunks_uneven()
2075 ((0..4).collect(), 3, vec![vec![0, 1, 2], vec![3]]), in check_chunks_uneven()
2082 .map(|v| v.into_iter().cloned().collect()) in check_chunks_uneven()
2089 expected.into_iter().rev().collect::<Vec<Vec<u32>>>(), in check_chunks_uneven()
2118 let v: Vec<_> = repeat(4).take(4).collect(); in check_repeat_take()
2125 let mut fours: Vec<_> = repeat(4).zip(v).collect(); in check_repeat_zip()
2135 let mut fours: Vec<_> = repeatn(4, usize::MAX).zip(v).collect(); in check_repeatn_zip_left()
2145 let mut fours: Vec<_> = v.into_par_iter().zip(repeatn(4, usize::MAX)).collect(); in check_repeatn_zip_right()
2155 let mut v: Vec<i32> = empty().filter(|_| unreachable!()).collect(); in check_empty()
2163 let v: Vec<(i32, i32)> = empty().zip(1..10).collect(); in check_empty()
2170 let mut v: Vec<i32> = once(42).filter(|_| true).collect(); in check_once()
2178 let v: Vec<(i32, i32)> = once(42).zip(1..10).collect(); in check_once()