aboutsummaryrefslogtreecommitdiff
path: root/lib/libc/db/man/hash.3
diff options
context:
space:
mode:
Diffstat (limited to 'lib/libc/db/man/hash.3')
-rw-r--r--lib/libc/db/man/hash.346
1 files changed, 23 insertions, 23 deletions
diff --git a/lib/libc/db/man/hash.3 b/lib/libc/db/man/hash.3
index 698f10ca185c..57a77c1f870d 100644
--- a/lib/libc/db/man/hash.3
+++ b/lib/libc/db/man/hash.3
@@ -29,9 +29,9 @@
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
.\" SUCH DAMAGE.
.\"
-.\" @(#)hash.3 8.1 (Berkeley) 6/6/93
+.\" @(#)hash.3 8.4 (Berkeley) 1/2/94
.\"
-.TH HASH 3 "June 6, 1993"
+.TH HASH 3 "January 2, 1994"
.UC 7
.SH NAME
hash \- hash database access method
@@ -61,15 +61,15 @@ typedef struct {
.RS
int bsize;
.br
-int cachesize;
-.br
int ffactor;
.br
+int nelem;
+.br
+int cachesize;
+.br
u_long (*hash)(const void *, size_t);
.br
int lorder;
-.br
-int nelem;
.RE
} HASHINFO;
.PP
@@ -81,13 +81,6 @@ defines the hash table bucket size, and is, by default, 256 bytes.
It may be preferable to increase the page size for disk-resident tables
and tables with large data items.
.TP
-cachesize
-A suggested maximum size, in bytes, of the memory cache.
-This value is
-.B only
-advisory, and the access method will allocate more memory rather
-than fail.
-.TP
ffactor
.I Ffactor
indicates a desired density within the hash table.
@@ -95,6 +88,20 @@ It is an approximation of the number of keys allowed to accumulate in any
one bucket, determining when the hash table grows or shrinks.
The default value is 8.
.TP
+nelem
+.I Nelem
+is an estimate of the final size of the hash table.
+If not set or set too low, hash tables will expand gracefully as keys
+are entered, although a slight performance degradation may be noticed.
+The default value is 1.
+.TP
+cachesize
+A suggested maximum size, in bytes, of the memory cache.
+This value is
+.B only
+advisory, and the access method will allocate more memory rather
+than fail.
+.TP
hash
.I Hash
is a user defined hash function.
@@ -113,13 +120,6 @@ 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.
-.TP
-nelem
-.I Nelem
-is an estimate of the final size of the hash table.
-If not set or set too low, hash tables will expand gracefully as keys
-are entered, although a slight performance degradation may be noticed.
-The default value is 1.
.PP
If the file already exists (and the O_TRUNC flag is not specified), the
values specified for the parameters bsize, ffactor, lorder and nelem are
@@ -134,17 +134,17 @@ Backward compatible interfaces to the routines described in
.IR dbm (3),
and
.IR ndbm (3)
-are provided, however, these interfaces are not compatible with
+are provided, however these interfaces are not compatible with
previous file formats.
.SH "SEE ALSO"
.IR btree (3),
.IR dbopen (3),
.IR mpool (3),
.IR recno (3)
-.br
+.sp
.IR "Dynamic Hash Tables" ,
Per-Ake Larson, Communications of the ACM, April 1988.
-.br
+.sp
.IR "A New Hash Package for UNIX" ,
Margo Seltzer, USENIX Proceedings, Winter 1991.
.SH BUGS