Re^2: Array vs. Hash for sparsely integer-indexed data (bit vectors)

Also worth considering: if your lookups are (or lend themselves to be adapted to) a simple boolean truth; vec can reduce the space requirement to a fraction of that used by either arrays or hashes and yields lookup time that also beat arrays:

$vec = ''; vec( $vec, $_*20, 1) =1 for 1 .. 1e5;;
print total_size \$vec;;
250056

$found = 0; say time; vec( $vec, $_, 1 ) and ++$found for 1 .. 20e5; s
+ay time; say $found;;
1359141761.02608
1359141761.35157
100000
[download]

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority".

In the absence of evidence, opinion is indistinguishable from prejudice.

Comment on Re^2: Array vs. Hash for sparsely integer-indexed data (bit vectors) Download Code