summaryrefslogtreecommitdiff
path: root/contrib/pg_trgm/trgm_gin.c
diff options
context:
space:
mode:
Diffstat (limited to 'contrib/pg_trgm/trgm_gin.c')
-rw-r--r--contrib/pg_trgm/trgm_gin.c4
1 files changed, 2 insertions, 2 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.
*/