3.1.0

• Implement merge operation for SimplePairingHeap

3.0.1

Fixed issues

• change_priority could sometimes return nil instead of self

3.0.0

Breaking changes

• #pop returns nil on empty heap instead of raising an Error
• #get_priority returns nil on empty heap instead of raising an Error

New methods

• PairingHeap::PairingHeap#include?
• #each_with_priority

2.0.0

Breaking changes

• Second argument of #push now defaults to the first argument

# it is now possible to write
array.each { |el| heap.push(el) }
# instead of
array.each { |el| heap.push(el, el) }

• PairingHeap#pop_priority was separated to two methods; PairingHeap#pop_priority and PairingHeap#pop_with_priority, similarly to SimplePairingHeap

New methods

• #each returns an iterator of heap elements.
• PairingHeap#get_priority_if_exists returns a pair where first element is success flag, and second element is priority.

1.0.0

First stable release

• Refactor merge_pairs to use pointer swapping instead of ruby array to represent stack

• Define *_with_priority and redefine *_priority methods
  Previous *_priority methods are now *_with_priority, *_priority only returns priority

• Fix potential issue in #delete method, when deleting root element

0.3.0

Minor performance improvements

0.2.0

Included variant without change_priority support

First release

v0.1.0

Initial commit