A priority queue is like a standard queue, except that each inserted element 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

>= 3.1

Authors

Trans, K. Kodama, Ronald Butler, Olivier Renaud, Rick Bradley

Versions

  1. 2.2.0

    1. source

      1. 2.2.0 source April 03, 2026 (9 KB)
  2. 2.1.0

    1. source

      1. 2.1.0 source March 03, 2015 (11 KB)
  3. 2.0.2

    1. source

      1. 2.0.2 source October 29, 2011 (9 KB)
  4. 2.0.1

    1. source

      1. 2.0.1 source October 29, 2011 (8.5 KB)
  5. 2.0.0

    1. source

      1. 2.0.0 source October 29, 2011 (9.5 KB)
Show all versions (6 total)

Pushed by

transami

SHA 256 checksum

← Previous version