Struct Children

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

Iterator over the child subtries of a trie.

Implementations

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

fn new(key: Nibblet, node: &'a TrieNode<K, V>) -> Self

Trait Implementations

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

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

Auto Trait Implementations

impl<'a, K, V> Freeze for Children<'a, K, V> where 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 Children<'a, K, V> where 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 Children<'a, K, V> where 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 Children<'a, K, V> where 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 Children<'a, K, V> where 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 Children<'a, K, V> where 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 Children<'a, K, V> where 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 Children<'a, K, V> where I: Iterator,

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

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

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

fn from(t: T) -> T

Returns the argument unchanged.

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

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

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