Trait OrderedSetIterator

pub trait OrderedSetIterator: Iterator + Sized {
    // Provided methods
    fn inner_join_map<I>(self, map: I) -> InnerJoinMapSet<I, Self> 
       where I: OrderedMapIterator<Key = Self::Item> { ... }
    fn inner_join_set<I>(self, map: I) -> InnerJoinSet<Self, I> 
       where I: OrderedSetIterator<Item = Self::Item> { ... }
}

Allows an iterator to do an inner join with another iterator to combine their values or filter based on their keys.

This trait is applied to an iterator over a set-like structure.

Provided Methods

fn inner_join_map<I>(self, map: I) -> InnerJoinMapSet<I, Self>

where I: OrderedMapIterator<Key = Self::Item>,

Joins two ordered maps together.

fn inner_join_set<I>(self, map: I) -> InnerJoinSet<Self, I>

where I: OrderedSetIterator<Item = Self::Item>,

Filters an ordered map with an ordered set.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementations on Foreign Types

impl<'a, B: BitBlock> OrderedSetIterator for Iter<'a, B>

impl<'a, K: Ord> OrderedSetIterator for Iter<'a, K>

impl<'a, K: Ord, V> OrderedSetIterator for Keys<'a, K, V>

Implementors

impl<A, B> OrderedSetIterator for InnerJoinSet<A, B>

where A: OrderedSetIterator, B: OrderedSetIterator<Item = A::Item>, A::Item: Ord,