futures_util/stream/buffer_unordered.rs
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 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123
use std::fmt;
use futures_core::{Async, IntoFuture, Poll, Stream};
use futures_core::task;
use futures_sink::{Sink};
use stream::{Fuse, FuturesUnordered};
/// An adaptor for a stream of futures to execute the futures concurrently, if
/// possible, delivering results as they become available.
///
/// This adaptor will buffer up a list of pending futures, and then return their
/// results in the order that they complete. This is created by the
/// `Stream::buffer_unordered` method.
#[must_use = "streams do nothing unless polled"]
pub struct BufferUnordered<S>
where S: Stream,
S::Item: IntoFuture,
{
stream: Fuse<S>,
queue: FuturesUnordered<<S::Item as IntoFuture>::Future>,
max: usize,
}
impl<S> fmt::Debug for BufferUnordered<S>
where S: Stream + fmt::Debug,
S::Item: IntoFuture,
<<S as Stream>::Item as IntoFuture>::Future: fmt::Debug,
{
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
fmt.debug_struct("BufferUnordered")
.field("stream", &self.stream)
.field("queue", &self.queue)
.field("max", &self.max)
.finish()
}
}
pub fn new<S>(s: S, amt: usize) -> BufferUnordered<S>
where S: Stream,
S::Item: IntoFuture<Error=<S as Stream>::Error>,
{
BufferUnordered {
stream: super::fuse::new(s),
queue: FuturesUnordered::new(),
max: amt,
}
}
impl<S> BufferUnordered<S>
where S: Stream,
S::Item: IntoFuture<Error=<S as Stream>::Error>,
{
/// Acquires a reference to the underlying stream that this combinator is
/// pulling from.
pub fn get_ref(&self) -> &S {
self.stream.get_ref()
}
/// Acquires a mutable reference to the underlying stream that this
/// combinator is pulling from.
///
/// Note that care must be taken to avoid tampering with the state of the
/// stream which may otherwise confuse this combinator.
pub fn get_mut(&mut self) -> &mut S {
self.stream.get_mut()
}
/// Consumes this combinator, returning the underlying stream.
///
/// Note that this may discard intermediate state of this combinator, so
/// care should be taken to avoid losing resources when this is called.
pub fn into_inner(self) -> S {
self.stream.into_inner()
}
}
impl<S> Stream for BufferUnordered<S>
where S: Stream,
S::Item: IntoFuture<Error=<S as Stream>::Error>,
{
type Item = <S::Item as IntoFuture>::Item;
type Error = <S as Stream>::Error;
fn poll_next(&mut self, cx: &mut task::Context) -> Poll<Option<Self::Item>, Self::Error> {
// First up, try to spawn off as many futures as possible by filling up
// our slab of futures.
while self.queue.len() < self.max {
let future = match self.stream.poll_next(cx)? {
Async::Ready(Some(s)) => s.into_future(),
Async::Ready(None) |
Async::Pending => break,
};
self.queue.push(future);
}
// Try polling a new future
if let Some(val) = try_ready!(self.queue.poll_next(cx)) {
return Ok(Async::Ready(Some(val)));
}
// If we've gotten this far, then there are no events for us to process
// and nothing was ready, so figure out if we're not done yet or if
// we've reached the end.
if self.stream.is_done() {
Ok(Async::Ready(None))
} else {
Ok(Async::Pending)
}
}
}
// Forwarding impl of Sink from the underlying stream
impl<S> Sink for BufferUnordered<S>
where S: Sink + Stream,
S::Item: IntoFuture,
{
type SinkItem = S::SinkItem;
type SinkError = S::SinkError;
delegate_sink!(stream);
}