* And again, c (ntrue) is a lower bound of len2, but c <= len1
* just by definition and, consequently, upper bound of
* similarity is just c / len1.
- * So, independly on DIVUNION the upper bound formula is the same.
+ * So, independently on DIVUNION the upper bound formula is the same.
*/
res = (nkeys == 0) ? false :
(((((float4) ntrue) / ((float4) nkeys))) >= nlimit);
else
{
/*
- * As trigramsMatchGraph implements a montonic boolean function,
+ * As trigramsMatchGraph implements a monotonic boolean function,
* promoting all GIN_MAYBE keys to GIN_TRUE will give a
* conservative result.
*/
/*
- * Extract the next non-wildcard part of a search string, ie, a word bounded
+ * Extract the next non-wildcard part of a search string, i.e. a word bounded
* by '_' or '%' meta-characters, non-word characters or string end.
*
* str: source string, of length lenstr bytes (need not be null-terminated)
errmsg("timestamp cannot be NaN")));
#endif
- /* rangecheck: see if timestamp_out would like it */
+ /* range check: see if timestamp_out would like it */
if (TIMESTAMP_NOT_FINITE(timestamp))
/* ok */ ;
else if (timestamp2tm(timestamp, NULL, tm, &fsec, NULL, NULL) != 0 ||
timestamp = (TimestampTz) pq_getmsgfloat8(buf);
#endif
- /* rangecheck: see if timestamptz_out would like it */
+ /* range check: see if timestamptz_out would like it */
if (TIMESTAMP_NOT_FINITE(timestamp))
/* ok */ ;
else if (timestamp2tm(timestamp, &tz, tm, &fsec, NULL, NULL) != 0 ||
else
elog(ERROR, "unrecognized interval typmod: %d", typmod);
- /* Need to adjust subsecond precision? */
+ /* Need to adjust sub-second precision? */
if (precision != INTERVAL_FULL_PRECISION)
{
if (precision < 0 || precision > MAX_INTERVAL_PRECISION)
* Both inputs must be ordinary finite timestamps (in current usage,
* they'll be results from GetCurrentTimestamp()).
*
- * We expect start_time <= stop_time. If not, we return zeroes; for current
+ * We expect start_time <= stop_time. If not, we return zeros; for current
* callers there is no need to be tense about which way division rounds on
* negative inputs.
*/
/*
- * Crosstype comparison functions for timestamp vs timestamptz
+ * Cross-type comparison functions for timestamp vs timestamptz
*/
Datum
{
/*
* For ts1 = ts2 the spec says te1 <> te2 OR te1 = te2, which is a
- * rather silly way of saying "true if both are nonnull, else null".
+ * rather silly way of saying "true if both are non-null, else null".
*/
if (te1IsNull || te2IsNull)
PG_RETURN_NULL();
(errcode(ERRCODE_DATETIME_VALUE_OUT_OF_RANGE),
errmsg("timestamp out of range")));
- /* Add days by converting to and from julian */
+ /* Add days by converting to and from Julian */
julian = date2j(tm->tm_year, tm->tm_mon, tm->tm_mday) + span->day;
j2date(julian, &tm->tm_year, &tm->tm_mon, &tm->tm_mday);
(errcode(ERRCODE_DATETIME_VALUE_OUT_OF_RANGE),
errmsg("timestamp out of range")));
- /* Add days by converting to and from julian */
+ /* Add days by converting to and from Julian */
julian = date2j(tm->tm_year, tm->tm_mon, tm->tm_mday) + span->day;
j2date(julian, &tm->tm_year, &tm->tm_mon, &tm->tm_mday);
/*
* The above correctly handles the whole-number part of the month and day
* products, but we have to do something with any fractional part
- * resulting when the factor is nonintegral. We cascade the fractions
+ * resulting when the factor is non-integral. We cascade the fractions
* down to lower units using the conversion factors DAYS_PER_MONTH and
* SECS_PER_DAY. Note we do NOT cascade up, since we are not forced to do
* so by the representation. The user can choose to cascade up later,
/*
* Fractional months full days into days.
*
- * Floating point calculation are inherently inprecise, so these
+ * Floating point calculation are inherently imprecise, so these
* calculations are crafted to produce the most reliable result possible.
* TSROUND() is needed to more accurately produce whole numbers where
* appropriate.
{
{"syslog_sequence_numbers", PGC_SIGHUP, LOGGING_WHERE,
- gettext_noop("Add sequence number to syslog messags to avoid duplicate suppression."),
+ gettext_noop("Add sequence number to syslog messages to avoid duplicate suppression."),
NULL
},
&syslog_sequence_numbers,
{
{"ssl_renegotiation_limit", PGC_USERSET, CONN_AUTH_SECURITY,
- gettext_noop("SSL regenotiation is no longer supported; this can only be 0."),
+ gettext_noop("SSL renegotiation is no longer supported; this can only be 0."),
NULL,
GUC_NO_SHOW_ALL | GUC_NOT_IN_SAMPLE | GUC_DISALLOW_IN_FILE,
},
/*
* Build the sorted array. This is split out so that it could be
- * re-executed after startup (eg, we could allow loadable modules to
+ * re-executed after startup (e.g., we could allow loadable modules to
* add vars, and then we'd need to re-sort).
*/
void
* don't re-read the config file during backend start.
*
* In EXEC_BACKEND builds, this works differently: we load all
- * nondefault settings from the CONFIG_EXEC_PARAMS file during
+ * non-default settings from the CONFIG_EXEC_PARAMS file during
* backend start. In that case we must accept PGC_SIGHUP
* settings, so as to have the same value as if we'd forked
* from the postmaster. This can also happen when using
* We need to be told the name of the variable the args are for, because
* the flattening rules vary (ugh).
*
- * The result is NULL if args is NIL (ie, SET ... TO DEFAULT), otherwise
+ * The result is NULL if args is NIL (i.e., SET ... TO DEFAULT), otherwise
* a palloc'd string.
*/
static char *
/* source */
values[8] = GucSource_Names[conf->source];
- /* now get the type specifc attributes */
+ /* now get the type specific attributes */
switch (conf->vartype)
{
case PGC_BOOL:
* There are three cases to consider:
*
* name is a known GUC variable. Check the value normally, check
- * permissions normally (ie, allow if variable is USERSET, or if it's
+ * permissions normally (i.e., allow if variable is USERSET, or if it's
* SUSET and user is superuser).
*
* name is not known, but exists or can be created as a placeholder (i.e.,
/*
* Refund STANDARDCHUNKHEADERSIZE per tuple.
*
- * This sometimes fails to make memory use prefectly balanced, but it
+ * This sometimes fails to make memory use perfectly balanced, but it
* should never make the situation worse. Note that Assert-enabled builds
* get a larger refund, due to a varying STANDARDCHUNKHEADERSIZE.
*/