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:36:24 +0300 |
| commit | 29602295bacf6e1e59abd6b82734f51d9c107ba8 (patch) | |
| tree | 34713fd7b35aba10dbba8d3145af507348da4990 /src/backend/access/gist/gistproc.c | |
| parent | 37d10c524c73cebc88ec9c69adc44917a3d67dcd (diff) | |
| download | postgresql-29602295bacf6e1e59abd6b82734f51d9c107ba8.tar.gz postgresql-29602295bacf6e1e59abd6b82734f51d9c107ba8.zip | |
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 db0bec6e3e5..9517be82478 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; |