./devel/ruby-lazy_priority_queue, Priority queue implemented using a lazy binomial heap

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: CURRENT, Version: 0.1.1, Package name: ruby27-lazy_priority_queue-0.1.1, Maintainer: pkgsrc-users

A priority queue which implements a lazy binomial heap. It supports the
change priority operation, being suitable for algorithms like Dijkstra's
shortest path and Prim's minimum spanning tree. It can be instantiated as a
min-priority queue as well as a max-priority queue.

Master sites:

Filesize: 5.5 KB

Version history: (Expand)

CVS history: (Expand)


   2021-10-26 12:20:11 by Nia Alarie | Files touched by this commit (3016) 
Log message:
archivers: Replace RMD160 checksums with BLAKE2s checksums

All checksums have been double-checked against existing RMD160 and
SHA512 hashes

Could not be committed due to merge conflict:
devel/py-traitlets/distinfo

The following distfiles were unfetchable (note: some may be only fetched
conditionally):

./devel/pvs/distinfo pvs-3.2-solaris.tgz
./devel/eclipse/distinfo eclipse-sourceBuild-srcIncluded-3.0.1.zip
   2021-10-07 15:44:44 by Nia Alarie | Files touched by this commit (3017) 
Log message:
devel: Remove SHA1 hashes for distfiles
   2016-10-11 01:15:34 by Takahiro Kambe | Files touched by this commit (4) 
Log message:
Add ruby-lazy_priority_queue 0.1.1, required by ruby-rgl.

A priority queue which implements a lazy binomial heap.  It supports the
change priority operation, being suitable for algorithms like Dijkstra's
shortest path and Prim's minimum spanning tree.  It can be instantiated as a
min-priority queue as well as a max-priority queue.