Struct Intersection
#[must_use = "this returns the intersection as an iterator, without modifying either input set"]
pub struct Intersection<'a, T: 'a, A: Allocator + Clone = Global> { pub(in ::collections::btree::set) inner: IntersectionInner<'a, T, A> }A lazy iterator producing elements in the intersection of BTreeSets.
This struct is created by the intersection method on BTreeSet.
See its documentation for more.
Fields
inner: IntersectionInner<'a, T, A>
Trait Implementations
impl<'a, T: Ord, A: Allocator + Clone> Iterator for Intersection<'a, T, A>
type Item = &'a T;fn next(&mut self) -> Option<&'a T>fn size_hint(&self) -> (usize, Option<usize>)fn min(self) -> Option<&'a T>
impl<T, A: Allocator + Clone> Clone for Intersection<'_, T, A>
fn clone(&self) -> Self
impl<T: Debug, A: Allocator + Clone> Debug for Intersection<'_, T, A>
fn fmt(&self, f: &mut Formatter<'_>) -> Result
impl<T: Ord, A: Allocator + Clone> FusedIterator for Intersection<'_, T, A>
Auto Trait Implementations
impl<'a, T, A> Freeze for Intersection<'a, T, A>
where
IntersectionInner<'a, T, A>: Freeze,
impl<'a, T, A> RefUnwindSafe for Intersection<'a, T, A>
where
IntersectionInner<'a, T, A>: RefUnwindSafe,
impl<'a, T, A> Send for Intersection<'a, T, A>
where
IntersectionInner<'a, T, A>: Send,
impl<'a, T, A> Sync for Intersection<'a, T, A>
where
IntersectionInner<'a, T, A>: Sync,
impl<'a, T, A> Unpin for Intersection<'a, T, A>
where
IntersectionInner<'a, T, A>: Unpin,
impl<'a, T, A> UnsafeUnpin for Intersection<'a, T, A>
where
IntersectionInner<'a, T, A>: UnsafeUnpin,
impl<'a, T, A> UnwindSafe for Intersection<'a, T, A>
where
IntersectionInner<'a, T, A>: UnwindSafe,
Blanket Implementations
impl<I> IntoIterator for Intersection<'a, T, A>
where
I: Iterator,
type Item = <I as Iterator>::Item;type IntoIter = I;fn into_iter(self) -> I
impl<T> Any for Intersection<'a, T, A>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for Intersection<'a, T, A>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for Intersection<'a, T, A>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneToUninit for Intersection<'a, T, A>
where
T: Clone,
unsafe fn clone_to_uninit(&self, dest: *mut u8)
impl<T> From<T> for Intersection<'a, T, A>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> SizeHint for Intersection<'a, T, A>
where
T: ?Sized,
fn lower_bound(&self) -> usizefn upper_bound(&self) -> Option<usize>
impl<T> SizedTypeProperties for Intersection<'a, T, A>
impl<T> ToOwned for Intersection<'a, T, A>
where
T: Clone,
type Owned = T;fn to_owned(&self) -> Tfn clone_into(&self, target: &mut T)
impl<T, U> Into<U> for Intersection<'a, T, A>
where
U: From<T>,
fn into(self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom<U> for Intersection<'a, T, A>
where
U: Into<T>,
type Error = Infallible;fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T, U> TryInto<U> for Intersection<'a, T, A>
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>