Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: A (memory) poor man's hash

by Anonymous Monk
on Nov 21, 2003 at 17:55 UTC ( #308982=note: print w/ replies, xml ) Need Help??


in reply to A (memory) poor man's <strike>hash</strike> lookup table.

Maybe I'm being brain-dead here (wouldn't be the first time), but you start off with a hash of a million integer keys, but you end up with something much less useful than a hash. No associated values, and no guarantee of a million unique "keys" unless you use the two-pronged test during insertion. It may or may not function as a memory efficient "set", but it isn't a hash (not even a poor man's hash).

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://308982]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (4)
As of 2016-06-28 02:06 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My preferred method of making French fries (chips) is in a ...











    Results (348 votes). Check out past polls.