comment on

Recursively traverses two data structures and tests for match. Takes any data type; arrays and hashes must be passed by reference. Returns false if two arrays have the same items in a different order. Streamlined for speed with large numbers of data items.

EDIT: Edited to test CODE refs.

use strict;
use warnings;

sub match {
    return ($_[0] eq $_[1] ? 1 : 0) if ! ref $_[0] && ! ref $_[1];
    my ($x, $y, $i) = @_;
    return 0 if ref $x ne ref $y;
    if (ref $x eq 'ARRAY') {
        return 0 if $#$x != $#$y;
        for ($i = 0; $i <= $#$x; $i++) {
            return 0 if ! match($x->[$i], $y->[$i]);
        } return 1;
    }
    if (ref $x eq 'HASH') {
        return 0 if scalar keys %$x != scalar keys %$y;
        my @x = sort keys %$x;
        my @y = sort keys %$y;
        for ($i = 0; $i <= $#x; $i++) {
            return 0 if $x[$i] ne $y[$i];
        }
        for ($i = 0; $i <= $#x; $i++) {
            return 0 if ! match($x->{$x[$i]}, $y->{$y[$i]});
        } return 1;
    }
    return ($x eq $y ? 1 : 0);
}
[download]

In reply to Recursively traverse two data structures and test for match by TedPride

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


go ahead... be a heretic
	PerlMonks