| commit | c5da53ba78cc00d8de448f99eb185067d53302ba | [log] [tgz] |
|---|---|---|
| author | Andrew Dalke <dalke@dalkescientific.com> | Fri May 26 19:02:09 2006 +0000 |
| committer | Andrew Dalke <dalke@dalkescientific.com> | Fri May 26 19:02:09 2006 +0000 |
| tree | 3f74f2eb5ad64f46ff8687fa1aa7ac8a272020c1 | |
| parent | afe6598732b4a8eee9f2d746080cd0bb28f17704 [diff] |
substring split now uses /F's fast string matching algorithm. (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.