| commit | d64c1def7ca69e346bade11f2a99651eb8e2ff35 | [log] [tgz] |
|---|---|---|
| author | Tim Peters <tim.peters@gmail.com> | Mon Aug 12 17:36:03 2002 +0000 |
| committer | Tim Peters <tim.peters@gmail.com> | Mon Aug 12 17:36:03 2002 +0000 |
| tree | 6c2f540c804be7f24f9c3ae0daca6368aeab4ab8 | |
| parent | a6fa0e6f2e0e2df20b008f3e5c5b0be25a0516de [diff] |
k_mul() and long_mul(): I'm confident that the Karatsuba algorithm is correct now, so added some final comments, did some cleanup, and enabled it for all long-int multiplies. The KARAT envar no longer matters, although I left some #if 0'ed code in there for my own use (temporary). k_mul() is still much slower than x_mul() if the inputs have very differenent sizes, and that still needs to be addressed.