Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: Combining / Merging two Ho(H|A)s

by jdporter (Canon)
on Feb 21, 2006 at 23:22 UTC ( #531832=note: print w/ replies, xml ) Need Help??


in reply to Combining / Merging two Ho(H|A)s

You didn't say what should happen when there are existing values in the two hashes, but their types are different. For example,

%h1 = ( foo => 1, ); %h2 = ( foo => { bar => 2, }, );
Do you have reason to believe this won't happen?

We're building the house of the future together.


Comment on Re: Combining / Merging two Ho(H|A)s
Download Code
Re^2: Combining / Merging two Ho(H|A)s
by jkva (Chaplain) on Feb 22, 2006 at 05:41 UTC
    Very very good point. It is possible. I'd say the first hash's value should be overwritten by the second one.
    GrandFather's code can be easily changed to check for REF differences and act accordingly.

      Right; but I would definitely look into Hash::Merge (Roy_Johnson's suggestion).

      We're building the house of the future together.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://531832]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (4)
As of 2014-08-01 10:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Who would be the most fun to work for?















    Results (4 votes), past polls