Struct collections::btree_set::IntersectionStable

pub struct Intersection<'a, T: 'a> {
    // some fields omitted
}

A lazy iterator producing elements in the set intersection (in-order).

Trait Implementations

impl<'a, T: Ord> Iterator for Intersection<'a, T>

type Item = &'a T

fn next(&mut self) -> Option<&'a T>

fn size_hint(&self) -> (usize, Option<usize>)

impl<'a, T: Ord> Iterator for Intersection<'a, T>

type Item = &'a T

fn next(&mut self) -> Option<&'a T>

fn size_hint(&self) -> (usize, Option<usize>)