13 Apr
2009
13 Apr
'09
12:33 p.m.
"John A. De Goes"
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 anything. -- (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.