Expand description

Re-export.

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§

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

Type Aliases§

  • Reexport of the HashMap from hashbrown with the default hasher set to the fnv hash function.
  • Reexport of the HashSet from hashbrown with the default hasher set to the fnv hash function.