in reply to Compare/Diff on nested data structures
If it is for humans, you could be done quickly by 'diff'ing output of Data::Dumper.
For automated processing you could walk the structures from bottom to top and prune matching data on both sides. Your application most likely already has a walking algorithm for the specific structure. The result is two smaller structures.
Solving the general case without knowledge of the structure is a lot more difficult.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Compare/Diff on nested data structures
by Anonymous Monk on Sep 29, 2009 at 09:46 UTC | |
by Anonymous Monk on Feb 25, 2014 at 17:18 UTC |