- 26 May, 2006 40 commits
-
-
Fredrik Lundh authored
-
Fredrik Lundh authored
-
Georg Brandl authored
invalid file paths for the built-in import machinery which leads to fewer open calls on startup. Also fix issue with PEP 302 style import hooks which lead to more open() calls than necessary.
-
Thomas Heller authored
-
Steve Holden authored
the illusion of negative run times. Halt with an error if run times go below 10 ms, indicating that results will be unreliable.
-
Fredrik Lundh authored
broken, someone would have noticed by now ;-)
-
Fredrik Lundh authored
-
Fredrik Lundh authored
-
Thomas Heller authored
-
Fredrik Lundh authored
-
Tim Peters authored
-
Tim Peters authored
-
Tim Peters authored
signed and unsigned integral types in comparisons.
-
Thomas Heller authored
so I'm writing this in latex now. Skeleton for the ctypes reference.
-
Fredrik Lundh authored
-
Steve Holden authored
Action verbose option correctly. Tweak operation counts. Add empty and new instances tests. Enable comparisons across different warp factors. Change version.
-
Bob Ippolito authored
-
Andrew Dalke authored
even with strip(..., 0)
-
Andrew Dalke authored
-
Bob Ippolito authored
-
Bob Ippolito authored
-
Bob Ippolito authored
-
Andrew M. Kuchling authored
-
Andrew M. Kuchling authored
-
Tim Peters authored
failures on Windows buildbots, but it's hard to know how since the regrtest failure output is useless here, and it never fails when a buildbot slave runs test_tarfile the second time in verbose mode.
-
Andrew Dalke authored
results list. Originally it allocated 0 items and used the list growth during append. Now it preallocates 12 items so the first few appends don't need list reallocs. ("Here are some words ."*2).split(None, 1) is 7% faster ("Here are some words ."*2).split() is is 15% faster (Your milage may vary, see dealership for details.) File parsing like this for line in f: count += len(line.split()) is also about 15% faster. There is a slowdown of about 3% for large strings because of the additional overhead of checking if the append is to a preallocated region of the list or not. This will be the rare case. It could be improved with special case code but we decided it was not useful enough. There is a cost of 12*sizeof(PyObject *) bytes per list. For the normal case of file parsing this is not a problem because of the lists have a short lifetime. We have not come up with cases where this is a problem in real life. I chose 12 because human text averages about 11 words per line in books, one of my data sets averages 6.2 words with a final peak at 11 words per line, and I work with a tab delimited data set with 8 tabs per line (or 9 words per line). 12 encompasses all of these. Also changed the last rstrip code to append then reverse, rather than doing insert(0). The strip() and rstrip() times are now comparable.
-
Tim Peters authored
-
Bob Ippolito authored
-
Andrew Dalke authored
-
Bob Ippolito authored
-
Andrew M. Kuchling authored
-
Tim Peters authored
-
Andrew Dalke authored
-
Andrew Dalke authored
The new split functions use a preallocated list. Added tests which exceed the preallocation size, to exercise list appends/resizes. Also added more edge case tests.
-
Tim Peters authored
-
Ronald Oussoren authored
- Some small bugfixes for the IDLE.app wrapper - Tweaks to build-installer to ensure that python gets build in the right way, including sqlite3. - Updated readme files
-
Martin Blais authored
* Added socket.recv_buf() and socket.recvfrom_buf() methods, that use the buffer protocol (send and sendto already did). * Added struct.pack_to(), that is the corresponding buffer compatible method to unpack_from(). * Fixed minor typos in arraymodule.
-
Fredrik Lundh authored
but Trent's copy thinks that it's an anachronism...
-
Andrew M. Kuchling authored
-
Fredrik Lundh authored
LOCAL inlining; also added some missing whitespace
-