var searchIndex = {};
searchIndex["eclectic"] = {"doc":"Collection traits for generic programming.","items":[[0,"map","eclectic","Maps.",null,null],[4,"Entry","eclectic::map","A map entry.",null,null],[13,"Occupied","","An occupied map entry.",0,null],[13,"Vacant","","A vacant map entry.",0,null],[8,"Base","","A trait that declares a map's key and value types.",null,null],[16,"Key","","The map's key type.",1,null],[16,"Value","","The map's value type.",1,null],[8,"Get","","A map that supports lookups using keys of type `&Q`.",null,null],[11,"contains_key","","Checks if the map contains the given key.",2,null],[10,"get","","Returns a reference to the value in the map corresponding to the given key.",2,null],[8,"GetMut","","A map that supports mutable lookups using keys of type `&Q`.",null,null],[10,"get_mut","","Returns a mutable reference to the value in the map corresponding to the given key.",3,null],[8,"Remove","","A map that supports removals using keys of type `&Q`.",null,null],[10,"remove","","Removes the given key from the map and returns its corresponding value, if any.",4,null],[8,"Insert","","A map that supports insertion.",null,null],[10,"insert","","Inserts the given key and value into the map and returns the previous value\ncorresponding to the given key, if any.",5,null],[8,"Map","","A map.",null,null],[8,"EntryMap","","A map that supports efficient in-place manipulation.",null,null],[16,"OccupiedEntry","","The type of the map's occupied entries.",6,null],[16,"VacantEntry","","The type of the map's vacant entries.",6,null],[10,"entry","","Returns the entry in the map corresponding to the given key.",6,null],[8,"OccupiedEntry","","An occupied map entry.",null,null],[16,"Key","","The type of the map's keys.",7,null],[16,"Value","","The type of the map's values.",7,null],[10,"get","","Returns a reference to the entry's value.",7,null],[10,"get_mut","","Returns a mutable reference to the entry's value.",7,null],[10,"into_mut","","Returns a mutable reference to the entry's value with the same lifetime as the map.",7,null],[11,"insert","","Replaces the entry's value with the given one and returns the old value.",7,null],[10,"remove","","Removes the entry from the map and returns its value.",7,null],[8,"VacantEntry","","A vacant map entry.",null,null],[16,"Key","","The type of the map's keys.",8,null],[16,"Value","","The type of the map's values.",8,null],[10,"insert","","Inserts the entry into the map with the given value and returns a mutable reference to\nit with the same lifetime as the map.",8,null],[11,"fmt","","",0,null],[11,"or_insert","","Ensures the entry is occupied by inserting it with the given default value if it is\nvacant.",0,null],[11,"or_insert_with","","Ensures the entry is occupied by inserting it with the result of the given function if\nit is vacant.",0,null],[0,"set","eclectic","Sets.",null,null],[8,"Base","eclectic::set","A trait that declares a set's item type.",null,null],[16,"Item","","",9,null],[8,"Contains","","A set that supports lookups using items of type `&Q`.",null,null],[10,"contains","","Checks if the set contains the given item.",10,null],[8,"Remove","","A set that supports removals using items of type `&Q`.",null,null],[10,"remove","","Removes the given item from the set and returns `true` if the set contained it.",11,null],[8,"Insert","","A set that supports insertion.",null,null],[10,"insert","","Inserts the given item into the set and returns `true` if the set did not contain it.",12,null],[8,"Set","","A set.",null,null],[8,"Len","eclectic","A collection that contains a finite number of items.",null,null],[11,"is_empty","","Checks if the collection is empty.",13,null],[10,"len","","Returns the number of items in the collection.",13,null],[8,"Clear","","A collection that can be cleared.",null,null],[10,"clear","","Removes all items from the collection.",14,null]],"paths":[[4,"Entry"],[8,"Base"],[8,"Get"],[8,"GetMut"],[8,"Remove"],[8,"Insert"],[8,"EntryMap"],[8,"OccupiedEntry"],[8,"VacantEntry"],[8,"Base"],[8,"Contains"],[8,"Remove"],[8,"Insert"],[8,"Len"],[8,"Clear"]]};
initSearch(searchIndex);