Re3: Hash key counting (2=>1)

To give the OP a few possible rationales:

My array would get so big, but is sparsely populated
My stuff isn't sequential (kinda doesn't work in this case, but is a good excuse, in general...)
I need to do a lot of random-access lookup

I give up. Essentially, imho, this is pointing out that the OP is trying to solve a problem without fully understanding the requirements necessary. If s/he did, then a less complex solution would probably point itself out very quickly.

------
We are the carpenters and bricklayers of the Information Age.

Don't go borrowing trouble. For programmers, this means Worry only about what you need to implement.

Please remember that I'm crufty and crochety. All opinions are purely mine and all code is untested, unless otherwise specified.

Comment on Re3: Hash key counting (2=>1)

Replies are listed 'Best First'.
Re^4: Hash key counting (2=>1) by Aristotle (Chancellor) on Apr 22, 2003 at 00:03 UTC
My array would get so big, but is sparsely populated How is that an argument in this case? He's adding sequentially numbered keys, so the population is as dense as at all possible. Makeshifts last the longest.	[reply]