Re: Recursively traverse two data structures and test for match

Replies are listed 'Best First'.
Re^2: Recursively traverse two data structures and test for match by dragonchild (Archbishop) on May 23, 2005 at 02:05 UTC
That's not a slam on anything that uses overloaded values. There's just a problem with how overloading is done. I wrote about it here. There's just no correct way to compare overloaded values from different classes. In general, if you think something isn't in Perl, try it out, because it usually is. :-) "What is the sound of Perl? Is it not the sound of a wall that people have stopped banging their heads against?"	[reply]
Re^3: Recursively traverse two data structures and test for match by diotalevi (Canon) on May 23, 2005 at 02:16 UTC
You didn't understand. If you wished to compare that two structures were identical as if overloading didn't exist, you're out of luck. Test::More's is_deeply doesn't do anything to disable the overloading and to thus act on the data structure transparently.	[reply]
Re^4: Recursively traverse two data structures and test for match by jdporter (Paladin) on May 23, 2005 at 12:07 UTC
Nor should it. If a class defines the concept of equality for itself, any external equality-testing framework should respect that. (btw - those interested should refer to FAQ How do I test the deep equality of two hash tables?)	[reply]
Re^5: Recursively traverse two data structures and test for match by diotalevi (Canon) on May 23, 2005 at 15:18 UTC
Re^6: Recursively traverse two data structures and test for match by jdporter (Paladin) on May 23, 2005 at 15:45 UTC
Some notes below your chosen depth have not been shown here
Re^6: Recursively traverse two data structures and test for match by dragonchild (Archbishop) on May 23, 2005 at 15:24 UTC


Think about Loose Coupling
	PerlMonks