Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

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

by ikegami (Pope)
on Feb 21, 2006 at 21:14 UTC ( #531803=note: print w/ replies, xml ) Need Help??


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

When dealing with data structures and you want something to occur at all levels, it is said to occur "in depth" or "deeply", or is said to be "deep". GrandFather's solution merges deeply, while xorl and Corion's solution merge shallowly.


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

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (6)
As of 2015-08-28 01:29 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The oldest computer book still on my shelves (or on my digital media) is ...













    Results (334 votes), past polls