From 64676ea3368619e84f8e14d20e1599f9f8bd3573 Mon Sep 17 00:00:00 2001 From: Justin Pryzby Date: Mon, 17 Feb 2020 12:33:42 -0600 Subject: [PATCH v4 12/12] comment typos --- contrib/pgcrypto/imath.c | 4 ++-- src/backend/access/transam/multixact.c | 2 +- src/backend/partitioning/partbounds.c | 2 +- src/include/lib/simplehash.h | 2 +- 4 files changed, 5 insertions(+), 5 deletions(-) diff --git a/contrib/pgcrypto/imath.c b/contrib/pgcrypto/imath.c index da4cdede76..a05a4bf5fd 100644 --- a/contrib/pgcrypto/imath.c +++ b/contrib/pgcrypto/imath.c @@ -3232,7 +3232,7 @@ s_embar(mp_int a, mp_int b, mp_int m, mp_int mu, mp_int c) We diverge from Knuth's algorithm in that we do not perform the subtraction from the remainder until we have determined that we have the correct - quotient digit. This makes our algorithm less efficient that Knuth because + quotient digit. This makes our algorithm less efficient than Knuth because we might have to perform multiple multiplication and comparison steps before the subtraction. The advantage is that it is easy to implement and ensure correctness without worrying about underflow from the subtraction. @@ -3355,7 +3355,7 @@ s_udiv_knuth(mp_int u, mp_int v) /* * Check to see if qhat > b, and decrease qhat if so. Theorem B - * guarantess that qhat is at most 2 larger than the actual value, so + * guarantees that qhat is at most 2 larger than the actual value, so * it is possible that qhat is greater than the maximum value that * will fit in a digit */ diff --git a/src/backend/access/transam/multixact.c b/src/backend/access/transam/multixact.c index 70d0e1c215..e2aa5c9ce4 100644 --- a/src/backend/access/transam/multixact.c +++ b/src/backend/access/transam/multixact.c @@ -2666,7 +2666,7 @@ SetOffsetVacuumLimit(bool is_startup) * We use this to determine whether the addition is "wrapping around" the * boundary point, hence the name. The reason we don't want to use the regular * 2^31-modulo arithmetic here is that we want to be able to use the whole of - * the 2^32-1 space here, allowing for more multixacts that would fit + * the 2^32-1 space here, allowing for more multixacts than would fit * otherwise. */ static bool diff --git a/src/backend/partitioning/partbounds.c b/src/backend/partitioning/partbounds.c index 4681441dcc..b9c65ff87c 100644 --- a/src/backend/partitioning/partbounds.c +++ b/src/backend/partitioning/partbounds.c @@ -1224,7 +1224,7 @@ merge_list_bounds(FmgrInfo *partsupfunc, Oid *partcollation, Assert(inner_index >= 0); /* - * Try merging both paritions. If successful, add the list value + * Try merging both partitions. If successful, add the list value * and index of the merged partition below. */ merged_index = merge_matching_partitions(&outer_map, &inner_map, diff --git a/src/include/lib/simplehash.h b/src/include/lib/simplehash.h index f7af921f5a..88f4c9a53f 100644 --- a/src/include/lib/simplehash.h +++ b/src/include/lib/simplehash.h @@ -560,7 +560,7 @@ restart: uint32 curoptimal; SH_ELEMENT_TYPE *entry = &data[curelem]; - /* any empty bucket can directly be used */ + /* any empty bucket can be used directly */ if (entry->status == SH_STATUS_EMPTY) { tb->members++; -- 2.17.0