|P is for Practical|
comparing nested data structuresby LanX (Canon)
|on Nov 02, 2011 at 09:54 UTC||Need Help??|
LanX has asked for the
wisdom of the Perl Monks concerning the following question:
Is there a fast trick to diff deeply nested data structures, beside the obviouse recursive comparison?
I was thinking about dumping and comparing the text output ...
I'm mining large amounts of data into nested data structures and would like to join indentical sub-trees.