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.
Cheers Rolf
In reply to comparing nested data structures by LanX
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |