Module Name: src
Committed By: dholland
Date: Tue Aug 30 05:12:00 UTC 2016
Modified Files:
src/share/man/man3: rbtree.3
Log Message:
Use only "function" for the comparison functions, not both that and
"operator". Noted by riastradh.
To generate a diff of this commit:
cvs rdiff -u -r1.11 -r1.12 src/share/man/man3/rbtree.3
Please note that diffs are not public domain; they are subject to the
copyright notices on the relevant files.
Modified files:
Index: src/share/man/man3/rbtree.3
diff -u src/share/man/man3/rbtree.3:1.11 src/share/man/man3/rbtree.3:1.12
--- src/share/man/man3/rbtree.3:1.11 Mon Aug 29 03:50:05 2016
+++ src/share/man/man3/rbtree.3 Tue Aug 30 05:12:00 2016
@@ -1,4 +1,4 @@
-.\" $NetBSD: rbtree.3,v 1.11 2016/08/29 03:50:05 dholland Exp $
+.\" $NetBSD: rbtree.3,v 1.12 2016/08/30 05:12:00 dholland Exp $
.\"
.\" Copyright (c) 2010 The NetBSD Foundation, Inc.
.\" All rights reserved.
@@ -81,7 +81,7 @@ The maximum height of a red-black tree i
A red-black tree.
.It Vt typedef signed int \
(* rbto_compare_nodes_fn)(void *context, const void *node1, const void *node2);
-The node-comparison operator.
+The node-comparison function.
Defines an ordering on nodes.
Returns a negative value if the first node
.Ar node1
@@ -98,7 +98,7 @@ and the second node
are identical according to the ordering.
.It Vt typedef signed int \
(* rbto_compare_key_fn)(void *context, const void *node, const void *key);
-The node-key comparison operator.
+The node-key comparison function.
Defines the order of nodes and keys.
Returns a negative value if the node
.Ar node
@@ -114,8 +114,8 @@ is identical to the key
.Ar key
according to the ordering.
.It Vt rb_tree_ops_t
-Defines the operator for comparing two nodes in the same tree,
-the operator for comparing a node in the tree with a key,
+Defines the function for comparing two nodes in the same tree,
+the function for comparing a node in the tree with a key,
the offset of member
.Vt rb_node_t
within the node type,
@@ -146,7 +146,7 @@ member.)
.It Fn rb_tree_init "rbt" "ops"
Initialize the red-black tree
.Fa rbt .
-Let the comparison operators given by
+Let the comparison functions given by
.Fa ops
define the order of nodes in the tree for
the purposes of insertion, search, and iteration.
