NetBSD Problem Report #185

From gnats  Thu Mar 31 19:51:36 1994
Received: from cis-ts3-slip4.cis.brown.edu (root@cis-ts3-slip4.cis.brown.edu [128.148.19.58]) by sun-lamp.cs.berkeley.edu (8.6.8/8.6.6) with ESMTP id TAA17118 for <gnats-bugs@sun-lamp.cs.berkeley.edu>; Thu, 31 Mar 1994 19:51:33 -0800
Message-Id: <199404010351.WAA01822@cis-ts3-slip4.cis.brown.edu>
Date: Thu, 31 Mar 1994 22:51:39 -0500
From: Mark_Weaver@brown.edu
Reply-To: Mark_Weaver@brown.edu
To: gnats-bugs@sun-lamp.cs.berkeley.edu
Subject: tsort(1) man-page is unclear/incorrect
X-Send-Pr-Version: 3.2

>Number:         185
>Category:       misc
>Synopsis:       tsort(1) man-page is unclear/incorrect
>Confidential:   no
>Severity:       non-critical
>Priority:       low
>Responsible:    gnats-admin
>State:          closed
>Class:          doc-bug
>Submitter-Id:   net
>Arrival-Date:   Thu Mar 31 20:05:09 +0000 1994
>Closed-Date:    Fri Apr 01 08:27:39 +0000 1994
>Last-Modified:  Fri Oct 19 15:29:48 +0000 2012
>Originator:     Mark Weaver
>Release:        
>Organization:
--------------------------------------------------------------------
Email: Mark_Weaver@brown.edu           | Brown University
PGP Key: finger mhw@cs.brown.edu       | Dept of Computer Science
>Environment:

System: NetBSD cis-ts3-slip4.cis.brown.edu 0.9a EXCELSIOR#0 i386

>Description:

	tsort(1) man page incorrectly implies that there must be an
	even number of nodes.  They meant to say that there must be
	an even number of words in the input file, since it is composed
	of node-pairs describing the graph.  It is very badly worded
	though.

>How-To-Repeat:

	man tsort

>Fix:

diff -u  src/usr.bin/tsort/tsort.1.mhw1 src/usr.bin/tsort/tsort.1
--- src/usr.bin/tsort/tsort.1.mhw1	Fri Feb  4 05:15:57 1994
+++ src/usr.bin/tsort/tsort.1	Wed Mar 30 22:36:20 1994
@@ -53,8 +53,7 @@
 or from standard input if no file
 is given.
 .Pp
-Node names in the input are separated by white space and there must be an
-even number of nodes.
+Node names in the input are separated by white space.
 .Pp
 Presence of a node in a graph can be represented by an arc from the node
 to itself.
>Release-Note:
>Audit-Trail:
State-Changed-From-To: open->closed 
State-Changed-By: cgd 
State-Changed-When: Fri Apr 1 00:27:39 PST 1994 
State-Changed-Why:  
fixed 
>Unformatted:

NetBSD Home
NetBSD PR Database Search

(Contact us) $NetBSD: query-full-pr,v 1.51 2026/08/10 02:28:17 riastradh Exp $
$NetBSD: gnats_config.sh,v 1.10 2026/05/13 22:00:09 riastradh Exp $
Copyright © 1994-2026 The NetBSD Foundation, Inc. ALL RIGHTS RESERVED.