Module Name: src
Committed By: yamt
Date: Fri Feb 17 08:22:48 UTC 2012
Modified Files:
src/share/man/man3: rbtree.3
Log Message:
sync with code
(remove const quals)
To generate a diff of this commit:
cvs rdiff -u -r1.5 -r1.6 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.5 src/share/man/man3/rbtree.3:1.6
--- src/share/man/man3/rbtree.3:1.5 Mon Mar 28 13:46:14 2011
+++ src/share/man/man3/rbtree.3 Fri Feb 17 08:22:47 2012
@@ -1,4 +1,4 @@
-.\" $NetBSD: rbtree.3,v 1.5 2011/03/28 13:46:14 ahoka Exp $
+.\" $NetBSD: rbtree.3,v 1.6 2012/02/17 08:22:47 yamt Exp $
.\"
.\" Copyright (c) 2010 The NetBSD Foundation, Inc.
.\" All rights reserved.
@@ -27,7 +27,7 @@
.\" ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
.\" POSSIBILITY OF SUCH DAMAGE.
.\"
-.Dd March 17, 2011
+.Dd February 17, 2012
.Dt RBTREE 3
.Os
.Sh NAME
@@ -74,7 +74,7 @@ The maximum height of a red-black tree i
.It Vt rb_tree_t
A red-black tree.
.It Vt typedef signed int \
-(*const rbto_compare_nodes_fn)(void *, const void *, const void *);
+(* rbto_compare_nodes_fn)(void *, const void *, const void *);
The node-comparison operator.
Defines an ordering on nodes.
Returns a negative value if the first node precedes the second node.
@@ -82,7 +82,7 @@ Returns a positive value if the first no
Returns 0 if the first node and the second are identical according
to the ordering.
.It Vt typedef signed int \
-(*const rbto_compare_key_fn)(void *, const void *, const void *);
+(* rbto_compare_key_fn)(void *, const void *, const void *);
The node-key comparison operator.
Defines the order of nodes and keys.
Returns a negative value if the node precedes the key.
