diff options
| author | Thomas Munro <tmunro@postgresql.org> | 2018-08-27 09:32:59 +1200 |
|---|---|---|
| committer | Thomas Munro <tmunro@postgresql.org> | 2018-08-27 09:34:35 +1200 |
| commit | 9ca2207990002a2fd594fd7f9776d9d91acba189 (patch) | |
| tree | fc3841ad70c3ab058f0d3e05cbf4625dddc0363d | |
| parent | f8fc5f5f50dbabec866dee79cd739bb3f68052a1 (diff) | |
| download | postgresql-9ca2207990002a2fd594fd7f9776d9d91acba189.tar.gz postgresql-9ca2207990002a2fd594fd7f9776d9d91acba189.zip | |
Fix typos.
Author: David Rowley
Discussion: https://postgr.es/m/CAKJS1f8du35u5DprpykWvgNEScxapbWYJdHq%2Bz06Wj3Y2KFPbw%40mail.gmail.com
| -rw-r--r-- | src/backend/partitioning/partprune.c | 8 | ||||
| -rw-r--r-- | src/backend/statistics/dependencies.c | 2 | ||||
| -rw-r--r-- | src/backend/utils/adt/geo_spgist.c | 8 |
3 files changed, 9 insertions, 9 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) { diff --git a/src/backend/statistics/dependencies.c b/src/backend/statistics/dependencies.c index 3b4a09b1a7e..140783cfb3a 100644 --- a/src/backend/statistics/dependencies.c +++ b/src/backend/statistics/dependencies.c @@ -395,7 +395,7 @@ statext_dependencies_build(int numrows, HeapTuple *rows, Bitmapset *attrs, degree = dependency_degree(numrows, rows, k, dependency, stats, attrs); /* - * if the dependency seems entirely invalid, don't store it it + * if the dependency seems entirely invalid, don't store it */ if (degree == 0.0) continue; diff --git a/src/backend/utils/adt/geo_spgist.c b/src/backend/utils/adt/geo_spgist.c index 06411aea9ec..a4bdab19fd9 100644 --- a/src/backend/utils/adt/geo_spgist.c +++ b/src/backend/utils/adt/geo_spgist.c @@ -35,10 +35,10 @@ * * We are using traversal values provided by SP-GiST to calculate and * to store the bounds of the quadrants, while traversing into the tree. - * Traversal value has all the boundaries in the 4D space, and is is - * capable of transferring the required boundaries to the following - * traversal values. In conclusion, three things are necessary - * to calculate the next traversal value: + * Traversal value has all the boundaries in the 4D space, and is capable + * of transferring the required boundaries to the following traversal + * values. In conclusion, three things are necessary to calculate the + * next traversal value: * * (1) the traversal value of the parent * (2) the quadrant of the current node |