On Tuesday 09 September 2003 19:27, Gordon Henriksen wrote: > Isn't the easiest way to get a recursive-and-exact object graph match to > simply use an existing serializer (FreezeThaw, Data::Dumper). This > leverages the circular reference handling and introspection smarts built > into those libraries. Then the test can just perform a string comparison > on the serialization of the expected and actual graphs. Well, so long as > the serializer sorts hash keys and otherwise avoids unpredictable > output.
If you want a yes/no answer then it probably is but if you want to know where they differ it's not so helpful, F
