Message190397
| Author |
arigo |
| Recipients |
arigo |
| Date |
2013年05月31日.09:49:52 |
| SpamBayes Score |
-1.0 |
| Marked as misclassified |
Yes |
| Message-id |
<1369993793.36.0.708057511123.issue18107@psf.upfronthosting.co.za> |
| In-reply-to |
| Content |
If you have in x some very large number, like 3**200000, then the computation for 'str(x)' is sub-efficient. Nathan Hurst posted to the pypy-dev mailing list a pure Python algo that gives the same result in 2/3rd of the time (in either CPython or PyPy). We would get a similar gain by recoding this algorithm in C.
The mail is here: http://mail.python.org/pipermail/pypy-dev/2013-May/011433.html |
|
History
|
|---|
| Date |
User |
Action |
Args |
| 2013年05月31日 09:49:53 | arigo | set | recipients:
+ arigo |
| 2013年05月31日 09:49:53 | arigo | set | messageid: <1369993793.36.0.708057511123.issue18107@psf.upfronthosting.co.za> |
| 2013年05月31日 09:49:53 | arigo | link | issue18107 messages |
| 2013年05月31日 09:49:52 | arigo | create |
|