class Concurrent::Collection::NonConcurrentPriorityQueue

@!visibility private
@see docs.oracle.com/javase/7/docs/api/java/util/PriorityQueue.html<br><br>@see algs4.cs.princeton.edu/24pq/MaxPQ.java.html<br>@see algs4.cs.princeton.edu/24pq/index.php#2.6<br><br>@see ruby-doc.org/stdlib-2.0.0/libdoc/thread/rdoc/Queue.html<br>@see en.wikipedia.org/wiki/Priority_queue<br><br>@note This implementation is not thread safe.
When running under all other interpreters it extends ‘RubyNonConcurrentPriorityQueue`.
When running under JRuby the class `NonConcurrentPriorityQueue` extends `JavaNonConcurrentPriorityQueue`.
library `java.util.NonConcurrentPriorityQueue`.
The JRuby native implementation is a thin wrapper around the standard
and Kevin Wayne.
stored in an array. The algorithm is based on the work of Robert Sedgewick
The pure Ruby implementation, `RubyNonConcurrentPriorityQueue` uses a heap algorithm
The API is based on the `Queue` class from the Ruby standard library.
set on construction.
from highest to lowest, but a lowest-to-highest sort order can be
with the “highest” priority is removed. By default the sort order is
at a position relative to their priority. On removal the element
comparison (spaceship) operator `<=>`. Items are added to the queue
A queue collection in which the elements are sorted based on their
@!macro priority_queue