Struct ChunkBy
struct ChunkBy<K, I, F> { ... }
where
I: Iterator
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.
Implementations
impl<K, I, F> Freeze for ChunkBy<K, I, F>
impl<K, I, F> RefUnwindSafe for ChunkBy<K, I, F>
impl<K, I, F> Send for ChunkBy<K, I, F>
impl<K, I, F> Sync for ChunkBy<K, I, F>
impl<K, I, F> Unpin for ChunkBy<K, I, F>
impl<K, I, F> UnsafeUnpin for ChunkBy<K, I, F>
impl<K, I, F> UnwindSafe for ChunkBy<K, I, F>
impl<T> Any for ChunkBy<K, I, F>
fn type_id(self: &Self) -> TypeId
impl<T> Borrow for ChunkBy<K, I, F>
fn borrow(self: &Self) -> &T
impl<T> BorrowMut for ChunkBy<K, I, F>
fn borrow_mut(self: &mut Self) -> &mut T
impl<T> From for ChunkBy<K, I, F>
fn from(t: T) -> TReturns the argument unchanged.
impl<T, U> Into for ChunkBy<K, I, F>
fn into(self: Self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom for ChunkBy<K, I, F>
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T, U> TryInto for ChunkBy<K, I, F>
fn try_into(self: Self) -> Result<U, <U as TryFrom<T>>::Error>