pub trait SortedPairIterator<K, V>: Iterator + Sized {
    // Provided methods
    fn join<W, J>(self, that: J) -> Join<Self, J>
       where J: SortedPairIterator<K, W> { ... }
    fn left_join<W, J>(self, that: J) -> LeftJoin<Self, J>
       where J: SortedPairIterator<K, W> { ... }
    fn right_join<W, J>(self, that: J) -> RightJoin<Self, J>
       where J: SortedPairIterator<K, W> { ... }
    fn outer_join<W, J>(self, that: J) -> OuterJoin<Self, J>
       where J: SortedPairIterator<K, W> { ... }
    fn map_values<W, F>(self, f: F) -> MapValues<Self, F>
       where F: FnMut(V) -> W { ... }
    fn filter_map_values<W, F>(self, f: F) -> FilterMapValues<Self, F>
       where F: FnMut(V) -> W { ... }
    fn keys(self) -> Keys<Self> { ... }
}
Expand description

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

Provided Methods§

source

fn join<W, J>(self, that: J) -> Join<Self, J>where J: SortedPairIterator<K, W>,

source

fn left_join<W, J>(self, that: J) -> LeftJoin<Self, J>where J: SortedPairIterator<K, W>,

source

fn right_join<W, J>(self, that: J) -> RightJoin<Self, J>where J: SortedPairIterator<K, W>,

source

fn outer_join<W, J>(self, that: J) -> OuterJoin<Self, J>where J: SortedPairIterator<K, W>,

source

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

source

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

source

fn keys(self) -> Keys<Self>

Object Safety§

This trait is not object safe.

Implementors§

source§

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