Struct IntoKeys

#[must_use = "iterators are lazy and do nothing unless consumed"]
pub struct IntoKeys<K, V, A: Allocator + Clone = Global> { pub(in ::collections::btree::map) inner: IntoIter<K, V, A> }

An owning iterator over the keys of a BTreeMap.

This struct is created by the into_keys method on BTreeMap. See its documentation for more.

Fields

inner: IntoIter<K, V, A>

Trait Implementations

impl<K, V, A> Default for IntoKeys<K, V, A> where A: Allocator + Default + Clone,

fn default() -> Self

Creates an empty btree_map::IntoKeys.

# use std::collections::btree_map;
let iter: btree_map::IntoKeys<u8, u8> = Default::default();
assert_eq!(iter.len(), 0);

impl<K, V, A: Allocator + Clone> DoubleEndedIterator for IntoKeys<K, V, A>

fn next_back(&mut self) -> Option<K>

impl<K, V, A: Allocator + Clone> ExactSizeIterator for IntoKeys<K, V, A>

fn len(&self) -> usize

impl<K, V, A: Allocator + Clone> FusedIterator for IntoKeys<K, V, A>

impl<K, V, A: Allocator + Clone> Iterator for IntoKeys<K, V, A>

type Item = K;
fn next(&mut self) -> Option<K>
fn size_hint(&self) -> (usize, Option<usize>)
fn last(self) -> Option<K>
fn min(self) -> Option<K>
where
    K: Ord,
fn max(self) -> Option<K>
where
    K: Ord,

impl<K, V, A: Allocator + Clone> TrustedLen for IntoKeys<K, V, A>

impl<K: Debug, V, A: Allocator + Clone> Debug for IntoKeys<K, V, A>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Auto Trait Implementations

impl<K, V, A> Freeze for IntoKeys<K, V, A> where IntoIter<K, V, A>: Freeze,

impl<K, V, A> RefUnwindSafe for IntoKeys<K, V, A> where IntoIter<K, V, A>: RefUnwindSafe,

impl<K, V, A> Send for IntoKeys<K, V, A> where IntoIter<K, V, A>: Send,

impl<K, V, A> Sync for IntoKeys<K, V, A> where IntoIter<K, V, A>: Sync,

impl<K, V, A> Unpin for IntoKeys<K, V, A> where IntoIter<K, V, A>: Unpin,

impl<K, V, A> UnsafeUnpin for IntoKeys<K, V, A> where IntoIter<K, V, A>: UnsafeUnpin,

impl<K, V, A> UnwindSafe for IntoKeys<K, V, A> where IntoIter<K, V, A>: UnwindSafe,

Blanket Implementations

impl<I> IntoIterator for IntoKeys<K, V, A> where I: Iterator,

type Item = <I as Iterator>::Item;
type IntoIter = I;
fn into_iter(self) -> I

impl<T> Any for IntoKeys<K, V, A> where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for IntoKeys<K, V, A> where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for IntoKeys<K, V, A> where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for IntoKeys<K, V, A>

fn from(t: T) -> T

Returns the argument unchanged.

impl<T> SizeHint for IntoKeys<K, V, A> where T: ?Sized,

fn lower_bound(&self) -> usize
fn upper_bound(&self) -> Option<usize>

impl<T> SizedTypeProperties for IntoKeys<K, V, A>

impl<T, U> Into<U> for IntoKeys<K, V, A> where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.

impl<T, U> TryFrom<U> for IntoKeys<K, V, 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 IntoKeys<K, V, A> where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error;
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>