var searchIndex = {};
searchIndex["bitmaptrie"] = {"doc":"A bitmapped vector trie with node compression and a path cache. Values are always sorted by\ntheir index; thus iterating is always in index order.","items":[[3,"CompVec","bitmaptrie","A simple sparse vector.  The `valid` word is a bitmap of which indeces\nhave values.  The maximum size of this vector is equal to the number of\nbits in a word (32 or 64).",null,null],[3,"PathCache","","A cached path into a trie",null,null],[3,"Trie","","Path-cached bitmap trie.",null,null],[3,"Iter","","Iterator over Trie",null,null],[3,"IterMut","","Iterator over Trie",null,null],[4,"TrieNode","","An interior (branch) or exterior (leaf) trie node, defined recursively.",null,null],[13,"Interior","","",0,null],[13,"Exterior","","",0,null],[11,"set","","Move a value into the node at the given index. Returns a reference\nto the location where the value is stored.",1,null],[11,"get_mut","","Return the mutable value at the given index if it exists, otherwise\nreturn None.",1,null],[11,"get","","Return the value at the given index if it exists, otherwise return\nNone.",1,null],[11,"get_default_mut","","Return the value at the given index if it exists, otherwise call the\nprovided function to get the default value to insert and return.",1,null],[11,"remove","","Remove an entry, returning the entry if it was present at the given\nindex.",1,null],[11,"size","","Number of objects stored.",1,null],[11,"capacity","","Number of objects that can be stored without reallocation.",1,null],[11,"is_empty","","Return true if the vector is empty.",1,null],[11,"next","","Return the next Some(((masked_valid, compressed), (index, &value)))\nor None",1,null],[11,"next_mut","","Return the next Some(((masked_valid, compressed), (index, &mut value)))\nor None",1,null],[11,"iter","","Create an iterator over the contents",1,null],[11,"new","","",1,{"inputs":[],"output":{"name":"compvec"}}],[17,"VALID_MAX","","First value to use in CompVec::next(masked__valid, ...)",null,null],[17,"USIZE_BYTES","","",null,null],[17,"WORD_SIZE","","",null,null],[11,"retain_if","","Retains only the elements specified by the predicate.",0,null],[11,"clone","","",2,null],[11,"new","","Instantiate a new Trie, indexed by a usize integer and storing values\nof type T.",3,{"inputs":[],"output":{"name":"trie"}}],[11,"set","","Set an entry to a value, moving the new value into the trie. Updates the internal path\ncache to point at this index.",3,null],[11,"get_default_mut","","Retrieve a mutable reference to the value at the given index. If the index does not have\nan associated value, call the default function to generate a value for that index and\nreturn the reference to it. Updates the internal path cache to point at this index.",3,null],[11,"get_mut","","Retrieve a mutable reference to the value at the given index. Updates the internal path\ncache to point at this index.",3,null],[11,"get","","Retrieve a reference to the value at the given index. Updates the internal path cache to\npoint at this index.",3,null],[11,"remove","","Remove an entry, returning the associated value. Invalidates the internal path cache from\nthe depth of tree modification out to the leaf if anything was removed.",3,null],[11,"retain_if","","Retains only the elements specified by the predicate. Invalidates the cache entirely.",3,null],[11,"set_with_cache","","Set an entry to a value, accelerating access with the given cache,\nupdating the cache with the new path. This function causes a new\ngeneration since it can possibly cause memory to move around.",3,null],[11,"get_mut_with_cache","","Retrieve a value, accelerating access with the given cache, updating\nthe cache with the new path.",3,null],[11,"get_with_cache","","Retrieve a value, accelerating access with the given cache, updating\nthe cache with the new path.",3,null],[11,"remove_with_cache","","Remove an entry, accelerating access with the given cache, updating\nthe cache with the new path. This function causes a new generation\nsince it can cause memory to move around.",3,null],[11,"new_cache","","Create a new cache for this instance.",3,null],[11,"iter","","Create an iterator over immutable data",3,null],[11,"iter_mut","","Create an iterator over mutable data",3,null],[11,"drop","","",3,null],[11,"index","","",3,null],[11,"index_mut","","",3,null],[11,"new","","",4,{"inputs":[{"name":"trienode"}],"output":{"name":"iter"}}],[11,"next","","",4,null],[11,"new","","",5,{"inputs":[{"name":"trienode"}],"output":{"name":"itermut"}}],[11,"next","","",5,null]],"paths":[[4,"TrieNode"],[3,"CompVec"],[3,"PathCache"],[3,"Trie"],[3,"Iter"],[3,"IterMut"]]};
initSearch(searchIndex);