text: initSidebarItems({"enum":[["Bound","An endpoint of a range of keys."]],"mod":[["binary_heap","A priority queue implemented with a binary heap."],["btree_map","A map based on a B-Tree."],["btree_set","A set based on a B-Tree."],["hash_map","A hash map implementation which uses linear probing with Robin Hood bucket stealing."],["hash_set","An implementation of a hash set using the underlying representation of a HashMap where the value is ()."],["linked_list","A doubly-linked list with owned nodes."],["vec_deque","VecDeque is a double-ended queue, which is implemented with the help of a growing ring buffer."]],"struct":[["BTreeMap","A map based on a B-Tree."],["BTreeSet","A set based on a B-Tree."],["BinaryHeap","A priority queue implemented with a binary heap."],["HashMap","A hash map implementation which uses linear probing with Robin Hood bucket stealing."],["HashSet","An implementation of a hash set using the underlying representation of a HashMap where the value is ()."],["LinkedList","A doubly-linked list."],["VecDeque","`VecDeque` is a growable ring buffer, which can be used as a double-ended queue efficiently."]]});