Home
last modified time | relevance | path

Searched refs:into_par_iter (Results 1 – 25 of 53) sorted by relevance

123

/external/rust/crates/rayon/tests/
Ddebug.rs17 check(heap.into_par_iter()); in debug_binary_heap()
26 check(map.into_par_iter()); in debug_btree_map()
34 check(set.into_par_iter()); in debug_btree_set()
44 check(map.into_par_iter()); in debug_hash_map()
53 check(set.into_par_iter()); in debug_hash_set()
62 check(list.into_par_iter()); in debug_linked_list()
72 check(deque.into_par_iter()); in debug_vec_deque()
80 check(option.into_par_iter()); in debug_option()
88 check(result.into_par_iter()); in debug_result()
93 check((0..10).into_par_iter()); in debug_range()
[all …]
Dclones.rs25 check(heap.into_par_iter()); in clone_binary_heap()
61 check(list.into_par_iter()); in clone_linked_list()
69 check(deque.into_par_iter()); in clone_vec_deque()
76 check(option.into_par_iter()); in clone_option()
83 check(result.into_par_iter()); in clone_result()
88 check((0..1000).into_par_iter()); in clone_range()
93 check((0..=1000).into_par_iter()); in clone_range_inclusive()
116 check(v.into_par_iter()); in clone_vec()
122 check(a.into_par_iter()); in clone_array()
204 check((v,).into_par_iter()); in clone_multizip()
[all …]
Dproducer_split_at.rs46 let result = iter.into_par_iter().with_producer(Split { in forward()
61 let result = iter.into_par_iter().with_producer(Split { in reverse()
278 check(&v, || (0..5).into_par_iter().chain(5..10)); in chain()
296 check(&v, || (0..10).into_par_iter().enumerate()); in enumerate()
302 check(&v, || (0..10).into_par_iter().step_by(2)) in step_by()
308 check(&v, || (0..10).into_par_iter().step_by(3)) in step_by_unaligned()
314 check(&v, || (0..10).into_par_iter().inspect(|_| ())); in inspect()
320 check(&v, || (0..10).into_par_iter().update(|_| ())); in update()
326 check(&v, || (0..5).into_par_iter().interleave(10..13)); in interleave()
327 check(&v[..6], || (0..3).into_par_iter().interleave(10..13)); in interleave()
[all …]
Dintersperse.rs5 let v: Vec<_> = (0..1000).into_par_iter().intersperse(-1).collect(); in check_intersperse()
15 .into_par_iter() in check_intersperse_again()
42 .into_par_iter() in check_intersperse_producer()
53 .into_par_iter() in check_intersperse_rev()
Doctillion.rs7 (0..OCTILLION).into_par_iter() in octillion()
12 (0..=OCTILLION).into_par_iter() in octillion_inclusive()
18 .into_par_iter() in octillion_flat()
23 .into_par_iter() in octillion_flat()
30 .into_par_iter() in octillion_flat()
Dchars.rs10 let mut chars: Vec<char> = range.into_par_iter().collect(); in half_open_correctness()
28 let mut chars: Vec<char> = range.into_par_iter().collect(); in closed_correctness()
Diter_panic.rs19 ITER.into_par_iter().for_each(|i| check(&i)); in iter_panic()
43 let iter = ITER.into_par_iter().with_max_len(1); in iter_panic_fuse()
/external/rust/crates/rayon/src/
Drange_inclusive.rs82 fn into_par_iter(self) -> Self::Iter { in into_par_iter() function
166 (start..end).into_par_iter().$method($( $arg ),*)
168 (start..end).into_par_iter().chain(once(end)).$method($( $arg ),*)
248 .into_par_iter()
255 .into_par_iter()
317 assert_eq!(Some(101), (0..=100u32).into_par_iter().opt_len()); in test_u32_opt_len()
320 (0..=u32::MAX - 1).into_par_iter().opt_len() in test_u32_opt_len()
324 (0..=u32::MAX).into_par_iter().opt_len() in test_u32_opt_len()
331 assert_eq!(Some(101), (0..=100u64).into_par_iter().opt_len()); in test_u64_opt_len()
334 (0..=usize::MAX as u64 - 1).into_par_iter().opt_len() in test_u64_opt_len()
[all …]
Drange.rs60 fn into_par_iter(self) -> Self::Iter { in into_par_iter() function
247 .into_par_iter()
309 .into_par_iter()
316 .into_par_iter()
400 assert_eq!(Some(100), (0..100u64).into_par_iter().opt_len()); in test_u64_opt_len()
403 (0..usize::MAX as u64).into_par_iter().opt_len() in test_u64_opt_len()
409 .into_par_iter() in test_u64_opt_len()
412 assert_eq!(None, (0..u64::MAX).into_par_iter().opt_len()); in test_u64_opt_len()
419 assert_eq!(Some(100), (0..100u128).into_par_iter().opt_len()); in test_u128_opt_len()
422 (0..usize::MAX as u128).into_par_iter().opt_len() in test_u128_opt_len()
[all …]
Dresult.rs24 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
26 inner: self.ok().into_par_iter(), in into_par_iter()
54 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
56 inner: self.as_ref().ok().into_par_iter(), in into_par_iter()
76 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
78 inner: self.as_mut().ok().into_par_iter(), in into_par_iter()
122 .into_par_iter() in from_par_iter()
Darray.rs18 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
19 <&[T]>::into_par_iter(self) in into_par_iter()
27 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
28 <&mut [T]>::into_par_iter(self) in into_par_iter()
36 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
Doption.rs30 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
103 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
105 inner: self.as_ref().into_par_iter(), in into_par_iter()
133 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
135 inner: self.as_mut().into_par_iter(), in into_par_iter()
192 .into_par_iter() in from_par_iter()
Dvec.rs22 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
23 <&[T]>::into_par_iter(self) in into_par_iter()
31 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
32 <&mut [T]>::into_par_iter(self) in into_par_iter()
46 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
/external/rust/crates/rayon/src/iter/
Dtest.rs48 a.into_par_iter().map(|i| i + 1).collect_into_vec(&mut b); in execute_range()
56 let b: LinkedList<i64> = a.into_par_iter().map(|i| i + 1).collect(); in execute_unindexed_range()
67 let a = range.clone().into_par_iter(); in execute_pseudo_indexed_range()
118 .into_par_iter() in fold_map_reduce()
172 .into_par_iter() in fold_is_full()
185 let b: Vec<i32> = (0..1024).into_par_iter().step_by(2).collect(); in check_step_by()
193 let b: Vec<i32> = (0..1029).into_par_iter().step_by(10).collect(); in check_step_by_unaligned()
201 let b: Vec<i32> = (0..1024).into_par_iter().step_by(2).rev().collect(); in check_step_by_rev()
320 .into_par_iter() in check_inspect()
335 a.into_par_iter().collect_into_vec(&mut b); in check_move()
[all …]
Dfold_chunks_with.rs144 .into_par_iter() in check_fold_chunks_with()
166 .into_par_iter() in check_fold_chunks_zero_size()
176 .into_par_iter() in check_fold_chunks_even_size()
188 v.into_par_iter() in check_fold_chunks_with_empty()
196 assert_eq!(4, (0..8).into_par_iter().fold_chunks_with(2, 0, sum).len()); in check_fold_chunks_len()
197 assert_eq!(3, (0..9).into_par_iter().fold_chunks_with(3, 0, sum).len()); in check_fold_chunks_len()
198 assert_eq!(3, (0..8).into_par_iter().fold_chunks_with(3, 0, sum).len()); in check_fold_chunks_len()
200 assert_eq!(0, (0..0).into_par_iter().fold_chunks_with(3, 0, sum).len()); in check_fold_chunks_len()
219 v.into_par_iter() in check_fold_chunks_uneven()
Dfold_chunks.rs146 .into_par_iter() in check_fold_chunks()
171 .into_par_iter() in check_fold_chunks_zero_size()
181 .into_par_iter() in check_fold_chunks_even_size()
193 v.into_par_iter() in check_fold_chunks_empty()
201 assert_eq!(4, (0..8).into_par_iter().fold_chunks(2, id, sum).len()); in check_fold_chunks_len()
202 assert_eq!(3, (0..9).into_par_iter().fold_chunks(3, id, sum).len()); in check_fold_chunks_len()
203 assert_eq!(3, (0..8).into_par_iter().fold_chunks(3, id, sum).len()); in check_fold_chunks_len()
205 assert_eq!(0, (0..0).into_par_iter().fold_chunks(3, id, sum).len()); in check_fold_chunks_len()
224 v.into_par_iter() in check_fold_chunks_uneven()
Dmultizip.rs146 fn into_par_iter(self) -> Self::Iter {
148 tuple: ( $( self.$idx.into_par_iter(), )+ ),
163 fn into_par_iter(self) -> Self::Iter {
180 fn into_par_iter(self) -> Self::Iter {
Dextend.rs17 $par_iter.into_par_iter().drive_unindexed(ListVecConsumer),
290 let mut list = par_iter.into_par_iter().drive_unindexed(ListConsumer); in par_extend()
304 self.par_extend(par_iter.into_par_iter().copied()) in par_extend()
391 let list = par_iter.into_par_iter().drive_unindexed(ListStringConsumer); in par_extend()
402 self.par_extend(par_iter.into_par_iter().copied()) in par_extend()
566 let par_iter = par_iter.into_par_iter(); in par_extend()
592 self.par_extend(par_iter.into_par_iter().copied()) in par_extend()
602 par_iter.into_par_iter().drive_unindexed(NoopConsumer) in par_extend()
/external/rust/crates/rayon/src/collections/
Dvec_deque.rs25 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
27 let inner = Vec::from(self).into_par_iter(); in into_par_iter()
55 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
58 inner: a.into_par_iter().chain(b), in into_par_iter()
78 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
81 inner: a.into_par_iter().chain(b), in into_par_iter()
/external/rust/crates/indexmap/src/
Drustc.rs20 fn into_par_iter(self) -> Self::Iter { in into_par_iter() function
49 fn into_par_iter(self) -> Self::Iter { in into_par_iter() function
78 fn into_par_iter(self) -> Self::Iter { in into_par_iter() function
110 fn into_par_iter(self) -> Self::Iter { in into_par_iter() function
138 fn into_par_iter(self) -> Self::Iter { in into_par_iter() function
Dmacros.rs137 .into_par_iter()
161 self.entries.into_par_iter().map($map_elt).drive(consumer)
173 .into_par_iter()
/external/rust/crates/indexmap/src/rayon/
Dmap.rs31 fn into_par_iter(self) -> Self::Iter { in into_par_iter() function
75 fn into_par_iter(self) -> Self::Iter { in into_par_iter() function
125 fn into_par_iter(self) -> Self::Iter { in into_par_iter() function
514 .into_par_iter() in insert_order()
534 map_b.into_par_iter().map(|(k, v)| (k, v.into())).collect(); in partial_eq_and_eq()
545 map.into_par_iter().collect::<Vec<_>>(), in extend()
553 let map: IndexMap<_, _> = vec.into_par_iter().collect(); in keys()
564 let map: IndexMap<_, _> = vec.into_par_iter().collect(); in values()
575 let mut map: IndexMap<_, _> = vec.into_par_iter().collect(); in values_mut()
/external/rust/crates/hashbrown/tests/
Drayon.rs189 let vec_par = MAP_EMPTY.clone().into_par_iter().collect::<Vec<_>>(); in map_seq_par_equivalence_into_iter_empty()
197 let mut vec_par = MAP.clone().into_par_iter().collect::<Vec<_>>(); in map_seq_par_equivalence_into_iter()
235 .into_par_iter() in map_seq_par_equivalence_collect_empty()
247 let map_par = MAP_VEC.clone().into_par_iter().collect::<HashMap<_, _>>(); in map_seq_par_equivalence_collect()
357 let vec_par = SET_EMPTY.clone().into_par_iter().collect::<Vec<_>>(); in set_seq_par_equivalence_into_iter_empty()
365 let mut vec_par = SET.clone().into_par_iter().collect::<Vec<_>>(); in set_seq_par_equivalence_into_iter()
389 .into_par_iter() in set_seq_par_equivalence_collect_empty()
401 let set_par = SET_VEC.clone().into_par_iter().collect::<HashSet<_>>(); in set_seq_par_equivalence_collect()
/external/rust/crates/hashbrown/src/external_trait_impls/rayon/
Dmap.rs352 .into_par_iter() in par_eq()
364 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
366 inner: self.table.into_par_iter(), in into_par_iter()
378 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
393 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
557 drop(hm.clone().into_par_iter()); in test_into_iter_drops()
565 .into_par_iter() in test_into_iter_drops()
636 assert_eq!(m.into_par_iter().count(), 0); in test_empty_iter()
659 let map: HashMap<_, _> = vec.into_par_iter().collect(); in test_keys()
670 let map: HashMap<_, _> = vec.into_par_iter().collect(); in test_values()
[all …]
Dset.rs106 .into_par_iter() in drive_unindexed()
171 .into_par_iter() in drive_unindexed()
209 .into_par_iter() in drive_unindexed()
257 self.into_par_iter().all(|x| !other.contains(x)) in par_is_disjoint()
266 self.into_par_iter().all(|x| other.contains(x)) in par_is_subset()
309 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
311 inner: self.map.into_par_iter(), in into_par_iter()
321 fn into_par_iter(self) -> Self::Iter { in into_par_iter() method
606 let v = hs.into_par_iter().collect::<Vec<char>>(); in test_move_iter()

123