1 unstable release

0.1.0 Dec 10, 2020

#1134 in Asynchronous

Download history 5/week @ 2024-03-11 31/week @ 2024-03-18 68/week @ 2024-03-25 78/week @ 2024-04-01 99/week @ 2024-04-08 72/week @ 2024-04-15 61/week @ 2024-04-22 102/week @ 2024-04-29 28/week @ 2024-05-06 59/week @ 2024-05-13 64/week @ 2024-05-20 82/week @ 2024-05-27 134/week @ 2024-06-03 121/week @ 2024-06-10 37/week @ 2024-06-17 56/week @ 2024-06-24

348 downloads per month

MIT license

10KB
74 lines

and-then-concurrent

Rust

Use on impl Streams via the TryStreamAndThenExt trait.

Why is this necessary? Consider the example below. We have a Stream from try_unfold, but this stream is splitting some larger stream into sub-streams, with each sub-stream represented by a channel. If we simply called and_then, that function's implementation, as an optimization, only keeps one "pending" future in its state. This means that it cannot poll the backing stream, because that might produce another future which it has no space for. So, it must run the pending future to completion before polling the stream again.

Unfortunately, in this case, the backing stream has to be polled for our future to resolve! So using and_then will deadlock. Instead, this crate makes a tradeoff: it will hold a list of pending futures in a FuturesUnordered, so it is safe to poll the backing stream. This means that if the resulting futures don't resolve, we could have a large list of futures.

let c = futures_util::stream::try_unfold(
    (
        0,
        HashMap::<usize, mpsc::UnboundedSender<(usize, usize)>>::default(),
    ),
    move |(mut i, mut map)| async move {
        loop {
            sleep(Duration::from_millis(10)).await;
            let (substream, message) = (i % 3, i);
            i += 1;
            if i > 25 {
                return Ok(None);
            }

            let mut new = None;
            if map
                .entry(substream)
                .or_insert_with(|| {
                    let (sub_s, sub_r) = mpsc::unbounded_channel();
                    new = Some(sub_r);
                    sub_s
                })
                .send((substream, message))
                .is_err()
            {
                map.remove(&substream);
            }

            if let Some(new_sub_r) = new {
                return Ok::<_, String>(Some((new_sub_r, (i, map))));
            }
        }
    },
)
// .and_then(...) would deadlock!
.and_then_concurrent(|mut res| async move {
    loop {
        let (stream, val): (usize, usize) = match res.recv().await {
            None => return Ok(()),
            Some(s) => s,
        };
        println!("got {:?} on stream {:?}", val, stream);
    }
})
.try_collect::<Vec<_>>();
c.await.unwrap();

Dependencies

~0.9–1.5MB
~31K SLoC