summaryrefslogtreecommitdiffstats
Commit message (Collapse)AuthorAgeFilesLines
...
* Simplify calling.Georg Brandl2006-05-261-8/+2
|
* Patch #1492218: document None being a constant.Georg Brandl2006-05-261-7/+9
|
* Replace Py_BuildValue("OO") by PyTuple_Pack.Georg Brandl2006-05-263-5/+5
|
* Comment typoAndrew M. Kuchling2006-05-261-1/+1
|
* needforspeed: stringlib refactoring: use stringlib/find for string findFredrik Lundh2006-05-263-30/+25
|
* Write more docs.Thomas Heller2006-05-261-17/+175
|
* needforspeed: use a macro to fix slice indexesFredrik Lundh2006-05-261-52/+18
|
* needforspeed: stringlib refactoring: use stringlib/find for unicodeFredrik Lundh2006-05-261-14/+36
| | | | find
* needforspeed: stringlib refactoring, continued. added count andFredrik Lundh2006-05-265-53/+132
| | | | find helpers; updated unicodeobject to use stringlib_count
* added rpartition method to UserString classFredrik Lundh2006-05-261-1/+4
|
* Exception isn't the root of all exception classes anymore.Georg Brandl2006-05-261-2/+3
|
* Change C spacing to 4 spaces by default to match PEP 7 for new C files.Brett Cannon2006-05-261-1/+1
|
* substring split now uses /F's fast string matching algorithm.Andrew Dalke2006-05-261-40/+57
| | | | | | | | | | (If compiled without FAST search support, changed the pre-memcmp test to check the last character as well as the first. This gave a 25% speedup for my test case.) Rewrote the split algorithms so they stop when maxsplit gets to 0. Previously they did a string match first then checked if the maxsplit was reached. The new way prevents a needless string search.
* Add rpartition() and path cachingAndrew M. Kuchling2006-05-261-3/+18
|
* Revert tests to MAL's original round sizes to retiain comparabilitySteve Holden2006-05-2617-141/+52
| | | | | from long ago and far away. Stop calling this pybench 1.4 because it isn't. Remove the empty test, which was a bad idea.
* needspeed: rpartition documentation, tests, and a bug fixes.Fredrik Lundh2006-05-263-4/+28
| | | | feel free to add more tests and improve the documentation.
* needforspeed: added rpartition implementationFredrik Lundh2006-05-265-2/+166
|
* removed unnecessary includeFredrik Lundh2006-05-261-2/+0
|
* Need for speed: Patch #921466 : sys.path_importer_cache is now used to cache ↵Georg Brandl2006-05-263-4/+38
| | | | | | | | | | valid and 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.
* Reordered, and wrote more docs.Thomas Heller2006-05-261-74/+127
|
* Use minimum calibration time rather than avergae to avoidSteve Holden2006-05-261-12/+17
| | | | | | the illusion of negative run times. Halt with an error if run times go below 10 ms, indicating that results will be unreliable.
* needforspeed: remove remaining USE_FAST macros; if fastsearch wasFredrik Lundh2006-05-261-67/+2
| | | | broken, someone would have noticed by now ;-)
* needforspeed: cleanupFredrik Lundh2006-05-261-4/+8
|
* needforspeed: stringlib refactoring (in progress)Fredrik Lundh2006-05-263-77/+71
|
* Write some docs.Thomas Heller2006-05-261-0/+40
|
* needforspeed: stringlib refactoring (in progress)Fredrik Lundh2006-05-264-179/+111
|
* Add missing svn:eol-style property to text files.Tim Peters2006-05-261-22/+22
|
* Whitespace normalization.Tim Peters2006-05-262-2/+1
|
* Repair Windows compiler warnings about mixingTim Peters2006-05-261-2/+2
| | | | signed and unsigned integral types in comparisons.
* For now, I gave up with automatic conversion of reST to Python-latex,Thomas Heller2006-05-262-0/+207
| | | | | | so I'm writing this in latex now. Skeleton for the ctypes reference.
* needforspeed: use Py_LOCAL on a few more locals in stringobject.cFredrik Lundh2006-05-261-26/+27
|
* Add -t option to allow easy test selection.Steve Holden2006-05-2617-111/+255
| | | | | | Action verbose option correctly. Tweak operation counts. Add empty and new instances tests. Enable comparisons across different warp factors. Change version.
* fix signed/unsigned mismatch in structBob Ippolito2006-05-261-2/+2
|
* Test for more edge strip cases; leading and trailing separator gets removedAndrew Dalke2006-05-261-0/+2
| | | | even with strip(..., 0)
* Eeked out another 3% or so performance in split whitespace by cleaning up ↵Andrew Dalke2006-05-261-35/+38
| | | | the algorithm.
* Enable PY_USE_INT_WHEN_POSSIBLE in structBob Ippolito2006-05-261-3/+1
|
* Fix _struct typo that broke some 64-bit platformsBob Ippolito2006-05-261-1/+1
|
* Fix distutils so that libffi will cross-compile between darwin/x86 and ↵Bob Ippolito2006-05-262-5/+3
| | | | darwin/ppc
* Typo fixAndrew M. Kuchling2006-05-261-1/+1
|
* Add buffer support for struct, socketAndrew M. Kuchling2006-05-261-8/+40
|
* Explicitly close files. I'm trying to stop the frequent spurious test_tarfileTim Peters2006-05-261-9/+32
| | | | | | 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.
* Changes to string.split/rsplit on whitespace to preallocate space in theAndrew Dalke2006-05-261-56/+75
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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.
* Use open() to open files (was using file()).Tim Peters2006-05-261-10/+10
|
* fix #1229380 No struct.pack exception for some out of range integersBob Ippolito2006-05-262-13/+98
|
* Added more rstrip tests, including for prealloc'ed arraysAndrew Dalke2006-05-261-1/+54
|
* quick hack to fix busted binhex testBob Ippolito2006-05-261-1/+5
|
* Add str.partition()Andrew M. Kuchling2006-05-261-0/+21
|
* Whitespace normalization.Tim Peters2006-05-261-1/+1
|
* Test cases for off-by-one errors in string split with multicharacter pattern.Andrew Dalke2006-05-261-0/+2
|
* I like tests.Andrew Dalke2006-05-261-0/+32
| | | | | | | 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.
generated by cgit v0.12 at 2025-02-18 14:04:04 (GMT)