Message227559
| Author |
terry.reedy |
| Recipients |
akira, brg@gladman.plus.com, gladman, mark.dickinson, mrabarnett, scoder, steven.daprano, terry.reedy, vstinner, wolma |
| Date |
2014年09月25日.17:43:49 |
| SpamBayes Score |
-1.0 |
| Marked as misclassified |
Yes |
| Message-id |
<1411667029.32.0.353736607393.issue22477@psf.upfronthosting.co.za> |
| In-reply-to |
| Content |
I strongly agree with Mark's revised plan:
1. add a fast C-coded math.gcd returning the actual greatest (in normal ordered int sense) common divisor;
2. use this for reduction of fractions in the fractions module to speed up operations on fractions.
3. revised fractions.gcd docstring "Return signed version of math.gcd. ..."
I think this would be double win (users get fast, 'proper' gcd; fractions work faster too). |
|