1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83
|
# easy-parallel
[](
https://github.com/smol-rs/easy-parallel/actions)
[](
https://github.com/smol-rs/easy-parallel)
[](
https://crates.io/crates/easy-parallel)
[](
https://docs.rs/easy-parallel)
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.
# Examples
Run two threads that increment a number:
```rust
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:
```rust
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:
```rust
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);
```
## License
Licensed under either of
* Apache License, Version 2.0 ([LICENSE-APACHE](LICENSE-APACHE) or http://www.apache.org/licenses/LICENSE-2.0)
* MIT license ([LICENSE-MIT](LICENSE-MIT) or http://opensource.org/licenses/MIT)
at your option.
#### Contribution
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.
|