Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit567acf2

Browse files
committed
Fix misc typos.
Oskari Saarenmaa. Backpatch to stable branches where applicable.
1 parent81ee435 commit567acf2

File tree

5 files changed

+6
-6
lines changed

5 files changed

+6
-6
lines changed

‎contrib/btree_gist/btree_ts.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -254,7 +254,7 @@ gbt_ts_penalty(PG_FUNCTION_ARGS)
254254
newdbl[2];
255255

256256
/*
257-
* We areallways using "double" timestamps here. Precision should be good
257+
* We arealways using "double" timestamps here. Precision should be good
258258
* enough.
259259
*/
260260
orgdbl[0]= ((double)origentry->lower);

‎contrib/btree_gist/btree_utils_var.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -36,7 +36,7 @@ gbt_var_decompress(PG_FUNCTION_ARGS)
3636
PG_RETURN_POINTER(entry);
3737
}
3838

39-
/* Returns a better readablerepresentaion of variable key ( sets pointer ) */
39+
/* Returns a better readablerepresentation of variable key ( sets pointer ) */
4040
GBT_VARKEY_R
4141
gbt_var_key_readable(constGBT_VARKEY*k)
4242
{

‎src/backend/access/common/heaptuple.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -808,7 +808,7 @@ heap_modify_tuple(HeapTuple tuple,
808808
* repl information, as appropriate.
809809
*
810810
* NOTE: it's debatable whether to use heap_deform_tuple() here or just
811-
* heap_getattr() only the non-replacedcolums. The latter could win if
811+
* heap_getattr() only the non-replacedcolumns. The latter could win if
812812
* there are many replaced columns and few non-replaced ones. However,
813813
* heap_deform_tuple costs only O(N) while the heap_getattr way would cost
814814
* O(N^2) if there are many non-replaced columns, so it seems better to

‎src/backend/access/gin/ginfast.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -841,8 +841,8 @@ ginInsertCleanup(Relation index, GinState *ginstate,
841841
* locking */
842842

843843
/*
844-
* removereaded pages from pending list, at this point all
845-
* content ofreaded pages is in regular structure
844+
* removeread pages from pending list, at this point all
845+
* content ofread pages is in regular structure
846846
*/
847847
if (shiftList(index,metabuffer,blkno,stats))
848848
{

‎src/backend/optimizer/path/costsize.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -869,7 +869,7 @@ cost_tidscan(Path *path, PlannerInfo *root,
869869

870870
/*
871871
* The TID qual expressions will be computed once, any other baserestrict
872-
* quals once perretrived tuple.
872+
* quals once perretrieved tuple.
873873
*/
874874
cost_qual_eval(&tid_qual_cost,tidquals,root);
875875

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp