NULL);
/*
- * Assumption here is that we'll never read less then 1% of table pages,
+ * Assumption here is that we'll never read less than 1% of table pages,
* this is here mainly because it is much less bad to overestimate than
* underestimate and using just spc_random_page_cost will probably lead
* to underestimations in general.
Synchronous Replication Support for Logical Decoding
- Logical decoding can be used to to build
+ Logical decoding can be used to build
synchronous
replication solutions with the same user interface as synchronous
replication for streaming
- Specifies the name of the database to connect to to dump global
+ Specifies the name of the database to connect to dump global
objects and discover what other databases should be dumped. If
not specified, the postgres database will be used,
and if that does not exist, template1 will be used.
/*
* For encoding purposes, item pointers are represented as 64-bit unsigned
* integers. The lowest 11 bits represent the offset number, and the next
- * lowest 32 bits are the block number. That leaves 17 bits unused, ie.
+ * lowest 32 bits are the block number. That leaves 17 bits unused, i.e.
* only 43 low bits are used.
*
* These 43-bit integers are encoded using varbyte encoding. In each byte,
* Removing number is actually replacement of two numbers with their sum. We
* have to prove that varbyte encoding of a sum can't be longer than varbyte
* encoding of its summands. Sum of two numbers is at most one bit wider than
- * than the larger of the summands. Widening a number by one bit enlarges its
- * length in varbyte encoding by at most one byte. Therefore, varbyte encoding
- * of sum is at most one byte longer than varbyte encoding of larger summand.
- * Lesser summand is at least one byte, so the sum cannot take more space than
- * the summands, Q.E.D.
+ * the larger of the summands. Widening a number by one bit enlarges its length
+ * in varbyte encoding by at most one byte. Therefore, varbyte encoding of sum
+ * is at most one byte longer than varbyte encoding of larger summand. Lesser
+ * summand is at least one byte, so the sum cannot take more space than the
+ * summands, Q.E.D.
*
* This property greatly simplifies VACUUM, which can assume that posting
* lists always fit on the same page after vacuuming. Note that even though
* that holds for removing items from a posting list, you must also be
- * careful to not cause expansion e.g when merging uncompressed items on the
+ * careful to not cause expansion e.g. when merging uncompressed items on the
* page into the compressed lists, when vacuuming.
*/
{
/*
* The OID column can appear in an index definition, but that's
- * OK, becuse we always copy the OID if present (see below). Other
+ * OK, because we always copy the OID if present (see below). Other
* system columns may not.
*/
if (attno == ObjectIdAttributeNumber)
has failed for some reason.
We flag the left page, even though it's the right page that's missing the
-downlink, beacuse it's more convenient to know already when following the
+downlink, because it's more convenient to know already when following the
right-link from the left page to the right page that it will need to have
its downlink inserted to the parent.
if (!is_parallel_worker)
{
/*
- * We need to mark our XIDs as commited in pg_clog. This is where we
+ * We need to mark our XIDs as committed in pg_clog. This is where we
* durably commit.
*/
latestXid = RecordTransactionCommit();
/*
* Here we are in the middle of a transaction block but one of the
* commands caused an abort so we do nothing but remain in the
- * abort state. Eventually we will get a ROLLBACK comand.
+ * abort state. Eventually we will get a ROLLBACK command.
*/
case TBLOCK_ABORT:
case TBLOCK_SUBABORT:
/*
* Remove knowledge about transactions we treat as committed that are smaller
- * than ->xmin. Those won't ever get checked via the ->commited array but via
+ * than ->xmin. Those won't ever get checked via the ->committed array but via
* the clog machinery, so we don't need to waste memory on them.
*/
static void
* Returns a pointer to the first character of the word, and a pointer
* to the next byte after the last character in the word (in *end).
* Character '*' at the end of word will not be threated as word
- * charater if flags is not null.
+ * character if flags is not null.
*/
static char *
findwrd(char *in, char **end, uint16 *flags)
int level = 1;
/*
- * Append the all tokens from v1 to res, exept last WJB_END_OBJECT
+ * Append the all tokens from v1 to res, except last WJB_END_OBJECT
* (because res will not be finished yet).
*/
(void) pushJsonbValue(state, r1, NULL);
when tag in ('sandwhich')
execute procedure test_event_trigger();
ERROR: filter value "sandwhich" not recognized for filter variable "tag"
--- should fail, create skunkcabbage is not a valid comand tag
+-- should fail, create skunkcabbage is not a valid command tag
create event trigger regress_event_trigger2 on ddl_command_start
when tag in ('create table', 'create skunkcabbage')
execute procedure test_event_trigger();
when tag in ('sandwhich')
execute procedure test_event_trigger();
--- should fail, create skunkcabbage is not a valid comand tag
+-- should fail, create skunkcabbage is not a valid command tag
create event trigger regress_event_trigger2 on ddl_command_start
when tag in ('create table', 'create skunkcabbage')
execute procedure test_event_trigger();
projects / postgresql.git / commitdiff