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

Commit2960229

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

File tree

11 files changed

+15
-15
lines changed

11 files changed

+15
-15
lines changed

‎contrib/btree_gist/btree_ts.c‎

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

364364
/*
365-
* We areallways using "double" timestamps here. Precision should be good
365+
* We arealways using "double" timestamps here. Precision should be good
366366
* enough.
367367
*/
368368
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
@@ -51,7 +51,7 @@ gbt_var_decompress(PG_FUNCTION_ARGS)
5151
PG_RETURN_POINTER(entry);
5252
}
5353

54-
/* Returns a better readablerepresentaion of variable key ( sets pointer ) */
54+
/* Returns a better readablerepresentation of variable key ( sets pointer ) */
5555
GBT_VARKEY_R
5656
gbt_var_key_readable(constGBT_VARKEY*k)
5757
{

‎contrib/cube/cube.c‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -819,7 +819,7 @@ cube_inter(PG_FUNCTION_ARGS)
819819
Max(LL_COORD(b,i),UR_COORD(b,i))
820820
);
821821
}
822-
/* continue on the higherdimemsions only present in 'a' */
822+
/* continue on the higherdimensions only present in 'a' */
823823
for (;i<DIM(a);i++)
824824
{
825825
result->x[i]=Max(0,

‎doc/src/sgml/sources.sgml‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -251,7 +251,7 @@ ereport(ERROR,
251251
</listitem>
252252
<listitem>
253253
<para>
254-
<function>errdetail_log_plural(const char *fmt_singuar, const char
254+
<function>errdetail_log_plural(const char *fmt_singular, const char
255255
*fmt_plural, unsigned long n, ...)</function> is like
256256
<function>errdetail_log</>, but with support for various plural forms of
257257
the message.

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -807,7 +807,7 @@ heap_modify_tuple(HeapTuple tuple,
807807
* repl information, as appropriate.
808808
*
809809
* NOTE: it's debatable whether to use heap_deform_tuple() here or just
810-
* heap_getattr() only the non-replacedcolums. The latter could win if
810+
* heap_getattr() only the non-replacedcolumns. The latter could win if
811811
* there are many replaced columns and few non-replaced ones. However,
812812
* heap_deform_tuple costs only O(N) while the heap_getattr way would cost
813813
* 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
@@ -881,8 +881,8 @@ ginInsertCleanup(GinState *ginstate,
881881
* locking */
882882

883883
/*
884-
* removereaded pages from pending list, at this point all
885-
* content ofreaded pages is in regular structure
884+
* removeread pages from pending list, at this point all
885+
* content ofread pages is in regular structure
886886
*/
887887
if (shiftList(index,metabuffer,blkno,stats))
888888
{

‎src/backend/access/gist/gistproc.c‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -578,7 +578,7 @@ gist_box_picksplit(PG_FUNCTION_ARGS)
578578
* We first consider splits where b is the lower bound of an entry.
579579
* We iterate through all entries, and for each b, calculate the
580580
* smallest possible a. Then we consider splits where a is the
581-
*uppper bound of an entry, and for each a, calculate the greatest
581+
*upper bound of an entry, and for each a, calculate the greatest
582582
* possible b.
583583
*
584584
* In the above example, the first loop would consider splits:
@@ -628,7 +628,7 @@ gist_box_picksplit(PG_FUNCTION_ARGS)
628628
}
629629

630630
/*
631-
* Iterate over upper bound of left group findinggreates possible
631+
* Iterate over upper bound of left group findinggreatest possible
632632
* lower bound of right group.
633633
*/
634634
i1=nentries-1;

‎src/backend/access/heap/heapam.c‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -5311,7 +5311,7 @@ heap_lock_updated_tuple_rec(Relation rel, ItemPointer tid, TransactionId xid,
53115311
*
53125312
* The initial tuple is assumed to be already locked.
53135313
*
5314-
* This function doesn't check visibility, it justinconditionally marks the
5314+
* This function doesn't check visibility, it justunconditionally marks the
53155315
* tuple(s) as locked. If any tuple in the updated chain is being deleted
53165316
* concurrently (or updated with the key being modified), sleep until the
53175317
* transaction doing it is finished.
@@ -5798,7 +5798,7 @@ heap_prepare_freeze_tuple(HeapTupleHeader tuple, TransactionId cutoff_xid,
57985798
/*
57995799
* NB -- some of these transformations are only valid because we
58005800
* know the return Xid is a tuple updater (i.e. not merely a
5801-
* locker.) Also note that the only reason we don'texplicitely
5801+
* locker.) Also note that the only reason we don'texplicitly
58025802
* worry about HEAP_KEYS_UPDATED is because it lives in
58035803
* t_infomask2 rather than t_infomask.
58045804
*/

‎src/backend/access/heap/rewriteheap.c‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -763,9 +763,9 @@ raw_heap_insert(RewriteState state, HeapTuple tup)
763763
*
764764
* Crash-Safety: This module diverts from the usual patterns of doing WAL
765765
* since it cannot rely on checkpoint flushing out all buffers and thus
766-
* waiting forexlusive locks on buffers. Usually the XLogInsert() covering
766+
* waiting forexclusive locks on buffers. Usually the XLogInsert() covering
767767
* buffer modifications is performed while the buffer(s) that are being
768-
* modified areexlusively locked guaranteeing that both the WAL record and
768+
* modified areexclusively locked guaranteeing that both the WAL record and
769769
* the modified heap are on either side of the checkpoint. But since the
770770
* mapping files we log aren't in shared_buffers that interlock doesn't work.
771771
*

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

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

932932
/*
933933
* The TID qual expressions will be computed once, any other baserestrict
934-
* quals once perretrived tuple.
934+
* quals once perretrieved tuple.
935935
*/
936936
cost_qual_eval(&tid_qual_cost,tidquals,root);
937937

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp