summaryrefslogtreecommitdiff
path: root/doc/gperf_8.html
diff options
context:
space:
mode:
Diffstat (limited to 'doc/gperf_8.html')
-rw-r--r--doc/gperf_8.html15
1 files changed, 8 insertions, 7 deletions
diff --git a/doc/gperf_8.html b/doc/gperf_8.html
index 7c12f75..9761d45 100644
--- a/doc/gperf_8.html
+++ b/doc/gperf_8.html
@@ -1,19 +1,20 @@
<HTML>
<HEAD>
-<!-- This HTML file has been created by texi2html 1.51
- from gperf.texi on 31 March 2007 -->
+<!-- This HTML file has been created by texi2html 1.52b
+ from gperf.texi on 1 February 2009 -->
-<TITLE>Perfect Hash Function Generator - 6 Things Still Left to Do</TITLE>
+<META HTTP-EQUIV="content-type" CONTENT="text/html; charset=UTF-8">
+<TITLE>Perfect Hash Function Generator - 7 Things Still Left to Do</TITLE>
</HEAD>
<BODY>
Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_7.html">previous</A>, <A HREF="gperf_9.html">next</A>, <A HREF="gperf_10.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>.
<P><HR><P>
-<H1><A NAME="SEC26" HREF="gperf_toc.html#TOC26">6 Things Still Left to Do</A></H1>
+<H1><A NAME="SEC25" HREF="gperf_toc.html#TOC25">7 Things Still Left to Do</A></H1>
<P>
-It should be "relatively" easy to replace the current perfect hash
+It should be “relatively” easy to replace the current perfect hash
function algorithm with a more exhaustive approach; the perfect hash
module is essential independent from other program modules. Additional
worthwhile improvements include:
@@ -24,10 +25,10 @@ worthwhile improvements include:
<LI>
Another useful extension involves modifying the program to generate
-"minimal" perfect hash functions (under certain circumstances, the
+“minimal” perfect hash functions (under certain circumstances, the
current version can be rather extravagant in the generated table size).
This is mostly of theoretical interest, since a sparse table
-often produces faster lookups, and use of the <SAMP>`-S'</SAMP> <CODE>switch</CODE>
+often produces faster lookups, and use of the <SAMP>&lsquo;-S&rsquo;</SAMP> <CODE>switch</CODE>
option can minimize the data size, at the expense of slightly longer
lookups (note that the gcc compiler generally produces good code for
<CODE>switch</CODE> statements, reducing the need for more complex schemes).