晋太元中,武陵人捕鱼为业。缘溪行,忘路之远近。忽逢桃花林,夹岸数百步,中无杂树,芳草鲜美,落英缤纷。渔人甚异之,复前行,欲穷其林。 林尽水源,便得一山,山有小口,仿佛若有光。便舍船,从口入。初极狭,才通人。复行数十步,豁然开朗。土地平旷,屋舍俨然,有良田、美池、桑竹之属。阡陌交通,鸡犬相闻。其中往来种作,男女衣着,悉如外人。黄发垂髫,并怡然自乐。 见渔人,乃大惊,问所从来。具答之。便要还家,设酒杀鸡作食。村中闻有此人,咸来问讯。自云先世避秦时乱,率妻子邑人来此绝境,不复出焉,遂与外人间隔。问今是何世,乃不知有汉,无论魏晋。此人一一为具言所闻,皆叹惋。余人各复延至其家,皆出酒食。停数日,辞去。此中人语云:“不足为外人道也。”(间隔 一作:隔绝) 既出,得其船,便扶向路,处处志之。及郡下,诣太守,说如此。太守即遣人随其往,寻向所志,遂迷,不复得路。 南阳刘子骥,高尚士也,闻之,欣然规往。未果,寻病终。后遂无问津者。
|
Server : Apache System : Linux srv.rainic.com 4.18.0-553.47.1.el8_10.x86_64 #1 SMP Wed Apr 2 05:45:37 EDT 2025 x86_64 User : rainic ( 1014) PHP Version : 7.4.33 Disable Function : exec,passthru,shell_exec,system Directory : /usr/share/doc/perl-Digest-SHA/examples/ |
Upload File : |
#!/usr/bin/perl
# dups: simple script for showing duplicate files
=head1 NAME
dups - Show Duplicate Files
=head1 SYNOPSIS
Usage: dups files ...
dups is a fast script for discovering duplicate files. It
achieves its efficiency by comparing file digests rather than the
file contents themselves, the latter being much larger in general.
The NIST Secure Hash Algorithm (SHA) is highly collision-resistant,
meaning that two files with the same SHA digest have an almost
certain probability of being identical.
The dups script works by computing the SHA-1 digest of each file
and looking for matches. The search can reveal more than one set
of duplicates, so the output is written as follows:
match1_file1
match1_file2
match1_file3
etc.
match2_file1
match2_file2
etc.
=head1 AUTHOR
Mark Shelor <mshelor@cpan.org>
=head1 SEE ALSO
Perl module L<Digest::SHA> or L<Digest::SHA::PurePerl>
=cut
use strict;
use Digest::SHA;
die "usage: dups files ...\n" unless @ARGV;
my @files = grep { -f $_ } @ARGV;
my %dups;
for (@files) {
my $digest = Digest::SHA->new->addfile($_, "b")->hexdigest;
push(@{$dups{$digest}}, $_);
}
for (keys %dups) {
my $ref = $dups{$_};
if (scalar(@$ref) > 1) {
print join("\n\t", @$ref), "\n\n";
}
}