Adwaith-Rajesh/gperf
1
0
Fork 0
mirror of https://git.savannah.gnu.org/git/gperf.git synced 2025-12-02 13:09:22 +00:00
Code Activity

regenerated

Browse Source
This commit is contained in:
Brendan Kehoe
2009-02-01 12:23:37 +00:00
parent c9bd4009aa
commit cfbb6bdc79
16 changed files with 7636 additions and 5495 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
doc/gperf_8.html
View File

@@ -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).