1<HTML>
2<HEAD>
3<!-- This HTML file has been created by texi2html 1.52b
4     from gperf.texi on 19 March 2013 -->
5
6<META HTTP-EQUIV="content-type" CONTENT="text/html; charset=UTF-8">
7<TITLE>Perfect Hash Function Generator - 7  Things Still Left to Do</TITLE>
8</HEAD>
9<BODY>
10Go 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>.
11<P><HR><P>
12
13
14<H1><A NAME="SEC25" HREF="gperf_toc.html#TOC25">7  Things Still Left to Do</A></H1>
15
16<P>
17It should be ���relatively��� easy to replace the current perfect hash
18function algorithm with a more exhaustive approach; the perfect hash
19module is essential independent from other program modules.  Additional
20worthwhile improvements include:
21
22</P>
23
24<UL>
25<LI>
26
27Another useful extension involves modifying the program to generate
28���minimal��� perfect hash functions (under certain circumstances, the
29current version can be rather extravagant in the generated table size).
30This is mostly of theoretical interest, since a sparse table
31often produces faster lookups, and use of the <SAMP>&lsquo;-S&rsquo;</SAMP> <CODE>switch</CODE>
32option can minimize the data size, at the expense of slightly longer
33lookups (note that the gcc compiler generally produces good code for
34<CODE>switch</CODE> statements, reducing the need for more complex schemes).
35
36<LI>
37
38In addition to improving the algorithm, it would also be useful to
39generate an Ada package as the code output, in addition to the current
40C and C++ routines.
41</UL>
42
43<P><HR><P>
44Go 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>.
45</BODY>
46</HTML>
47