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

ChunkLazy is the storage for a lazy chunking operation.

IntoChunks behaves just like GroupBy: 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

client: Index of chunk that requests next element

client: Index of chunk

Trait Implementations

The type of the elements being iterated over.

Which kind of iterator are we turning this into?

Creates an iterator from a value. Read more

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.