From: Peter Eisentraut Date: Wed, 2 May 2012 17:14:39 +0000 (+0300) Subject: Even more duplicate word removal, in the spirit of the season X-Git-Tag: REL9_2_BETA1~62 X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=e9605a039b60350003daf8a5b3c0c10993994b60;p=postgresql Even more duplicate word removal, in the spirit of the season --- diff --git a/contrib/fuzzystrmatch/levenshtein.c b/contrib/fuzzystrmatch/levenshtein.c index 90d4f2169d..32827cb5f6 100644 --- a/contrib/fuzzystrmatch/levenshtein.c +++ b/contrib/fuzzystrmatch/levenshtein.c @@ -349,8 +349,8 @@ levenshtein_internal(text *s, text *t, * remaining portions of the strings are of equal length. There * are (n - 1) characters in the target string, of which j have * been transformed. There are (m - 1) characters in the source - * string, so we want to find the value for zp where where (n - 1) - * - j = (m - 1) - zp. + * string, so we want to find the value for zp where (n - 1) - j = + * (m - 1) - zp. */ int zp = j - (n - m); diff --git a/contrib/pgcrypto/crypt-md5.c b/contrib/pgcrypto/crypt-md5.c index 7aa57bc319..6c7a2b329e 100644 --- a/contrib/pgcrypto/crypt-md5.c +++ b/contrib/pgcrypto/crypt-md5.c @@ -34,7 +34,7 @@ char * px_crypt_md5(const char *pw, const char *salt, char *passwd, unsigned dstlen) { static char *magic = "$1$"; /* This string is magic for this algorithm. - * Having it this way, we can get get better + * Having it this way, we can get better * later on */ static char *p; static const char *sp, diff --git a/src/backend/tsearch/wparser_def.c b/src/backend/tsearch/wparser_def.c index 4b76997854..f2ec784ac2 100644 --- a/src/backend/tsearch/wparser_def.c +++ b/src/backend/tsearch/wparser_def.c @@ -2508,7 +2508,7 @@ prsd_headline(PG_FUNCTION_ARGS) List *prsoptions = (List *) PG_GETARG_POINTER(1); TSQuery query = PG_GETARG_TSQUERY(2); - /* from opt + start and and tag */ + /* from opt + start and end tag */ int min_words = 15; int max_words = 35; int shortword = 3;