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

source

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

source

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

source

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

source

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

source

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

source

fn keys(self) -> Keys<Self>

Implementors§

source§

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