Crates.io | easy-parallel |
lib.rs | easy-parallel |
version | 3.3.1 |
source | src |
created_at | 2020-05-26 22:07:54.007889 |
updated_at | 2023-09-25 17:20:11.345223 |
description | Run closures in parallel |
homepage | https://github.com/smol-rs/easy-parallel |
repository | https://github.com/smol-rs/easy-parallel |
max_upload_size | |
id | 246368 |
size | 26,588 |
Run closures in parallel.
This is a simple primitive for spawning threads in bulk and waiting for them to complete. Threads are allowed to borrow local variables from the main thread.
Run two threads that increment a number:
use easy_parallel::Parallel;
use std::sync::Mutex;
let mut m = Mutex::new(0);
Parallel::new()
.add(|| *m.lock().unwrap() += 1)
.add(|| *m.lock().unwrap() += 1)
.run();
assert_eq!(*m.get_mut().unwrap(), 2);
Square each number of a vector on a different thread:
use easy_parallel::Parallel;
let v = vec![10, 20, 30];
let squares = Parallel::new()
.each(0..v.len(), |i| v[i] * v[i])
.run();
assert_eq!(squares, [100, 400, 900]);
Compute the sum of numbers in an array:
use easy_parallel::Parallel;
fn par_sum(v: &[i32]) -> i32 {
const THRESHOLD: usize = 2;
if v.len() <= THRESHOLD {
v.iter().copied().sum()
} else {
let half = (v.len() + 1) / 2;
let sums = Parallel::new().each(v.chunks(half), par_sum).run();
sums.into_iter().sum()
}
}
let v = [1, 25, -4, 10, 8];
assert_eq!(par_sum(&v), 40);
Licensed under either of
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.