depq is a Double-Ended Priority Queue library. It is a data structure which can insert elements and delete elements with minimum and maximum priority. If there are elements which has same priority, the element inserted first is chosen. The priority can be changed after the element is inserted.

Required Ruby Version

>= 0

Authors

Tanaka Akira

Versions

  1. 0.7

    1. source

      1. 0.7 source June 29, 2014 (24 KB)
  2. 0.6

    1. source

      1. 0.6 source November 29, 2011 (22.5 KB)
  3. 0.5

    1. source

      1. 0.5 source October 27, 2011 (18.5 KB)
  4. 0.4

    1. source

      1. 0.4 source November 28, 2009 (18 KB)
  5. 0.3

    1. source

      1. 0.3 source September 24, 2009 (17.5 KB)
Show all versions (7 total)

SHA 256 checksum

← Previous version