[MLton] Callback functions: how?

Henry Cejtin henry.cejtin at sbcglobal.net
Wed Feb 14 15:36:45 PST 2007

There is no need to make the hash table size prime size, and it costs you
because each lookup now requires a divide instead of a bit-wise and.  If the
bits of your hash function are truly random and you make each bucket a list,
then there is no gain.

More information about the MLton mailing list