gperf reads a set of ``keys'' from keyfile (or, by
default, from the standard input) and attempts to find a non-minimal
perfect hashing function that recognizes a member of the key set in
constant, i.e., O(1), time. If such a function is found the program
generates a pair of C source code routines that perform the
hashing and table lookup. All generated code is directed to the
standard output.
Please refer to the gperf.texinfo file for more information.
This file is distributed with gperf release.
.\" $Header: /cvs/gnome/gtk-doc/db2man/docbook-to-man,v 1.1.1.1 1998/11/24 06:00:34 owen Exp $
.\"
.\" transcript compatibility for postscript use.
.\"
.\" synopsis: .P! <file.ps>
.\"
P!
\!!1 setgray
\.\"
\!!0 setgray
\" force out current output buffer
\!!save /psv exch def currentpoint translate 0 0 moveto
\!!/showpage{}def
\" prolog
sed -e 's/^/!/' \\$1\" bring in postscript file
\!!psv restore
pF
\\*(f1 .ds f1 \\n(.f
.ie \\*(f2 .ds f2 \\n(.f
.ie \\*(f3 .ds f3 \\n(.f
.ie \\*(f4 .ds f4 \\n(.f
.tm ? font overflow
\\$1
fP
!\\*(f4 \{\
\\*(f4
f4\"
' br \}
.ie !\\*(f3 \{\
\\*(f3
f3\"
' br \}
.ie !\\*(f2 \{\
\\*(f2
f2\"
' br \}
.ie !\\*(f1 \{\
\\*(f1
f1\"
' br \}
.tm ? font underflow
f1\"
f2\"
f3\"
f4\"
8n 16n 24n 32n 40n 48n 56n 64n 72n
