Struct itertools::structs::IntoChunks

pub struct IntoChunks<I>
where
    I: Iterator,
{
    inner: RefCell<GroupInner<usize, I, ChunkIndex>>,
    index: Cell<usize>,
}

ChunkLazy is the storage for a lazy chunking operation.

IntoChunks behaves just like ChunkBy: it is iterable, and it only buffers if several chunk iterators are alive at the same time.

This type implements IntoIterator (it is not an iterator itself), because the chunk iterators need to borrow from this value. It should be stored in a local variable or temporary and iterated.

Iterator element type is Chunk, each chunk’s iterator.

See .chunks() for more information.

Fields

inner: RefCell<GroupInner<usize, I, ChunkIndex>>

index: Cell<usize>

Implementations

impl<I> IntoChunks<I>

where I: Iterator,

fn step(&self, client: usize) -> Option<I::Item>

client: Index of chunk that requests next element

fn drop_group(&self, client: usize)

client: Index of chunk

Trait Implementations

impl<I> Clone for IntoChunks<I>

where I: Clone + Iterator, I::Item: Clone,

fn clone(&self) -> Self

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a, I> IntoIterator for &'a IntoChunks<I>

where I: Iterator, I::Item: 'a,

type Item = Chunk<'a, I>

The type of the elements being iterated over.

type IntoIter = Chunks<'a, I>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.