Expand description

Collection types.

Modules

  • A priority queue implemented with a binary heap.
  • An ordered map based on a B-Tree.
  • An ordered set based on a B-Tree.
  • A hash map implemented with quadratic probing and SIMD lookup.
  • A hash set implemented as a HashMap where the value is ().
  • A doubly-linked list with owned nodes.
  • A double-ended queue (deque) implemented with a growable ring buffer.

Structs

Enums

  • Details of the allocation that caused a TryReserveError
  • An endpoint of a range of keys.