diff options
| author | Paul Eggert <eggert@cs.ucla.edu> | 2021-08-14 14:18:45 -0700 |
|---|---|---|
| committer | Paul Eggert <eggert@cs.ucla.edu> | 2021-08-14 14:19:55 -0700 |
| commit | e87ccc7038d4f44f4601b3e8775fef09b1420dff (patch) | |
| tree | 4141e7ffa83f803c9e1e44f71a3b22d037644d30 /src | |
| parent | 8b2c31b646d92b7b8757f67aa68d0f2174766b74 (diff) | |
| download | grep-e87ccc7038d4f44f4601b3e8775fef09b1420dff.tar.gz | |
doc: update cites and authors
Diffstat (limited to 'src')
| -rw-r--r-- | src/kwset.c | 18 |
1 files changed, 3 insertions, 15 deletions
diff --git a/src/kwset.c b/src/kwset.c index 792cc018..987e2e5d 100644 --- a/src/kwset.c +++ b/src/kwset.c @@ -19,21 +19,9 @@ /* Written August 1989 by Mike Haertel. */ -/* For the Aho-Corasick algorithm, see: - Aho AV, Corasick MJ. Efficient string matching: an aid to - bibliographic search. CACM 18, 6 (1975), 333-40 - <https://dx.doi.org/10.1145/360825.360855>, which describes the - failure function used below. - - For the Boyer-Moore algorithm, see: Boyer RS, Moore JS. - A fast string searching algorithm. CACM 20, 10 (1977), 762-72 - <https://dx.doi.org/10.1145/359842.359859>. - - For a survey of more-recent string matching algorithms that might - help improve performance, see: Faro S, Lecroq T. The exact online - string matching problem: a review of the most recent results. - ACM Computing Surveys 45, 2 (2013), 13 - <https://dx.doi.org/10.1145/2431211.2431212>. */ +/* For more on the Aho-Corasick and Boyer-Moore algorithms, + as well as other algorithms that might help improve performance, + see the grep manual's "Performance" chapter. */ #include <config.h> |