diff options
Diffstat (limited to 'doc/gperf_3.html')
| -rw-r--r-- | doc/gperf_3.html | 19 |
1 files changed, 10 insertions, 9 deletions
diff --git a/doc/gperf_3.html b/doc/gperf_3.html index 529b1c7..dda84ab 100644 --- a/doc/gperf_3.html +++ b/doc/gperf_3.html @@ -1,12 +1,12 @@ <HTML> <HEAD> <!-- This HTML file has been created by texi2html 1.51 - from gperf.texi on 26 September 2000 --> + from gperf.texi on 7 May 2003 --> <TITLE>Perfect Hash Function Generator - 1 Introduction</TITLE> </HEAD> <BODY> -Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_2.html">previous</A>, <A HREF="gperf_4.html">next</A>, <A HREF="gperf_11.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>. +Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_2.html">previous</A>, <A HREF="gperf_4.html">next</A>, <A HREF="gperf_10.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>. <P><HR><P> @@ -16,8 +16,8 @@ Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_2.html">previous</A>, <CODE>gperf</CODE> is a perfect hash function generator written in C++. It transforms an <VAR>n</VAR> element user-specified keyword set <VAR>W</VAR> into a perfect hash function <VAR>F</VAR>. <VAR>F</VAR> uniquely maps keywords in -<VAR>W</VAR> onto the range 0..<VAR>k</VAR>, where <VAR>k</VAR> >= <VAR>n</VAR>. If <VAR>k</VAR> -= <VAR>n</VAR> then <VAR>F</VAR> is a <EM>minimal</EM> perfect hash function. +<VAR>W</VAR> onto the range 0..<VAR>k</VAR>, where <VAR>k</VAR> >= <VAR>n-1</VAR>. If <VAR>k</VAR> += <VAR>n-1</VAR> then <VAR>F</VAR> is a <EM>minimal</EM> perfect hash function. <CODE>gperf</CODE> generates a 0..<VAR>k</VAR> element static lookup table and a pair of C functions. These functions determine whether a given character string <VAR>s</VAR> occurs in <VAR>W</VAR>, using at most one probe into @@ -27,14 +27,15 @@ the lookup table. <P> <CODE>gperf</CODE> currently generates the reserved keyword recognizer for lexical analyzers in several production and research compilers and -language processing tools, including GNU C, GNU C++, GNU Pascal, GNU -Modula 3, and GNU indent. Complete C++ source code for <CODE>gperf</CODE> is -available via anonymous ftp from <CODE>ftp://ftp.gnu.org/pub/gnu/gperf/</CODE>. +language processing tools, including GNU C, GNU C++, GNU Java, GNU Pascal, +GNU Modula 3, and GNU indent. Complete C++ source code for <CODE>gperf</CODE> is +available from <CODE>http://ftp.gnu.org/pub/gnu/gperf/</CODE>. A paper describing <CODE>gperf</CODE>'s design and implementation in greater -detail is available in the Second USENIX C++ Conference proceedings. +detail is available in the Second USENIX C++ Conference proceedings +or from <CODE>http://www.cs.wustl.edu/~schmidt/resume.html</CODE>. </P> <P><HR><P> -Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_2.html">previous</A>, <A HREF="gperf_4.html">next</A>, <A HREF="gperf_11.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>. +Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_2.html">previous</A>, <A HREF="gperf_4.html">next</A>, <A HREF="gperf_10.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>. </BODY> </HTML> |