PQueue 2.0.0 has been released. 

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. 

* home: http://rubyworks.github.com/pqueue
* code: http://github.com/rubyworks/pqueue
* mail: http://groups.google.com/group/rubyworks-mailinglist
* bugs: http://github.com/rubyworks/pqueue/issues

This is a complete rewrite to simplify the design and use more of Ruby's internal methods.  Overall performance should be markedly improved. A few method names have changed to be more consistent with Ruby's other data structure. Note that the internal heap is now in reverse order from the previous version. If using #to_a be aware that the priority order will be reversed. This release also switches the library to distribution under the BSD-2-Clause license. 

Changes: 

* Rewrite library.
* Modernize build configuration.
* Switch to BSD-2-Clause license.