Struct itertools::groupbylazy::ChunkBy

pub struct ChunkBy<K, I, F>
where
    I: Iterator,
{
    inner: RefCell<GroupInner<K, I, F>>,
    index: Cell<usize>,
}

ChunkBy is the storage for the lazy grouping operation.

If the groups are consumed in their original order, or if each group is dropped without keeping it around, then ChunkBy uses no allocations. It needs allocations only if several group iterators are alive at the same time.

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

See .chunk_by() for more information.

Fields

inner: RefCell<GroupInner<K, I, F>>

index: Cell<usize>

Implementations

impl<K, I, F> ChunkBy<K, I, F>

where I: Iterator,

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

where F: FnMut(&I::Item) -> K, K: PartialEq,

client: Index of group that requests next element

fn drop_group(&self, client: usize)

client: Index of group

Trait Implementations

impl<'a, K, I, F> IntoIterator for &'a ChunkBy<K, I, F>

where I: Iterator, I::Item: 'a, F: FnMut(&I::Item) -> K, K: PartialEq,

type Item = (K, Group<'a, K, I, F>)

The type of the elements being iterated over.

type IntoIter = Groups<'a, K, I, F>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.