Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re: Recursively traverse two data structures and test for match

by TedPride (Priest)
on May 23, 2005 at 17:39 UTC ( #459640=note: print w/replies, xml ) Need Help??


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

I imagine the routine doesn't provide anything over Test::More, but I thought it would be fun to roll one on my own. Besides, you can just cut and paste this routine into your program - no need to mess with installing modules.

I notice I didn't include tests for CODE refs, however. I'm a naughty boy.

  • 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 diotalevi (Canon) on May 23, 2005 at 18:17 UTC
    I didn't see you testing for cycles. Any self referential structure is going to cause your code to stop in an infinite loop.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (3)
As of 2020-06-02 05:43 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you really want to know if there is extraterrestrial life?



    Results (13 votes). Check out past polls.

    Notices?