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
use crate::stream::Fuse;
use futures_core::stream::Stream;
use futures_core::task::{Context, Poll};
use futures_sink::Sink;
use pin_utils::{unsafe_pinned, unsafe_unpinned};
use core::mem;
use core::pin::Pin;
use alloc::vec::Vec;
/// Stream for the [`chunks`](super::StreamExt::chunks) method.
#[derive(Debug)]
#[must_use = "streams do nothing unless polled"]
pub struct Chunks<St: Stream> {
stream: Fuse<St>,
items: Vec<St::Item>,
cap: usize, // https://github.com/rust-lang-nursery/futures-rs/issues/1475
}
impl<St: Unpin + Stream> Unpin for Chunks<St> {}
impl<St: Stream> Chunks<St> where St: Stream {
unsafe_unpinned!(items: Vec<St::Item>);
unsafe_pinned!(stream: Fuse<St>);
pub(super) fn new(stream: St, capacity: usize) -> Chunks<St> {
assert!(capacity > 0);
Chunks {
stream: super::Fuse::new(stream),
items: Vec::with_capacity(capacity),
cap: capacity,
}
}
fn take(mut self: Pin<&mut Self>) -> Vec<St::Item> {
let cap = self.cap;
mem::replace(self.as_mut().items(), Vec::with_capacity(cap))
}
/// Acquires a reference to the underlying stream that this combinator is
/// pulling from.
pub fn get_ref(&self) -> &St {
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 St {
self.stream.get_mut()
}
/// Acquires a pinned 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_pin_mut<'a>(self: Pin<&'a mut Self>) -> Pin<&'a mut St> {
self.stream().get_pin_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) -> St {
self.stream.into_inner()
}
}
impl<St: Stream> Stream for Chunks<St> {
type Item = Vec<St::Item>;
fn poll_next(
mut self: Pin<&mut Self>,
cx: &mut Context<'_>,
) -> Poll<Option<Self::Item>> {
loop {
match ready!(self.as_mut().stream().poll_next(cx)) {
// Push the item into the buffer and check whether it is full.
// If so, replace our buffer with a new and empty one and return
// the full one.
Some(item) => {
self.as_mut().items().push(item);
if self.items.len() >= self.cap {
return Poll::Ready(Some(self.as_mut().take()))
}
}
// Since the underlying stream ran out of values, return what we
// have buffered, if we have anything.
None => {
let last = if self.items.is_empty() {
None
} else {
let full_buf = mem::replace(self.as_mut().items(), Vec::new());
Some(full_buf)
};
return Poll::Ready(last);
}
}
}
}
}
// Forwarding impl of Sink from the underlying stream
impl<S, Item> Sink<Item> for Chunks<S>
where
S: Stream + Sink<Item>,
{
type SinkError = S::SinkError;
delegate_sink!(stream, Item);
}