--ofZMSlrAVk9bLeVm
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
Content-Transfer-Encoding: quoted-printable
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 =3D ( 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.
--=20
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.
--ofZMSlrAVk9bLeVm
Content-Type: application/pgp-signature
Content-Disposition: inline
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v2.0.4 (FreeBSD)
iD8DBQFHdr2Z/opHv/APuIcRAixVAJ9FRodz7VA5lSTTb+thHdgUfaj8QgCgktV2
NbDvoyWtAx8XEuzpRIaq+bY=
=Xp6K
-----END PGP SIGNATURE-----
--ofZMSlrAVk9bLeVm--