I'm not sure why people fealt this question wasn't sufficiently clear, so I will expand on it. I've already written the code, I'm just trying to make it cleaner and easier to maintain by the next guy. The part that I don't like is the refrences, and I was wondering if any of the Perl Monk Gurus could enlighten me with better ways of doing this without changing the over-all structure. By that I mean the routine must be recursive, the keys are associated with arrays, not scalars, and these arrays are grown as new values are found for given keys.
Basically I'm recursivly filling a particular data structure, and I'm looking for the cleanest way to do it.
In reply to RE: Hash Push
by Adam
in thread Hash Push
by Adam