[src/trunk]: src/usr.bin/nbperf Fix a comment.

[joerg <joerg%NetBSD.org@localhost>]

details:   https://anonhg.NetBSD.org/src/rev/450b478c7a22
branches:  trunk
changeset: 752592:450b478c7a22
user:      joerg <joerg%NetBSD.org@localhost>
date:      Mon Mar 01 21:46:58 2010 +0000

description:
Fix a comment.

diffstat:

 usr.bin/nbperf/nbperf-bdz.c |  6 +++---
 1 files changed, 3 insertions(+), 3 deletions(-)

diffs (27 lines):

diff -r f4ade84f3636 -r 450b478c7a22 usr.bin/nbperf/nbperf-bdz.c
--- a/usr.bin/nbperf/nbperf-bdz.c       Mon Mar 01 21:37:18 2010 +0000
+++ b/usr.bin/nbperf/nbperf-bdz.c       Mon Mar 01 21:46:58 2010 +0000
@@ -1,4 +1,4 @@
-/*     $NetBSD: nbperf-bdz.c,v 1.2 2009/08/17 14:15:07 joerg Exp $     */
+/*     $NetBSD: nbperf-bdz.c,v 1.3 2010/03/01 21:46:58 joerg Exp $     */
 /*-
  * Copyright (c) 2009 The NetBSD Foundation, Inc.
  * All rights reserved.
@@ -32,7 +32,7 @@
  */
 
 #include <sys/cdefs.h>
-__RCSID("$NetBSD: nbperf-bdz.c,v 1.2 2009/08/17 14:15:07 joerg Exp $");
+__RCSID("$NetBSD: nbperf-bdz.c,v 1.3 2010/03/01 21:46:58 joerg Exp $");
 
 #include <err.h>
 #include <inttypes.h>
@@ -53,7 +53,7 @@
  *
  * Each edge in the represents a key.  The vertices are the reminder of
  * the hash function mod n.  n = cm with c > 1.23.  This ensures that
- * can be found with a very high probality.
+ * an acyclic graph can be found with a very high probality.
  *
  * An acyclic graph has an edge order, where at least one vertex of
  * each edge hasn't been seen before.   It is declares the first unvisited