Date: Sun, 3 Jan 2021 20:01:54 +0000 (UTC) From: Sunpoet Po-Chuan Hsieh <sunpoet@FreeBSD.org> To: ports-committers@freebsd.org, svn-ports-all@freebsd.org, svn-ports-head@freebsd.org Subject: svn commit: r560076 - in head/devel: . rubygem-tsort Message-ID: <202101032001.103K1s5o096095@repo.freebsd.org>
next in thread | raw e-mail | index | archive | help
Author: sunpoet Date: Sun Jan 3 20:01:53 2021 New Revision: 560076 URL: https://svnweb.freebsd.org/changeset/ports/560076 Log: Add rubygem-tsort 0.1.0 TSort implements topological sorting using Tarjan's algorithm for strongly connected components. TSort is designed to be able to be used with any object which can be interpreted as a directed graph. TSort requires two methods to interpret an object as a graph, tsort_each_node and tsort_each_child: - tsort_each_node is used to iterate for all nodes over a graph. - tsort_each_child is used to iterate for child nodes of a given node. The equality of nodes are defined by eql? and hash since TSort uses Hash internally. WWW: https://github.com/ruby/tsort Added: head/devel/rubygem-tsort/ head/devel/rubygem-tsort/Makefile (contents, props changed) head/devel/rubygem-tsort/distinfo (contents, props changed) head/devel/rubygem-tsort/pkg-descr (contents, props changed) Modified: head/devel/Makefile Modified: head/devel/Makefile ============================================================================== --- head/devel/Makefile Sun Jan 3 20:01:48 2021 (r560075) +++ head/devel/Makefile Sun Jan 3 20:01:53 2021 (r560076) @@ -6584,6 +6584,7 @@ SUBDIR += rubygem-treetop SUBDIR += rubygem-trollop SUBDIR += rubygem-trollop1 + SUBDIR += rubygem-tsort SUBDIR += rubygem-tty SUBDIR += rubygem-tty-box SUBDIR += rubygem-tty-color Added: head/devel/rubygem-tsort/Makefile ============================================================================== --- /dev/null 00:00:00 1970 (empty, because file is newly added) +++ head/devel/rubygem-tsort/Makefile Sun Jan 3 20:01:53 2021 (r560076) @@ -0,0 +1,21 @@ +# Created by: Po-Chuan Hsieh <sunpoet@FreeBSD.org> +# $FreeBSD$ + +PORTNAME= tsort +PORTVERSION= 0.1.0 +CATEGORIES= devel rubygems +MASTER_SITES= RG + +MAINTAINER= sunpoet@FreeBSD.org +COMMENT= Topological sorting using Tarjan's algorithm + +LICENSE= BSD2CLAUSE RUBY +LICENSE_COMB= dual +LICENSE_FILE_BSD2CLAUSE=${WRKSRC}/LICENSE.txt + +USES= gem +USE_RUBY= yes + +NO_ARCH= yes + +.include <bsd.port.mk> Added: head/devel/rubygem-tsort/distinfo ============================================================================== --- /dev/null 00:00:00 1970 (empty, because file is newly added) +++ head/devel/rubygem-tsort/distinfo Sun Jan 3 20:01:53 2021 (r560076) @@ -0,0 +1,3 @@ +TIMESTAMP = 1609598805 +SHA256 (rubygem/tsort-0.1.0.gem) = c9f9b27e4a19d5ac061ae8f170f17cf7b8c0a8d2918d4aba49efbb33d8141793 +SIZE (rubygem/tsort-0.1.0.gem) = 9728 Added: head/devel/rubygem-tsort/pkg-descr ============================================================================== --- /dev/null 00:00:00 1970 (empty, because file is newly added) +++ head/devel/rubygem-tsort/pkg-descr Sun Jan 3 20:01:53 2021 (r560076) @@ -0,0 +1,15 @@ +TSort implements topological sorting using Tarjan's algorithm for strongly +connected components. + +TSort is designed to be able to be used with any object which can be interpreted +as a directed graph. + +TSort requires two methods to interpret an object as a graph, tsort_each_node +and tsort_each_child: +- tsort_each_node is used to iterate for all nodes over a graph. +- tsort_each_child is used to iterate for child nodes of a given node. + +The equality of nodes are defined by eql? and hash since TSort uses Hash +internally. + +WWW: https://github.com/ruby/tsort
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?202101032001.103K1s5o096095>