Port details |
- rubygem-tsort Topological sorting using Tarjan's algorithm
- 0.1.0 devel
=0 Version of this port present on the latest quarterly branch.- Maintainer: sunpoet@FreeBSD.org
 - Port Added: 2021-01-03 20:50:31
- Last Update: 2021-01-03 20:01:54
- SVN Revision: 560076
- Also Listed In: rubygems
- License: BSD2CLAUSE RUBY
- Description:
- 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
- SVNWeb : Homepage
- pkg-plist: as obtained via:
make generate-plist -
- rubygem-tsort>0:devel/rubygem-tsort
- To install the port:
cd /usr/ports/devel/rubygem-tsort/ && make install clean - To add the package:
pkg install rubygem-tsort - PKGNAME: rubygem-tsort
- Flavors: there is no flavor information for this port.
- distinfo:
- TIMESTAMP = 1609598805
SHA256 (rubygem/tsort-0.1.0.gem) = c9f9b27e4a19d5ac061ae8f170f17cf7b8c0a8d2918d4aba49efbb33d8141793
SIZE (rubygem/tsort-0.1.0.gem) = 9728
Packages: (move your mouse over the cells for more information)
- Dependencies
- NOTE: FreshPorts displays only information on required and default dependencies. Optional dependencies are not covered.
- Build dependencies:
-
- ruby27 : lang/ruby27
- gem27 : devel/ruby-gems
- Runtime dependencies:
-
- ruby27 : lang/ruby27
- gem27 : devel/ruby-gems
- Patch dependencies:
-
- ruby27 : lang/ruby27
- gem27 : devel/ruby-gems
-
- There are no ports dependent upon this port
- Configuration Options
- No options to configure
- USES:
- gem
- Master Sites:
-
|
Number of commits found: 1
Commit History - (may be incomplete: see SVNWeb link above for full details) |
Date | By | Description |
03 Jan 2021 20:01:54
0.1.0

|
sunpoet  |
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 |
Number of commits found: 1
|
Latest Vulnerabilities |
9 vulnerabilities affecting 70 ports have been reported in the past 14 days
|
* - modified, not new All vulnerabilities
Last updated: 2021-01-26 20:33:26
|
|