busybox-w32/testsuite/factor.tests, branch long_pathsA mirror of https://github.com/rmyorston/busybox-w32.git
https://git.lua4.win/busybox-w32/atom?h=long_paths2020-12-22T19:24:30+00:00factor: detect squares2020-12-22T19:24:30+00:00Denys Vlasenkovda.linux@googlemail.com2020-12-22T19:08:40+00:00urn:sha1:6452c300366cf0e322227ad39991ec2fdfd6beed
If we have a square, the speedup can be extremely large
(in best case example below, it's ~40000 times faster):
$ time ./busybox_old factor 18446743988964486098
18446743988964486098: 2 3037000493 3037000493
real 0m4.246s
$ time ./busybox factor 18446743988964486098
18446743988964486098: 2 3037000493 3037000493
real 0m0.000s
function old new delta
isqrt_odd - 57 +57
print_w - 36 +36
factorize 218 236 +18
print_h - 7 +7
factorize_numstr 65 72 +7
------------------------------------------------------------------------------
(add/remove: 3/0 grow/shrink: 2/0 up/down: 125/0) Total: 125 bytes
Signed-off-by: Denys Vlasenko <vda.linux@googlemail.com>
factor: new applet2017-04-09T19:18:43+00:00Denys Vlasenkovda.linux@googlemail.com2017-04-09T19:18:43+00:00urn:sha1:ee7f75d94f2a70d61a71eca9416d51a3268859d7
thus far only able to factor up to ULLONG_MAX
function old new delta
factor_main - 378 +378
packed_usage 31427 31502 +75
applet_names 2590 2597 +7
applet_main 1500 1504 +4
------------------------------------------------------------------------------
(add/remove: 2/0 grow/shrink: 3/0 up/down: 464/0) Total: 464 bytes
Signed-off-by: Denys Vlasenko <vda.linux@googlemail.com>