Oy, yes. I see what you mean. The array will grow to accomodate it's highest index, and therefore all lower indexes will come into existence.
I think the OP should use a hash. Clearly, it's a hash-ish behavior he/she wants. The fact that the keys are numbers is making it look like a list problem, but really, it's a hash problem.
In reply to Re^3: Check if value exists into an array in a hash
by pileofrogs
in thread Check if value exists into an array in a hash
by Sombrerero_loco
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |