Structs§

  • Node in a RedBlack tree. The first 16 bytes are used for maintaining the RedBlack and BST properties, the rest is the payload.
  • A Red-Black tree which supports random access O(log n), insert O(log n), delete O(log n), and get max O(1)
  • A Red-Black tree which supports random access O(log n) and get max O(1), but does not require the data to be mutable.

Constants§

Traits§