Enum DifferenceInner
pub(in ::collections::btree::set) enum DifferenceInner<'a, T: 'a, A: Allocator + Clone>Variants
-
Stitch { self_iter: Iter<'a, T>, other_iter: Peekable<Iter<'a, T>> } -
Search { self_iter: Iter<'a, T>, other_set: &'a BTreeSet<T, A> } -
Iterate(Iter<'a, T>)
Trait Implementations
impl<T: Debug, A: Allocator + Clone> Debug for DifferenceInner<'_, T, A>
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Auto Trait Implementations
impl<'a, T, A> Freeze for DifferenceInner<'a, T, A>
where
Iter<'a, T>: Freeze + Freeze + Freeze,
Peekable<Iter<'a, T>>: Freeze,
&'a BTreeSet<T, A>: Freeze,
impl<'a, T, A> RefUnwindSafe for DifferenceInner<'a, T, A>
where
Iter<'a, T>: RefUnwindSafe + RefUnwindSafe + RefUnwindSafe,
Peekable<Iter<'a, T>>: RefUnwindSafe,
&'a BTreeSet<T, A>: RefUnwindSafe,
impl<'a, T, A> Send for DifferenceInner<'a, T, A>
where
Iter<'a, T>: Send + Send + Send,
Peekable<Iter<'a, T>>: Send,
&'a BTreeSet<T, A>: Send,
impl<'a, T, A> Sync for DifferenceInner<'a, T, A>
where
Iter<'a, T>: Sync + Sync + Sync,
Peekable<Iter<'a, T>>: Sync,
&'a BTreeSet<T, A>: Sync,
impl<'a, T, A> Unpin for DifferenceInner<'a, T, A>
where
Iter<'a, T>: Unpin + Unpin + Unpin,
Peekable<Iter<'a, T>>: Unpin,
&'a BTreeSet<T, A>: Unpin,
impl<'a, T, A> UnsafeUnpin for DifferenceInner<'a, T, A>
where
Iter<'a, T>: UnsafeUnpin + UnsafeUnpin + UnsafeUnpin,
Peekable<Iter<'a, T>>: UnsafeUnpin,
&'a BTreeSet<T, A>: UnsafeUnpin,
impl<'a, T, A> UnwindSafe for DifferenceInner<'a, T, A>
where
Iter<'a, T>: UnwindSafe + UnwindSafe + UnwindSafe,
Peekable<Iter<'a, T>>: UnwindSafe,
&'a BTreeSet<T, A>: UnwindSafe,
Blanket Implementations
impl<T> Any for DifferenceInner<'a, T, A>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for DifferenceInner<'a, T, A>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for DifferenceInner<'a, T, A>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> From<T> for DifferenceInner<'a, T, A>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> SizeHint for DifferenceInner<'a, T, A>
where
T: ?Sized,
fn lower_bound(&self) -> usizefn upper_bound(&self) -> Option<usize>
impl<T> SizedTypeProperties for DifferenceInner<'a, T, A>
impl<T, U> Into<U> for DifferenceInner<'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 DifferenceInner<'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 DifferenceInner<'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>