Trait SortedStartsMap 

pub trait SortedStartsMap<T, VR>: Iterator<Item = (RangeInclusive<T>, VR)> + FusedIterator
where
    T: Integer,
    VR: ValueRef,
{ }

Used internally. Marks iterators that provide (range, value) pairs that are sorted by the range’s start, but that are not necessarily disjoint.

Dyn Compatibility

This trait is dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl<T, VR, I, IInner, TMap> SortedStartsMap<T, VR> for FlatMap<IntoIter<I>, IInner, TMap>

where T: Integer, VR: ValueRef, IInner: SortedStartsMap<T, VR>, I: SortedStartsMap<T, VR>, TMap: FnMut(I) -> IInner,

impl<T, VR, I, P> SortedStartsMap<T, VR> for Filter<I, P>

where T: Integer, VR: ValueRef, I: SortedStartsMap<T, VR>, P: FnMut(&I::Item) -> bool,

impl<T, VR, I, P> SortedStartsMap<T, VR> for SkipWhile<I, P>

where T: Integer, VR: ValueRef, I: SortedStartsMap<T, VR>, P: FnMut(&I::Item) -> bool,

impl<T, VR, I, P> SortedStartsMap<T, VR> for TakeWhile<I, P>

where T: Integer, VR: ValueRef, I: SortedStartsMap<T, VR>, P: FnMut(&I::Item) -> bool,

impl<T, VR, I> SortedStartsMap<T, VR> for Flatten<IntoIter<I>>

where T: Integer, VR: ValueRef, I: SortedStartsMap<T, VR>,

impl<T, VR, I> SortedStartsMap<T, VR> for Fuse<I>

where T: Integer, VR: ValueRef, I: SortedStartsMap<T, VR>,

impl<T, VR, I> SortedStartsMap<T, VR> for Peekable<I>

where T: Integer, VR: ValueRef, I: SortedStartsMap<T, VR>,

impl<T, VR, I> SortedStartsMap<T, VR> for Skip<I>

where T: Integer, VR: ValueRef, I: SortedStartsMap<T, VR>,

impl<T, VR, I> SortedStartsMap<T, VR> for Take<I>

where T: Integer, VR: ValueRef, I: SortedStartsMap<T, VR>,

impl<T, VR> SortedStartsMap<T, VR> for Empty<(RangeInclusive<T>, VR)>

where T: Integer, VR: ValueRef,

impl<T, VR> SortedStartsMap<T, VR> for Once<(RangeInclusive<T>, VR)>

where T: Integer, VR: ValueRef,

Implementors

impl<'a, V: Eq + Clone, T> SortedStartsMap<T, &'a V> for RangeValuesIter<'a, T, V>

where T: Integer,

impl<'a, VR: ValueRef, T> SortedStartsMap<T, VR> for DynSortedDisjointMap<'a, T, VR>

where T: Integer,

impl<V: Eq + Clone, T> SortedStartsMap<T, Rc<V>> for IntoRangeValuesIter<T, V>

where T: Integer,

impl<VR: ValueRef, I0: SortedDisjointMap<T, VR>, I1: SortedDisjoint<T>, T> SortedStartsMap<T, VR> for IntersectionIterMap<T, VR, I0, I1>

where T: Integer,

impl<VR: ValueRef, I: Iterator<Item = (RangeInclusive<T>, VR)>, T> SortedStartsMap<T, VR> for CheckSortedDisjointMap<T, VR, I>

where T: Integer,

impl<VR: ValueRef, I: PrioritySortedStartsMap<T, VR>, T> SortedStartsMap<T, VR> for SymDiffIterMap<T, VR, I>

where T: Integer,

impl<VR: ValueRef, I: PrioritySortedStartsMap<T, VR>, T> SortedStartsMap<T, VR> for UnionIterMap<T, VR, I>

where T: Integer,