Struct std::collections::btree_set::IntersectionStable

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

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

Trait Implementations

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

type Item = &'a T

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

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