Am 24.08.2011 10:17, schrieb Victor Stinner: > Le 24/08/2011 04:41, Torsten Becker a écrit : >> On Tue, Aug 23, 2011 at 18:27, Victor Stinner >> <victor.stinner at haypocalc.com> wrote: >>> I posted a patch to re-add it: >>> http://bugs.python.org/issue12819#msg142867 >> >> Thank you for the patch! Note that this patch adds the fast path only >> to the helper function which determines the length of the string and >> the maximum character. The decoding part is still without a fast path >> for ASCII runs. > > Ah? If utf8_max_char_size_and_has_errors() returns no error hand > maxchar=127: memcpy() is used. You mean that memcpy() is too slow? :-) No: the pure-ASCII case is already optimized with memcpy. It's the mostly-ASCII case that is not optimized anymore in this PEP 393 implementation (the one with "ASCII runs" instead of "pure ASCII"). Regards, Martin
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4