From cfbb6bdc798b11ce9c755a5ed182a61e498f3494 Mon Sep 17 00:00:00 2001 From: Brendan Kehoe Date: Sun, 1 Feb 2009 12:23:37 +0000 Subject: regenerated --- doc/gperf_8.html | 15 ++++++++------- 1 file changed, 8 insertions(+), 7 deletions(-) (limited to 'doc/gperf_8.html') 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 @@ - + -Perfect Hash Function Generator - 6 Things Still Left to Do + +Perfect Hash Function Generator - 7 Things Still Left to Do Go to the first, previous, next, last section, table of contents.

6 Things Still Left to Do

7 Things Still Left to Do

-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:

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 `-S' switch +often produces faster lookups, and use of the ‘-S’ switch option can minimize the data size, at the expense of slightly longer lookups (note that the gcc compiler generally produces good code for switch statements, reducing the need for more complex schemes). -- cgit v1.2.1