{"added":null,"apiVersion":1,"behindSince":null,"buildDepends":[],"categories":["devel","ruby"],"comment":"Performant priority queue in pure ruby","compare":null,"dependentCount":null,"description":"PairingHeap\n\nPairingHeap is a pure Ruby priority queue implementation using a pairing\nheap as the underlying data structure.  While a pairing heap is\nasymptotically less efficient than the Fibonacci heap, it is usually faster\nin practice.  This makes it a popular choice for Prim's MST or Dijkstra's\nalgorithm implementations.\n\nPairingHeap is currently being used as the priority queue data structure in\nRGL (https://github.com/monora/rgl/).\n\nAlso implementation without priority change support is provided\n(SimplePairingHeap), while the asymptotical complexity of the methods stay\nthe same, bookkeeping of elements is not needed making, the constant\nsmaller.","flavors":[{"comment":"Performant priority queue in pure ruby","pkgName":"ruby34-pairing_heap-3.1.1"},{"comment":"Performant priority queue in pure ruby","pkgName":"ruby40-pairing_heap-3.1.1"}],"html":"https://daemonports.org/netbsd/devel/ruby-pairing_heap/","kind":"port","lastUpdate":null,"license":["mit"],"maintainer":"pkgsrc-users@NetBSD.org","name":"ruby33-pairing_heap","newest":false,"newestVersion":null,"noVulnData":false,"origin":"devel/ruby-pairing_heap","otherSystems":[],"packages":[{"repo":"NetBSD 10.1 x86_64","versions":["3.1.1"]},{"repo":"NetBSD 10.1 aarch64","versions":["3.1.1"]},{"repo":"SmartOS / illumos x86_64","versions":["3.1.1"]},{"repo":"macOS 15 arm64","versions":["3.1.1"]}],"pkgName":"ruby33-pairing_heap-3.1.1","related":null,"repository":"pkgsrc","requiredBy":["devel/ruby-rgl"],"requiredByCount":1,"runDepends":["lang/ruby33"],"status":null,"system":"netbsd","systemLabel":"NetBSD","version":"3.1.1","versions":null,"vulnerabilities":null,"www":"https://github.com/mhib/pairing_heap"}