Struct Iter
#[must_use = "iterators are lazy and do nothing unless consumed"]
pub struct Iter<'a, T: 'a> { pub(in ::collections::btree::set) iter: Keys<'a, T, SetValZST> }
An iterator over the items of a BTreeSet.
This struct is created by the iter method on BTreeSet.
See its documentation for more.
Fields
iter: Keys<'a, T, SetValZST>
Trait Implementations
impl<'a, T> DoubleEndedIterator for Iter<'a, T>
fn next_back(&mut self) -> Option<&'a T>
impl<'a, T> Iterator for Iter<'a, T>
type Item = &'a T;fn next(&mut self) -> Option<&'a T>fn size_hint(&self) -> (usize, Option<usize>)fn last(self) -> Option<&'a T>fn min(self) -> Option<&'a T> where &'a T: Ord,fn max(self) -> Option<&'a T> where &'a T: Ord,
impl<T> Clone for Iter<'_, T>
fn clone(&self) -> Self
impl<T> Default for Iter<'_, T>
fn default() -> SelfCreates an empty
btree_set::Iter.# use btree_set; let iter: Iter = Defaultdefault; assert_eq!;
impl<T> ExactSizeIterator for Iter<'_, T>
fn len(&self) -> usize
impl<T> FusedIterator for Iter<'_, T>
impl<T> TrustedLen for Iter<'_, T>
impl<T: Debug> Debug for Iter<'_, T>
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Auto Trait Implementations
impl<'a, T> Freeze for Iter<'a, T>
where
Keys<'a, T, SetValZST>: Freeze,
impl<'a, T> RefUnwindSafe for Iter<'a, T>
where
Keys<'a, T, SetValZST>: RefUnwindSafe,
impl<'a, T> Send for Iter<'a, T>
where
Keys<'a, T, SetValZST>: Send,
impl<'a, T> Sync for Iter<'a, T>
where
Keys<'a, T, SetValZST>: Sync,
impl<'a, T> Unpin for Iter<'a, T>
where
Keys<'a, T, SetValZST>: Unpin,
impl<'a, T> UnsafeUnpin for Iter<'a, T>
where
Keys<'a, T, SetValZST>: UnsafeUnpin,
impl<'a, T> UnwindSafe for Iter<'a, T>
where
Keys<'a, T, SetValZST>: UnwindSafe,
Blanket Implementations
impl<I> IntoIterator for Iter<'a, T>
where
I: Iterator,
type Item = <I as Iterator>::Item;type IntoIter = I;fn into_iter(self) -> I
impl<T> Any for Iter<'a, T>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for Iter<'a, T>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for Iter<'a, T>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneToUninit for Iter<'a, T>
where
T: Clone,
unsafe fn clone_to_uninit(&self, dest: *mut u8)
impl<T> From<T> for Iter<'a, T>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> SizeHint for Iter<'a, T>
where
T: ?Sized,
fn lower_bound(&self) -> usizefn upper_bound(&self) -> Option<usize>
impl<T> SizedTypeProperties for Iter<'a, T>
impl<T> ToOwned for Iter<'a, T>
where
T: Clone,
type Owned = T;fn to_owned(&self) -> Tfn clone_into(&self, target: &mut T)
impl<T, U> Into<U> for Iter<'a, T>
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 Iter<'a, T>
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 Iter<'a, T>
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>