Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: Recursively traverse two data structures and test for match

by diotalevi (Canon)
on May 23, 2005 at 01:32 UTC ( #459416=note: print w/replies, xml ) Need Help??


in reply to Recursively traverse two data structures and test for match

Neither this nor Test::More's is_deeply correctly handle overloaded values.
  • Comment on 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?"
      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.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://459416]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (5)
As of 2020-06-04 16:21 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you really want to know if there is extraterrestrial life?



    Results (35 votes). Check out past polls.

    Notices?