var searchIndex = {};
searchIndex["sparseset"] = {"doc":"A sparse set.","items":[[3,"SparseSet","sparseset","An implementation of a sparse set.",null,null],[3,"Entry","","An entry in the sparse set.\nYou can retrieve a slice (possibly mutable) of [Entry] from the SparseSet.",null,null],[12,"value","","The value stored in the entry. A reference to it is returned by value() and value_mut(), as\nwell as get() and get_mut() directly from SparseSet. The field can be used without going\ntrough the accessors functions since it is public.",0,null],[11,"key","","Read-only access to the entry's key.",0,null],[11,"value","","Returns the value. Mainly for symmetry with key() since the value is public anyway.",0,null],[11,"value_mut","","Returns the value, mutable. Mainly for symmetry with key() since the value is public\nanyway.",0,null],[11,"with_capacity","","Creates a SparseSet with the given capacity.",1,{"inputs":[{"name":"usize"}],"output":{"name":"self"}}],[11,"len","","",1,null],[11,"capacity","","",1,null],[11,"clear","","Clears the SparseSet in O(1) for simple T and O(n) if T implements Drop.",1,null],[11,"get","","Returns a reference to the value corresponding to the given key in O(1).",1,null],[11,"get_mut","","Returns a mutable reference to the value corresponding to the given key in O(1).",1,null],[11,"contains","","Test if the given key is contained in the set in O(1).",1,null],[11,"insert","","Insert in the set a value for the given key in O(1).",1,null],[11,"remove","","Removes the given key in O(1).\nReturns the removed value or None if key not found.",1,null],[11,"deref","","",1,null],[11,"deref_mut","","",1,null],[11,"into_iter","","",1,null]],"paths":[[3,"Entry"],[3,"SparseSet"]]};
initSearch(searchIndex);