Up to [cvs.NetBSD.org] / pkgsrc / devel / ruby-pairing_heap
Request diff between arbitrary revisions
Keyword substitution: kv
Default branch: MAIN
devel/ruby-pairing_heap: update to 3.1.3 3.1.2 (2026-10-18) * RBS type signatures 3.1.3 (2026-10-19) * Fix syntax errors in RBS type signatures
devel/ruby-pairing_heap: add version 3.0.0 This pacakges is required by new version of ruby-rgl package. PairingHeap 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/). Also implementation without priority change support is provided (SimplePairingHeap), while the asymptotical complexity of the methods stay the same, bookkeeping of elements is not needed making, the constant smaller.