Trait SortedStarts

pub trait SortedStarts<T: Integer>: Iterator<Item = RangeInclusive<T>> { }

A trait used to mark iterators that provide ranges sorted by start, but not necessarily by end, and may overlap.

Implementations on Foreign Types

impl<T: Integer, I: SortedDisjoint<T>> SortedStarts<T> for Tee<I>

Implementors

impl<'a, T: Integer> SortedStarts<T> for DynSortedDisjoint<'a, T>

impl<T, I> SortedStarts<T> for KMerge<T, I>

where T: Integer, I: SortedDisjoint<T>,

impl<T, L, R> SortedStarts<T> for Merge<T, L, R>

where T: Integer, L: SortedDisjoint<T>, R: SortedDisjoint<T>,

impl<T: Integer> SortedStarts<T> for IntoRangesIter<T>

impl<T: Integer> SortedStarts<T> for RangesIter<'_, T>

impl<T: Integer, I> SortedStarts<T> for AssumeSortedStarts<T, I>

where I: Iterator<Item = RangeInclusive<T>>,

impl<T: Integer, I> SortedStarts<T> for CheckSortedDisjoint<T, I>

where I: Iterator<Item = RangeInclusive<T>>,

impl<T: Integer, I: SortedDisjoint<T>> SortedStarts<T> for NotIter<T, I>

impl<T: Integer, I: SortedStarts<T>> SortedStarts<T> for UnionIter<T, I>