> A perfect hash should be much faster at the trivial expense of some space.
>
> >From the distribution:
> While teaching a data structures course at University of California,
> Irvine, I developed a program called GPERF that generates perfect hash
> functions for sets of key words. A perfect hash function is simply:
>
> A hash function and a data structure that allows
> recognition of a key word in a set of words using
> exactly 1 probe into the data structure.
>
>
> > We also can not distribute GNU code.
>
> I'm pretty sure that the code the gperf outputs is not covered under the
> GPL, just gperf itself.
>
Can you run our keywords.c using our method and gperf and see if there
is any speed difference?
-- Bruce Momjian | http://www.op.net/~candle pgman@candle.pha.pa.us | (610)
853-3000+ If your life is a hard drive, | 830 Blythe Avenue + Christ can be your backup. | Drexel Hill,
Pennsylvania19026
