in reply to
Copy of an anonymous hash?
Dear Anonymous,The topic of your problem is called deep copy and it's worth while searchingfor it ... and he has a column on it ...
There is shallow copy in one extreme and deep copy in the other an in the middle lots of intermediate solutions, which one is the good one depends on the particular data representation.
For instance, if you are cloning an object representing an XML node, you will like to deep-copy all its children but not the pointer to its parent.
Shallow copy is usually a good solution:
all you need is to do a shallow copy whenever you change a
Priority 1, Priority 2, Priority 3
Priority 1, Priority 0, Priority -1
Urgent, important, favour
Data loss, bug, enhancement
Out of scope, out of budget, out of line
Family, friends, work
Impossible, inconceivable, implemented
Results (94 votes),