Struct Keys
pub struct Keys<'a, K, V> { /* private fields */ }An iterator over a toml::Map's keys.
Trait Implementations
impl<'a, K, V> DoubleEndedIterator for Keys<'a, K, V>
fn next_back(&mut self) -> Option<Self::Item>
impl<'a, K, V> ExactSizeIterator for Keys<'a, K, V>
fn len(&self) -> usize
impl<'a, K, V> Iterator for Keys<'a, K, V>
type Item = &'a K;fn next(&mut self) -> Option<Self::Item>fn size_hint(&self) -> (usize, Option<usize>)
Auto Trait Implementations
impl<'a, K, V> Freeze for Keys<'a, K, V>
where
Keys<'a, K, V>: Freeze,
impl<'a, K, V> RefUnwindSafe for Keys<'a, K, V>
where
Keys<'a, K, V>: RefUnwindSafe,
impl<'a, K, V> Send for Keys<'a, K, V>
where
Keys<'a, K, V>: Send,
impl<'a, K, V> Sync for Keys<'a, K, V>
where
Keys<'a, K, V>: Sync,
impl<'a, K, V> Unpin for Keys<'a, K, V>
where
Keys<'a, K, V>: Unpin,
impl<'a, K, V> UnsafeUnpin for Keys<'a, K, V>
where
Keys<'a, K, V>: UnsafeUnpin,
impl<'a, K, V> UnwindSafe for Keys<'a, K, V>
where
Keys<'a, K, V>: UnwindSafe,
Blanket Implementations
impl<I> IntoIterator for Keys<'a, K, V>
where
I: Iterator,
type Item = <I as Iterator>::Item;type IntoIter = I;fn into_iter(self) -> I
impl<T> Any for Keys<'a, K, V>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for Keys<'a, K, V>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for Keys<'a, K, V>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> From<T> for Keys<'a, K, V>
fn from(t: T) -> TReturns the argument unchanged.
impl<T, U> Into<U> for Keys<'a, K, V>
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 Keys<'a, K, V>
where
U: Into<T>,
type Error = never;fn try_from(value: U) -> Result<T, never>
impl<T, U> TryInto<U> for Keys<'a, K, V>
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>