Perl-Repository-APC
view release on metacpan or search on metacpan
eg/thinnercache.pl view on Meta::CPAN
23965,23966, # encoding neutral unpack: Data::Serializer 0.44 with JSON 2.07
24009,24010, # Unicode::RecursiveDowngrade, Hatena::Keyword 0.05
24448, # 5.008006 THREAD
24517,24518, # removed AvFLAGS
24521,24522, # removed HvPMROOT
24525,24529, # 26 removed xhv_eiter from XPVHV and 29 regained compilability
# 24541,24542, # Math::Pari
# 24556,24557, # Math::Pari after rafl's patch
24641, # according to CoreList this is 5.008007
24659,24660, # Class::constr, Data::Structure::Util
24713,24714, # shared hash keys, manifested in AVIF/Tree-Trie-1.5
24965,24966, # Safe::World but only of marginal importance because failure has changed
25178,25179, # CharsetDetector 1.0
25567,25568, # srezic-rx-problem
25805,25808, # Text::Query
25965,25966, # Safe::World 0.14
25985,25986, # Mail::Box
26369,26370, # Class::MOP 0.40
26373,26374, # classes
26452,26453, # Devel::Profiler 0.04 "Not a glob reference"
26454,26465, # Term::ReadPassword 0.07 (proxysubs; No useable patch between)
26486,26487, # SQL::Translator; Class::MOP ?
26876, # 5.008007 THREAD
26979,26980, # Math::Pari after Nicholas' patch (Message-ID: <877ifnfoal.fsf@k75.linux.bogus>)
27002, # 5.009003
27040, # 5.008008 according to corelist
27263,27264, # JSON 1.12
27533,27534, # regexp recursion stuff/regression(rtperl#60034)
27648,27649, # Devel::Arena
27704,27705, # Thread.pm emulation: Net::Daemon
28358,28359, # encoding::source
28867,28868, # Regexp::Optimizer 0.15
28966, # 5.009004
29025,29026, # DBIx::Class(?), Authen::Htpasswd
29278,29279, # Apache::Parselog 1.02
29317,29318, # String::Multibyte
30038,30039, # forks 0.27
30487,30488, # Devel::Cover 0.61
30609,30610, # Sepia
30637,30638, # XML-LibXML-Simple 0.12 (MarkOv) maint-5.8!
30677,30678, # TAP::Parser 0.52
30952,30953, # Thread.pm emulation: Net::Daemon
30979,30980, # mro, Best 0.11, Class::Inner, Class::Prototyped
31025,31027, # Regexp::Assemble
31162, # 5.008008, my maint 5.8 installation under which I run Jifty
31223, # 5.008008 THREAD
31251,31252, # Data::Alias,Devel::EvalContext
31940,31941, # Tcl (debugging perls)
32147, # my first bleadperl to run Jifty (yay!)
32367, # 5.10.0-RC1
32491, # 5.10.0-RC2
32642, # 5.10.0
32706,32707, # breaks Data::Alias, Devel::Declare, autobox
32733,32734, # DROLSKY/Class-MOP-0.65-70; replace RVs with IVs
32739,32740, # breaks YAML::LibYAML due to ORANGE regexps
32856,32857, # DCONWAY/Getopt-Euclid-v0.1.0 know your enemy, this is hard to binarysearch, not the usual oneliner!
32953,32954, # Data-PostfixDeref-0.03
33017,33018, # RCLAMP/Devel-Caller-2.03, Coro 4.37
33021,33022, # DROLSKY/Devel-StackTrace-1.15, Devel-ebug-0.48
33027,33028, # ROBIN/Want-0.16
33029,33030, # ROBIN/PadWalker-1.6
33056,33057, # ROBIN/Want-0.16 again
33071,33072, # PJCJ/Devel-Cover-0.63, ANDYA/Devel-LeakTrace-Fast-0.11
33085,33086, # PAR::Packer 0.978
33087,33088, # OLAF/Net-DNS-0.62.tar.gz
33709,33710, # PJCJ/Devel-Cover-0.64.tar.gz
33871,33874, # DLAND/Regexp-Assemble-0.33.tar.gz
34481,34482, # Perl6::Say broke on this makemaker
# current smoker
# 24329, # 5.8.6
# 26727, # before 5.8.8, not acceptable, bug between 26696 and 26894
27512, # 5.8.8
34437, # 5.10.1 tobe
35054, # ~5.8.9
39999, # need a new plan for those
);
ENDLESS: while () {
my @dirs;
find(sub {
my $mname = $File::Find::name;
$mname =~ s|\Q$root\E||;
$File::Find::prune++ if $mname =~ tr[/][] > 2;
return unless /perl.+\@(\d+)/;
my $patch = $1;
return if exists $never_delete{$patch};
push @dirs, $File::Find::name if $mname;
}, $root);
my %n;
# read them and give them a value
warn "Found ". scalar @dirs ." deleteable perls";
for my $dirent (@dirs) {
next unless $dirent =~ m|/perl.+\@(\d+)|;
next if exists $no{$dirent};
$n{$dirent} = $1;
}
# sort them by value
my @n = sort { $n{$a} <=> $n{$b} } keys %n;
# we do not want to delete first and last one
pop @n; shift @n;
# group them by the difference to the next lower
my %diff;
for my $n (1..$#n) {
my $diff = $n{$n[$n]} - $n{$n[$n-1]};
$max = $diff if $diff > $max;
$diff{$diff}{$n[$n]} = undef;
}
my $done;
local($|) = 1;
OUTER: for (my $i = 0; $i <= $max; $i++) {
$done++ if $i == $max;
next OUTER unless exists $diff{$i};
# for my $d (sort { $n{$a} <=> $n{$b} } keys %{$diff{$i}}) {
INNER: for my $d (reduce { $n{$a} < $n{$b} ? $a : $b } keys %{$diff{$i}}) {
printf "unlink %s (distance %d) [Nyq]? ", $d, $i;
my $ans;
if ($Opt{max}) {
( run in 2.025 seconds using v1.01-cache-2.11-cpan-e1769b4cff6 )