database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-06-13 07:41:39 +03:00
Code Activity

Assorted comment fixes, mostly just typos, but some obsolete statements.

Browse Source 
YAMAMOTO Takashi
This commit is contained in:
Tom Lane
2012-01-29 19:23:56 -05:00
parent dd243b3e40
commit ad10853b30
11 changed files with 24 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/backend/access/gist/gist.c
View File

@ -253,7 +253,7 @@ gistplacetopage(Relation rel, Size freespace, GISTSTATE *giststate,
}
/*
* Now that we know whick blocks the new pages go to, set up downlink
* Now that we know which blocks the new pages go to, set up downlink
* tuples to point to them.
*/
for (ptr = dist; ptr; ptr = ptr->next)

3
src/backend/access/gist/gistproc.c
View File

@ -1,7 +1,8 @@
/*-------------------------------------------------------------------------
*
* gistproc.c
* Support procedures for GiSTs over 2-D objects (boxes, polygons, circles).
* Support procedures for GiSTs over 2-D objects (boxes, polygons, circles,
* points).
*
* This gives R-tree behavior, with Guttman's poly-time split algorithm.
*

14
src/backend/access/gist/gistsplit.c
View File

@ -29,7 +29,7 @@ typedef struct
/*
* Forms unions of subkeys after page split, but
* uses only tuples aren't in groups of equalent tuples
* uses only tuples that aren't in groups of equivalent tuples
*/
static void
gistunionsubkeyvec(GISTSTATE *giststate, IndexTuple *itvec,
@ -200,8 +200,8 @@ do { \
/*
* adjust left and right unions according to splits by previous
* split by firsts columns. This function is called only in case
* when pickSplit doesn't support subspplit.
* split by first columns. This function is called only in case
* when pickSplit doesn't support subsplit.
*/
static void
@ -503,8 +503,8 @@ gistSplitHalf(GIST_SPLITVEC *v, int len)
}
/*
* trys to split page by attno key, in a case of null
* values move its to separate page.
* tries to split page by attno key, in case of null
* values move those to separate page.
*/
void
gistSplitByKey(Relation r, Page page, IndexTuple *itup, int len, GISTSTATE *giststate,
@ -531,7 +531,7 @@ gistSplitByKey(Relation r, Page page, IndexTuple *itup, int len, GISTSTATE *gist
{
/*
* Corner case: All keys in attno column are null, we should try to
* split by keys in next column. It all keys in all columns are NULL
* split by keys in next column. If all keys in all columns are NULL
* just split page half by half
*/
v->spl_risnull[attno] = v->spl_lisnull[attno] = TRUE;
@ -582,7 +582,7 @@ gistSplitByKey(Relation r, Page page, IndexTuple *itup, int len, GISTSTATE *gist
{
/*
* simple case: left and right keys for attno column are
* equial
* equal
*/
gistSplitByKey(r, page, itup, len, giststate, v, entryvec, attno + 1);
}

6
src/backend/access/gist/gistutil.c
View File

@ -22,7 +22,7 @@
#include "utils/builtins.h"
/*
* static *S used for temrorary storage (saves stack and palloc() call)
* static *S used for temporary storage (saves stack and palloc() call)
*/
static Datum attrS[INDEX_MAX_KEYS];
@ -148,8 +148,8 @@ gistfillitupvec(IndexTuple *vec, int veclen, int *memlen)
}
/*
* Make unions of keys in IndexTuple vector, return FALSE if itvec contains
* invalid tuple. Resulting Datums aren't compressed.
* Make unions of keys in IndexTuple vector.
* Resulting Datums aren't compressed.
*/
void

2
src/backend/access/gist/gistvacuum.c
View File

@ -131,7 +131,7 @@ pushStackIfSplited(Page page, GistBDItem *stack)
/*
* Bulk deletion of all index entries pointing to a set of heap tuples and
* check invalid tuples after crash recovery.
* check invalid tuples left after upgrade.
* The set of target tuples is specified via a callback routine that tells
* whether any given heap tuple (identified by ItemPointer) is being deleted.
*