So how is dumping the structures as text (which has to traverse the structures in any case) then parsing the text to recreate some internal representation to allow comparison of the structures going to be faster than a direct comparison?
In reply to Re: comparing nested data structures
by GrandFather
in thread comparing nested data structures
by LanX
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |