Trait sorted_iter::SortedPairIterator

pub trait SortedPairIterator<K, V> {
    type I: Iterator<Item = (K, V)>;
    fn map_values<W, F: FnMut(V) -> W>(self, f: F) -> MapValues<Self::I, F>;
    fn filter_map_values<W, F: FnMut(V) -> W>(
        self, 
        f: F
    ) -> FilterMapValues<Self::I, F>;
    fn keys(self) -> Keys<Self::I>;
    fn join<W, J: Iterator<Item = (K, W)> + SortedByKey>(
        self, 
        that: J
    ) -> Join<Self::I, J>;
    fn left_join<W, J: Iterator<Item = (K, W)> + SortedByKey>(
        self, 
        that: J
    ) -> LeftJoin<Self::I, J>;
    fn right_join<W, J: Iterator<Item = (K, W)> + SortedByKey>(
        self, 
        that: J
    ) -> RightJoin<Self::I, J>;
    fn outer_join<W, J: Iterator<Item = (K, W)> + SortedByKey>(
        self, 
        that: J
    ) -> OuterJoin<Self::I, J>;
}

relational operations for iterators of pairs where the items are sorted according to the key

Associated Types

type I: Iterator<Item = (K, V)>

Loading content...

Required methods

Important traits for MapValues<I, F>

impl<K, V, W, I, F> Iterator for MapValues<I, F> where
    K: Ord,
    I: Iterator<Item = (K, V)>,
    F: FnMut(V) -> W,  type Item = (K, W);

fn map_values<W, F: FnMut(V) -> W>(self, f: F) -> MapValues<Self::I, F>

map values while leaving keys alone

Important traits for FilterMapValues<I, F>

impl<K, V, W, I, F> Iterator for FilterMapValues<I, F> where
    K: Ord,
    I: Iterator<Item = (K, V)>,
    F: FnMut(V) -> Option<W>,  type Item = (K, W);

fn filter_map_values<W, F: FnMut(V) -> W>(
    self,
    f: F
) -> FilterMapValues<Self::I, F>

filter_map values while leaving keys alone

Important traits for Keys<I>

impl<K, V, I> Iterator for Keys<I> where
    K: Ord,
    I: Iterator<Item = (K, V)>,  type Item = K;

fn keys(self) -> Keys<Self::I>

keys as an iterator that is sorted by item

Important traits for Join<I, J>

impl<K, A, B, I, J> Iterator for Join<I, J> where
    K: Ord,
    I: Iterator<Item = (K, A)> + SortedByKey,
    J: Iterator<Item = (K, B)> + SortedByKey,  type Item = (K, (A, B));

fn join<W, J: Iterator<Item = (K, W)> + SortedByKey>(
    self,
    that: J
) -> Join<Self::I, J>

inner join with another sorted pair iterator

Important traits for LeftJoin<I, J>

impl<K, A, B, I, J> Iterator for LeftJoin<I, J> where
    K: Ord,
    I: Iterator<Item = (K, A)>,
    J: Iterator<Item = (K, B)>,  type Item = (K, (A, Option<B>));

fn left_join<W, J: Iterator<Item = (K, W)> + SortedByKey>(
    self,
    that: J
) -> LeftJoin<Self::I, J>

left join with another sorted pair iterator

Important traits for RightJoin<I, J>

impl<K, A, B, I, J> Iterator for RightJoin<I, J> where
    K: Ord,
    I: Iterator<Item = (K, A)>,
    J: Iterator<Item = (K, B)>,  type Item = (K, (Option<A>, B));

fn right_join<W, J: Iterator<Item = (K, W)> + SortedByKey>(
    self,
    that: J
) -> RightJoin<Self::I, J>

right join with another sorted pair iterator

Important traits for OuterJoin<I, J>

impl<K, A, B, I, J> Iterator for OuterJoin<I, J> where
    K: Ord,
    I: Iterator<Item = (K, A)>,
    J: Iterator<Item = (K, B)>,  type Item = (K, (Option<A>, Option<B>));

fn outer_join<W, J: Iterator<Item = (K, W)> + SortedByKey>(
    self,
    that: J
) -> OuterJoin<Self::I, J>

outer join with another sorted pair iterator

Loading content...

Implementors

impl<K: Ord, V, I: Iterator<Item = (K, V)> + SortedByKey> SortedPairIterator<K, V> for I

type I = I

Important traits for Join<I, J>

impl<K, A, B, I, J> Iterator for Join<I, J> where
    K: Ord,
    I: Iterator<Item = (K, A)> + SortedByKey,
    J: Iterator<Item = (K, B)> + SortedByKey,  type Item = (K, (A, B));

fn join<W, J: Iterator<Item = (K, W)> + SortedByKey>(
    self,
    that: J
) -> Join<I, J>

Important traits for LeftJoin<I, J>

impl<K, A, B, I, J> Iterator for LeftJoin<I, J> where
    K: Ord,
    I: Iterator<Item = (K, A)>,
    J: Iterator<Item = (K, B)>,  type Item = (K, (A, Option<B>));

fn left_join<W, J: Iterator<Item = (K, W)> + SortedByKey>(
    self,
    that: J
) -> LeftJoin<I, J>

Important traits for RightJoin<I, J>

impl<K, A, B, I, J> Iterator for RightJoin<I, J> where
    K: Ord,
    I: Iterator<Item = (K, A)>,
    J: Iterator<Item = (K, B)>,  type Item = (K, (Option<A>, B));

fn right_join<W, J: Iterator<Item = (K, W)> + SortedByKey>(
    self,
    that: J
) -> RightJoin<I, J>

Important traits for OuterJoin<I, J>

impl<K, A, B, I, J> Iterator for OuterJoin<I, J> where
    K: Ord,
    I: Iterator<Item = (K, A)>,
    J: Iterator<Item = (K, B)>,  type Item = (K, (Option<A>, Option<B>));

fn outer_join<W, J: Iterator<Item = (K, W)> + SortedByKey>(
    self,
    that: J
) -> OuterJoin<I, J>

Important traits for MapValues<I, F>

impl<K, V, W, I, F> Iterator for MapValues<I, F> where
    K: Ord,
    I: Iterator<Item = (K, V)>,
    F: FnMut(V) -> W,  type Item = (K, W);

fn map_values<W, F: FnMut(V) -> W>(self, f: F) -> MapValues<Self::I, F>

Important traits for FilterMapValues<I, F>

impl<K, V, W, I, F> Iterator for FilterMapValues<I, F> where
    K: Ord,
    I: Iterator<Item = (K, V)>,
    F: FnMut(V) -> Option<W>,  type Item = (K, W);

fn filter_map_values<W, F: FnMut(V) -> W>(
    self,
    f: F
) -> FilterMapValues<Self::I, F>

Important traits for Keys<I>

impl<K, V, I> Iterator for Keys<I> where
    K: Ord,
    I: Iterator<Item = (K, V)>,  type Item = K;

fn keys(self) -> Keys<Self::I>

Loading content...