Crate open_gpui_collections

Modules§

binary_heap: A priority queue implemented with a binary heap.
btree_map: An ordered map based on a B-Tree.
btree_set: An ordered 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 (deque) implemented with a growable ring buffer.
vecmap

BTreeMap: An ordered map based on a B-Tree.
BTreeSet: An ordered set based on a B-Tree.
BinaryHeap: A priority queue implemented with a binary heap.
FxBuildHasher: An implementation of BuildHasher that produces FxHashers.
FxHasher: A speedy hash algorithm for use within rustc. The hashmap in liballoc by default uses SipHash which isn’t quite as speedy as we want. In the compiler we’re not really worried about DOS attempts, so we use a fast non-cryptographic hash.
LinkedList: A doubly-linked list with owned nodes.
TryReserveError: The error type for try_reserve methods.
VecDeque: A double-ended queue implemented with a growable ring buffer.

Bound: An endpoint of a range of keys.
TryReserveErrorKindExperimental: Details of the allocation that caused a TryReserveError