Home
last modified time | relevance | path

Searched refs:par_iter (Results 1 – 25 of 27) sorted by relevance

12

/external/rust/crates/rayon/tests/
Dclones.rs17 check(heap.par_iter()); in clone_binary_heap()
25 check(map.par_iter()); in clone_btree_map()
32 check(set.par_iter()); in clone_btree_set()
39 check(map.par_iter()); in clone_hash_map()
46 check(set.par_iter()); in clone_hash_set()
53 check(list.par_iter()); in clone_linked_list()
61 check(deque.par_iter()); in clone_vec_deque()
68 check(option.par_iter()); in clone_option()
75 check(result.par_iter()); in clone_result()
102 check(v.par_iter()); in clone_vec()
[all …]
Ddebug.rs15 check(heap.par_iter()); in debug_binary_heap()
24 check(map.par_iter()); in debug_btree_map()
33 check(set.par_iter()); in debug_btree_set()
41 check(map.par_iter()); in debug_hash_map()
51 check(set.par_iter()); in debug_hash_set()
60 check(list.par_iter()); in debug_linked_list()
69 check(deque.par_iter()); in debug_vec_deque()
78 check(option.par_iter()); in debug_option()
86 check(result.par_iter()); in debug_result()
120 check(v.par_iter()); in debug_vec()
[all …]
Dproducer_split_at.rs234 check(&v, || v.par_iter().cloned()); in cloned()
240 check(&v, || v.par_iter().copied()); in copied()
293 check(&v, || s.par_iter().cloned().chunks(2)); in chunks()
299 check(&v, || v.par_iter().map(Clone::clone)); in map()
305 check(&v, || v.par_iter().map_with(vec![0], |_, &x| x)); in map_with()
311 check(&v, || v.par_iter().map_init(|| vec![0], |_, &x| x)); in map_init()
Dissue671-unzip.rs9 .par_iter() in type_length_limit()
Dcollect.rs87 a.par_iter() in collect_drop_on_unwind_zst()
Dstr.rs26 let par_chars: String = vchars.par_iter().collect(); in execute_strings()
/external/rust/crates/rayon/src/iter/
Dfrom_par_iter.rs11 fn collect_extended<C, I>(par_iter: I) -> C in collect_extended()
17 collection.par_extend(par_iter); in collect_extended()
26 fn from_par_iter<I>(par_iter: I) -> Self in from_par_iter()
30 collect_extended(par_iter) in from_par_iter()
39 fn from_par_iter<I>(par_iter: I) -> Self in from_par_iter()
43 Vec::from_par_iter(par_iter).into() in from_par_iter()
53 fn from_par_iter<I>(par_iter: I) -> Self in from_par_iter()
57 Vec::from_par_iter(par_iter).into() in from_par_iter()
67 fn from_par_iter<I>(par_iter: I) -> Self in from_par_iter()
71 collect_extended(par_iter) in from_par_iter()
[all …]
Dextend.rs12 fn extend<C, I, F>(collection: &mut C, par_iter: I, reserve: F) in extend()
18 let list = collect(par_iter); in extend()
25 pub(super) fn collect<I>(par_iter: I) -> LinkedList<Vec<I::Item>> in collect()
29 par_iter in collect()
68 fn par_extend<I>(&mut self, par_iter: I) in par_extend()
72 extend(self, par_iter, heap_reserve); in par_extend()
81 fn par_extend<I>(&mut self, par_iter: I) in par_extend()
85 extend(self, par_iter, heap_reserve); in par_extend()
95 fn par_extend<I>(&mut self, par_iter: I) in par_extend()
99 extend(self, par_iter, no_reserve); in par_extend()
[all …]
Dtest.rs30 a.par_iter().map(|&i| i + 1).collect_into_vec(&mut b); in execute()
39 a.par_iter().cloned().collect_into_vec(&mut b); in execute_cloned()
78 is_indexed(a.par_iter().map(|x| x)); in check_map_indexed()
84 let r1: i32 = a.par_iter().map(|&i| i + 1).sum(); in map_sum()
92 let r1 = a.par_iter().map(|&i| i + 1).reduce(|| 0, |i, j| i + j); in map_reduce()
100 let r1 = a.par_iter().map(|&i| i + 1).reduce_with(|i, j| i + j); in map_reduce_with()
214 a.par_iter() in check_enumerate()
226 a.par_iter() in check_enumerate_rev()
237 a.par_iter().enumerate().with_producer(WithProducer); in check_indices_after_enumerate_split()
273 a.par_iter().skip(16).collect_into_vec(&mut v1); in check_skip()
[all …]
Dflatten.rs112 let par_iter = item.into_par_iter(); in consume() localVariable
114 let result = par_iter.drive_unindexed(consumer); in consume()
Dflat_map.rs125 let par_iter = map_op(item).into_par_iter(); in consume() localVariable
127 let result = par_iter.drive_unindexed(consumer); in consume()
Dmultizip.rs165 tuple: ( $( self.$idx.par_iter(), )+ ),
Dmod.rs272 fn par_iter(&'data self) -> Self::Iter; in par_iter() method
282 fn par_iter(&'data self) -> Self::Iter { in par_iter() function
2896 fn from_par_iter<I>(par_iter: I) -> Self in from_par_iter()
2949 fn par_extend<I>(&mut self, par_iter: I) in par_extend()
/external/rust/crates/rayon/src/iter/collect/
Dmod.rs148 fn par_extend<I>(&mut self, par_iter: I) in par_extend()
153 let par_iter = par_iter.into_par_iter(); in par_extend() localVariable
154 match par_iter.opt_len() { in par_extend()
159 special_extend(par_iter, len, self); in par_extend()
163 let list = super::extend::collect(par_iter); in par_extend()
/external/rust/crates/hashbrown/src/external_trait_impls/rayon/
Dmap.rs256 inner: unsafe { self.inner.par_iter() }, in fmt()
291 inner: unsafe { self.inner.par_iter() }, in fmt()
303 inner: unsafe { self.table.par_iter() }, in par_keys()
312 inner: unsafe { self.table.par_iter() }, in par_values()
323 inner: unsafe { self.table.par_iter() }, in par_values_mut()
380 inner: unsafe { self.table.par_iter() }, in into_par_iter()
395 inner: unsafe { self.table.par_iter() }, in into_par_iter()
411 fn from_par_iter<P>(par_iter: P) -> Self in from_par_iter()
416 map.par_extend(par_iter); in from_par_iter()
429 fn par_extend<I>(&mut self, par_iter: I) in par_extend()
[all …]
Draw.rs85 pub(super) unsafe fn par_iter(&self) -> RawParIter<T> { in par_iter() method
86 self.table.par_iter() in par_iter()
123 pub(super) unsafe fn par_iter(&self) -> RawParIter<T> { in par_iter() method
124 self.table.as_ref().par_iter() in par_iter()
208 pub unsafe fn par_iter(&self) -> RawParIter<T> { in par_iter() method
Dset.rs334 fn from_par_iter<P>(par_iter: P) -> Self in from_par_iter()
339 set.par_extend(par_iter); in from_par_iter()
350 fn par_extend<I>(&mut self, par_iter: I) in par_extend()
354 extend(self, par_iter); in par_extend()
364 fn par_extend<I>(&mut self, par_iter: I) in par_extend()
368 extend(self, par_iter); in par_extend()
373 fn extend<T, S, I, A>(set: &mut HashSet<T, S, A>, par_iter: I) in extend()
381 let (list, len) = super::helpers::collect(par_iter); in extend()
461 a.par_iter().for_each(|k| { in test_iterate()
588 let set: HashSet<_> = xs.par_iter().cloned().collect(); in test_from_iter()
/external/rust/crates/hashbrown/tests/
Drayon.rs37 let vec_par = MAP_EMPTY.par_iter().collect::<Vec<_>>(); in map_seq_par_equivalence_iter_empty()
45 let mut vec_par = MAP.par_iter().collect::<Vec<_>>(); in map_seq_par_equivalence_iter()
273 map_par.par_extend(MAP_EXTENSION_EMPTY.par_iter().cloned()); in map_seq_par_equivalence_existing_empty_extend_empty()
285 map_par.par_extend(MAP_EXTENSION.par_iter().cloned()); in map_seq_par_equivalence_existing_empty_extend()
297 map_par.par_extend(MAP_EXTENSION_EMPTY.par_iter().cloned()); in map_seq_par_equivalence_existing_extend_empty()
309 map_par.par_extend(MAP_EXTENSION.par_iter().cloned()); in map_seq_par_equivalence_existing_extend()
331 let vec_par = SET_EMPTY.par_iter().collect::<Vec<_>>(); in set_seq_par_equivalence_iter_empty()
341 let mut vec_par = SET.par_iter().collect::<Vec<_>>(); in set_seq_par_equivalence_iter()
427 set_par.par_extend(SET_EXTENSION_EMPTY.par_iter().cloned()); in set_seq_par_equivalence_existing_empty_extend_empty()
439 set_par.par_extend(SET_EXTENSION.par_iter().cloned()); in set_seq_par_equivalence_existing_empty_extend()
[all …]
/external/rust/crates/rayon/src/
Dpar_either.rs65 fn par_extend<I>(&mut self, par_iter: I) in par_extend()
70 Left(collection) => collection.par_extend(par_iter), in par_extend()
71 Right(collection) => collection.par_extend(par_iter), in par_extend()
Dresult.rs99 fn from_par_iter<I>(par_iter: I) -> Self in from_par_iter()
121 let collection = par_iter in from_par_iter()
Doption.rs178 fn from_par_iter<I>(par_iter: I) -> Self in from_par_iter()
191 let collection = par_iter in from_par_iter()
/external/rust/crates/rayon/src/iter/plumbing/
Dmod.rs351 pub fn bridge<I, C>(par_iter: I, consumer: C) -> C::Result in bridge()
356 let len = par_iter.len(); in bridge()
357 return par_iter.with_producer(Callback { len, consumer }); in bridge()
DREADME.md59 vec1.par_iter()
60 .zip(vec2.par_iter())
143 `par_iter.reduce()`, that will create a "reducing" consumer and then
144 invoke `par_iter.drive_unindexed()` (or `par_iter.drive()`) as
195 can take ownership of `par_iter`; we can then in turn give ownership
/external/rust/crates/criterion/src/stats/univariate/kde/
Dmod.rs45 xs.par_iter() in map()
/external/rust/crates/rayon/
DREADME.md25 `foo.par_iter()`, and Rayon does the rest:
30 input.par_iter() // <-- just change that!

12