Crate par_stream[−][src]

Expand description

Asynchronous parallel streams analogous to rayon.

Cargo Features

The following cargo features select the backend runtime for concurrent workers. One of them must be specified, otherwise the crate raises a compile error.

runtime-tokio enables the tokio multi-threaded runtime.
runtime-async-std enables the async-std default runtime.
runtime-smol enables the smol default runtime.

Combinators

Usage

The crate provides extension traits to add new combinators to existing streams, that are targeted for parallel computing and concurrent data processing. Most traits can be found at prelude.

The extension traits can be imported from prelude.

use par_stream::prelude::*;

Parallel Processing

stream.par_map(config, fn) processes stream items in parallel closures.
stream.par_then(config, fut) processes stream items in parallel futures.
par_map_unordered() and par_then_unordered() are unordered variances.
try_par_map(), try_par_then(), try_par_then_unordered() are the fallible variances.

Distributing Patterns

stream.tee(buf_size) creates a copy of a stream.
stream.scatter(buf_size) forks a stream into parts.
gather(buf_size, streams) merges multiple streams into one stream.

Scatter-Gather Pattern

The combinators can construct a scatter-gather pattern that passes each to one of concurrent workers, and gathers the outputs together.


async fn main_async() {
    let orig = futures::stream::iter(0..1000);

    // scatter stream items to two receivers
    let rx1 = orig.scatter(None);
    let rx2 = rx1.clone();

    // gather back from two receivers
    let values: HashSet<_> = par_stream::gather(None, vec![rx1, rx2]).collect().await;

    // the gathered values have equal content with the original
    assert_eq!(values, (0..1000).collect::<HashSet<_>>());
}

Tee-Zip Pattern

Another example is to construct a tee-zip pattern that clones each element to several concurrent workers, and pairs up outputs from each worker.


async fn main_async() {
    let orig: Vec<_> = (0..1000).collect();

    let rx1 = futures::stream::iter(orig.clone()).tee(1);
    let rx2 = rx1.clone();
    let rx3 = rx1.clone();

    let fut1 = rx1.map(|val| val).collect();
    let fut2 = rx2.map(|val| val * 2).collect();
    let fut3 = rx3.map(|val| val * 3).collect();

    let (vec1, vec2, vec3): (Vec<_>, Vec<_>, Vec<_>) = futures::join!(fut1, fut2, fut3);
}

Item Ordering

stream.wrapping_enumerate() is like enumerate(), but wraps around to zero after reaching usize::MAX.
stream.reorder_enumerated() accepts a (usize, T) typed stream and reorder the items according to the index number.
stream.try_wrapping_enumerate() and stream.try_reorder_enumerated() are fallible counterparts.

The item ordering combinators are usually combined with unordered concurrent processing methods, allowing on-demand data passing between stages.

stream
    // mark items with index numbers
    .wrapping_enumerate()
    // a series of unordered maps
    .par_then_unordered(config, fn)
    .par_then_unordered(config, fn)
    .par_then_unordered(config, fn)
    // reorder the items back by indexes
    .reorder_enumerated()

Configure Number of Workers

The config parameter of stream.par_map(config, fn) controls the number of concurrent workers and internal buffer size. It accepts the following values.

None: The number of workers defaults to the number of system processors.
10 or non-zero integers: 10 workers.
2.5 or non-zero floating points: The number of worker is 2.5 times the system processors.
(10, 15): 10 workers and internal buffer size 15.

If the buffer size is not specified, the default is the double of number of workers.