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

Commit7ef8b52

Browse files
committed
Fix typos and grammar in comments and docs
Author: Justin PryzbyDiscussion:https://postgr.es/m/20210416070310.GG3315@telsasoft.com
1 parentc731f91 commit7ef8b52

File tree

26 files changed

+47
-47
lines changed

26 files changed

+47
-47
lines changed

‎contrib/amcheck/verify_heapam.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -930,7 +930,7 @@ check_tuple_visibility(HeapCheckContext *ctx)
930930
* If xmin_status happens to be XID_IS_CURRENT_XID, then in theory
931931
* any such DDL changes ought to be visible to us, so perhaps
932932
* we could check anyway in that case. But, for now, let's be
933-
*conservate and treat this like any other uncommitted insert.
933+
*conservative and treat this like any other uncommitted insert.
934934
*/
935935
return false;
936936
}

‎doc/src/sgml/brin.sgml

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -730,7 +730,7 @@ LOG: request for BRIN range summarization for index "brin_wi_idx" page 128 was
730730
for <xref linkend="sql-altertable"/>. When set to a positive value,
731731
each block range is assumed to contain this number of distinct non-null
732732
values. When set to a negative value, which must be greater than or
733-
equal to -1, the number of distinct non-null is assumedlinear with
733+
equal to -1, the number of distinct non-nullvaluesis assumedto grow linearly with
734734
the maximum possible number of tuples in the block range (about 290
735735
rows per block). The default value is <literal>-0.1</literal>, and
736736
the minimum number of distinct non-null values is <literal>16</literal>.
@@ -833,7 +833,7 @@ typedef struct BrinOpcInfo
833833
Returns whether all the ScanKey entries are consistent with the given
834834
indexed values for a range.
835835
The attribute number to use is passed as part of the scan key.
836-
Multiple scan keys for the same attribute may be passed at once, the
836+
Multiple scan keys for the same attribute may be passed at once; the
837837
number of entries is determined by the <literal>nkeys</literal> parameter.
838838
</para>
839839
</listitem>
@@ -1214,7 +1214,7 @@ typedef struct BrinOpcInfo
12141214

12151215
<para>
12161216
The minmax-multi operator class is also intended for data types implementing
1217-
a totally orderedsets, and may be seen as a simple extension of the minmax
1217+
a totally orderedset, and may be seen as a simple extension of the minmax
12181218
operator class. While minmax operator class summarizes values from each block
12191219
range into a single contiguous interval, minmax-multi allows summarization
12201220
into multiple smaller intervals to improve handling of outlier values.

‎doc/src/sgml/ecpg.sgml

Lines changed: 12 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -354,15 +354,15 @@ current=testdb1 (should be testdb1)
354354
</para>
355355

356356
<para>
357-
The third option is to declaresql identifier linked to
357+
The third option is to declarea SQL identifier linked to
358358
the connection, for example:
359359
<programlisting>
360360
EXEC SQL AT <replaceable>connection-name</replaceable> DECLARE <replaceable>statement-name</replaceable> STATEMENT;
361361
EXEC SQL PREPARE <replaceable>statement-name</replaceable> FROM :<replaceable>dyn-string</replaceable>;
362362
</programlisting>
363-
Once you link asql identifier to a connection, you execute a dynamic SQL
364-
without AT clause. Note that this option behaves like preprocessor directives,
365-
therefore the link is enabled only in the file.
363+
Once you link aSQL identifier to a connection, you execute dynamic SQL
364+
withoutanAT clause. Note that this option behaves like preprocessor
365+
directives,therefore the link is enabled only in the file.
366366
</para>
367367
<para>
368368
Here is an example program using this option:
@@ -6911,15 +6911,15 @@ EXEC SQL [ AT <replaceable class="parameter">connection_name</replaceable> ] DEC
69116911
<title>Description</title>
69126912

69136913
<para>
6914-
<command>DECLARE STATEMENT</command> declares SQL statement identifier.
6914+
<command>DECLARE STATEMENT</command> declaresaSQL statement identifier.
69156915
SQL statement identifier can be associated with the connection.
6916-
When the identifier is used by dynamic SQL statements,these SQLs are executed
6917-
by using the associated connection.
6918-
The namespace of the declaration is the precompile unit, and multiple declarations to
6919-
the same SQL statement identifieris not allowed.
6920-
6921-
Note that if the precompiler run in the Informix compatibility mode and some SQL statement
6922-
is declared, "database" can not be used as a cursorname.
6916+
When the identifier is used by dynamic SQL statements,the statements
6917+
are executed using the associated connection.
6918+
The namespace of the declaration is the precompile unit, and multiple
6919+
declarations tothe same SQL statement identifierare not allowed.
6920+
Note that if the precompiler runs in Informix compatibility mode and
6921+
some SQL statement is declared, "database" can not be used as a cursor
6922+
name.
69236923
</para>
69246924
</refsect1>
69256925

‎src/backend/access/brin/brin.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -596,7 +596,7 @@ bringetbitmap(IndexScanDesc scan, TIDBitmap *tbm)
596596
* and if we're violating them. In that case we can
597597
* terminate early, without invoking the support function.
598598
*
599-
* As there may be more keys, we can onlydetemine
599+
* As there may be more keys, we can onlydetermine
600600
* mismatch within this loop.
601601
*/
602602
if (bdesc->bd_info[attno-1]->oi_regular_nulls&&
@@ -636,7 +636,7 @@ bringetbitmap(IndexScanDesc scan, TIDBitmap *tbm)
636636

637637
/*
638638
* Collation from the first key (has to be the same for
639-
* all keys for the sameattribue).
639+
* all keys for the sameattribute).
640640
*/
641641
collation=keys[attno-1][0]->sk_collation;
642642

‎src/backend/access/brin/brin_bloom.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -409,7 +409,7 @@ typedef struct BloomOpaque
409409
{
410410
/*
411411
* XXX At this point we only need a single proc (to compute the hash), but
412-
* let's keep the array just like inclusion andminman opclasses, for
412+
* let's keep the array just like inclusion andminmax opclasses, for
413413
* consistency. We may need additional procs in the future.
414414
*/
415415
FmgrInfoextra_procinfos[BLOOM_MAX_PROCNUMS];

‎src/backend/access/brin/brin_minmax_multi.c

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -248,7 +248,7 @@ typedef struct DistanceValue
248248
}DistanceValue;
249249

250250

251-
/* Cache for support and strategyprocesures. */
251+
/* Cache for support and strategyprocedures. */
252252

253253
staticFmgrInfo*minmax_multi_get_procinfo(BrinDesc*bdesc,uint16attno,
254254
uint16procnum);
@@ -1311,7 +1311,7 @@ compare_distances(const void *a, const void *b)
13111311
}
13121312

13131313
/*
1314-
* Given an array of expanded ranges, compute distance of the gapsbetwen
1314+
* Given an array of expanded ranges, compute distance of the gapsbetween
13151315
* the ranges - for ncranges there are (ncranges-1) gaps.
13161316
*
13171317
* We simply call the "distance" function to compute the (max-min) for pairs
@@ -1623,7 +1623,7 @@ ensure_free_space_in_buffer(BrinDesc *bdesc, Oid colloid,
16231623
*
16241624
* We don't simply check against range->maxvalues again. The deduplication
16251625
* might have freed very little space (e.g. just one value), forcing us to
1626-
* dodepuplication very often. In that case it's better to do compaction
1626+
* dodeduplication very often. In that case it's better to do compaction
16271627
* and reduce more space.
16281628
*/
16291629
if (2*range->nranges+range->nvalues <=range->maxvalues*MINMAX_BUFFER_LOAD_FACTOR)

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -115,7 +115,7 @@ typedef struct
115115

116116
/*
117117
* In sorted build, we use a stack of these structs, one for each level,
118-
* to hold an in-memory buffer of therighmost page at the level. When the
118+
* to hold an in-memory buffer of therightmost page at the level. When the
119119
* page fills up, it is written out and a new page is allocated.
120120
*/
121121
typedefstructGistSortedBuildPageState

‎src/backend/access/index/genam.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -633,7 +633,7 @@ systable_endscan(SysScanDesc sysscan)
633633
* Currently we do not support non-index-based scans here. (In principle
634634
* we could do a heapscan and sort, but the uses are in places that
635635
* probably don't need to still work with corrupted catalog indexes.)
636-
* For the moment, therefore, these functions are merely thethinnest of
636+
* For the moment, therefore, these functions are merely thethinest of
637637
* wrappers around index_beginscan/index_getnext_slot. The main reason for
638638
* their existence is to centralize possible future support of lossy operators
639639
* in catalog scans.

‎src/backend/access/nbtree/nbtpage.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1398,7 +1398,7 @@ _bt_delitems_delete(Relation rel, Buffer buf, TransactionId latestRemovedXid,
13981398
* _bt_delitems_delete. These steps must take place before each function's
13991399
* critical section begins.
14001400
*
1401-
*updatabable and nupdatable are inputs, though note that we will use
1401+
*updatable and nupdatable are inputs, though note that we will use
14021402
* _bt_update_posting() to replace the original itup with a pointer to a final
14031403
* version in palloc()'d memory. Caller should free the tuples when its done.
14041404
*
@@ -1504,7 +1504,7 @@ _bt_delitems_cmp(const void *a, const void *b)
15041504
* some extra index tuples that were practically free for tableam to check in
15051505
* passing (when they actually turn out to be safe to delete). It probably
15061506
* only makes sense for the tableam to go ahead with these extra checks when
1507-
* it is block-orientated (otherwise the checks probably won't be practically
1507+
* it is block-oriented (otherwise the checks probably won't be practically
15081508
* free, which we rely on). The tableam interface requires the tableam side
15091509
* to handle the problem, though, so this is okay (we as an index AM are free
15101510
* to make the simplifying assumption that all tableams must be block-based).

‎src/backend/catalog/pg_type.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -997,7 +997,7 @@ makeMultirangeTypeName(const char *rangeTypeName, Oid typeNamespace)
997997
* makeUniqueTypeName
998998
*Generate a unique name for a prospective new type
999999
*
1000-
* Given a typeName, return a new palloc'ed name bypreprending underscores
1000+
* Given a typeName, return a new palloc'ed name byprepending underscores
10011001
* until a non-conflicting name results.
10021002
*
10031003
* If tryOriginal, first try with zero underscores.

‎src/backend/commands/analyze.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -660,7 +660,7 @@ do_analyze_rel(Relation onerel, VacuumParams *params,
660660
{
661661
/*
662662
* Partitioned tables don't have storage, so we don't set any fields in
663-
* their pg_class entries except forrelpages, which is necessary for
663+
* their pg_class entries except forreltuples, which is necessary for
664664
* auto-analyze to work properly.
665665
*/
666666
vac_update_relstats(onerel,-1,totalrows,

‎src/backend/executor/nodeIncrementalSort.c

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -661,9 +661,9 @@ ExecIncrementalSort(PlanState *pstate)
661661
/*
662662
* We're in full sort mode accumulating a minimum number of tuples
663663
* and not checking for prefix key equality yet, so we can't
664-
* assume the group pivot tuple willreamin the same -- unless
664+
* assume the group pivot tuple willremain the same -- unless
665665
* we're using a minimum group size of 1, in which case the pivot
666-
* is obviously still thepviot.
666+
* is obviously still thepivot.
667667
*/
668668
if (nTuples!=minGroupSize)
669669
ExecClearTuple(node->group_pivot);
@@ -1162,7 +1162,7 @@ ExecReScanIncrementalSort(IncrementalSortState *node)
11621162
}
11631163

11641164
/*
1165-
* If chgParam of subnode is not null,theni the plan will be re-scanned
1165+
* If chgParam of subnode is not null,then the plan will be re-scanned
11661166
* by the first ExecProcNode.
11671167
*/
11681168
if (outerPlan->chgParam==NULL)

‎src/backend/rewrite/rewriteSearchCycle.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -59,7 +59,7 @@
5959
* SQL standard actually does it in that more complicated way), but the
6060
* internal representation allows us to construct it this way.)
6161
*
62-
* With a searchcaluse
62+
* With a searchclause
6363
*
6464
* SEARCH DEPTH FIRST BY col1, col2 SET sqc
6565
*

‎src/backend/statistics/dependencies.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -972,7 +972,7 @@ find_strongest_dependency(MVDependencies **dependencies, int ndependencies,
972972
/*
973973
* clauselist_apply_dependencies
974974
*Apply the specified functional dependencies to a list of clauses and
975-
*return the estimatedselecvitity of the clauses that are compatible
975+
*return the estimatedselectivity of the clauses that are compatible
976976
*with any of the given dependencies.
977977
*
978978
* This will estimate all not-already-estimated clauses that are compatible
@@ -1450,7 +1450,7 @@ dependencies_clauselist_selectivity(PlannerInfo *root,
14501450
if (!bms_is_member(listidx,*estimatedclauses))
14511451
{
14521452
/*
1453-
* If it's a simple columnrefrence, just extract the attnum. If
1453+
* If it's a simple columnreference, just extract the attnum. If
14541454
* it's an expression, assign a negative attnum as if it was a
14551455
* system attribute.
14561456
*/

‎src/backend/statistics/extended_stats.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -358,7 +358,7 @@ statext_compute_stattarget(int stattarget, int nattrs, VacAttrStats **stats)
358358
*/
359359
for (i=0;i<nattrs;i++)
360360
{
361-
/* keep themaximmum statistics target */
361+
/* keep themaximum statistics target */
362362
if (stats[i]->attr->attstattarget>stattarget)
363363
stattarget=stats[i]->attr->attstattarget;
364364
}

‎src/backend/storage/ipc/procarray.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2131,7 +2131,7 @@ GetSnapshotDataReuse(Snapshot snapshot)
21312131
*older than this are known not running any more.
21322132
*
21332133
* And try to advance the bounds of GlobalVis{Shared,Catalog,Data,Temp}Rels
2134-
* for the benefit oftheGlobalVisTest* family of functions.
2134+
* for the benefit ofthe GlobalVisTest* family of functions.
21352135
*
21362136
* Note: this function should probably not be called with an argument that's
21372137
* not statically allocated (see xip allocation below).

‎src/backend/tsearch/spell.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2020,7 +2020,7 @@ NISortAffixes(IspellDict *Conf)
20202020
(constunsignedchar*)Affix->repl,
20212021
(ptr-1)->len))
20222022
{
2023-
/* leave only unique andminimals suffixes */
2023+
/* leave only unique andminimal suffixes */
20242024
ptr->affix=Affix->repl;
20252025
ptr->len=Affix->replen;
20262026
ptr->issuffix=issuffix;

‎src/backend/utils/activity/backend_status.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1032,10 +1032,10 @@ pgstat_get_my_queryid(void)
10321032
if (!MyBEEntry)
10331033
return0;
10341034

1035-
/* There's no need for alook around pgstat_begin_read_activity /
1035+
/* There's no need for alock around pgstat_begin_read_activity /
10361036
* pgstat_end_read_activity here as it's only called from
10371037
* pg_stat_get_activity which is already protected, or from the same
1038-
* backend whichmean that there won't be concurrentwrite.
1038+
* backend whichmeans that there won't be concurrentwrites.
10391039
*/
10401040
returnMyBEEntry->st_queryid;
10411041
}

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -553,7 +553,7 @@ multirange_get_typcache(FunctionCallInfo fcinfo, Oid mltrngtypid)
553553

554554

555555
/*
556-
* Estimate size occupied by serializedmultirage.
556+
* Estimate size occupied by serializedmultirange.
557557
*/
558558
staticSize
559559
multirange_size_estimate(TypeCacheEntry*rangetyp,int32range_count,

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4039,7 +4039,7 @@ estimate_multivariate_ndistinct(PlannerInfo *root, RelOptInfo *rel,
40394039

40404040
/*
40414041
* Process a simple Var expression, by matching it to keys
4042-
* directly. If there's amatchine expression, we'll try
4042+
* directly. If there's amatching expression, we'll try
40434043
* matching it later.
40444044
*/
40454045
if (IsA(varinfo->var,Var))

‎src/bin/pg_rewind/pg_rewind.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -605,7 +605,7 @@ perform_rewind(filemap_t *filemap, rewind_source *source,
605605
* and the target. But if the source is a standby server, it's possible
606606
* that the last common checkpoint is *after* the standby's restartpoint.
607607
* That implies that the source server has applied the checkpoint record,
608-
* but hasn'tperfomed a corresponding restartpoint yet. Make sure we
608+
* but hasn'tperformed a corresponding restartpoint yet. Make sure we
609609
* start at the restartpoint's redo point in that case.
610610
*
611611
* Use the old version of the source's control file for this. The server

‎src/bin/pg_waldump/pg_waldump.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -323,7 +323,7 @@ WALDumpCloseSegment(XLogReaderState *state)
323323
}
324324

325325
/*
326-
* pg_waldump's WAL pagerader
326+
* pg_waldump's WAL pagereader
327327
*
328328
* timeline and startptr specifies the LSN, and reads up to endptr.
329329
*/

‎src/common/hmac_openssl.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -34,7 +34,7 @@
3434

3535
/*
3636
* In backend, use an allocation in TopMemoryContext to count for resowner
37-
* cleanup handling ifnecesary. For versions of OpenSSL where HMAC_CTX is
37+
* cleanup handling ifnecessary. For versions of OpenSSL where HMAC_CTX is
3838
* known, just use palloc(). In frontend, use malloc to be able to return
3939
* a failure status back to the caller.
4040
*/

‎src/common/pg_lzcompress.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -147,7 +147,7 @@
147147
*
148148
*For each subsequent entry in the history list, the "good_match"
149149
*is lowered by 10%. So the compressor will be more happy with
150-
*short matches thefarer it has to go back in the history.
150+
*short matches thefurther it has to go back in the history.
151151
*Another "speed against ratio" preference characteristic of
152152
*the algorithm.
153153
*

‎src/interfaces/ecpg/preproc/ecpg.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -375,7 +375,7 @@ main(int argc, char *const argv[])
375375
}
376376
cur=NULL;
377377

378-
/* remove olddelared statements if any are still there */
378+
/* remove olddeclared statements if any are still there */
379379
for (list=g_declared_list;list!=NULL;)
380380
{
381381
structdeclared_list*this=list;

‎src/port/bsearch_arg.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -43,7 +43,7 @@
4343
* is odd, moving left simply involves halving lim: e.g., when lim
4444
* is 5 we look at item 2, so we change lim to 2 so that we will
4545
* look at items 0 & 1. If lim is even, the same applies. If lim
46-
* is odd, moving right againinvoles halving lim, this time moving
46+
* is odd, moving right againinvolves halving lim, this time moving
4747
* the base up one item past p: e.g., when lim is 5 we change base
4848
* to item 3 and make lim 2 so that we will look at items 3 and 4.
4949
* If lim is even, however, we have to shrink it by one before

0 commit comments

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