svn commit: r416005 - in head/devel: . rubygem-lazy_priority_queue

[Sunpoet Po-Chuan Hsieh]

Author: sunpoet
Date: Sat May 28 17:07:17 2016
New Revision: 416005
URL: https://svnweb.freebsd.org/changeset/ports/416005

Log:
  - Add rubygem-lazy_priority_queue 0.1.1
  
  Lazy priority queue is a pure Ruby 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.
  
  WWW: https://github.com/matiasbattocchia/lazy_priority_queue

Added:
  head/devel/rubygem-lazy_priority_queue/
  head/devel/rubygem-lazy_priority_queue/Makefile   (contents, props changed)
  head/devel/rubygem-lazy_priority_queue/distinfo   (contents, props changed)
  head/devel/rubygem-lazy_priority_queue/pkg-descr   (contents, props changed)
Modified:
  head/devel/Makefile

Modified: head/devel/Makefile
==============================================================================
--- head/devel/Makefile	Sat May 28 15:43:35 2016	(r416004)
+++ head/devel/Makefile	Sat May 28 17:07:17 2016	(r416005)
@@ -4996,6 +4996,7 @@
     SUBDIR += rubygem-kgio
     SUBDIR += rubygem-launchy
     SUBDIR += rubygem-launchy22
+    SUBDIR += rubygem-lazy_priority_queue
     SUBDIR += rubygem-librarian
     SUBDIR += rubygem-librarianp
     SUBDIR += rubygem-libyajl2

Added: head/devel/rubygem-lazy_priority_queue/Makefile
==============================================================================
--- /dev/null	00:00:00 1970	(empty, because file is newly added)
+++ head/devel/rubygem-lazy_priority_queue/Makefile	Sat May 28 17:07:17 2016	(r416005)
@@ -0,0 +1,18 @@
+# Created by: Sunpoet Po-Chuan Hsieh <sunpoet at FreeBSD.org>
+# $FreeBSD$
+
+PORTNAME=	lazy_priority_queue
+PORTVERSION=	0.1.1
+CATEGORIES=	devel rubygems
+MASTER_SITES=	RG
+
+MAINTAINER=	sunpoet at FreeBSD.org
+COMMENT=	Priority queue implemented using a lazy binomial heap
+
+LICENSE=	BSD2CLAUSE
+
+NO_ARCH=	yes
+USE_RUBY=	yes
+USES=		gem
+
+.include <bsd.port.mk>

Added: head/devel/rubygem-lazy_priority_queue/distinfo
==============================================================================
--- /dev/null	00:00:00 1970	(empty, because file is newly added)
+++ head/devel/rubygem-lazy_priority_queue/distinfo	Sat May 28 17:07:17 2016	(r416005)
@@ -0,0 +1,3 @@
+TIMESTAMP = 1464389841
+SHA256 (rubygem/lazy_priority_queue-0.1.1.gem) = e5d4ea8d037e8743afc91019fc23f5f6858372fea73e05e8244f8964f0634337
+SIZE (rubygem/lazy_priority_queue-0.1.1.gem) = 5632

Added: head/devel/rubygem-lazy_priority_queue/pkg-descr
==============================================================================
--- /dev/null	00:00:00 1970	(empty, because file is newly added)
+++ head/devel/rubygem-lazy_priority_queue/pkg-descr	Sat May 28 17:07:17 2016	(r416005)
@@ -0,0 +1,6 @@
+Lazy priority queue is a pure Ruby 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.
+
+WWW: https://github.com/matiasbattocchia/lazy_priority_queue