8000 Fix typos and grammar in comments and docs · postgrespro/postgres@7ef8b52 · GitHub
[go: up one dir, main page]
Skip to content

Commit 7ef8b52

Browse files
michaelpqmichaelpq
committed
Fix typos and grammar in comments and docs
Author: Justin Pryzby Discussion: https://postgr.es/m/20210416070310.GG3315@telsasoft.com
1 parent c731f91 commit 7ef8b52

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 assumed linear with
733+
equal to -1, the number of distinct non-null values is assumed to 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 ordered sets, and may be seen as a simple extension of the minmax
1217+
a totally ordered set, 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 declare sql identifier linked to
357+
The third option is to declare a 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 a sql 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 a SQL identifier to a connection, you execute dynamic SQL
364+
without an AT 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> declares a SQL 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 identifier is 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 cursor name.
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 to the same SQL statement identifier are 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 only detemine
599+
* As there may be more keys, we can only determine
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 same attribue).
639+
* all keys for the same attribute).
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 and minman opclasses, for
412+
* let's keep the array just like inclusion and minmax opclasses, for
413413
* consistency. We may need additional procs in the future.
414414
*/
415415
FmgrInfo extra_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 strategy procesures. */
251+
/* Cache for support and strategy procedures. */
252252

253253
static FmgrInfo *minmax_multi_get_procinfo(BrinDesc *bdesc, uint16 attno,
254254
uint16 procnum);
@@ -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 gaps betwen
1314+
* Given an array of expanded ranges, compute distance of the gaps between
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-
* do depuplication very often. In that case it's better to do compaction
1626+
* do deduplication 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 the righmost page at the level. When the
118+
* to hold an in-memory buffer of the rightmost page at the level. When the
119119
* page fills up, it is written out and a new page is allocated.
120120
*/
121121
typedef struct GistSortedBuildPageState

‎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 the thinnest of
636+
* For the moment, therefore, these functions are merely the thinest 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 by preprending underscores
1000+
* Given a typeName, return a new palloc'ed name by prepending underscores
10011001
* until a non-conflicting name results.
10021002
*
10031003
* If tryOriginal, first try with zero underscores.

0 commit comments

Comments
 (0)
0