- 26 Mar, 2009 13 commits
-
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
most significantly apply a modified portion of the patch from #4242 with patches for skipping implementation details
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
- 25 Mar, 2009 6 commits
-
-
Raymond Hettinger authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Marc-André Lemburg authored
-
Marc-André Lemburg authored
to return different information than the _sys_version() output used in previous Python versions. This also fixes issue5561: platform.python_version_tuple returns tuple of ints, should be strings Added more tests for the various platform functions.
-
Skip Montanaro authored
-
- 24 Mar, 2009 9 commits
-
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Raymond Hettinger authored
-
- 23 Mar, 2009 12 commits
-
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
It seems my love of PEP 8 overrode the need for consistentcy
-
Benjamin Peterson authored
patch by myself #1034053
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Benjamin Peterson authored
-
Antoine Pitrou authored
-
Antoine Pitrou authored
untrackable objects are not tracked by the garbage collector. This can reduce the size of collections and therefore the garbage collection overhead on long-running programs, depending on their particular use of datatypes. (trivia: this makes the "binary_trees" benchmark from the Computer Language Shootout 40% faster)
-
Raymond Hettinger authored
-
Mark Dickinson authored
The basic algorithm remains the same; the most significant speedups come from the following three changes: (1) normalize by shifting instead of multiplying and dividing (2) the old algorithm usually did an unnecessary extra iteration of the outer loop; remove this. As a special case, this means that long divisions with a single-digit result run twice as fast as before. (3) make inner loop much tighter. Various benchmarks show speedups of between 50% and 150% for long integer divisions and modulo operations.
-