var searchIndex = {};
searchIndex["radix_trie"] = {"doc":"A wonderful, fast, safe, generic radix trie implementation.","items":[[3,"NibbleVec","radix_trie","A data-structure for storing a sequence of 4-bit values.",null,null],[3,"Iter","","Iterator over the keys and values of a Trie.",null,null],[3,"Keys","","Iterator over the keys of a Trie.",null,null],[3,"Values","","Iterator over the values of a Trie.",null,null],[3,"Trie","","Data-structure for storing and querying string-like keys and associated values.",null,null],[11,"new","","",0,{"inputs":[{"name":"trie"}],"output":{"name":"iter"}}],[11,"new","","",1,{"inputs":[{"name":"iter"}],"output":{"name":"keys"}}],[11,"next","","",1,null],[11,"new","","",2,{"inputs":[{"name":"iter"}],"output":{"name":"values"}}],[11,"next","","",2,null],[11,"next","","",0,null],[0,"traversal","","",null,null],[8,"Traversal","radix_trie::traversal","Trait capturing a traversal of a trie.",null,null],[16,"Key","","Key type to be threaded through by `run`, needn't be `K` (is often `&'a K`).",3,null],[16,"Value","","Value type to be threaded through by `run`, needn't be `V` (is often `()`).",3,null],[16,"Result","","Type returned by the entire traversal, for insert it's `Option<V>`.",3,null],[10,"default_result","","",3,{"inputs":[],"output":{"name":"result"}}],[11,"root_fn","","",3,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"}],"output":{"name":"result"}}],[11,"no_child_fn","","",3,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"},{"name":"usize"}],"output":{"name":"result"}}],[11,"full_match_fn","","",3,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"}],"output":{"name":"result"}}],[11,"partial_match_fn","","",3,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"},{"name":"usize"}],"output":{"name":"result"}}],[11,"first_prefix_fn","","",3,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"}],"output":{"name":"result"}}],[11,"action_fn","","",3,{"inputs":[{"name":"trie"},{"name":"result"},{"name":"usize"}],"output":{"name":"result"}}],[11,"run","","Run the traversal, returning the result.",3,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"}],"output":{"name":"result"}}],[8,"RefTraversal","","Trait capturing a traversal of a trie.",null,null],[16,"Key","","Key type to be threaded through by `run`, needn't be `K` (is often `&'a K`).",4,null],[16,"Value","","Value type to be threaded through by `run`, needn't be `V` (is often `()`).",4,null],[16,"Result","","Type returned by the entire traversal, for insert it's `Option<V>`.",4,null],[10,"default_result","","",4,{"inputs":[],"output":{"name":"result"}}],[11,"root_fn","","",4,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"}],"output":{"name":"result"}}],[11,"no_child_fn","","",4,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"},{"name":"usize"}],"output":{"name":"result"}}],[11,"full_match_fn","","",4,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"}],"output":{"name":"result"}}],[11,"partial_match_fn","","",4,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"},{"name":"usize"}],"output":{"name":"result"}}],[11,"first_prefix_fn","","",4,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"}],"output":{"name":"result"}}],[11,"action_fn","","",4,{"inputs":[{"name":"trie"},{"name":"result"},{"name":"usize"}],"output":{"name":"result"}}],[11,"run","","Run the traversal, returning the result.",4,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"}],"output":{"name":"result"}}],[8,"TraversalMut","","Trait capturing a traversal of a trie.",null,null],[16,"Key","","Key type to be threaded through by `run`, needn't be `K` (is often `&'a K`).",5,null],[16,"Value","","Value type to be threaded through by `run`, needn't be `V` (is often `()`).",5,null],[16,"Result","","Type returned by the entire traversal, for insert it's `Option<V>`.",5,null],[10,"default_result","","",5,{"inputs":[],"output":{"name":"result"}}],[11,"root_fn","","",5,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"}],"output":{"name":"result"}}],[11,"no_child_fn","","",5,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"},{"name":"usize"}],"output":{"name":"result"}}],[11,"full_match_fn","","",5,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"}],"output":{"name":"result"}}],[11,"partial_match_fn","","",5,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"},{"name":"usize"}],"output":{"name":"result"}}],[11,"first_prefix_fn","","",5,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"}],"output":{"name":"result"}}],[11,"action_fn","","",5,{"inputs":[{"name":"trie"},{"name":"result"},{"name":"usize"}],"output":{"name":"result"}}],[11,"run","","Run the traversal, returning the result.",5,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"}],"output":{"name":"result"}}],[8,"RefTraversalMut","","Trait capturing a traversal of a trie.",null,null],[16,"Key","","Key type to be threaded through by `run`, needn't be `K` (is often `&'a K`).",6,null],[16,"Value","","Value type to be threaded through by `run`, needn't be `V` (is often `()`).",6,null],[16,"Result","","Type returned by the entire traversal, for insert it's `Option<V>`.",6,null],[10,"default_result","","",6,{"inputs":[],"output":{"name":"result"}}],[11,"root_fn","","",6,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"}],"output":{"name":"result"}}],[11,"no_child_fn","","",6,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"},{"name":"usize"}],"output":{"name":"result"}}],[11,"full_match_fn","","",6,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"}],"output":{"name":"result"}}],[11,"partial_match_fn","","",6,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"},{"name":"usize"}],"output":{"name":"result"}}],[11,"first_prefix_fn","","",6,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"}],"output":{"name":"result"}}],[11,"action_fn","","",6,{"inputs":[{"name":"trie"},{"name":"result"},{"name":"usize"}],"output":{"name":"result"}}],[11,"run","","Run the traversal, returning the result.",6,{"inputs":[{"name":"trie"},{"name":"key"},{"name":"value"},{"name":"nibblevec"}],"output":{"name":"result"}}],[8,"TrieKey","radix_trie","Trait for types which can be used to key a Radix Trie.",null,null],[10,"encode","","Encode a value as a vector of bytes.",7,null],[11,"fmt","","",8,null],[11,"new","","Create an empty Trie.",8,{"inputs":[],"output":{"name":"trie"}}],[11,"len","","Fetch the number of key-value pairs stored in the Trie.",8,null],[11,"is_empty","","Determine if the Trie contains 0 key-value pairs.",8,null],[11,"is_leaf","","Determine if the trie is a leaf node (has no children).",8,null],[11,"key","","Get the key stored at this node, if any.",8,null],[11,"value","","Get the value stored at this node, if any.",8,null],[11,"value_mut","","Get a mutable reference to the value stored at this node, if any.",8,null],[11,"get","","Fetch a reference to the given key's corresponding value, if any.",8,null],[11,"get_mut","","Fetch a mutable reference to the given key's corresponding value, if any.",8,null],[11,"get_node","","Fetch a reference to the given key's corresponding node, if any.",8,null],[11,"get_ancestor","","Fetch a reference to the closest ancestor node of the given key.",8,null],[11,"get_ancestor_value","","Fetch the closest ancestor *value* for a given key.",8,null],[11,"get_descendant","","Fetch the closest descendant for a given key.",8,null],[11,"insert","","Insert the given key-value pair, returning any previous value associated with the key.",8,null],[11,"remove","","Remove and return the value associated with the given key.",8,null],[11,"iter","","Return an iterator over the keys and values of the Trie.",8,null],[11,"keys","","Return an iterator over the keys of the Trie.",8,null],[11,"values","","Return an iterator over the values of the Trie.",8,null],[14,"id!","","Identity macro to allow expansion of the "mutability" token tree.",null,null],[11,"new","","Create an empty nibble vector.",9,{"inputs":[],"output":{"name":"nibblevec"}}],[11,"from_byte_vec","","Create a nibble vector from a vector of bytes.",9,{"inputs":[{"name":"vec"}],"output":{"name":"nibblevec"}}],[11,"len","","Get the number of elements stored in the vector.",9,null],[11,"get","","Fetch a single entry from the vector.",9,null],[11,"push","","Add a single nibble to the vector.",9,null],[11,"split","","Split the vector into two parts.",9,null],[11,"join","","Append another nibble vector whilst consuming this vector.",9,null],[11,"clone","","",9,null],[11,"eq","","",9,null],[11,"eq","","",9,null],[11,"fmt","","",9,null]],"paths":[[3,"Iter"],[3,"Keys"],[3,"Values"],[8,"Traversal"],[8,"RefTraversal"],[8,"TraversalMut"],[8,"RefTraversalMut"],[8,"TrieKey"],[3,"Trie"],[3,"NibbleVec"]]};
initSearch(searchIndex);