On Sat, Dec 29, 2007 at 08:50:14PM +0000, Edward B. DREGER wrote: >...have you explored [order-preserving] minimal perfect hash functions? > >perfect_hash = ( hash1[x] + hash2[x] ) % entry_count ;
This relies on pre-knowledge of all possible entries. It's excellent for (eg) keyword lookups in a compiler (and gcc uses gperf for that reason) but no good where the input can be arbitrary. -- Peter Jeremy Please excuse any delays as the result of my ISP's inability to implement an MTA that is either RFC2821-compliant or matches their claimed behaviour.
pgpMTCFa9ILv0.pgp
Description: PGP signature
