(split) LDP: Update original to LDP v3.65

[linuxjm/LDP_man-pages.git] / original / man3 / hash.3

diff --git a/original/man3/hash.3 b/original/man3/hash.3
index 24c194d..68b77a1 100644 (file)
--- a/original/man3/hash.3
+++ b/original/man3/hash.3
@@ -1,6 +1,7 @@
 .\" Copyright (c) 1990, 1993
 .\"    The Regents of the University of California.  All rights reserved.
 .\"
+.\" %%%LICENSE_START(BSD_4_CLAUSE_UCB)
 .\" Redistribution and use in source and binary forms, with or without
 .\" modification, are permitted provided that the following conditions
 .\" are met:
@@ -28,10 +29,11 @@
 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 .\" SUCH DAMAGE.
+.\" %%%LICENSE_END
 .\"
 .\"    @(#)hash.3      8.6 (Berkeley) 8/18/94
 .\"
-.TH HASH 3 1994-08-18 "" "Linux Programmer's Manual"
+.TH HASH 3 2012-04-23 "" "Linux Programmer's Manual"
 .UC 7
 .SH NAME
 hash \- hash database access method
@@ -43,17 +45,24 @@ hash \- hash database access method
 .ft R
 .fi
 .SH DESCRIPTION
+.IR "Note well" :
+This page documents interfaces provided in glibc up until version 2.1.
+Since version 2.2, glibc no longer provides these interfaces.
+Probably, you are looking for the APIs provided by the
+.I libdb
+library instead.
+
 The routine
 .BR dbopen (3)
 is the library interface to database files.
 One of the supported file formats is hash files.
 The general description of the database access methods is in
 .BR dbopen (3),
-this manual page describes only the hash specific information.
+this manual page describes only the hash-specific information.
 .PP
 The hash data structure is an extensible, dynamic hashing scheme.
 .PP
-The access method specific data structure provided to
+The access-method-specific data structure provided to
 .BR dbopen (3)
 is defined in the
 .I <db.h>
@@ -112,7 +121,7 @@ The number should represent the order as an integer; for example,
 big endian order would be the number 4,321.
 If
 .I lorder
-is 0 (no order is specified) the current host order is used.
+is 0 (no order is specified), the current host order is used.
 If the file already exists, the specified value is ignored and the
 value specified when the tree was created is used.
 .PP
@@ -148,14 +157,22 @@ for any of the errors specified for the library routine
 .BR dbopen (3).
 .SH BUGS
 Only big and little endian byte order are supported.
-.SH "SEE ALSO"
+.SH SEE ALSO
 .BR btree (3),
 .BR dbopen (3),
 .BR mpool (3),
 .BR recno (3)
-.sp
+
 .IR "Dynamic Hash Tables" ,
 Per-Ake Larson, Communications of the ACM, April 1988.
-.sp
+
 .IR "A New Hash Package for UNIX" ,
 Margo Seltzer, USENIX Proceedings, Winter 1991.
+.SH COLOPHON
+This page is part of release 3.65 of the Linux
+.I man-pages
+project.
+A description of the project,
+and information about reporting bugs,
+can be found at
+\%http://www.kernel.org/doc/man\-pages/.