From 9a6ff5bc53dedbaa601a1a76cbaf8a76afd60c9f Mon Sep 17 00:00:00 2001
From: Daniel Baumann <daniel.baumann@progress-linux.org>
Date: Mon, 15 Apr 2024 21:41:06 +0200
Subject: Adding upstream version 6.7.

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
---
 man3/hash.3 | 22 +++++++++++-----------
 1 file changed, 11 insertions(+), 11 deletions(-)

(limited to 'man3/hash.3')

diff --git a/man3/hash.3 b/man3/hash.3
index ed99fe1..6ab717f 100644
--- a/man3/hash.3
+++ b/man3/hash.3
@@ -5,7 +5,7 @@
 .\"
 .\"	@(#)hash.3	8.6 (Berkeley) 8/18/94
 .\"
-.TH hash 3 2022-12-04 "Linux man-pages 6.05.01"
+.TH hash 3 2023-10-31 "Linux man-pages 6.7"
 .UC 7
 .SH NAME
 hash \- hash database access method
@@ -26,7 +26,7 @@ Since glibc 2.2, glibc no longer provides these interfaces.
 Probably, you are looking for the APIs provided by the
 .I libdb
 library instead.
-.PP
+.P
 The routine
 .BR dbopen (3)
 is the library interface to database files.
@@ -34,15 +34,15 @@ 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.
-.PP
+.P
 The hash data structure is an extensible, dynamic hashing scheme.
-.PP
+.P
 The access-method-specific data structure provided to
 .BR dbopen (3)
 is defined in the
 .I <db.h>
 include file as follows:
-.PP
+.P
 .in +4n
 .EX
 typedef struct {
@@ -55,7 +55,7 @@ typedef struct {
 } HASHINFO;
 .EE
 .in
-.PP
+.P
 The elements of this structure are as follows:
 .TP 10
 .I bsize
@@ -99,7 +99,7 @@ If
 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
+.P
 If the file already exists (and the
 .B O_TRUNC
 flag is not specified), the
@@ -111,12 +111,12 @@ and
 .I nelem
 are
 ignored and the values specified when the tree was created are used.
-.PP
+.P
 If a hash function is specified,
 .I hash_open
 attempts to determine if the hash function specified is the same as
 the one with which the database was created, and fails if it is not.
-.PP
+.P
 Backward-compatible interfaces to the routines described in
 .BR dbm (3),
 and
@@ -137,9 +137,9 @@ Only big and little endian byte order are supported.
 .BR dbopen (3),
 .BR mpool (3),
 .BR recno (3)
-.PP
+.P
 .IR "Dynamic Hash Tables" ,
 Per-Ake Larson, Communications of the ACM, April 1988.
-.PP
+.P
 .IR "A New Hash Package for UNIX" ,
 Margo Seltzer, USENIX Proceedings, Winter 1991.
-- 
cgit v1.2.3