My array would get so big, but is sparsely populatedHow 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.
In reply to Re^4: Hash key counting (2=>1)
by Aristotle
in thread Hash key counting
by blackjudas
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |