Repository navigation
Expand file tree
/
Copy pathreport
More file actions
executable file
·373 lines (346 loc) · 10.2 KB
/
Copy pathreport
File metadata and controls
executable file
·373 lines (346 loc) · 10.2 KB
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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
#!/usr/bin/env perl
BEGIN { do "./lib/reexec" for grep $_, $ENV{MATHPERL} }
use strict;
use warnings;
use Math::GMP;
use Math::Prime::Util qw{ factor_exp };
use List::Util qw{ first reduce };
use lib ('./lib');
use Seq::Db;
use Type;
use Math::xGMP;
my($debug, $opt_composite, $opt_table, $opt_run, $commas) = (0, 0, 0, 0, 0);
my $order = 'n';
my $typename = 't';
my $nfilter;
my $filter = sub { 1 };
while (@ARGV && $ARGV[0] =~ /^-/) {
my $arg = shift(@ARGV);
last if $arg eq '--';
$debug = 1, next if $arg eq '-d';
$opt_composite = 1, next if $arg eq '-c';
$opt_table = 1, next if $arg eq '-t';
$opt_run = 1, next if $arg eq '-r';
$commas = 1, next if $arg eq '-C';
$order = [ \'LENGTH(checked)', 'checked' ], next if $arg eq '-z';
$typename = $1, next if $arg =~ /^-y(.*)/;
$filter = chain_sig($filter, $1 || shift(@ARGV)), next
if $arg =~ /^-s(.*)/;
$filter = chain_fact($filter, $1 || shift(@ARGV)), next
if $arg =~ /^-f(.*)/;
$filter = chain_min($filter, $1 || shift(@ARGV)), next
if $arg =~ /^-n(.*)/;
$filter = chain_max($filter, $1 || shift(@ARGV)), next
if $arg =~ /^-x(.*)/;
$filter = chain_maxprime($filter, $1 || shift(@ARGV)), next
if $arg =~ /^-mp(.*)/;
$filter = chain_topprime($filter, $1 || shift(@ARGV)), next
if $arg =~ /^-tp(.*)/;
$filter = chain_mod($filter, $1, $2), next
if $arg =~ /^-m(\d+)=([0-9,]+)$/;
($nfilter, $filter) = ($filter, sub { 1 }), next
if $arg eq '-k';
die "Unknown option '$arg'";
}
my($n, $k) = @ARGV;
if ($n) {
$filter = chain_min($filter, $n);
$filter = chain_max($filter, $n);
}
my $type = Type->new($typename);
local @ENV{qw{ DBI_TRACE DBIC_TRACE }} = (1, 1) if $debug;
my $db = Seq::Db->new($type, 0);
use Data::Dumper;
local $Data::Dumper::Indent = $Data::Dumper::Sortkeys = 1;
if ($nfilter) {
report_all();
} elsif ($opt_table || !$n) {
report_g();
} elsif (!$k) {
report_f();
} elsif (!$opt_run) {
report_fk();
} else {
report_run();
}
exit 0;
sub report_all {
for my $g ($db->resultset('TauG')->search(
undef, { order_by => $order }
)->all) {
my $n = $g->n;
next unless $nfilter->($n);
for my $f (@{ $g->fall($db) }) {
my $k = $f->k;
next unless $filter->($k);
_report_fk($g, $f);
}
}
return;
}
sub knowng {
my($g) = @_;
my $max = 0;
for my $f (@{ $g->fall($db) }) {
next if $f->k <= $max;
$max = $f->k if $f->f; # whether or not $f->complete
}
return $max;
}
sub report_g {
# tau(n) only relevant for tauseq, addseq
my $tauish = ($type->typename =~ /^[ta]$/) ? 1 : 0;
for my $g ($db->resultset('TauG')->search(
undef, { order_by => $order }
)->all) {
my $n = $g->n;
next unless $filter->($n);
if ($g->depend && !$g->complete) {
$g->update_depends($db);
}
my $knowng = knowng($g);
next if $g->checked == 0 && !$g->complete && $knowng == 0;
next if $opt_composite && (
# $g->prime || $g->complete || $g->depend
$g->complete || $g->depend
);
if ($opt_table) {
my $f = (
!$g->complete && $g->depend && $g->depended->ming == $g->ming
) ? sprintf('g(%s)', $g->depend_n)
: _fc(_maxf($g));
my $ming = ($g->superset ? '+' : '')
. ($g->subset ? '-' : '')
. $g->ming;
if ($tauish) {
printf(
"%5s | %4s | %5s | %5s | %20s | %s\n",
$n, _tau($n), $ming, $g->maxg, $f, _comments($g),
);
} else {
printf(
"%5s | %5s | %5s | %27s | %s\n",
$n, $ming, $g->maxg, $f, _comments($g),
);
}
next;
}
if ($g->complete) {
printf "g(%s) = %s\n", $g->n, $g->maxg;
} elsif ($g->depend) {
printf "g(%s) = g(%s)\n", $g->n, $g->depend_n;
} else {
my $range = $g->ming;
$range = "$range/$knowng" if $range < $knowng;
my $maxg = $g->maxg;
if ($knowng < $maxg) {
$range = "$range .. $maxg";
my $bisected = $g->bisected // 0;
$range = "$range b$bisected" if $bisected;
}
printf "g(%s) in [%s], checked to %s\n",
$g->n, $range, $g->checked;
}
}
return;
}
sub last_complete {
my($f) = @_;
return $f->last_run if defined $f->last_run;
return reduce { ($a->runid > $b->runid) ? $a : $b } grep {
$_->owner == 1 && $_->complete && !$_->partial
} $f->runs->all;
}
sub _report_fk {
my($g, $f) = @_;
if ($f->impossible) {
printf "f(%s, %s) is impossible\n", $f->n, $f->k;
} elsif ($f->complete && !$f->depend) {
if ($f->f) {
my $rt = last_complete($f);
my $st = '';
if ($rt) {
$st = sprintf ' (%s%.2fs)', $rt->old ? '*' : '', $rt->runtime;
}
printf "f(%s, %s) = %s%s\n", $f->n, $f->k, _f($f->f), $st;
} elsif ($f->k <= $g->maxg) {
printf "f(%s, %s) > %s\n", $f->n, $f->k, _f($g->checked);
} # else ignore, it was proven impossible
} elsif ($f->complete && $f->depend) {
if ($f->f) {
printf "f(%s, %s) = %s = %s f(%s, %s)\n",
$f->n, $f->k, _f($f->f), $f->depend_m, $f->depend_n, $f->k;
} else {
printf "f(%s, %s) = %s f(%s, %s)\n",
$f->n, $f->k, $f->depend_m, $f->depend_n, $f->k;
}
} elsif ($f->f && !$f->complete) {
printf "f(%s, %s) <= %s\n", $f->n, $f->k, _f($f->f);
} else {
printf "f(%s, %s) > %s\n", $f->n, $f->k, _f($g->checked)
unless $g->depend;
}
return;
}
sub report_fk {
my $g = $db->resultset('TauG')->find({ n => $n });
my $f = $db->resultset('TauF')->find({ n => $n, k => $k });
_report_fk($g, $f);
return;
}
sub report_f {
my $g = $db->resultset('TauG')->find({ n => $n });
if ($g->complete) {
printf "g(%s) = %s\n", $g->n, $g->maxg;
} elsif ($g->depend) {
printf "g(%s) = g(%s)\n", $g->n, $g->depend_n;
} else {
printf "g(%s) in [%s .. %s], checked to %s\n",
$g->n, $g->ming, $g->maxg, $g->checked;
}
my $max = $g->maxg;
for my $f (@{ $g->fall($db) }) {
_report_fk($g, $f);
}
return;
}
sub run_by_owner {
my($r) = @_;
my $owner = $r->owner;
return join ' ', @{ $r->command } if $owner == 0;
return sprintf 'oul %s %s', $r->n, $r->k if $owner == 1;
return "unknown owner=$owner";
}
sub report_run {
my $g = $db->resultset('TauG')->find({ n => $n });
my $f = $db->resultset('TauF')->find({ n => $n, k => $k });
for my $r ($f->runs->all) {
printf "[%s] %s\n",
run_by_owner($r),
$r->complete ? sprintf('complete %.3f + %.3f',
$r->preptime // 0, $r->runtime // 0)
: sprintf('%s, prio %.2f',
$r->running ? 'running' : 'waiting', $r->priority);
}
}
sub chain_min {
my($next, $min) = @_;
return sub { $_[0] >= $min && $next->($_[0]) };
}
sub chain_max {
my($next, $max) = @_;
return sub { $_[0] <= $max && $next->($_[0]) };
}
sub chain_fact {
my($next, $fact) = @_;
return sub { ($_[0] % $fact) == 0 && $next->($_[0]) };
}
sub chain_sig {
my($next, $sig) = @_;
# Either '1,2,3' => p^1 q^2 r^3 or '12p^2q' => 12 p^2 q
my($k, @pow) = (1);
if ($sig =~ /[a-z]/i) {
$k = $1 if $sig =~ s/^(\d+)//;
@pow = map +(/\w\^(\d+)/ ? $1 : 1), split /(?=[a-z])/, $sig;
} else {
@pow = split /,/, $sig;
}
my $vsig = join ',', sort { $b <=> $a } @pow;
return sub {
my $n = $_[0];
return 0 unless $next->($n);
return 0 unless ($n % $k) == 0;
$n /= $k;
return 0 if gcd($n, $k) > 1;
my $vn = join ',', sort { $b <=> $a } map $_->[1], factor_exp($n);
return $vn eq $vsig ? 1 : 0;
};
}
sub chain_maxprime {
my($next, $p) = @_;
return sub {
return 0 unless $next->($_[0]);
my $tp = (factor_exp($_[0]))[-1][0];
return $p >= $tp ? 1 : 0;
};
}
sub chain_topprime {
my($next, $p) = @_;
return sub {
return 0 unless $next->($_[0]);
my $tp = (factor_exp($_[0]))[-1][0];
return $p == $tp ? 1 : 0;
};
}
sub chain_mod {
my($next, $m, $v) = @_;
my %v = map +($_ => 1), split /,/, $v;
return sub {
return 0 unless $next->($_[0]);
return $v{$_[0] % $m} ? 1 : 0;
};
}
sub _tau {
my($n) = @_;
my $k = 1;
$k *= $_->[1] + 1 for factor_exp($n);
return $k;
}
sub _maxf {
my($g) = @_;
my @f = grep $_->complete && $_->f, $g->f->all;
return @f ? $f[-1]->f : '-';
}
sub gcd {
my($a, $b) = @_;
$a = Math::GMP->new($a) unless ref $a;
return $a->bgcd($b);
}
sub _comments {
my($g) = @_;
my $n = $g->n;
my @f = $g->f->all;
my @c;
if ($g->complete) {
push @c, 'complete';
} elsif ($g->depend) {
push @c, 'dependent';
} else {
push @c, sprintf 'checked %s', _fe('%.2g', $g->checked);
}
my $f = first { $_->complete && $_->depend } @f;
if ($f) {
push @c, sprintf'%s f(%s, k>%s)',
$f->depend_m, $f->depend_n, $f->k - 1;
}
$f = first { $_->minc } @f;
if ($f) {
my($r) = $f->runs->search_bitfield({ fix_power => 1 },
{ limit => 1 })->all;
if ($r) {
push @c, sprintf 'fix_power: k >= %s, -c > %s',
$r->k, $f->minc;
}
}
return join "; ", @c;
}
sub _f {
my($n) = @_;
$commas ? _fc($n) : "$n";
}
sub _fe {
my($ft, $n) = @_;
my $s = (sprintf $ft, "$n") =~ s{e\+?0*(?=\d)}{e}r;
if ($s =~ /inf/i) {
my $log = $n->log10;
my $exp = int($log);
my $rem = $log - $exp;
$s = sprintf $ft, 10 ** $rem;
$s =~ s{e\d+|$}{e$exp};
}
return $s;
}
sub _fc {
my($n) = @_;
(sprintf '%s', $n) =~ s{(?<=\d)(?=(?:\d{3})+\z)}{,}gr;
}