pub fn new(trie: &'a MultiTrie<T>) -> MultiTrieIterator<'a, T> {
        let mut node_stack = Vec::with_capacity(trie.nb_required);
        let nb_roots = trie.nb_tries - trie.nb_required + 1;
        let mut leaf_iter = Vec::new();
        for i in (0..nb_roots).rev() {
            if trie.nb_required > 1 {
                node_stack.push((
                    (i, Vec::<usize>::new()),
                    create_node_iterator(&trie.store[i]),
                ));
            } else {
                leaf_iter.push((i, create_leaf_iterator(&trie.store[i])));
            }
        }
        MultiTrieIterator {
            trie,
            node_stack,
            trie_info_iter: Vec::new(),
            leaf_iter,
            cur_path: Vec::new(),
        }
    }
/// Create a new MultiTrie iterator.
Create a new MultiTrie iterator.
Create a new MultiTrie iterator .
pub fn new(trie: &'a MultiTrie<T>) -> MultiTrieIterator<'a, T> {
        let mut node_stack = Vec::with_capacity(trie.nb_required);
        let nb_roots = trie.nb_tries - trie.nb_required + 1;
        let mut leaf_iter = Vec::new();
        for i in (0..nb_roots).rev() {
            if trie.nb_required > 1 {
                node_stack.push((
                    (i, Vec::<usize>::new()),
                    create_node_iterator(&trie.store[i]),
                ));
            } else {
                leaf_iter.push((i, create_leaf_iterator(&trie.store[i])));
            }
        }
        MultiTrieIterator {
            trie,
            node_stack,
            trie_info_iter: Vec::new(),
            leaf_iter,
            cur_path: Vec::new(),
        }
    }
pub fn new ( trie : & ' a MultiTrie < T > ) -> MultiTrieIterator < ' a , T > { let mut node_stack = Vec :: with_capacity ( trie . nb_required ) ; let nb_roots = trie . nb_tries - trie . nb_required + 1 ; let mut leaf_iter = Vec :: new ( ) ; for i in ( 0 .. nb_roots ) . rev ( ) { if trie . nb_required > 1 { node_stack . push ( ( ( i , Vec :: < usize > :: new ( ) ) , create_node_iterator ( & trie . store [ i ] ) , ) ) ; } else { leaf_iter . push ( ( i , create_leaf_iterator ( & trie . store [ i ] ) ) ) ; } } MultiTrieIterator { trie , node_stack , trie_info_iter : Vec :: new ( ) , leaf_iter , cur_path : Vec :: new ( ) , } }
Create a new MultiTrie iterator.
Create a new MultiTrie iterator .
trie
&'a MultiTrie<T>