| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | MFC: | Daniel C. Sobral | 2000-07-31 | 1 | -0/+5 |
| | | | | | | | | | | | | | | | | | | | | | | | | engine.c: 1.6 through 1.9 regcomp.c: 1.14 through 1.23 regex.3: 1.5 regex2.h: 1.4 and 1.5 regfree.c: 1.2 and 1.3 Improve search heuristics by: 1. Using Boyer-Moore algorithm for search the "must" string when those strings are at least 4 characters in length. 2. Use the point at which the must string was found to compute the earliest possible point at which the pattern may be found, if possible. Correct the BUGS section of the man page. PR: 15561 PR: 14342 Notes: svn path=/stable/4/; revision=64043 | ||||
| * | int -> long changes that reduce the diffs with the NetBSD version to | John Birrell | 1998-05-14 | 1 | -22/+22 |
| | | | | | | | | work in a 64-bit environment. Notes: svn path=/head/; revision=36043 | ||||
| * | Use locale for character classes instead of hardcoded values | Andrey A. Chernov | 1996-08-11 | 1 | -4/+4 |
| | | | | | | | | Misc 8bit cleanup Notes: svn path=/head/; revision=17508 | ||||
| * | BSD 4.4 Lite Lib Sources | Rodney W. Grimes | 1994-05-27 | 1 | -0/+173 |
| Notes: svn path=/cvs2svn/branches/unlabeled-1.1.1/; revision=1573 | |||||
