Trait sorted_iter::SortedIteratorExt

pub trait SortedIteratorExt: Iterator + Sized {
    fn union<J>(self, that: J) -> Union<Self, J>
    where
        J: SortedIteratorExt<Item = Self::Item>,
    { ... }
    fn intersection<J>(self, that: J) -> Intersection<Self, J>
    where
        J: SortedIteratorExt<Item = Self::Item>,
    { ... }
    fn difference<J>(self, that: J) -> Difference<Self, J>
    where
        J: SortedIteratorExt<Item = Self::Item>,
    { ... }
    fn symmetric_difference<J>(self, that: J) -> SymmetricDifference<Self, J>
    where
        J: SortedIteratorExt<Item = Self::Item>,
    { ... }
    fn pairs(self) -> Pairs<Self> { ... }
}

set operations for iterators where the items are sorted according to the natural order

Provided methods

Important traits for Union<I, J>

impl<K: Ord, I: Iterator<Item = K>, J: Iterator<Item = K>> Iterator for Union<I, J> type Item = K;

fn union<J>(self, that: J) -> Union<Self, J> where
    J: SortedIteratorExt<Item = Self::Item>, 

union with another sorted iterator

Important traits for Intersection<I, J>

impl<K: Ord, I: Iterator<Item = K>, J: Iterator<Item = K>> Iterator for Intersection<I, J> type Item = K;

fn intersection<J>(self, that: J) -> Intersection<Self, J> where
    J: SortedIteratorExt<Item = Self::Item>, 

intersection with another sorted iterator

Important traits for Difference<I, J>

impl<K: Ord, I: Iterator<Item = K>, J: Iterator<Item = K>> Iterator for Difference<I, J> type Item = K;

fn difference<J>(self, that: J) -> Difference<Self, J> where
    J: SortedIteratorExt<Item = Self::Item>, 

difference with another sorted iterator

Important traits for SymmetricDifference<I, J>

impl<K: Ord, I: Iterator<Item = K>, J: Iterator<Item = K>> Iterator for SymmetricDifference<I, J> type Item = K;

fn symmetric_difference<J>(self, that: J) -> SymmetricDifference<Self, J> where
    J: SortedIteratorExt<Item = Self::Item>, 

symmetric difference with another sorted iterator

Important traits for Pairs<I>

impl<I: Iterator> Iterator for Pairs<I> type Item = (I::Item, ());

fn pairs(self) -> Pairs<Self>

pairs with unit value

Loading content...

Implementors

impl<I> SortedIteratorExt for I where
    I: Iterator + SortedByItem, 

Loading content...