[][src]Trait slice_group_by::GroupByMut

pub trait GroupByMut<T, P> where
    P: FnMut(&T, &T) -> bool
{ fn linear_group_by_mut(&mut self, predicate: P) -> LinearGroupByMut<T, P>;
fn binary_group_by_mut(&mut self, predicate: P) -> BinaryGroupByMut<T, P>;
fn exponential_group_by_mut(
        &mut self,
        predicate: P
    ) -> ExponentialGroupByMut<T, P>; }

A convenient trait to construct an iterator returning non-overlapping mutable groups defined by a predicate.

Required methods

Important traits for LinearGroupByMut<'a, T, P>
fn linear_group_by_mut(&mut self, predicate: P) -> LinearGroupByMut<T, P>

Returns an iterator on slice groups using the linear search method.

Important traits for BinaryGroupByMut<'a, T, P>
fn binary_group_by_mut(&mut self, predicate: P) -> BinaryGroupByMut<T, P>

Returns an iterator on slice groups using the binary search method.

The predicate function should implement an order consistent with the sort order of the slice.

Important traits for ExponentialGroupByMut<'a, T, P>
fn exponential_group_by_mut(
    &mut self,
    predicate: P
) -> ExponentialGroupByMut<T, P>

Returns an iterator on slice groups using the exponential search method.

The predicate function should implement an order consistent with the sort order of the slice.

Loading content...

Implementations on Foreign Types

impl<T, P> GroupByMut<T, P> for [T] where
    P: FnMut(&T, &T) -> bool
[src]

Loading content...

Implementors

Loading content...