1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
|
# 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;
use Data::Walk;
BEGIN {
plan tests => 11;
}
my ($data, $wanted, $count, $preprocess);
$data = { foo => 'bar' };
$data->{baz} = $data;
$count = 0;
$wanted = sub {
++$count;
ok ($count <= 5);
};
walk { wanted => $wanted }, $data;
ok $count, 5;
$preprocess = sub {
my @args = @_;
return () if $count > 10;
return @args;
};
$wanted = sub {
++$count;
};
walk { wanted => $wanted,
follow => 1,
preprocess => $preprocess,
}, $data;
ok $count > 5;
$data = {};
bless $data, 'Data::Walk::Fake';
$wanted = sub {
ok $Data::Walk::address, int $_;
};
walk { wanted => $wanted }, $data;
my $scalar = 'foobar';
$data = [ \$scalar, \$scalar, \$scalar ];
$count = 0;
$wanted = sub {
unless ('ARRAY' eq ref $_) {
ok $Data::Walk::seen, $count++;
}
};
walk { wanted => $wanted }, $data;
$count, scalar @{$data};
|
