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:35:49 +0300 |
| commit | c80b5f66c6faff085e312492be0aa50754e99eb9 (patch) | |
| tree | cee081a32310c6572265d40c32e567d3c19ab2c9 /src/backend/access/gist/gistproc.c | |
| parent | c39f5674dfc77802b4245dd92cb4b1e35499a5a5 (diff) | |
| download | postgresql-c80b5f66c6faff085e312492be0aa50754e99eb9.tar.gz | |
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 4cea3f1be1..22ae31c0f8 100644 --- a/src/backend/access/gist/gistproc.c +++ b/src/backend/access/gist/gistproc.c @@ -588,7 +588,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: @@ -638,7 +638,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; |