From owner-svn-ports-all@freebsd.org Sat May 28 17:07:19 2016 Return-Path: Delivered-To: svn-ports-all@mailman.ysv.freebsd.org Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2001:1900:2254:206a::19:1]) by mailman.ysv.freebsd.org (Postfix) with ESMTP id 419B3B4EBE8; Sat, 28 May 2016 17:07:19 +0000 (UTC) (envelope-from sunpoet@FreeBSD.org) Received: from repo.freebsd.org (repo.freebsd.org [IPv6:2610:1c1:1:6068::e6a:0]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (Client did not present a certificate) by mx1.freebsd.org (Postfix) with ESMTPS id F3A9514AA; Sat, 28 May 2016 17:07:18 +0000 (UTC) (envelope-from sunpoet@FreeBSD.org) Received: from repo.freebsd.org ([127.0.1.37]) by repo.freebsd.org (8.15.2/8.15.2) with ESMTP id u4SH7IQg099638; Sat, 28 May 2016 17:07:18 GMT (envelope-from sunpoet@FreeBSD.org) Received: (from sunpoet@localhost) by repo.freebsd.org (8.15.2/8.15.2/Submit) id u4SH7Hix099634; Sat, 28 May 2016 17:07:17 GMT (envelope-from sunpoet@FreeBSD.org) Message-Id: <201605281707.u4SH7Hix099634@repo.freebsd.org> X-Authentication-Warning: repo.freebsd.org: sunpoet set sender to sunpoet@FreeBSD.org using -f From: Sunpoet Po-Chuan Hsieh Date: Sat, 28 May 2016 17:07:17 +0000 (UTC) To: ports-committers@freebsd.org, svn-ports-all@freebsd.org, svn-ports-head@freebsd.org Subject: svn commit: r416005 - in head/devel: . rubygem-lazy_priority_queue X-SVN-Group: ports-head MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit X-BeenThere: svn-ports-all@freebsd.org X-Mailman-Version: 2.1.22 Precedence: list List-Id: SVN commit messages for the ports tree List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sat, 28 May 2016 17:07:19 -0000 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 +# $FreeBSD$ + +PORTNAME= lazy_priority_queue +PORTVERSION= 0.1.1 +CATEGORIES= devel rubygems +MASTER_SITES= RG + +MAINTAINER= sunpoet@FreeBSD.org +COMMENT= Priority queue implemented using a lazy binomial heap + +LICENSE= BSD2CLAUSE + +NO_ARCH= yes +USE_RUBY= yes +USES= gem + +.include 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