1 line
1.0 KiB
JavaScript
1 line
1.0 KiB
JavaScript
initSidebarItems({"enum":[["Bound","An endpoint of a range of keys."],["TryReserveError","The error type for `try_reserve` methods."]],"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 implemented with quadratic probing and SIMD lookup."],["hash_set","A hash set implemented as a `HashMap` where the value is `()`."],["linked_list","A doubly-linked list with owned nodes."],["vec_deque","A double-ended queue implemented with a growable 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 implemented with quadratic probing and SIMD lookup."],["HashSet","A hash set implemented as a `HashMap` where the value is `()`."],["LinkedList","A doubly-linked list with owned nodes."],["VecDeque","A double-ended queue implemented with a growable ring buffer."]]}); |