Issue 18107: 'str(long)' can be made faster
Issue18107
Created on 2013-05-31 09:49 by arigo, last changed 2022-04-11 14:57 by admin. This issue is now closed.
| Messages (3) | |||
|---|---|---|---|
| msg190397 - (view) | Author: Armin Rigo (arigo) *  |
Date: 2013-05-31 09:49 | |
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 |
|||
| msg190398 - (view) | Author: Serhiy Storchaka (serhiy.storchaka) * |
Date: 2013-05-31 10:06 | |
See also issue3451. |
|||
| msg190406 - (view) | Author: Armin Rigo (arigo) * |
Date: 2013-05-31 14:21 | |
Thanks, I missed it. Sorry for the noise. |
|||
| History | |||
|---|---|---|---|
| Date | User | Action | Args |
| 2022-04-11 14:57:46 | admin | set | github: 62307 |
| 2013-05-31 14:21:29 | arigo | set | status: open -> closed resolution: duplicate messages: + msg190406 |
| 2013-05-31 10:06:30 | serhiy.storchaka | set | nosy:
+ mark.dickinson, serhiy.storchaka messages:
+ msg190398 |
| 2013-05-31 09:49:53 | arigo | create | |