README.md in pairing_heap-1.0.0 vs README.md in pairing_heap-2.0.0
- old
+ new
@@ -1,6 +1,7 @@
# PairingHeap
+[](https://github.com/testdouble/standard)
PairingHeap is a pure Ruby priority queue implementation using a pairing heap as the underlying data structure. While a pairing heap is asymptotically less efficient than the Fibonacci heap, it is usually faster in practice. This makes it a popular choice for Prim's MST or Dijkstra's algorithm implementations.
PairingHeap is currently being used as the priority queue data structure in [RGL](https://github.com/monora/rgl/).
@@ -34,12 +35,12 @@
simple_heap = PairingHeap::SimplePairingHeap.new
simple_heap.push(:a, 1)
simple_heap.push(:b, 2)
simple_heap.push(:c, 3)
simple_heap.peek # => :a
-simple_heap.peek_priority # => [:a, 1]
-simple_heap.pop_priority # => [:a, 1]
+simple_heap.peek_priority # => 1
+simple_heap.pop_with_priority # => [:a, 1]
simple_heap.pop # => :b
# Min priority queue
best_defenses = PairingHeap::MinPriorityQueue.new
best_defenses.push('Chelsea', 24)
@@ -929,15 +930,15 @@
<tr>
<td>pairing_heap (PairingHeap)</td>
<td>1.359x slower</td>
</tr>
<tr>
- <td>lazy_priority_queue</td>
- <td>2.115x slower</td>
- </tr>
- <tr>
<td>Fibonacci</td>
<td>1.824x slower</td>
+ </tr>
+ <tr>
+ <td>lazy_priority_queue</td>
+ <td>2.115x slower</td>
</tr>
<tr>
<th colspan="4">truffleruby 22.2.0, like ruby 3.0.3, GraalVM CE JVM [x86_64-darwin]</th>
</tr>
<tr>