mirror of
https://github.com/postgres/postgres.git
synced 2025-06-07 00:02:00 -04:00
Fix typos in various places
Author: Andrea Gelmini Reviewed-by: Michael Paquier, Justin Pryzby Discussion: https://postgr.es/m/20190528181718.GA39034@glet
This commit is contained in:
parent
0240a00fbd
commit
1fb6f62a84
@ -2609,7 +2609,7 @@ SELECT citext_pattern_ge('b'::citext, 'A'::citext) AS true;
|
|||||||
t
|
t
|
||||||
(1 row)
|
(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.
|
-- Uncomment to run them.
|
||||||
-- Test ~<~ and ~<=~
|
-- Test ~<~ and ~<=~
|
||||||
SELECT 'a'::citext ~<~ 'B'::citext AS t;
|
SELECT 'a'::citext ~<~ 'B'::citext AS t;
|
||||||
|
@ -2609,7 +2609,7 @@ SELECT citext_pattern_ge('b'::citext, 'A'::citext) AS true;
|
|||||||
t
|
t
|
||||||
(1 row)
|
(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.
|
-- Uncomment to run them.
|
||||||
-- Test ~<~ and ~<=~
|
-- Test ~<~ and ~<=~
|
||||||
SELECT 'a'::citext ~<~ 'B'::citext AS t;
|
SELECT 'a'::citext ~<~ 'B'::citext AS t;
|
||||||
|
@ -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;
|
||||||
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.
|
-- Uncomment to run them.
|
||||||
|
|
||||||
-- Test ~<~ and ~<=~
|
-- Test ~<~ and ~<=~
|
||||||
|
@ -1533,7 +1533,7 @@ initGISTstate(Relation index)
|
|||||||
* The truncated tupdesc for non-leaf index tuples, which doesn't contain
|
* The truncated tupdesc for non-leaf index tuples, which doesn't contain
|
||||||
* the INCLUDE attributes.
|
* 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,
|
* B-tree creates shortened tuple descriptor for every truncated tuple,
|
||||||
* because it is doing this less often: it does not have to form truncated
|
* 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
|
* tuples during page split. Also, B-tree is not adjusting tuples on
|
||||||
|
@ -2362,7 +2362,7 @@ heapam_scan_sample_next_block(TableScanDesc scan, SampleScanState *scanstate)
|
|||||||
|
|
||||||
if (blockno >= hscan->rs_nblocks)
|
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;
|
blockno = 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -308,7 +308,7 @@ llvm_build_inline_plan(llvm::Module *mod)
|
|||||||
* Check whether function and all its dependencies are too
|
* Check whether function and all its dependencies are too
|
||||||
* big. Dependencies already counted for other functions that
|
* big. Dependencies already counted for other functions that
|
||||||
* will get inlined are not counted again. While this make
|
* 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.
|
* in a different behaviour.
|
||||||
*/
|
*/
|
||||||
if (running_instcount > inlineState.costLimit)
|
if (running_instcount > inlineState.costLimit)
|
||||||
|
@ -1015,7 +1015,7 @@ AddQual(Query *parsetree, Node *qual)
|
|||||||
errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
|
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);
|
copy = copyObject(qual);
|
||||||
|
|
||||||
parsetree->jointree->quals = make_and_qual(parsetree->jointree->quals,
|
parsetree->jointree->quals = make_and_qual(parsetree->jointree->quals,
|
||||||
|
@ -179,7 +179,7 @@ BufferShmemSize(void)
|
|||||||
* and benchmarking has shown that keeping every BufferDesc aligned on a
|
* and benchmarking has shown that keeping every BufferDesc aligned on a
|
||||||
* cache line boundary is important for performance. So, instead, the
|
* cache line boundary is important for performance. So, instead, the
|
||||||
* array of I/O locks is allocated in a separate tranche. Because those
|
* 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.
|
* padding.
|
||||||
*/
|
*/
|
||||||
size = add_size(size, mul_size(NBuffers, sizeof(LWLockMinimallyPadded)));
|
size = add_size(size, mul_size(NBuffers, sizeof(LWLockMinimallyPadded)));
|
||||||
|
@ -202,7 +202,7 @@ WaitExceedsMaxStandbyDelay(void)
|
|||||||
|
|
||||||
/*
|
/*
|
||||||
* Progressively increase the sleep times, but not to more than 1s, since
|
* 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;
|
standbyWait_us *= 2;
|
||||||
if (standbyWait_us > 1000000)
|
if (standbyWait_us > 1000000)
|
||||||
|
@ -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 */
|
/* both non-positive so do not cross positive X-axis */
|
||||||
return 0;
|
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),
|
z = float8_mi(float8_mul(float8_mi(x, prev_x), y),
|
||||||
float8_mul(float8_mi(y, prev_y), x));
|
float8_mul(float8_mi(y, prev_y), x));
|
||||||
if (FPzero(z))
|
if (FPzero(z))
|
||||||
|
@ -189,7 +189,7 @@ inet_cidr_pton_ipv4(const char *src, u_char *dst, size_t size)
|
|||||||
goto emsgsize;
|
goto emsgsize;
|
||||||
}
|
}
|
||||||
|
|
||||||
/* Firey death and destruction unless we prefetched EOS. */
|
/* Fiery death and destruction unless we prefetched EOS. */
|
||||||
if (ch != '\0')
|
if (ch != '\0')
|
||||||
goto enoent;
|
goto enoent;
|
||||||
|
|
||||||
@ -309,7 +309,7 @@ inet_net_pton_ipv4(const char *src, u_char *dst)
|
|||||||
goto emsgsize;
|
goto emsgsize;
|
||||||
}
|
}
|
||||||
|
|
||||||
/* Firey death and destruction unless we prefetched EOS. */
|
/* Fiery death and destruction unless we prefetched EOS. */
|
||||||
if (ch != '\0')
|
if (ch != '\0')
|
||||||
goto enoent;
|
goto enoent;
|
||||||
|
|
||||||
|
@ -229,7 +229,7 @@ static int
|
|||||||
flattenJsonPathParseItem(StringInfo buf, JsonPathParseItem *item,
|
flattenJsonPathParseItem(StringInfo buf, JsonPathParseItem *item,
|
||||||
int nestingLevel, bool insideArraySubscript)
|
int nestingLevel, bool insideArraySubscript)
|
||||||
{
|
{
|
||||||
/* position from begining of jsonpath data */
|
/* position from beginning of jsonpath data */
|
||||||
int32 pos = buf->len - JSONPATH_HDRSZ;
|
int32 pos = buf->len - JSONPATH_HDRSZ;
|
||||||
int32 chld;
|
int32 chld;
|
||||||
int32 next;
|
int32 next;
|
||||||
|
@ -44,7 +44,7 @@ $node->command_fails(
|
|||||||
|
|
||||||
ok(!-d "$tempdir/backup", 'backup directory was cleaned up');
|
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
|
# but leave the data directory behind
|
||||||
mkdir("$tempdir/backup")
|
mkdir("$tempdir/backup")
|
||||||
or BAIL_OUT("unable to create $tempdir/backup");
|
or BAIL_OUT("unable to create $tempdir/backup");
|
||||||
|
@ -2937,7 +2937,7 @@ do_connect(enum trivalue reuse_previous_specification,
|
|||||||
if (host && strcmp(host, PQhost(o_conn)) == 0)
|
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
|
* consistency
|
||||||
*/
|
*/
|
||||||
hostaddr = PQhostaddr(o_conn);
|
hostaddr = PQhostaddr(o_conn);
|
||||||
|
@ -56,7 +56,7 @@ HEADER
|
|||||||
print $OUTPUT
|
print $OUTPUT
|
||||||
"static const pg_unicode_test UnicodeNormalizationTests[] =\n{\n";
|
"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.
|
# hexadecimal list format, suitable for outputting in a C array.
|
||||||
sub codepoint_string_to_hex
|
sub codepoint_string_to_hex
|
||||||
{
|
{
|
||||||
|
@ -200,7 +200,7 @@ struct TupleTableSlotOps
|
|||||||
* copy needs to be palloc'd in the current memory context. The slot
|
* 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
|
* 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
|
* 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.
|
* consumed by the slot.
|
||||||
*/
|
*/
|
||||||
HeapTuple (*copy_heap_tuple) (TupleTableSlot *slot);
|
HeapTuple (*copy_heap_tuple) (TupleTableSlot *slot);
|
||||||
@ -210,7 +210,7 @@ struct TupleTableSlotOps
|
|||||||
* The copy needs to be palloc'd in the current memory context. The 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
|
* 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
|
* 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.
|
* consumed by the slot.
|
||||||
*/
|
*/
|
||||||
MinimalTuple (*copy_minimal_tuple) (TupleTableSlot *slot);
|
MinimalTuple (*copy_minimal_tuple) (TupleTableSlot *slot);
|
||||||
|
@ -5,8 +5,8 @@
|
|||||||
* allow a manage nested conditionals.
|
* allow a manage nested conditionals.
|
||||||
*
|
*
|
||||||
* It is used by:
|
* It is used by:
|
||||||
* - "psql" interpretor for handling \if ... \endif
|
* - "psql" interpreter for handling \if ... \endif
|
||||||
* - "pgbench" interpretor for handling \if ... \endif
|
* - "pgbench" interpreter for handling \if ... \endif
|
||||||
* - "pgbench" syntax checker to test for proper nesting
|
* - "pgbench" syntax checker to test for proper nesting
|
||||||
*
|
*
|
||||||
* The stack holds the state of enclosing conditionals (are we in
|
* The stack holds the state of enclosing conditionals (are we in
|
||||||
|
@ -134,7 +134,7 @@ typedef struct ExprState
|
|||||||
* ExclusionOps Per-column exclusion operators, or NULL if none
|
* ExclusionOps Per-column exclusion operators, or NULL if none
|
||||||
* ExclusionProcs Underlying function OIDs for ExclusionOps
|
* ExclusionProcs Underlying function OIDs for ExclusionOps
|
||||||
* ExclusionStrats Opclass strategy numbers 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
|
* UniqueProcs
|
||||||
* UniqueStrats
|
* UniqueStrats
|
||||||
* Unique is it a unique index?
|
* Unique is it a unique index?
|
||||||
|
Loading…
x
Reference in New Issue
Block a user