Home
last modified time | relevance | path

Searched refs:find_any (Results 1 – 4 of 4) sorted by relevance

/external/rust/crates/rayon/tests/
Doctillion.rs96 let x = two_threads(|| octillion().find_any(|x| *x > OCTILLION / 2)); in find_any_octillion()
102 let x = two_threads(|| octillion_flat().find_any(|x| *x > OCTILLION / 2)); in find_any_octillion_flat()
111 .find_any(|_| true) in filter_find_any_octillion()
121 .find_any(|_| true) in filter_find_any_octillion_flat()
128 let x = two_threads(|| octillion_flat().fold(|| (), |_, _| ()).find_any(|_| true)); in fold_find_any_octillion_flat()
/external/rust/crates/rayon/src/iter/
Dmod.rs1652 fn find_any<P>(self, predicate: P) -> Option<Self::Item> in find_any() method
1749 self.filter_map(predicate).find_any(yes) in find_map_any()
1827 self.find_any(predicate) in find()
1851 self.map(predicate).find_any(bool::clone).is_some() in any()
1878 self.map(predicate).find_any(is_false).is_none() in all()
2603 let (i, _) = self.map(predicate).enumerate().find_any(check)?; in position_any()
Dtest.rs180 .find_any(|_| true); in fold_is_full()
1251 fn find_any() { in find_any() function
1254 assert!(a.par_iter().find_any(|&&x| x % 42 == 41).is_some()); in find_any()
1256 a.par_iter().find_any(|&&x| x % 19 == 1 && x % 53 == 0), in find_any()
1259 assert_eq!(a.par_iter().find_any(|&&x| x < 0), None); in find_any()
1361 let value: Option<i32> = (0_i32..2048).into_par_iter().find_any(|&p| { in check_find_not_present()
1372 let value: Option<i32> = (0_i32..2048).into_par_iter().find_any(|&p| { in check_find_is_present()
2112 let even = repeat(4).find_any(|&x| x % 2 == 0); in check_repeat_find_any()
/external/rust/crates/rayon/
DRELEASES.md656 - `find_any()`: similar to `find` on a sequential iterator,