A priority queue is like a standard queue, except that each inserted elements is given a certain priority, based on the result of the comparison block given at instantiation time. Retrieving an element from the queue will always return the one with the highest priority.
Required Ruby Version
None
Authors
K. Kodama, Ronald Butler, Olivier Renaud, Rick Bradley, Thomas Sawyer
Versions
- 2.2.0 April 03, 2026 (9 KB)
- 2.1.0 March 03, 2015 (11 KB)
- 2.0.2 October 29, 2011 (9 KB)
- 2.0.1 October 29, 2011 (8.5 KB)
- 2.0.0 October 29, 2011 (9.5 KB)