[−][src]Trait sorted_iter::SortedPairIterator
relational operations for iterators of pairs where the items are sorted according to the key
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>ⓘ
self,
that: J
) -> RightJoin<Self, J>ⓘ
fn outer_join<W, J: SortedPairIterator<K, W>>(
self,
that: J
) -> OuterJoin<Self, J>ⓘ
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>ⓘ
self,
f: F
) -> FilterMapValues<Self, F>ⓘ
fn keys(self) -> Keys<Self>ⓘ
Implementors
impl<K, V, I> SortedPairIterator<K, V> for I where
I: Iterator<Item = (K, V)> + SortedByKey,
[src]
I: Iterator<Item = (K, V)> + SortedByKey,