pkgsrc-Changes archive

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index][Old Index]

CVS commit: pkgsrc/devel/ruby-lazy_priority_queue



Module Name:    pkgsrc
Committed By:   taca
Date:           Mon Oct 10 23:15:34 UTC 2016

Added Files:
        pkgsrc/devel/ruby-lazy_priority_queue: DESCR Makefile PLIST distinfo

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.


To generate a diff of this commit:
cvs rdiff -u -r0 -r1.1 pkgsrc/devel/ruby-lazy_priority_queue/DESCR \
    pkgsrc/devel/ruby-lazy_priority_queue/Makefile \
    pkgsrc/devel/ruby-lazy_priority_queue/PLIST \
    pkgsrc/devel/ruby-lazy_priority_queue/distinfo

Please note that diffs are not public domain; they are subject to the
copyright notices on the relevant files.

Added files:

Index: pkgsrc/devel/ruby-lazy_priority_queue/DESCR
diff -u /dev/null pkgsrc/devel/ruby-lazy_priority_queue/DESCR:1.1
--- /dev/null   Mon Oct 10 23:15:34 2016
+++ pkgsrc/devel/ruby-lazy_priority_queue/DESCR Mon Oct 10 23:15:34 2016
@@ -0,0 +1,4 @@
+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.
Index: pkgsrc/devel/ruby-lazy_priority_queue/Makefile
diff -u /dev/null pkgsrc/devel/ruby-lazy_priority_queue/Makefile:1.1
--- /dev/null   Mon Oct 10 23:15:34 2016
+++ pkgsrc/devel/ruby-lazy_priority_queue/Makefile      Mon Oct 10 23:15:34 2016
@@ -0,0 +1,12 @@
+# $NetBSD: Makefile,v 1.1 2016/10/10 23:15:34 taca Exp $
+
+DISTNAME=      lazy_priority_queue-0.1.1
+CATEGORIES=    devel
+
+MAINTAINER=    pkgsrc-users%NetBSD.org@localhost
+HOMEPAGE=      https://github.com/matiasbattocchia/lazy_priority_queue
+COMMENT=       Priority queue implemented using a lazy binomial heap
+LICENSE=       2-clause-bsd
+
+.include "../../lang/ruby/gem.mk"
+.include "../../mk/bsd.pkg.mk"
Index: pkgsrc/devel/ruby-lazy_priority_queue/PLIST
diff -u /dev/null pkgsrc/devel/ruby-lazy_priority_queue/PLIST:1.1
--- /dev/null   Mon Oct 10 23:15:34 2016
+++ pkgsrc/devel/ruby-lazy_priority_queue/PLIST Mon Oct 10 23:15:34 2016
@@ -0,0 +1,4 @@
+@comment $NetBSD: PLIST,v 1.1 2016/10/10 23:15:34 taca Exp $
+${GEM_HOME}/cache/${GEM_NAME}.gem
+${GEM_LIBDIR}/lib/lazy_priority_queue.rb
+${GEM_HOME}/specifications/${GEM_NAME}.gemspec
Index: pkgsrc/devel/ruby-lazy_priority_queue/distinfo
diff -u /dev/null pkgsrc/devel/ruby-lazy_priority_queue/distinfo:1.1
--- /dev/null   Mon Oct 10 23:15:34 2016
+++ pkgsrc/devel/ruby-lazy_priority_queue/distinfo      Mon Oct 10 23:15:34 2016
@@ -0,0 +1,6 @@
+$NetBSD: distinfo,v 1.1 2016/10/10 23:15:34 taca Exp $
+
+SHA1 (lazy_priority_queue-0.1.1.gem) = 84ae44853d56689cae724ecf1535e7cb1a3b3c21
+RMD160 (lazy_priority_queue-0.1.1.gem) = 82d3053463fa936233e452be781daef441304073
+SHA512 (lazy_priority_queue-0.1.1.gem) = b0f4390d9691cdb1342d428505f5cab69de584cbd734e7a6bc8a4b8b723420c38d7b5bbb7bed4612045360b4f8d8db6e6a8eca8c8e588a43468d4b340844c827
+Size (lazy_priority_queue-0.1.1.gem) = 5632 bytes



Home | Main Index | Thread Index | Old Index