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

Commit2bccced

Browse files
committed
Fix typos in comments.
Thom Brown
1 parent5c6d9fc commit2bccced

File tree

11 files changed

+18
-18
lines changed

11 files changed

+18
-18
lines changed

‎contrib/pgcrypto/openssl.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -429,7 +429,7 @@ bf_init(PX_Cipher *c, const uint8 *key, unsigned klen, const uint8 *iv)
429429

430430
/*
431431
* Test if key len is supported. BF_set_key silently cut large keys and it
432-
* could bebea problem when user transfer crypted data from one server
432+
* could be a problem when user transfer crypted data from one server
433433
* to another.
434434
*/
435435

‎doc/src/sgml/gin.sgml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -270,7 +270,7 @@
270270
contains the corresponding query keys. Likewise, the function must
271271
return GIN_FALSE only if the item does not match, whether or not it
272272
contains the GIN_MAYBE keys. If the result depends on the GIN_MAYBE
273-
entries,ie. the match cannot be confirmed or refuted based on the
273+
entries,i.e. the match cannot be confirmed or refuted based on the
274274
known query keys, the function must return GIN_MAYBE.
275275
</para>
276276
<para>

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -933,7 +933,7 @@ keyGetItem(GinState *ginstate, MemoryContext tempCtx, GinScanKey key,
933933
/*
934934
* Ok, we now know that there are no matches < minItem.
935935
*
936-
* If minItem is lossy, it means that theretherewere no exact items on
936+
* If minItem is lossy, it means that there were no exact items on
937937
* the page among requiredEntries, because lossy pointers sort after exact
938938
* items. However, there might be exact items for the same page among
939939
* additionalEntries, so we mustn't advance past them.

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010
* a GIN scan can apply various optimizations, if it can determine that an
1111
* item matches or doesn't match, even if it doesn't know if some of the keys
1212
* are present or not. Hence, it's useful to have a ternary-logic consistent
13-
* function, wherewhereeach key can be TRUE (present), FALSE (not present),
13+
* function, where each key can be TRUE (present), FALSE (not present),
1414
* or MAYBE (don't know if present). This file provides such a ternary-logic
1515
* consistent function, implemented by calling the regular boolean consistent
1616
* function many times, with all the MAYBE arguments set to all combinations

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

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -783,9 +783,9 @@ raw_heap_insert(RewriteState state, HeapTuple tup)
783783
* deal with WAL logging at all - an fsync() at the end of a rewrite would be
784784
* sufficient for crash safety. Any mapping that hasn't been safely flushed to
785785
* disk has to be by an aborted (explicitly or via a crash) transaction and is
786-
* ignored by virtue of the xid init's name being subject to a
786+
* ignored by virtue of the xid inits name being subject to a
787787
* TransactionDidCommit() check. But we want to support having standbys via
788-
* physical replication, both for availability and totodo logical decoding
788+
* physical replication, both for availability and to do logical decoding
789789
* there.
790790
* ------------------------------------------------------------------------
791791
*/
@@ -1046,7 +1046,7 @@ logical_rewrite_log_mapping(RewriteState state, TransactionId xid,
10461046

10471047
/*
10481048
* Perform logical remapping for a tuple that's mapped from old_tid to
1049-
* new_tuple->t_self by rewrite_heap_tuple()iff necessary for the tuple.
1049+
* new_tuple->t_self by rewrite_heap_tuple()if necessary for the tuple.
10501050
*/
10511051
staticvoid
10521052
logical_rewrite_heap_tuple(RewriteStatestate,ItemPointerDataold_tid,

‎src/backend/lib/ilist.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@
2626
/*
2727
* Delete 'node' from list.
2828
*
29-
* It is not allowed to delete a 'node' which isisnot in the list 'head'
29+
* It is not allowed to delete a 'node' which is not in the list 'head'
3030
*
3131
* Caution: this is O(n); consider using slist_delete_current() instead.
3232
*/

‎src/backend/replication/logical/logical.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -293,7 +293,7 @@ CreateInitDecodingContext(char *plugin,
293293
* So we have to acquire the ProcArrayLock to prevent computation of new
294294
* xmin horizons by other backends, get the safe decoding xid, and inform
295295
* the slot machinery about the new limit. Once that's done the
296-
* ProcArrayLock can bebereleased as the slot machinery now is
296+
* ProcArrayLock can be released as the slot machinery now is
297297
* protecting against vacuum.
298298
* ----
299299
*/

‎src/backend/replication/logical/snapbuild.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -55,7 +55,7 @@
5555
*
5656
*
5757
*
58-
* The snapbuild machinery is starting up ininseveral stages, as illustrated
58+
* The snapbuild machinery is starting up in several stages, as illustrated
5959
* by the following graph:
6060
* +-------------------------+
6161
* +----|SNAPBUILD_START |-------------+
@@ -779,7 +779,7 @@ SnapBuildDistributeNewCatalogSnapshot(SnapBuild *builder, XLogRecPtr lsn)
779779
/*
780780
* If we don't have a base snapshot yet, there are no changes in this
781781
* transaction which in turn implies we don't yet need a snapshot at
782-
* all. We'll addadda snapshot when the first change gets queued.
782+
* all. We'll add a snapshot when the first change gets queued.
783783
*
784784
* NB: This works correctly even for subtransactions because
785785
* ReorderBufferCommitChild() takes care to pass the parent the base

‎src/backend/rewrite/rewriteHandler.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2343,7 +2343,7 @@ relation_is_updatable(Oid reloid,
23432343

23442344
/*
23452345
* Determine which of the view's columns are updatable. If there
2346-
* are none within the set ofofcolumns we are looking at, then
2346+
* are none within the set of columns we are looking at, then
23472347
* the view doesn't support INSERT/UPDATE, but it may still
23482348
* support DELETE.
23492349
*/

‎src/backend/utils/adt/json.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -395,7 +395,7 @@ parse_object(JsonLexContext *lex, JsonSemAction *sem)
395395
(*ostart) (sem->semstate);
396396

397397
/*
398-
* Data inside an objectat at a higher nesting level than the object
398+
* Data inside an objectis at a higher nesting level than the object
399399
* itself. Note that we increment this after we call the semantic routine
400400
* for the object start and restore it before we call the routine for the
401401
* object end.
@@ -473,7 +473,7 @@ parse_array(JsonLexContext *lex, JsonSemAction *sem)
473473
(*astart) (sem->semstate);
474474

475475
/*
476-
* Data inside an arrayat at a higher nesting level than the array
476+
* Data inside an arrayis at a higher nesting level than the array
477477
* itself. Note that we increment this after we call the semantic routine
478478
* for the array start and restore it before we call the routine for the
479479
* array end.

‎src/backend/utils/time/tqual.c

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1549,7 +1549,7 @@ HeapTupleHeaderIsOnlyLocked(HeapTupleHeader tuple)
15491549
}
15501550

15511551
/*
1552-
* check whether the transaciont id 'xid'in in the pre-sorted array 'xip'.
1552+
* check whether the transaciont id 'xid'is in the pre-sorted array 'xip'.
15531553
*/
15541554
staticbool
15551555
TransactionIdInArray(TransactionIdxid,TransactionId*xip,Sizenum)
@@ -1589,7 +1589,7 @@ HeapTupleSatisfiesHistoricMVCC(HeapTuple htup, Snapshot snapshot,
15891589
Assert(!TransactionIdDidCommit(xmin));
15901590
return false;
15911591
}
1592-
/* check ifits one of our txids, toplevel is also in there */
1592+
/* check ifit's one of our txids, toplevel is also in there */
15931593
elseif (TransactionIdInArray(xmin,snapshot->subxip,snapshot->subxcnt))
15941594
{
15951595
boolresolved;
@@ -1598,7 +1598,7 @@ HeapTupleSatisfiesHistoricMVCC(HeapTuple htup, Snapshot snapshot,
15981598

15991599
/*
16001600
* another transaction might have (tried to) delete this tuple or
1601-
* cmin/cmax was stored in a combocid.S we need to to lookup the
1601+
* cmin/cmax was stored in a combocid.So we need to lookup the
16021602
* actual values externally.
16031603
*/
16041604
resolved=ResolveCminCmaxDuringDecoding(HistoricSnapshotGetTupleCids(),snapshot,
@@ -1662,7 +1662,7 @@ HeapTupleSatisfiesHistoricMVCC(HeapTuple htup, Snapshot snapshot,
16621662
xmax=HeapTupleGetUpdateXid(tuple);
16631663
}
16641664

1665-
/* check ifits one of our txids, toplevel is also in there */
1665+
/* check ifit's one of our txids, toplevel is also in there */
16661666
if (TransactionIdInArray(xmax,snapshot->subxip,snapshot->subxcnt))
16671667
{
16681668
boolresolved;

0 commit comments

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