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

  • An ordered map based on a B-Tree.
  • An ordered set based on a B-Tree.
  • A priority queue implemented with a binary heap.
  • A cheaply cloneable and sliceable chunk of contiguous memory.
  • 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 wrapper around floats providing implementations of Eq, Ord, and Hash.
  • The error type for try_reserve methods.
  • A double-ended queue implemented with a growable ring buffer.

Enums

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