index 94aba67cdb2e21097ab477a2936789ecbc0f667d..96800be9c03c276677a46dddc487a878086c814e 100644 (file)
@@ -2609,7 +2609,7 @@ SELECT citext_pattern_ge('b'::citext, 'A'::citext) AS true;
t
(1 row)
--- Multi-byte tests below are diabled like the sanity tests above.
+-- Multi-byte tests below are disabled like the sanity tests above.
-- Uncomment to run them.
-- Test ~<~ and ~<=~
SELECT 'a'::citext ~<~ 'B'::citext AS t;
index 187d3b5d2c6d01fd334ca9cf6a289a75782c1c5c..33e3676d3c48c826bdddd2dd263eec14b3c60f2a 100644 (file)
@@ -2609,7 +2609,7 @@ SELECT citext_pattern_ge('b'::citext, 'A'::citext) AS true;
t
(1 row)
--- Multi-byte tests below are diabled like the sanity tests above.
+-- Multi-byte tests below are disabled like the sanity tests above.
-- Uncomment to run them.
-- Test ~<~ and ~<=~
SELECT 'a'::citext ~<~ 'B'::citext AS t;
index 0cc909eb52ae91b2cb360bca30ab5148d15c7891..261b73cfa6cc637299c81121e5ad3e424242f2d5 100644 (file)
@@ -810,7 +810,7 @@ SELECT citext_pattern_ge('b'::citext, 'a'::citext) AS true;
SELECT citext_pattern_ge('B'::citext, 'a'::citext) AS true;
SELECT citext_pattern_ge('b'::citext, 'A'::citext) AS true;
--- Multi-byte tests below are diabled like the sanity tests above.
+-- Multi-byte tests below are disabled like the sanity tests above.
-- Uncomment to run them.
-- Test ~<~ and ~<=~
index 45c00aaa87a65b9a5b95c3ce77fbcaf40e176369..470b121e7da94b48979092d0498449469484ad18 100644 (file)
* The truncated tupdesc for non-leaf index tuples, which doesn't contain
* the INCLUDE attributes.
*
- * It is used to form tuples during tuple adjustement and page split.
+ * It is used to form tuples during tuple adjustment and page split.
* B-tree creates shortened tuple descriptor for every truncated tuple,
* because it is doing this less often: it does not have to form truncated
* tuples during page split. Also, B-tree is not adjusting tuples on
index a4a28e88ec99c363142b74d46cce1b35292e3f36..92ea1d163e6e9806973ec854967422b919e7f245 100644 (file)
@@ -2362,7 +2362,7 @@ heapam_scan_sample_next_block(TableScanDesc scan, SampleScanState *scanstate)
if (blockno >= hscan->rs_nblocks)
{
- /* wrap to begining of rel, might not have started at 0 */
+ /* wrap to beginning of rel, might not have started at 0 */
blockno = 0;
}
index 07b5fc7b38edcea86ca5ad4696d79e0335656649..8005d43a8498629a8259b69ab6f8177df0d73001 100644 (file)
@@ -308,7 +308,7 @@ llvm_build_inline_plan(llvm::Module *mod)
* Check whether function and all its dependencies are too
* big. Dependencies already counted for other functions that
* will get inlined are not counted again. While this make
- * things somewhat order dependant, I can't quite see a point
+ * things somewhat order dependent, I can't quite see a point
* in a different behaviour.
*/
if (running_instcount > inlineState.costLimit)
index e20158b9626204ed179401688f6a4bca6780fd71..6189a068535947e9d683479928aec01fb151cd59 100644 (file)
errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
}
- /* INTERSECT want's the original, but we need to copy - Jan */
+ /* INTERSECT wants the original, but we need to copy - Jan */
copy = copyObject(qual);
parsetree->jointree->quals = make_and_qual(parsetree->jointree->quals,
index b0ee3a26d6e7770a166d3e7ef89df34fc94d9791..ccd2c31c0b39af34228b9f5c4eb2f4d8239399b8 100644 (file)
* and benchmarking has shown that keeping every BufferDesc aligned on a
* cache line boundary is important for performance. So, instead, the
* array of I/O locks is allocated in a separate tranche. Because those
- * locks are not highly contentended, we lay out the array with minimal
+ * locks are not highly contended, we lay out the array with minimal
* padding.
*/
size = add_size(size, mul_size(NBuffers, sizeof(LWLockMinimallyPadded)));
index 842fcabd9794daaa5da4fe2e611524c26a7bffb8..25b7e314afc417f3e6cd9439c80f7e4ea4ee20b8 100644 (file)
/*
* Progressively increase the sleep times, but not to more than 1s, since
- * pg_usleep isn't interruptable on some platforms.
+ * pg_usleep isn't interruptible on some platforms.
*/
standbyWait_us *= 2;
if (standbyWait_us > 1000000)
index 2ecc73b77248d2e05914d1c1c22a3c8984c21e76..373784fcc1ef485c903cfe2951cace23830999e1 100644 (file)
@@ -5315,7 +5315,7 @@ lseg_crossing(float8 x, float8 y, float8 prev_x, float8 prev_y)
/* both non-positive so do not cross positive X-axis */
return 0;
- /* x and y cross axises, see URL above point_inside() */
+ /* x and y cross axes, see URL above point_inside() */
z = float8_mi(float8_mul(float8_mi(x, prev_x), y),
float8_mul(float8_mi(y, prev_y), x));
if (FPzero(z))
index 6f3ece1209c158fe3efef0f4ef15fcb2381ae524..c28809fad68a7a4055726a0ed3f3dcb46c42f596 100644 (file)
@@ -189,7 +189,7 @@ inet_cidr_pton_ipv4(const char *src, u_char *dst, size_t size)
goto emsgsize;
}
- /* Firey death and destruction unless we prefetched EOS. */
+ /* Fiery death and destruction unless we prefetched EOS. */
if (ch != '0円')
goto enoent;
@@ -309,7 +309,7 @@ inet_net_pton_ipv4(const char *src, u_char *dst)
goto emsgsize;
}
- /* Firey death and destruction unless we prefetched EOS. */
+ /* Fiery death and destruction unless we prefetched EOS. */
if (ch != '0円')
goto enoent;
index 10cd38a5315f8d7a77622aa060a5f0b8b90b61f8..d5da1558670d334b225b1e58e9a55a283bce22a1 100644 (file)
flattenJsonPathParseItem(StringInfo buf, JsonPathParseItem *item,
int nestingLevel, bool insideArraySubscript)
{
- /* position from begining of jsonpath data */
+ /* position from beginning of jsonpath data */
int32 pos = buf->len - JSONPATH_HDRSZ;
int32 chld;
int32 next;
index 7d59d3dffa69dfc902a23ab3c94a894ac70264eb..b7d36b65dd7dedb5f74a20e4aa24f75ac2782735 100644 (file)
ok(!-d "$tempdir/backup", 'backup directory was cleaned up');
-# Create a backup directory that is not empty so the next commnd will fail
+# Create a backup directory that is not empty so the next command will fail
# but leave the data directory behind
mkdir("$tempdir/backup")
or BAIL_OUT("unable to create $tempdir/backup");
index a3280eeb180a645fc2a4886f212742132e7c1974..695d6ba9f14891f5f2690b6651d7f4b1176c71e9 100644 (file)
@@ -2937,7 +2937,7 @@ do_connect(enum trivalue reuse_previous_specification,
if (host && strcmp(host, PQhost(o_conn)) == 0)
{
/*
- * if we are targetting the same host, reuse its hostaddr for
+ * if we are targeting the same host, reuse its hostaddr for
* consistency
*/
hostaddr = PQhostaddr(o_conn);
index bb19786f0c25ea90bc39f0bff5ffc554910239c0..3ff5ee3c5ed53d4588be34f8ffdeb38838af6be2 100644 (file)
print $OUTPUT
"static const pg_unicode_test UnicodeNormalizationTests[] =\n{\n";
-# Helper routine to conver a space-separated list of Unicode characters to
+# Helper routine to convert a space-separated list of Unicode characters to
# hexadecimal list format, suitable for outputting in a C array.
sub codepoint_string_to_hex
{
index 6eaa678a1e7c3c41a339c1468d31863a653ccc08..d9122803863b354d5d2dfa4396962e7bb00437be 100644 (file)
* copy needs to be palloc'd in the current memory context. The slot
* itself is expected to remain unaffected. It is *not* expected to have
* meaningful "system columns" in the copy. The copy is not be "owned" by
- * the slot i.e. the caller has to take responsibilty to free memory
+ * the slot i.e. the caller has to take responsibility to free memory
* consumed by the slot.
*/
HeapTuple (*copy_heap_tuple) (TupleTableSlot *slot);
* The copy needs to be palloc'd in the current memory context. The slot
* itself is expected to remain unaffected. It is *not* expected to have
* meaningful "system columns" in the copy. The copy is not be "owned" by
- * the slot i.e. the caller has to take responsibilty to free memory
+ * the slot i.e. the caller has to take responsibility to free memory
* consumed by the slot.
*/
MinimalTuple (*copy_minimal_tuple) (TupleTableSlot *slot);
index 539b929b6a705efd00c8d0a96b3929298ed5c2db..7faa74e7be991db3f0121bd0778c267f5adfa660 100644 (file)
* allow a manage nested conditionals.
*
* It is used by:
- * - "psql" interpretor for handling \if ... \endif
- * - "pgbench" interpretor for handling \if ... \endif
+ * - "psql" interpreter for handling \if ... \endif
+ * - "pgbench" interpreter for handling \if ... \endif
* - "pgbench" syntax checker to test for proper nesting
*
* The stack holds the state of enclosing conditionals (are we in
index 64122bc1e3efe922d38a17ed0b694213706d3f86..112a9a53683f197b4f5cebcf45ff5bec1523f629 100644 (file)
* ExclusionOps Per-column exclusion operators, or NULL if none
* ExclusionProcs Underlying function OIDs for ExclusionOps
* ExclusionStrats Opclass strategy numbers for ExclusionOps
- * UniqueOps Theses are like Exclusion*, but for unique indexes
+ * UniqueOps These are like Exclusion*, but for unique indexes
* UniqueProcs
* UniqueStrats
* Unique is it a unique index?