diff options
| author | Heikki Linnakangas <heikki.linnakangas@iki.fi> | 2015-09-05 11:35:49 +0300 |
|---|---|---|
| committer | Heikki Linnakangas <heikki.linnakangas@iki.fi> | 2015-09-05 11:37:22 +0300 |
| commit | 658ec626406342211837280a6eb0f836f7d14429 (patch) | |
| tree | 4918ef9330bc1b351115d2573137b75e8bc8fab6 /src/backend/access/gist/gistproc.c | |
| parent | 9e9b310d8bcac76bf19f99f3c90e7c08366c52f7 (diff) | |
Fix misc typos.
Oskari Saarenmaa. Backpatch to stable branches where applicable.
Diffstat (limited to 'src/backend/access/gist/gistproc.c')
| -rw-r--r-- | src/backend/access/gist/gistproc.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/backend/access/gist/gistproc.c b/src/backend/access/gist/gistproc.c index 3a45781d0e1..a1ba58a23c1 100644 --- a/src/backend/access/gist/gistproc.c +++ b/src/backend/access/gist/gistproc.c @@ -578,7 +578,7 @@ gist_box_picksplit(PG_FUNCTION_ARGS) * We first consider splits where b is the lower bound of an entry. * We iterate through all entries, and for each b, calculate the * smallest possible a. Then we consider splits where a is the - * uppper bound of an entry, and for each a, calculate the greatest + * upper bound of an entry, and for each a, calculate the greatest * possible b. * * In the above example, the first loop would consider splits: @@ -628,7 +628,7 @@ gist_box_picksplit(PG_FUNCTION_ARGS) } /* - * Iterate over upper bound of left group finding greates possible + * Iterate over upper bound of left group finding greatest possible * lower bound of right group. */ i1 = nentries - 1; |