var searchIndex = {};
searchIndex["eclectic"] = {"doc":"Collection traits for generic programming.","items":[[0,"collection","eclectic","Collections.",null,null],[8,"Collection","eclectic::collection","A collection.",null,null],[16,"Item","","The type of the collection's items.",0,null],[11,"is_empty","","Checks if the collection contains zero items.",0,null],[10,"len","","Returns the number of items in the collection.",0,null],[8,"Insert","","A collection that supports insertion.",null,null],[10,"append","","Moves all items from the given collection into the collection.",1,null],[8,"Remove","","A collection that supports removal.",null,null],[10,"clear","","Removes all items from the collection.",2,null],[10,"drain","","Removes all items from the collection and returns an iterator that yields them.",2,null],[0,"list","eclectic","Lists.",null,null],[8,"List","eclectic::list","A list.",null,null],[10,"get","","Returns a reference to the item at the given index in the list.",3,null],[10,"get_mut","","Returns a mutable reference to the item at the given index in the list.",3,null],[10,"iter","","Returns an iterator that yields references to the list's items.",3,null],[10,"iter_mut","","Returns an iterator that yields mutable references to the list's items.",3,null],[10,"swap","","Swaps the items at the given indices in the list.",3,null],[8,"Insert","","A list that supports insertion.",null,null],[10,"insert","","Inserts the given item into the list at the given index.",4,null],[11,"push","","Pushes the given item onto the back of the list.",4,null],[8,"Remove","","A list that supports removal.",null,null],[10,"drain_range","","Removes the items in the list that lie in the given range and returns an iterator that\nyields them.",5,null],[11,"pop","","Removes the last item in the list and returns it.",5,null],[10,"remove","","Removes the item at the given index in the list and returns it.",5,null],[10,"split_off","","Splits the list in two at the given index.",5,null],[10,"swap_remove","","Removes the item at the given index in the list and returns it, replacing it with the\nlast item in the list.",5,null],[10,"truncate","","Removes all items in the list starting at the given index.",5,null],[0,"map","eclectic","Maps.",null,null],[4,"Entry","eclectic::map","A map entry.",null,null],[13,"Occupied","","An occupied map entry.",6,null],[13,"Vacant","","A vacant map entry.",6,null],[8,"Map","","A map.",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,"entry","","Returns the entry in the map corresponding to the given key.",7,null],[10,"iter","","Returns an iterator that yields references to the map's keys and references to their\nvalues.",7,null],[10,"iter_mut","","Returns an iterator that yields references to the map's keys and mutable references to\ntheir values.",7,null],[8,"Get","","A map that supports retrievals using keys of type `&Q`.",null,null],[11,"contains_key","","Checks if the map contains a key that is equivalent to the given key.",8,null],[10,"get","","Returns a reference to the value of the key in the map that is equivalent to the given\nkey.",8,null],[10,"get_mut","","Returns a mutable reference to the value of the key in the map that is equivalent to\nthe given key.",8,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.",9,null],[8,"Insert","","A map that supports insertion.",null,null],[10,"insert","","Inserts the given key and value into the map without replacing an equivalent key.",10,null],[8,"OccupiedEntry","","An occupied map entry.",null,null],[16,"Key","","The type of the entry's key.",11,null],[16,"Value","","The type of the entry's value.",11,null],[16,"MutValue","","The type of the mutable reference to the entry's value with the same lifetime as the\nmap.",11,null],[10,"get","","Returns a reference to the entry's value.",11,null],[10,"get_mut","","Returns a mutable reference to the entry's value.",11,null],[10,"into_mut","","Returns a mutable reference to the entry's value with the same lifetime as the map.",11,{"inputs":[{"name":"box"}],"output":{"name":"mutvalue"}}],[11,"insert","","Replaces the entry's value with the given one and returns the old value.",11,null],[10,"remove","","Removes the entry from the map and returns its value.",11,{"inputs":[{"name":"box"}],"output":{"name":"value"}}],[8,"VacantEntry","","A vacant map entry.",null,null],[16,"Key","","The type of the entry's key.",12,null],[16,"Value","","The type of the entry's value.",12,null],[16,"MutValue","","The type of the mutable reference to the entry's value with the same lifetime as the\nmap.",12,null],[10,"insert","","Inserts the entry into the map with the given value.",12,{"inputs":[{"name":"box"},{"name":"value"}],"output":{"name":"mutvalue"}}],[11,"or_insert","","Ensures that the entry is occupied by inserting it into the map with the given value if\nit is vacant.",6,null],[11,"or_insert_with","","Ensures that the entry is occupied by inserting it into the map with the result of the\ngiven function if it is vacant.",6,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.",13,null],[8,"Queue","","A queue.",null,null],[10,"front","","Returns a reference to the item at the front of the queue.",14,null],[10,"front_mut","","Returns a mutable reference to the item at the front of the queue.",14,null],[10,"pop_front","","Removes the item at the front of the queue and returns it.",14,null],[8,"Stack","","A stack.",null,null],[10,"back","","Returns a reference to the item at the back of the stack.",15,null],[10,"back_mut","","Returns a mutable reference to the item at the back of the stack.",15,null],[10,"pop_back","","Removes the item at the back of the stack and returns it.",15,null],[8,"Deque","","A deque (double-ended queue).",null,null],[10,"push_front","","Pushes the given item onto the front of the deque.",16,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.",17,null],[10,"is_subset","","Checks if the set is a subset of the given set.",17,null],[11,"is_superset","","Checks if the set is a superset of the given set.",17,null],[10,"iter","","Returns an iterator that yields references to the set's items.",17,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.",18,null],[10,"get","","Returns a reference to the item in the set that is equivalent to the given item.",18,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.",19,null],[10,"take","","Removes the item in the set that is equivalent to the given item and returns it.",19,null],[8,"Insert","","A set that supports insertion.",null,null],[10,"insert","","Inserts the given item into the set without replacing an equivalent item.",20,null],[10,"replace","","Inserts the given item into the set, replacing an equivalent item.",20,null]],"paths":[[8,"Collection"],[8,"Insert"],[8,"Remove"],[8,"List"],[8,"Insert"],[8,"Remove"],[4,"Entry"],[8,"Map"],[8,"Get"],[8,"Remove"],[8,"Insert"],[8,"OccupiedEntry"],[8,"VacantEntry"],[8,"PushBack"],[8,"Queue"],[8,"Stack"],[8,"Deque"],[8,"Set"],[8,"Get"],[8,"Remove"],[8,"Insert"]]};
initSearch(searchIndex);