Trait SortedStarts 

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

Used internally. Marks iterators that provide ranges sorted by start, but that are not necessarily disjoint. The ranges are non-empty.

Implementors

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

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

impl<'a, V: Eq + Clone, T: Integer> SortedStarts<T> for MapRangesIter<'a, T, V>

impl<'ignore, T: Integer> SortedStarts<T> for IntoRangesIter<T>

impl<'ignore, T: Integer> SortedStarts<T> for RangeOnce<T>

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

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

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

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

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, I> SortedStarts<T> for AssumeSortedStarts<T, I>

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

impl<V: Eq + Clone, T: Integer> SortedStarts<T> for MapIntoRangesIter<T, V>

impl<VR: ValueRef, I: SortedDisjointMap<T, VR>, T: Integer> SortedStarts<T> for RangeValuesToRangesIter<T, VR, I>