blob: 1ac19658fb68baa2377752c413ba2e3b6808ce76 [file] [log] [blame]
use crate::stream::{FuturesUnordered, StreamExt};
use core::mem;
use core::marker::Unpin;
use core::pin::Pin;
use core::num::NonZeroUsize;
use futures_core::future::{FusedFuture, Future};
use futures_core::stream::TryStream;
use futures_core::task::{LocalWaker, Poll};
use pin_utils::{unsafe_pinned, unsafe_unpinned};
/// A stream combinator which executes a unit closure over each item on a
/// stream concurrently.
///
/// This structure is returned by the
/// [`TryStreamExt::try_for_each_concurrent`](super::TryStreamExt::try_for_each_concurrent)
/// method.
#[derive(Debug)]
#[must_use = "streams do nothing unless polled"]
pub struct TryForEachConcurrent<St, Fut, F> {
stream: Option<St>,
f: F,
futures: FuturesUnordered<Fut>,
limit: Option<NonZeroUsize>,
}
impl<St, Fut, F> Unpin for TryForEachConcurrent<St, Fut, F>
where St: Unpin,
Fut: Unpin,
{}
impl<St, Fut, F> FusedFuture for TryForEachConcurrent<St, Fut, F> {
fn is_terminated(&self) -> bool {
self.stream.is_none() && self.futures.is_empty()
}
}
impl<St, Fut, F> TryForEachConcurrent<St, Fut, F>
where St: TryStream,
F: FnMut(St::Ok) -> Fut,
Fut: Future<Output = Result<(), St::Error>>,
{
unsafe_pinned!(stream: Option<St>);
unsafe_unpinned!(f: F);
unsafe_unpinned!(futures: FuturesUnordered<Fut>);
unsafe_unpinned!(limit: Option<NonZeroUsize>);
pub(super) fn new(stream: St, limit: Option<usize>, f: F) -> TryForEachConcurrent<St, Fut, F> {
TryForEachConcurrent {
stream: Some(stream),
// Note: `limit` = 0 gets ignored.
limit: limit.and_then(NonZeroUsize::new),
f,
futures: FuturesUnordered::new(),
}
}
}
impl<St, Fut, F> Future for TryForEachConcurrent<St, Fut, F>
where St: TryStream,
F: FnMut(St::Ok) -> Fut,
Fut: Future<Output = Result<(), St::Error>>,
{
type Output = Result<(), St::Error>;
fn poll(mut self: Pin<&mut Self>, lw: &LocalWaker) -> Poll<Self::Output> {
loop {
let mut made_progress_this_iter = false;
// Try and pull an item from the stream
let current_len = self.as_mut().futures().len();
// Check if we've already created a number of futures greater than `limit`
if self.limit.map(|limit| limit.get() > current_len).unwrap_or(true) {
let poll_res = match self.as_mut().stream().as_pin_mut() {
Some(stream) => stream.try_poll_next(lw),
None => Poll::Ready(None),
};
let elem = match poll_res {
Poll::Ready(Some(Ok(elem))) => {
made_progress_this_iter = true;
Some(elem)
},
Poll::Ready(None) => {
self.as_mut().stream().set(None);
None
}
Poll::Pending => None,
Poll::Ready(Some(Err(e))) => {
// Empty the stream and futures so that we know
// the future has completed.
self.as_mut().stream().set(None);
drop(mem::replace(self.as_mut().futures(), FuturesUnordered::new()));
return Poll::Ready(Err(e));
}
};
if let Some(elem) = elem {
let next_future = (self.as_mut().f())(elem);
self.as_mut().futures().push(next_future);
}
}
match self.as_mut().futures().poll_next_unpin(lw) {
Poll::Ready(Some(Ok(()))) => made_progress_this_iter = true,
Poll::Ready(None) => {
if self.as_mut().stream().is_none() {
return Poll::Ready(Ok(()))
}
},
Poll::Pending => {}
Poll::Ready(Some(Err(e))) => {
// Empty the stream and futures so that we know
// the future has completed.
self.as_mut().stream().set(None);
drop(mem::replace(self.as_mut().futures(), FuturesUnordered::new()));
return Poll::Ready(Err(e));
}
}
if !made_progress_this_iter {
return Poll::Pending;
}
}
}
}