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

Fix misc typos.

Browse Source 
Oskari Saarenmaa. Backpatch to stable branches where applicable.
This commit is contained in:
Heikki Linnakangas
2015-09-05 11:35:49 +03:00
parent 81ee435c42
commit 567acf259b
5 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
contrib/btree_gist/btree_ts.c
View File

@ -254,7 +254,7 @@ gbt_ts_penalty(PG_FUNCTION_ARGS)
newdbl[2]; newdbl[2];
/* /*
* We are allways using "double" timestamps here. Precision should be good * We are always using "double" timestamps here. Precision should be good
* enough. * enough.
*/ */
orgdbl[0] = ((double) origentry->lower); orgdbl[0] = ((double) origentry->lower);

2
contrib/btree_gist/btree_utils_var.c
View File

@ -36,7 +36,7 @@ gbt_var_decompress(PG_FUNCTION_ARGS)
PG_RETURN_POINTER(entry); PG_RETURN_POINTER(entry);
} }
/* Returns a better readable representaion of variable key ( sets pointer ) */ /* Returns a better readable representation of variable key ( sets pointer ) */
GBT_VARKEY_R GBT_VARKEY_R
gbt_var_key_readable(const GBT_VARKEY *k) gbt_var_key_readable(const GBT_VARKEY *k)
{ {

2
src/backend/access/common/heaptuple.c
View File

@ -808,7 +808,7 @@ heap_modify_tuple(HeapTuple tuple,
* repl information, as appropriate. * repl information, as appropriate.
* *
* NOTE: it's debatable whether to use heap_deform_tuple() here or just * NOTE: it's debatable whether to use heap_deform_tuple() here or just
* heap_getattr() only the non-replaced colums. The latter could win if * heap_getattr() only the non-replaced columns. The latter could win if
* there are many replaced columns and few non-replaced ones. However, * there are many replaced columns and few non-replaced ones. However,
* heap_deform_tuple costs only O(N) while the heap_getattr way would cost * heap_deform_tuple costs only O(N) while the heap_getattr way would cost
* O(N^2) if there are many non-replaced columns, so it seems better to * O(N^2) if there are many non-replaced columns, so it seems better to

4
src/backend/access/gin/ginfast.c
View File

@ -841,8 +841,8 @@ ginInsertCleanup(Relation index, GinState *ginstate,
* locking */ * locking */
/* /*
* remove readed pages from pending list, at this point all * remove read pages from pending list, at this point all
* content of readed pages is in regular structure * content of read pages is in regular structure
*/ */
if (shiftList(index, metabuffer, blkno, stats)) if (shiftList(index, metabuffer, blkno, stats))
{ {

2
src/backend/optimizer/path/costsize.c
View File

@ -869,7 +869,7 @@ cost_tidscan(Path *path, PlannerInfo *root,
/* /*
* The TID qual expressions will be computed once, any other baserestrict * The TID qual expressions will be computed once, any other baserestrict
* quals once per retrived tuple. * quals once per retrieved tuple.
*/ */
cost_qual_eval(&tid_qual_cost, tidquals, root); cost_qual_eval(&tid_qual_cost, tidquals, root);