range_set_blaze

Trait SortedStartsMap

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

Expand description

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

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,