RBTree is a sorted associative collection that is implemented with Red-Black Tree. The elements of RBTree are ordered and its interface is the almost same as Hash, so simply you can consider RBTree sorted Hash.

Required Ruby Version

None

Authors

Isaiah Peng

Versions

  1. 0.2.1

    1. source

      1. 0.2.1 source July 23, 2013 (103 KB)
  2. 0.2.0

    1. source

      1. 0.2.0 source December 09, 2012 (103 KB)
  3. 0.1.0

    1. source

      1. 0.1.0 source November 10, 2012 (135 KB)

SHA 256 checksum

← Previous version