Fix misc typos.
Oskari Saarenmaa. Backpatch to stable branches where applicable.
This commit is contained in:
parent
81ee435c42
commit
567acf259b
|
@ -254,7 +254,7 @@ gbt_ts_penalty(PG_FUNCTION_ARGS)
|
|||
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.
|
||||
*/
|
||||
orgdbl[0] = ((double) origentry->lower);
|
||||
|
|
|
@ -36,7 +36,7 @@ gbt_var_decompress(PG_FUNCTION_ARGS)
|
|||
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_var_key_readable(const GBT_VARKEY *k)
|
||||
{
|
||||
|
|
|
@ -808,7 +808,7 @@ heap_modify_tuple(HeapTuple tuple,
|
|||
* repl information, as appropriate.
|
||||
*
|
||||
* 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,
|
||||
* 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
|
||||
|
|
|
@ -841,8 +841,8 @@ ginInsertCleanup(Relation index, GinState *ginstate,
|
|||
* locking */
|
||||
|
||||
/*
|
||||
* remove readed pages from pending list, at this point all
|
||||
* content of readed pages is in regular structure
|
||||
* remove read pages from pending list, at this point all
|
||||
* content of read pages is in regular structure
|
||||
*/
|
||||
if (shiftList(index, metabuffer, blkno, stats))
|
||||
{
|
||||
|
|
|
@ -869,7 +869,7 @@ cost_tidscan(Path *path, PlannerInfo *root,
|
|||
|
||||
/*
|
||||
* 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);
|
||||
|
||||
|
|
Loading…
Reference in New Issue