head	1.2;
access;
symbols
	pkgsrc-2026Q1:1.1.0.2
	pkgsrc-2026Q1-base:1.1;
locks; strict;
comment	@# @;


1.2
date	2026.04.08.14.34.39;	author taca;	state dead;
branches;
next	1.1;
commitid	8e2Fp1SXrRYWfaBG;

1.1
date	2026.02.11.07.27.17;	author taca;	state Exp;
branches;
next	;
commitid	Hl19kxZ0ss4WGVtG;


desc
@@


1.2
log
@devel/ruby-tsort: remove package

This package is for devel/ruby-railties{72,80} with ruby32.
@
text
@$NetBSD: distinfo,v 1.1 2026/02/11 07:27:17 taca Exp $

BLAKE2s (tsort-0.2.0.gem) = 015895cfb4a4da77af2c41e2a9d1fa4f69a82ecaf164cbf655b4e782959d628e
SHA512 (tsort-0.2.0.gem) = 5b868917cb19582a92d0d76f3220e8b1544be72bd4ea23be9d9e420b1320ac06c609d06c03c11ecc31dff6c2524eac45b789ef959d45bdcc18cb6fbab11155f8
Size (tsort-0.2.0.gem) = 10240 bytes
@


1.1
log
@devel/ruby-tsort: add version 0.2.0

tsort gem 0.2.0 is default gem but it is required by
devel/ruby-erailties{71,72,80} packages on ruby32.


TSort

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.
@
text
@d1 1
a1 1
$NetBSD$
@