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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
# 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 => 160;
}
my ($wanted, $count, $preprocess, $preprocessor_calls, $last);
my %data = ('A' .. 'Z', 'a' .. 'z');
$preprocessor_calls = 0;
$preprocess = sub {
my %container = @_;
my @sorted;
foreach my $key (sort keys %container) {
push @sorted, $key, $container{$key};
}
++$preprocessor_calls;
return @sorted;
};
$last = '';
$wanted = sub {
unless (ref $_) {
ok($_ gt $last);
$last = $_;
}
};
walk { wanted => $wanted, preprocess => $preprocess}, \%data;
ok $preprocessor_calls;
my @data = ('A' .. 'Z', 'a' .. 'z');
$preprocessor_calls = 0;
$preprocess = sub {
++$preprocessor_calls;
return reverse sort @_;
};
$last = chr (1 + ord $data[-1]);
$wanted = sub {
unless (ref $_) {
ok($_ lt $last);
$last = $_;
}
};
walk { wanted => $wanted, preprocess => $preprocess}, \@data;
ok $preprocessor_calls;
%data = ('A' .. 'Z', 'a' .. 'z');
$preprocessor_calls = 0;
$preprocess = sub {
my %container = @_;
my @sorted;
foreach my $key (sort keys %container) {
push @sorted, $key, $container{$key};
}
++$preprocessor_calls;
return @sorted;
};
$last = '';
$wanted = sub {
unless (ref $_) {
ok($_ gt $last);
$last = $_;
}
};
walk { wanted => $wanted, preprocess_hash => $preprocess}, \%data;
ok $preprocessor_calls;
@data = ('A' .. 'Z', 'a' .. 'z');
$preprocessor_calls = 0;
$preprocess = sub {
++$preprocessor_calls;
};
$wanted = sub {};
walk { wanted => $wanted, preprocess_hash => $preprocess}, \@data;
ok(!$preprocessor_calls);
|
