diff options
author | Junio C Hamano <gitster@pobox.com> | 2013-04-12 13:54:01 -0700 |
---|---|---|
committer | Junio C Hamano <gitster@pobox.com> | 2013-04-12 13:54:01 -0700 |
commit | caa7d79f1f7c9940acfaf161b9b84bbf81980d95 (patch) | |
tree | bbfbe6ac84575766b4752e48960d12288a8b6c42 /kwset.c | |
parent | e2af9e361b1d7452492baa073790b19292f9c038 (diff) | |
parent | a46221e9adcf3deb88c4fc904859205bf87f784c (diff) | |
download | git-caa7d79f1f7c9940acfaf161b9b84bbf81980d95.tar.gz |
Sync with 'maint'
* maint:
Correct common spelling mistakes in comments and tests
kwset: fix spelling in comments
precompose-utf8: fix spelling of "want" in error message
compat/nedmalloc: fix spelling in comments
compat/regex: fix spelling and grammar in comments
obstack: fix spelling of similar
contrib/subtree: fix spelling of accidentally
git-remote-mediawiki: spelling fixes
doc: various spelling fixes
fast-export: fix argument name in error messages
Documentation: distinguish between ref and offset deltas in pack-format
i18n: make the translation of -u advice in one go
Diffstat (limited to 'kwset.c')
-rw-r--r-- | kwset.c | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -26,7 +26,7 @@ The author may be reached (Email) at the address mike@ai.mit.edu, or (US mail) as Mike Haertel c/o Free Software Foundation. */ -/* The algorithm implemented by these routines bears a startling resemblence +/* The algorithm implemented by these routines bears a startling resemblance to one discovered by Beate Commentz-Walter, although it is not identical. See "A String Matching Algorithm Fast on the Average," Technical Report, IBM-Germany, Scientific Center Heidelberg, Tiergartenstrasse 15, D-6900 @@ -435,7 +435,7 @@ kwsprep (kwset_t kws) /* Update the delta table for the descendents of this node. */ treedelta(curr->links, curr->depth, delta); - /* Compute the failure function for the decendents of this node. */ + /* Compute the failure function for the descendants of this node. */ treefails(curr->links, curr->fail, kwset->trie); /* Update the shifts at each node in the current node's chain |