A self-balancing binary tree optimised for fast access to frequently used nodes. Useful for implementing caches and garbage collection algorithms.

Required Ruby Version

>= 2.0.0

Authors

Piotr Murach

Versions

  1. 0.4.0

    1. source

      1. 0.4.0 source March 29, 2021 (9 KB)
  2. 0.3.0

    1. source

      1. 0.3.0 source February 26, 2019 (12.5 KB)
  3. 0.2.0

    1. source

      1. 0.2.0 source January 03, 2015 (12.5 KB)
  4. 0.1.0

    1. source

      1. 0.1.0 source December 27, 2014 (10.5 KB)

Pushed by

piotrmurach

SHA 256 checksum

← Previous version