[−][src]Trait slice_group_by::GroupBy
A convenient trait to construct an iterator returning non-overlapping groups defined by a predicate.
Required methods
ⓘImportant traits for LinearGroupBy<'a, T, P>fn linear_group_by(&self, predicate: P) -> LinearGroupBy<T, P> where
P: FnMut(&T, &T) -> bool,
ⓘImportant traits for LinearGroupBy<'a, T, P>
P: FnMut(&T, &T) -> bool,
Returns an iterator on slice groups using the linear search method.
ⓘImportant traits for BinaryGroupBy<'a, T, P>fn binary_group_by(&self, predicate: P) -> BinaryGroupBy<T, P> where
P: FnMut(&T, &T) -> bool,
ⓘImportant traits for BinaryGroupBy<'a, T, P>
P: FnMut(&T, &T) -> bool,
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 ExponentialGroupBy<'a, T, P>fn exponential_group_by(&self, predicate: P) -> ExponentialGroupBy<T, P> where
P: FnMut(&T, &T) -> bool,
ⓘImportant traits for ExponentialGroupBy<'a, T, P>
P: FnMut(&T, &T) -> bool,
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.
Implementors
impl<T, P, S> GroupBy<T, P> for S where
S: AsRef<[T]>,
[src]
S: AsRef<[T]>,
ⓘImportant traits for LinearGroupBy<'a, T, P>fn linear_group_by(&self, predicate: P) -> LinearGroupBy<T, P> where
P: FnMut(&T, &T) -> bool,
[src]
ⓘImportant traits for LinearGroupBy<'a, T, P>
P: FnMut(&T, &T) -> bool,
ⓘImportant traits for BinaryGroupBy<'a, T, P>fn binary_group_by(&self, predicate: P) -> BinaryGroupBy<T, P> where
P: FnMut(&T, &T) -> bool,
[src]
ⓘImportant traits for BinaryGroupBy<'a, T, P>
P: FnMut(&T, &T) -> bool,
ⓘImportant traits for ExponentialGroupBy<'a, T, P>fn exponential_group_by(&self, predicate: P) -> ExponentialGroupBy<T, P> where
P: FnMut(&T, &T) -> bool,
[src]
ⓘImportant traits for ExponentialGroupBy<'a, T, P>
P: FnMut(&T, &T) -> bool,