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 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161
|
use 5.006;
use strict;
use warnings;
use Test::More 0.92;
use File::Temp;
use lib 't/lib';
use TestUtils qw/exception tempd has_symlinks/;
use Path::Tiny;
#--------------------------------------------------------------------------#
subtest 'no symlinks' => sub {
my $wd = tempd;
my @tree = qw(
aaaa.txt
bbbb.txt
cccc/dddd.txt
cccc/eeee/ffff.txt
gggg.txt
);
my @breadth = qw(
aaaa.txt
bbbb.txt
cccc
gggg.txt
cccc/dddd.txt
cccc/eeee
cccc/eeee/ffff.txt
);
path($_)->touchpath for @tree;
subtest 'iterator' => sub {
my $iter = path(".")->iterator( { recurse => 1 } );
my @files;
while ( my $f = $iter->() ) {
push @files, "$f";
}
is_deeply( [ sort @files ], [ sort @breadth ], "Breadth first iteration" )
or diag explain \@files;
};
subtest 'visit' => sub {
my @files;
path(".")->visit( sub { push @files, "$_[0]" }, { recurse => 1 }, );
is_deeply( [ sort @files ], [ sort @breadth ], "Breadth first iteration" )
or diag explain \@files;
};
subtest 'visit state' => sub {
my $result = path(".")->visit( sub { $_[1]->{$_}++ }, { recurse => 1 }, );
is_deeply( [ sort keys %$result ], [ sort @breadth ], "Breadth first iteration" )
or diag explain $result;
};
subtest 'visit abort' => sub {
my $result =
path(".")->visit( sub { return \0 if ++$_[1]->{count} == 2 }, { recurse => 1 } );
is( $result->{count}, 2, "visitor aborted on false scalar ref" );
};
};
subtest 'with symlinks' => sub {
plan skip_all => "No symlink support"
unless has_symlinks();
my $wd = tempd;
my @tree = qw(
aaaa.txt
bbbb.txt
cccc/dddd.txt
cccc/eeee/ffff.txt
gggg.txt
);
my @follow = qw(
aaaa.txt
bbbb.txt
cccc
gggg.txt
pppp
qqqq.txt
cccc/dddd.txt
cccc/eeee
cccc/eeee/ffff.txt
pppp/ffff.txt
);
my @nofollow = qw(
aaaa.txt
bbbb.txt
cccc
gggg.txt
pppp
qqqq.txt
cccc/dddd.txt
cccc/eeee
cccc/eeee/ffff.txt
);
path($_)->touchpath for @tree;
symlink path( 'cccc', 'eeee' ), path('pppp');
symlink path('aaaa.txt'), path('qqqq.txt');
subtest 'no follow' => sub {
# no-follow
subtest 'iterator' => sub {
my $iter = path(".")->iterator( { recurse => 1 } );
my @files;
while ( my $f = $iter->() ) {
push @files, "$f";
}
is_deeply( [ sort @files ], [ sort @nofollow ], "Don't follow symlinks" )
or diag explain \@files;
};
subtest 'visit' => sub {
my @files;
path(".")->visit( sub { push @files, "$_[0]" }, { recurse => 1 }, );
is_deeply( [ sort @files ], [ sort @nofollow ], "Don't follow symlinks" )
or diag explain \@files;
};
};
subtest 'follow' => sub {
subtest 'iterator' => sub {
my $iter = path(".")->iterator( { recurse => 1, follow_symlinks => 1 } );
my @files;
while ( my $f = $iter->() ) {
push @files, "$f";
}
is_deeply( [ sort @files ], [ sort @follow ], "Follow symlinks" )
or diag explain \@files;
};
subtest 'visit' => sub {
my @files;
path(".")
->visit( sub { push @files, "$_[0]" }, { recurse => 1, follow_symlinks => 1 }, );
is_deeply( [ sort @files ], [ sort @follow ], "Follow symlinks" )
or diag explain \@files;
};
};
};
done_testing;
#
# This file is part of Path-Tiny
#
# This software is Copyright (c) 2014 by David Golden.
#
# This is free software, licensed under:
#
# The Apache License, Version 2.0, January 2004
#
|