This issue tracker has been migrated to GitHub ,
and is currently read-only.
For more information,
see the GitHub FAQs in the Python's Developer Guide.
| Author | pitrou |
|---|---|
| Recipients | christian.heimes, pitrou |
| Date | 2008年03月22日.16:45:02 |
| SpamBayes Score | 0.035898186 |
| Marked as misclassified | No |
| Message-id | <1206204304.36.0.0530168742105.issue2013@psf.upfronthosting.co.za> |
| In-reply-to |
| Content | |
|---|---|
Here are some updated timings against the current py3k branch: $ ./python -m timeit "sum(range(10000))" Without patch: 1000 loops, best of 3: 675 usec per loop With patch: 1000 loops, best of 3: 462 usec per loop $ ./python -m timeit -s "n=1000000" "sum(range(n, n+10000))" Without patch: 1000 loops, best of 3: 1.36 msec per loop With patch: 1000 loops, best of 3: 1.38 msec per loop $ ./python -m timeit "min(range(255))" Without patch: 10000 loops, best of 3: 18.7 usec per loop With patch: 10000 loops, best of 3: 19.4 usec per loop As you can see the patch makes things quite a bit better for 1-digit long objects, and there is only a small slowdown for longer or tiny ints. Given that 1-digit long objects should be prevalent in most code I think it's probably a winner overall. |
|
| History | |||
|---|---|---|---|
| Date | User | Action | Args |
| 2008年03月22日 16:45:04 | pitrou | set | spambayes_score: 0.0358982 -> 0.035898186 recipients: + pitrou, christian.heimes |
| 2008年03月22日 16:45:04 | pitrou | set | spambayes_score: 0.0358982 -> 0.0358982 messageid: <1206204304.36.0.0530168742105.issue2013@psf.upfronthosting.co.za> |
| 2008年03月22日 16:45:03 | pitrou | link | issue2013 messages |
| 2008年03月22日 16:45:02 | pitrou | create | |