Trait IntervalIterator

pub trait IntervalIterator<E: PartialOrd> {
    type IntervalIter: Iterator<Item = RangeInclusive<E>>;

    // Required method
    fn intervals(&self) -> Self::IntervalIter;

    // Provided methods
    fn card(&self) -> usize
       where E: AsPrimitive<usize> + Integer { ... }
    fn diff<O, R>(&self, other: &O) -> R
       where E: Clone + Integer,
             O: IntervalIterator<E>,
             R: FromIterator<RangeInclusive<E>> { ... }
    fn disjoint<O: IntervalIterator<E> + ?Sized>(&self, other: &O) -> bool { ... }
    fn intersect<O, R>(&self, other: &O) -> R
       where E: Clone,
             O: IntervalIterator<E>,
             R: FromIterator<RangeInclusive<E>> { ... }
    fn subset<O: IntervalIterator<E> + ?Sized>(&self, other: &O) -> bool { ... }
    fn superset<O: IntervalIterator<E> + ?Sized>(&self, other: &O) -> bool { ... }
    fn union<O, R>(&self, other: &O) -> R
       where E: Clone,
             O: IntervalIterator<E>,
             R: FromIterator<RangeInclusive<E>> { ... }
}

A trait that provides operations on iterators of orderdered intervals.

Required Associated Types

type IntervalIter: Iterator<Item = RangeInclusive<E>>

The type of the interval iterator.

Required Methods

fn intervals(&self) -> Self::IntervalIter

Returns an iterator over the ordered intervals.

Provided Methods

fn card(&self) -> usize

where E: AsPrimitive<usize> + Integer,

Returns the number of elements contained within the RangeList.

fn diff<O, R>(&self, other: &O) -> R

where E: Clone + Integer, O: IntervalIterator<E>, R: FromIterator<RangeInclusive<E>>,

Compute RangeList without any of the elements in the ranges of other.

Warning

The implementation decrements the lowest value of self and increments the largest value of self. This could cause a panic if this causes overflow in E.

fn disjoint<O: IntervalIterator<E> + ?Sized>(&self, other: &O) -> bool

Returns whether self and other are disjoint sets

fn intersect<O, R>(&self, other: &O) -> R

where E: Clone, O: IntervalIterator<E>, R: FromIterator<RangeInclusive<E>>,

Return the set intersection of two interval iterators.

fn subset<O: IntervalIterator<E> + ?Sized>(&self, other: &O) -> bool

Returns whether self is a subset of other

fn superset<O: IntervalIterator<E> + ?Sized>(&self, other: &O) -> bool

Returns whether self is a superset of other

fn union<O, R>(&self, other: &O) -> R

where E: Clone, O: IntervalIterator<E>, R: FromIterator<RangeInclusive<E>>,

Return the set union of two interval iterators.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementations on Foreign Types

impl<E: Clone + Ord> IntervalIterator<E> for BTreeSet<E>

type IntervalIter = Map<<BTreeSet<E> as IntoIterator>::IntoIter, fn(_: E) -> RangeInclusive<E>>

fn intervals(&self) -> Self::IntervalIter

impl<E: Clone + Ord> IntervalIterator<E> for HashSet<E>

type IntervalIter = Map<<Vec<E> as IntoIterator>::IntoIter, fn(_: E) -> RangeInclusive<E>>

fn intervals(&self) -> Self::IntervalIter

Implementors

impl<E: PartialOrd + Clone> IntervalIterator<E> for RangeList<E>

type IntervalIter = <RangeList<E> as IntoIterator>::IntoIter