This small gem contains several data structures that I have implemented in Ruby to learn how they work. Sometimes it is not enough to read the description of a data structure and accompanying pseudo-code. Actually implementing it is often helpful in understanding what is going on. It is also usually fun. The gem contains basic implementions of Disjoint Union, Heap, Priority Search Tree, and Segment Tree. See the homepage for more details.

Required Ruby Version

>= 3.1.3

Authors

Rory Molinari

Versions

  1. 0.5.8

    1. source

      1. 0.5.8 source December 08, 2025 (86 KB)
  2. 0.5.7

    1. source

      1. 0.5.7 source January 04, 2024 (69.5 KB)
  3. 0.5.6

    1. source

      1. 0.5.6 source January 04, 2024 (69.5 KB)
  4. 0.5.5

    1. source

      1. 0.5.5 source December 19, 2023 (69 KB)
  5. 0.5.4

    1. source

      1. 0.5.4 source December 12, 2023 (69 KB)
Show all versions (19 total)

Pushed by

quokka

SHA 256 checksum

← Previous version