RBTree is a sorted associative collection using Red-Black Tree as the internal data structure. The elements of RBTree are ordered and the interface is the almost same as Hash, so simply you can consider RBTree sorted Hash.
Required Ruby Version
> 0.0.0
Authors
OZAWA Takuma
Versions
- 0.4.7 June 26, 2026 (29.5 KB)
- 0.4.6 December 10, 2022 (30 KB)
- 0.4.5 February 02, 2022 (29.5 KB)
- 0.4.4 January 01, 2021 (29.5 KB)
- 0.4.3 January 01, 2021 (29.5 KB)
- 0.2.0 February 04, 2008* (27.5 KB)