Commit63cfdb8

committed

Adjust spellings of forms of "cancel"

1 parent3aed52a commit63cfdb8Copy full SHA for 63cfdb8

File tree

-5

lines changed

-5

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -54,7 +54,7 @@ static void consider_new_or_clause(PlannerInfo root, RelOptInfo rel,`
`54`	`54`	`* fault is not really in the transformation, but in clauselist_selectivity's`
`55`	`55`	`* inability to recognize redundant conditions.) We can compensate for this`
`56`	`56`	`* redundancy by changing the cached selectivity of the original OR clause,`
`57`		`- *cancelling out the (valid) reduction in the estimated sizes of the base`
	`57`	`+ *canceling out the (valid) reduction in the estimated sizes of the base`
`58`	`58`	`* relations so that the estimated joinrel size remains the same. This is`
`59`	`59`	`* a MAJOR HACK: it depends on the fact that clause selectivities are cached`
`60`	`60`	`* and on the fact that the same RestrictInfo node will appear in every`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -348,7 +348,7 @@ ResolveRecoveryConflictWithDatabase(Oid dbid)`
`348`	`348`	`* We either resolve conflicts immediately or set a timeout to wake us at`
`349`	`349`	`* the limit of our patience.`
`350`	`350`	`*`
`351`		`- * Resolve conflicts bycancelling to all backends holding a conflicting`
	`351`	`+ * Resolve conflicts bycanceling to all backends holding a conflicting`
`352`	`352`	`* lock. As we are already queued to be granted the lock, no new lock`
`353`	`353`	`* requests conflicting with ours will be granted in the meantime.`
`354`	`354`	`*`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -532,7 +532,7 @@ pg_sleep(PG_FUNCTION_ARGS)`
`532`	`532`	`* By computing the intended stop time initially, we avoid accumulation of`
`533`	`533`	`* extra delay across multiple sleeps. This also ensures we won't delay`
`534`	`534`	`* less than the specified time when WaitLatch is terminated early by a`
`535`		`- * non-query-cancelling signal such as SIGHUP.`
	`535`	`+ * non-query-canceling signal such as SIGHUP.`
`536`	`536`	`*/`
`537`	`537`
`538`	`538`	`#ifdefHAVE_INT64_TIMESTAMP`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -7289,7 +7289,7 @@ div_var_fast(NumericVar var1, NumericVar var2, NumericVar *result,`
`7289`	`7289`	`* But having said that: div[qi] can be more than INT_MAX/NBASE, as`
`7290`	`7290`	`* noted above, which means that the product div[qi] * NBASE can`
`7291`	`7291`	`* overflow. When that happens, adding it to div[qi + 1] will always`
`7292`		`- * cause acancelling overflow so that the end result is correct. We`
	`7292`	`+ * cause acanceling overflow so that the end result is correct. We`
`7293`	`7293`	`* could avoid the intermediate overflow by doing the multiplication`
`7294`	`7294`	`* and addition in int64 arithmetic, but so far there appears no need.`
`7295`	`7295`	`*/`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -419,7 +419,7 @@ HeapTupleSatisfiesToast(HeapTuple htup, Snapshot snapshot,`
`419`	`419`
`420`	`420`	`/*`
`421`	`421`	`* An invalid Xmin can be left behind by a speculative insertion that`
`422`		`- * iscancelled by super-deleting the tuple. We shouldn't see any of`
	`422`	`+ * iscanceled by super-deleting the tuple. We shouldn't see any of`
`423`	`423`	`* those in TOAST tables, but better safe than sorry.`
`424`	`424`	`*/`
`425`	`425`	`elseif (!TransactionIdIsValid(HeapTupleHeaderGetXmin(tuple)))`

Comments

(0)