| commit | 67ca64ce54012d1e322cb275cee55704cf73d46d | [log] [tgz] |
|---|---|---|
| author | Victor Stinner <victor.stinner@haypocalc.com> | Sat Oct 01 02:47:29 2011 +0200 |
| committer | Victor Stinner <victor.stinner@haypocalc.com> | Sat Oct 01 02:47:29 2011 +0200 |
| tree | 3d833e04fcc96a187819eefdf95c89b3bbc72bd4 | |
| parent | 4584a5ba1ab223d273b1678ba6ec3a2781a824f7 [diff] |
I want a super fast 'a' * n! * Optimize unicode_repeat() for a special case with memset() * Simplify integer overflow checking; remove the second check because PyUnicode_New() already does it and uses a smaller limit (Py_ssize_t vs size_t)