New submission from Jurjen N.E. Bos: Inspired by the recently new discovered 49th Mersenne prime number I wrote a module to do high speed long/int to decimal conversion. I can now output the new Mersenne number in 18.5 minutes (instead of several hours) on my machine. For numbers longer than about 100000 bits, this routine it is faster than str(number) thanks to the Karatsuba multiplication in CPython. The module supports all number bases 2 through 36, and is written in pure python (both 2 and 3). There is a simple way to save more time by reusing the conversion object (saving about half the time for later calls). My suggestion is to incorporate this into some library, since Python still lacks a routine to convert to any number base. Ideally, it could be incorporated in the builtin str function, but this would need more work. When converting to C, it is recommended to optimize bases 4 and 32 the same way as oct, hex and bin do (which isn't easily accessible from Python).
Hope you like it. At least, it was a lot of fun to write... Hope you like it. ---------- components: Library (Lib) files: fastStr.py messages: 259317 nosy: jneb priority: normal severity: normal status: open title: Fast decimalisation and conversion to other bases type: enhancement versions: Python 2.7 Added file: http://bugs.python.org/file41770/fastStr.py _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue26256> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
