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. This is a fork of the original gem that fixes various bugs on Ruby 2.3+.

Required Ruby Version

>= 1.9

Authors

Kyrylo Silin, OZAWA Takuma

Versions

  1. 1.1.0

    1. source

      1. 1.1.0 source June 06, 2026 (34 KB)
  2. 1.0.1

    1. source

      1. 1.0.1 source March 24, 2026 (33.5 KB)
  3. 1.0.0

    1. source

      1. 1.0.0 source March 24, 2026 (33.5 KB)
  4. 0.7.1

    1. source

      1. 0.7.1 source April 20, 2023 (33.5 KB)
  5. 0.7.0

    1. source

      1. 0.7.0 source January 10, 2022 (33.5 KB)
Show all versions (7 total)

Pushed by

kyrylo

SHA 256 checksum

← Previous version