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
|
#!/usr/bin/env perl
use strict;
use warnings;
use Cwd;
use Test::More;
use File::Temp qw(tempdir);
plan tests => 4;
use_ok 'Path::Class';
my $cwd = getcwd;
my $tmp = dir(tempdir(CLEANUP => 1));
# Test ability to filter children before navigating down to them
# a
# / \
# b* c * → inaccessible
# / \ \
# d e f
# / \ \
# g h i*
(my $abe = $tmp->subdir(qw(a b e)))->mkpath;
(my $acf = $tmp->subdir(qw(a c f)))->mkpath;
$acf->file('i')->touch;
$abe->file('h')->touch;
$abe->file('g')->touch;
$tmp->file(qw(a b d))->touch;
# Simulate permissions failures by just keeping a 'bad' list. We
# can't use actual permissions failures, because some people run tests
# as root, and then permissions always succeed.
my %bad = ( b => 1, i => 1);
my $a = $tmp->subdir('a');
my $nnodes = $a->traverse_if(
sub {
my ($child, $cont) = @_;
#diag("I am in $child");
return sum($cont->(), 1);
},
sub {
my $child = shift;
#diag("Checking whether to use $child: " . -r $child);
return !$bad{$child->basename};
}
);
is($nnodes, 3);
my $ndirs = $a->traverse_if(
sub {
my ($child, $cont) = @_;
return sum($cont->(), ($child->is_dir ? 1 : 0));
},
sub {
my $child = shift;
return !$bad{$child->basename};
}
);
is($ndirs, 3);
my $max_depth = $a->traverse_if(
sub {
my ($child, $cont, $depth) = @_;
return max($cont->($depth + 1), $depth);
},
sub {
my $child = shift;
return !$bad{$child->basename};
},
0);
is($max_depth, 2);
sub sum { my $total = 0; $total += $_ for @_; $total }
sub max { my $max = 0; for (@_) { $max = $_ if $_ > $max } $max }
|
