[Haskell-cafe] Re: Types and hashes of hashes, trouble for a Java-programmer...

Achim Schneider barsoap at web.de
Mon Apr 13 12:33:38 EDT 2009

"John A. De Goes" <john at n-brain.net> wrote:

> Why not use an ordered pair as the key?
Well, that might be seriously less efficient, depending on the type and
size of keys: By nesting, you might avoid computing the hash of a
two-megabyte key in case the outer lookup failed. The same goes for any
other Map implementation, of course, O(zarroo) is always faster than

(c) this sig last receiving data processing entity. Inspect headers
for copyright history. All rights reserved. Copying, hiring, renting,
performance and/or quoting of this signature prohibited.

More information about the Haskell-Cafe mailing list