mirror/postgresql
2
0
Fork 0
mirror of https://git.postgresql.org/git/postgresql.git synced 2025-02-23 19:39:53 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix typos.

Browse Source 
Author: David Rowley
Discussion: https://postgr.es/m/CAKJS1f8du35u5DprpykWvgNEScxapbWYJdHq%2Bz06Wj3Y2KFPbw%40mail.gmail.com
This commit is contained in:
Thomas Munro 2018-08-27 09:32:59 +12:00
parent bff84a547d
commit 18e586741b
3 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/backend/partitioning/partprune.c
View File

@ -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)
{

2
src/backend/statistics/dependencies.c
View File

@ -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;

8
src/backend/utils/adt/geo_spgist.c
View File

@ -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