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
None
Authors
Tanaka Akira
Versions
- 0.7 June 29, 2014 (24 KB)
- 0.6 November 29, 2011 (22.5 KB)
- 0.5 October 27, 2011 (18.5 KB)
- 0.4 November 28, 2009 (18 KB)
- 0.3 September 24, 2009 (17.5 KB)
- 0.1 September 24, 2009 (15.5 KB)