The Perl and Raku Conference 2025: Greenville, South Carolina - June 27-29 Learn more

# Data::Walk - Traverse Perl data structures.
# Copyright (C) 2005-2016 Guido Flohr <guido.flohr@cantanea.com>,
# all rights reserved.
# This program is free software; you can redistribute it and/or modify it
# under the terms of the GNU Library General Public License as published
# by the Free Software Foundation; either version 2, or (at your option)
# any later version.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Library General Public License for more details.
# You should have received a copy of the GNU Library General Public
# License along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
# USA.
use strict;
use Test;
BEGIN {
plan tests => 12;
}
my ($data, $wanted, $count, @expect);
$data = { hash => [0 .. 2]};
$data => {foo => 27, bar => 42, baz => 33};
@expect = (0, 0, 1, 0, 1, 2);
$count = 0;
$wanted = sub {
ok $Data::Walk::index, shift @expect, "Index wrong at position $count";
++$count;
};
walk { wanted => $wanted }, $data;
@expect = (0, 0, 1, 2, 1, 0);
$count = 0;
$wanted = sub {
ok $Data::Walk::index, shift @expect, "Index wrong at position $count";
++$count;
};
walkdepth { wanted => $wanted }, $data;