A RBTree is a sorted associative collection that is implemented with a Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash.

Required Ruby Version

>= 2.1

Authors

OZAWA Takuma

Versions

  1. 0.4.7 June 26, 2026 (29.5 KB)
  2. 0.4.6 December 10, 2022 (30 KB)
  3. 0.4.5 February 02, 2022 (29.5 KB)
  4. 0.4.4 January 01, 2021 (29.5 KB)
  5. 0.4.3 January 01, 2021 (29.5 KB)
Show all versions (11 total)

Pushed by

SHA 256 checksum