summaryrefslogtreecommitdiff
path: root/Python
diff options
context:
space:
mode:
authorVictor Stinner <victor.stinner@haypocalc.com>2011-10-01 02:47:29 +0200
committerVictor Stinner <victor.stinner@haypocalc.com>2011-10-01 02:47:29 +0200
commit67ca64ce54012d1e322cb275cee55704cf73d46d (patch)
tree3d833e04fcc96a187819eefdf95c89b3bbc72bd4 /Python
parent4584a5ba1ab223d273b1678ba6ec3a2781a824f7 (diff)
downloadcpython-git-67ca64ce54012d1e322cb275cee55704cf73d46d.tar.gz
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)
Diffstat (limited to 'Python')
0 files changed, 0 insertions, 0 deletions