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,"Map","","A map.",null,null],[16,"Key","","The type of the map's keys.",1,null],[16,"Value","","The type of the map's values.",1,null],[8,"Get","","A map that supports lookups using keys of type `&Q`.",null,null],[11,"contains_key","","Checks if the map contains a key that is equivalent to the given key.",2,null],[10,"get","","Returns a reference to the value in the map whose key is equivalent to the given key.",2,null],[10,"get_mut","","Returns a mutable reference to the value in the map whose key is equivalent to the\ngiven key.",2,null],[8,"Remove","","A map that supports removals using keys of type `&Q`.",null,null],[10,"remove","","Removes the key in the map that is equivalent to the given key and returns its value.",3,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.",4,null],[8,"EntryMap","","A map that supports efficient in-place modification.",null,null],[16,"OccupiedEntry","","The type of the map's occupied entries.",5,null],[16,"VacantEntry","","The type of the map's vacant entries.",5,null],[10,"entry","","Returns the entry in the map corresponding to the given key.",5,null],[8,"OccupiedEntry","","An occupied map entry.",null,null],[16,"Map","","The entry's map type.",6,null],[10,"get","","Returns a reference to the entry's value.",6,null],[10,"get_mut","","Returns a mutable reference to the entry's value.",6,null],[10,"into_mut","","Returns a mutable reference to the entry's value with the same lifetime as the map.",6,null],[11,"insert","","Replaces the entry's value with the given one and returns the old value.",6,null],[10,"remove","","Removes the entry from the map and returns its value.",6,null],[8,"VacantEntry","","A vacant map entry.",null,null],[16,"Map","","The entry's map type.",7,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.",7,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,"seq","eclectic","Sequences.",null,null],[8,"PushBack","eclectic::seq","A sequence that supports insertion.",null,null],[10,"push_back","","Pushes the given item onto the back of the sequence.",8,null],[8,"Queue","","A queue.",null,null],[10,"front","","Returns a reference to the item at the front of the queue.",9,null],[10,"front_mut","","Returns a mutable reference to the item at the front of the queue.",9,null],[10,"pop_front","","Removes and returns the item at the front of the queue.",9,null],[8,"Stack","","A stack.",null,null],[10,"back","","Returns a reference to the item at the back of the stack.",10,null],[10,"back_mut","","Returns a mutable reference to the item at the back of the stack.",10,null],[10,"pop_back","","Removes and returns the item at the back of the stack.",10,null],[8,"Deque","","A deque (double-ended queue).",null,null],[10,"push_front","","Pushes the given item onto the front of the deque.",11,null],[0,"set","eclectic","Sets.",null,null],[8,"Set","eclectic::set","A set.",null,null],[10,"is_disjoint","","Checks if the set is disjoint from the given set.",12,null],[10,"is_subset","","Checks if the set is a subset of the given set.",12,null],[11,"is_superset","","Checks if the set is a superset of the given set.",12,null],[8,"Get","","A set that supports retrievals using items of type `&Q`.",null,null],[11,"contains","","Checks if the set contains an item that is equivalent to the given item.",13,null],[10,"get","","Returns the item in the set that is equivalent to the given item.",13,null],[8,"Remove","","A set that supports removal using items of type `&Q`.",null,null],[11,"remove","","Removes the item in the set that is equivalent to the given item.",14,null],[10,"take","","Removes and returns the item in the set that is equivalent to the given item.",14,null],[8,"Insert","","A set that supports insertion.",null,null],[10,"insert","","Inserts the given item into the set without replacement.",15,null],[10,"replace","","Inserts the given item into the set with replacement.",15,null],[8,"Collection","eclectic","A collection.",null,null],[16,"Item","","The type of the collection's items.",16,null],[11,"is_empty","","Checks if the collection contains zero items.",16,null],[10,"len","","Returns the number of items in the collection.",16,null],[8,"Insert","","A collection that supports insertion.",null,null],[10,"append","","Moves all items from the given collection into the collection.",17,null],[8,"Remove","","A collection that supports removal.",null,null],[10,"clear","","Removes all items from the collection.",18,null]],"paths":[[4,"Entry"],[8,"Map"],[8,"Get"],[8,"Remove"],[8,"Insert"],[8,"EntryMap"],[8,"OccupiedEntry"],[8,"VacantEntry"],[8,"PushBack"],[8,"Queue"],[8,"Stack"],[8,"Deque"],[8,"Set"],[8,"Get"],[8,"Remove"],[8,"Insert"],[8,"Collection"],[8,"Insert"],[8,"Remove"]]};
initSearch(searchIndex);