[−][src]Trait slice_group_by::GroupByMut

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

    fn linear_group_mut(&mut self) -> LinearGroupMut<T>
    where
        T: PartialEq;

    fn binary_group_by_mut<P>(&mut self, predicate: P) -> BinaryGroupByMut<T, P>
    where
        P: FnMut(&T, &T) -> bool;

    fn binary_group_mut(&mut self) -> BinaryGroupMut<T>
    where
        T: PartialEq;

    fn exponential_group_by_mut<P>(
        &mut self, 
        predicate: P
    ) -> ExponentialGroupByMut<T, P>
    where
        P: FnMut(&T, &T) -> bool;

    fn exponential_group_mut(&mut self) -> ExponentialGroupMut<T>
    where
        T: PartialEq;
}

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<P>(&mut self, predicate: P) -> LinearGroupByMut<T, P> where
    P: FnMut(&T, &T) -> bool, 

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

ⓘImportant traits for LinearGroupMut<'a, T>
fn linear_group_mut(&mut self) -> LinearGroupMut<T> where
    T: PartialEq, 

Returns an iterator on mutable slice groups based on the PartialEq::eq method of T, it uses linear search to iterate over groups.

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

Returns an iterator on mutable 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 BinaryGroupMut<'a, T>
fn binary_group_mut(&mut self) -> BinaryGroupMut<T> where
    T: PartialEq, 

Returns an iterator on mutable slice groups based on the PartialEq::eq method of T, it uses binary search to iterate over groups.

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<P>(
    &mut self,
    predicate: P
) -> ExponentialGroupByMut<T, P> where
    P: FnMut(&T, &T) -> bool, 

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

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

ⓘImportant traits for ExponentialGroupMut<'a, T>
fn exponential_group_mut(&mut self) -> ExponentialGroupMut<T> where
    T: PartialEq, 

Returns an iterator on mutable slice groups based on the PartialEq::eq method of T, it uses exponential search to iterate over groups.

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

Loading content...

Implementations on Foreign Types

impl<T> GroupByMut<T> for [T][src]

Loading content...

Implementors

Loading content...