diff options
| author | Thomas Munro | 2018-08-26 21:32:59 +0000 |
|---|---|---|
| committer | Thomas Munro | 2018-08-26 21:32:59 +0000 |
| commit | 18e586741b41713bec31effbde96ccd6da0a4361 (patch) | |
| tree | da80f1a81c7c7401335bfa5bea0b330f4f4f095d /src/backend/partitioning | |
| parent | bff84a547d71cd466c21f9c4625e64340aab7dd2 (diff) | |
Fix typos.
Author: David Rowley
Discussion: https://postgr.es/m/CAKJS1f8du35u5DprpykWvgNEScxapbWYJdHq%2Bz06Wj3Y2KFPbw%40mail.gmail.com
Diffstat (limited to 'src/backend/partitioning')
| -rw-r--r-- | src/backend/partitioning/partprune.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/backend/partitioning/partprune.c b/src/backend/partitioning/partprune.c index 0dd55ac1ba3..b5c1c7d4dd0 100644 --- a/src/backend/partitioning/partprune.c +++ b/src/backend/partitioning/partprune.c @@ -1428,7 +1428,7 @@ gen_prune_steps_from_opexps(PartitionScheme part_scheme, /* * For each clause for the "last" column, after appending * the clause's own expression to the 'prefix', we'll - * generate one step using the so generated vector and and + * generate one step using the so generated vector and * assign = as its strategy. Actually, 'prefix' might * contain multiple clauses for the same key, in which * case, we must generate steps for various combinations @@ -2828,9 +2828,9 @@ get_matching_range_bounds(PartitionPruneContext *context, } /* - * Skip a gap. See the above comment about how we decide whether or or - * not to scan the default partition based whether the datum that will - * become the maximum datum is finite or not. + * Skip a gap. See the above comment about how we decide whether or not + * to scan the default partition based whether the datum that will become + * the maximum datum is finite or not. */ if (maxoff >= 1 && partindices[maxoff] < 0) { |