Struct Iter

pub struct Iter<'a, K: 'a, V: 'a> { /* private fields */ }

Iterator over the keys and values of a Trie.

Implementations

impl<'a, K, V> Iter<'a, K, V>

fn new(root: &'a TrieNode<K, V>) -> Iter<'a, K, V>

Trait Implementations

impl<'a, K, V> Iterator for Iter<'a, K, V>

type Item = (&'a K, &'a V);
fn next(&mut self) -> Option<Self::Item>

Auto Trait Implementations

impl<'a, K, V> Freeze for Iter<'a, K, V> where &'a TrieNode<K, V>: Freeze, Vec<FilterMap<Iter<'a, Option<Box<TrieNode<K, V>>>>, fn(&'a Option<Box<TrieNode<K, V>>>) -> Option<&'a Box<TrieNode<K, V>>>>>: Freeze,

impl<'a, K, V> RefUnwindSafe for Iter<'a, K, V> where &'a TrieNode<K, V>: RefUnwindSafe, Vec<FilterMap<Iter<'a, Option<Box<TrieNode<K, V>>>>, fn(&'a Option<Box<TrieNode<K, V>>>) -> Option<&'a Box<TrieNode<K, V>>>>>: RefUnwindSafe,

impl<'a, K, V> Send for Iter<'a, K, V> where &'a TrieNode<K, V>: Send, Vec<FilterMap<Iter<'a, Option<Box<TrieNode<K, V>>>>, fn(&'a Option<Box<TrieNode<K, V>>>) -> Option<&'a Box<TrieNode<K, V>>>>>: Send,

impl<'a, K, V> Sync for Iter<'a, K, V> where &'a TrieNode<K, V>: Sync, Vec<FilterMap<Iter<'a, Option<Box<TrieNode<K, V>>>>, fn(&'a Option<Box<TrieNode<K, V>>>) -> Option<&'a Box<TrieNode<K, V>>>>>: Sync,

impl<'a, K, V> Unpin for Iter<'a, K, V> where &'a TrieNode<K, V>: Unpin, Vec<FilterMap<Iter<'a, Option<Box<TrieNode<K, V>>>>, fn(&'a Option<Box<TrieNode<K, V>>>) -> Option<&'a Box<TrieNode<K, V>>>>>: Unpin,

impl<'a, K, V> UnsafeUnpin for Iter<'a, K, V> where &'a TrieNode<K, V>: UnsafeUnpin, Vec<FilterMap<Iter<'a, Option<Box<TrieNode<K, V>>>>, fn(&'a Option<Box<TrieNode<K, V>>>) -> Option<&'a Box<TrieNode<K, V>>>>>: UnsafeUnpin,

impl<'a, K, V> UnwindSafe for Iter<'a, K, V> where &'a TrieNode<K, V>: UnwindSafe, Vec<FilterMap<Iter<'a, Option<Box<TrieNode<K, V>>>>, fn(&'a Option<Box<TrieNode<K, V>>>) -> Option<&'a Box<TrieNode<K, V>>>>>: UnwindSafe,

Blanket Implementations

impl<I> IntoIterator for Iter<'a, K, V> where I: Iterator,

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

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

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Iter<'a, K, V> where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Iter<'a, K, V> where T: ?Sized,

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

impl<T> From<T> for Iter<'a, K, V>

fn from(t: T) -> T

Returns the argument unchanged.

impl<T, U> Into<U> for Iter<'a, K, V> 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 Iter<'a, K, V> where U: Into<T>,

type Error = never;
fn try_from(value: U) -> Result<T, never>

impl<T, U> TryInto<U> for Iter<'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>