diff options
Diffstat (limited to 'doc/gperf_8.html')
| -rw-r--r-- | doc/gperf_8.html | 23 |
1 files changed, 7 insertions, 16 deletions
diff --git a/doc/gperf_8.html b/doc/gperf_8.html index a016c5d..58460aa 100644 --- a/doc/gperf_8.html +++ b/doc/gperf_8.html @@ -1,16 +1,16 @@ <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 - 6 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_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_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="SEC21" HREF="gperf_toc.html#TOC21">6 Things Still Left to Do</A></H1> +<H1><A NAME="SEC26" HREF="gperf_toc.html#TOC26">6 Things Still Left to Do</A></H1> <P> It should be "relatively" easy to replace the current perfect hash @@ -23,19 +23,10 @@ worthwhile improvements include: <UL> <LI> -Make the algorithm more robust. At present, the program halts with an -error diagnostic if it can't find a direct solution and the <SAMP>`-D'</SAMP> -option is not enabled. A more comprehensive, albeit computationally -expensive, approach would employ backtracking or enable alternative -options and retry. It's not clear how helpful this would be, in -general, since most search sets are rather small in practice. - -<LI> - Another useful extension involves modifying the program to generate "minimal" perfect hash functions (under certain circumstances, the current version can be rather extravagant in the generated table size). -Again, this is mostly of theoretical interest, since a sparse table +This is mostly of theoretical interest, since a sparse table often produces faster lookups, and use of the <SAMP>`-S'</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 @@ -44,11 +35,11 @@ lookups (note that the gcc compiler generally produces good code for <LI> In addition to improving the algorithm, it would also be useful to -generate a C++ class or Ada package as the code output, in addition to -the current C routines. +generate an Ada package as the code output, in addition to the current +C and C++ routines. </UL> <P><HR><P> -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_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_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>. </BODY> </HTML> |