diff options
Diffstat (limited to 'contrib')
| -rw-r--r-- | contrib/pg_trgm/trgm_gin.c | 4 | ||||
| -rw-r--r-- | contrib/pg_trgm/trgm_op.c | 2 |
2 files changed, 3 insertions, 3 deletions
diff --git a/contrib/pg_trgm/trgm_gin.c b/contrib/pg_trgm/trgm_gin.c index 6805e3e9b2..8c19041591 100644 --- a/contrib/pg_trgm/trgm_gin.c +++ b/contrib/pg_trgm/trgm_gin.c @@ -210,7 +210,7 @@ gin_trgm_consistent(PG_FUNCTION_ARGS) * And again, c (ntrue) is a lower bound of len2, but c <= len1 * just by definition and, consequently, upper bound of * similarity is just c / len1. - * So, independly on DIVUNION the upper bound formula is the same. + * So, independently on DIVUNION the upper bound formula is the same. */ res = (nkeys == 0) ? false : (((((float4) ntrue) / ((float4) nkeys))) >= nlimit); @@ -330,7 +330,7 @@ gin_trgm_triconsistent(PG_FUNCTION_ARGS) else { /* - * As trigramsMatchGraph implements a montonic boolean function, + * As trigramsMatchGraph implements a monotonic boolean function, * promoting all GIN_MAYBE keys to GIN_TRUE will give a * conservative result. */ diff --git a/contrib/pg_trgm/trgm_op.c b/contrib/pg_trgm/trgm_op.c index 3ca6e5e951..b728cc1abd 100644 --- a/contrib/pg_trgm/trgm_op.c +++ b/contrib/pg_trgm/trgm_op.c @@ -628,7 +628,7 @@ calc_word_similarity(char *str1, int slen1, char *str2, int slen2, /* - * Extract the next non-wildcard part of a search string, ie, a word bounded + * Extract the next non-wildcard part of a search string, i.e. a word bounded * by '_' or '%' meta-characters, non-word characters or string end. * * str: source string, of length lenstr bytes (need not be null-terminated) |