Trait sorted_iter::SortedIterator

pub trait SortedIterator<T> {
    type I: Iterator<Item = T>;
    fn union<J: Iterator<Item = T> + SortedByItem>(
        self, 
        that: J
    ) -> Union<Self::I, J>;
    fn intersection<J: Iterator<Item = T> + SortedByItem>(
        self, 
        that: J
    ) -> Intersection<Self::I, J>;
    fn difference<J: Iterator<Item = T> + SortedByItem>(
        self, 
        that: J
    ) -> Difference<Self::I, J>;
    fn symmetric_difference<J: Iterator<Item = T> + SortedByItem>(
        self, 
        that: J
    ) -> SymmetricDifference<Self::I, J>;
    fn pairs(self) -> Pairs<Self::I>;
}

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

Associated Types

type I: Iterator<Item = T>

the iterator this SortedIterator extends

Loading content...

Required 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: Iterator<Item = T> + SortedByItem>(
    self,
    that: J
) -> Union<Self::I, J>

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: Iterator<Item = T> + SortedByItem>(
    self,
    that: J
) -> Intersection<Self::I, J>

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: Iterator<Item = T> + SortedByItem>(
    self,
    that: J
) -> Difference<Self::I, J>

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: Iterator<Item = T> + SortedByItem>(
    self,
    that: J
) -> SymmetricDifference<Self::I, J>

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::I>

pairs with unit value

Loading content...

Implementors

impl<T: Ord, I: Iterator<Item = T> + SortedByItem> SortedIterator<T> for I

type I = I

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: Iterator<Item = T> + SortedByItem>(self, that: J) -> Union<I, J>

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: Iterator<Item = T> + SortedByItem>(
    self,
    that: J
) -> Intersection<I, J>

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: Iterator<Item = T> + SortedByItem>(
    self,
    that: J
) -> Difference<I, J>

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: Iterator<Item = T> + SortedByItem>(
    self,
    that: J
) -> SymmetricDifference<I, J>

Important traits for Pairs<I>

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

fn pairs(self) -> Pairs<Self::I>

Loading content...