But I see how in a bigger data set this should be the way to go. Checking for existence in a larger hash could be counter productive.
You probably don't have to worry about that, searches in hashes are fast and usually do not depend on the size of the hashes.In reply to Re^3: Appending values to existing hash key
by Laurent_R
in thread Appending values to existing hash key
by jaypal
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |