On 1/3/19, Joerg Sonnenberger <jo...@bec.de> wrote: > Hello John, > I was pointed at your patch on IRC and decided to look into adding my > own pieces. What I can provide you is a fast perfect hash function > generator. I've attached a sample hash function based on the current > main keyword list. hash() essentially gives you the number of the only > possible match, a final strcmp/memcmp is still necessary to verify that > it is an actual keyword though. The |0x20 can be dropped if all cases > have pre-lower-cased the input already. This would replace the binary > search in the lookup functions. Returning offsets directly would be easy > as well. That allows writing a single string where each entry is prefixed > with a type mask, the token id, the length of the keyword and the actual > keyword text. Does that sound useful to you?
Judging by previous responses, there is still interest in using perfect hash functions, so thanks for this. I'm not knowledgeable enough to judge its implementation, so I'll leave that for others. -John Naylor
