1
0
mirror of https://github.com/postgres/postgres.git synced 2025-08-31 17:02:12 +03:00

Fix typos in comments.

Backpatch to all supported versions, where applicable, to make backpatching
of future fixes go more smoothly.

Josh Soref

Discussion: https://www.postgresql.org/message-id/CACZqfqCf+5qRztLPgmmosr-B0Ye4srWzzw_mo4c_8_B_mtjmJQ@mail.gmail.com
This commit is contained in:
Heikki Linnakangas
2017-02-06 11:33:58 +02:00
parent 9863017b87
commit 181bdb90ba
137 changed files with 195 additions and 195 deletions

View File

@@ -34,7 +34,7 @@ static const char *get_am_type_string(char amtype);
/*
* CreateAcessMethod
* CreateAccessMethod
* Registers a new access method.
*/
ObjectAddress

View File

@@ -685,7 +685,7 @@ createdb(ParseState *pstate, const CreatedbStmt *stmt)
/*
* Force synchronous commit, thus minimizing the window between
* creation of the database files and commital of the transaction. If
* creation of the database files and committal of the transaction. If
* we crash before committing, we'll have a DB that's taking up disk
* space but is not in pg_database, which is not good.
*/
@@ -955,7 +955,7 @@ dropdb(const char *dbname, bool missing_ok)
/*
* Force synchronous commit, thus minimizing the window between removal of
* the database files and commital of the transaction. If we crash before
* the database files and committal of the transaction. If we crash before
* committing, we'll have a DB that's gone on disk but still there
* according to pg_database, which is not good.
*/
@@ -1309,7 +1309,7 @@ movedb(const char *dbname, const char *tblspcname)
/*
* Force synchronous commit, thus minimizing the window between
* copying the database files and commital of the transaction. If we
* copying the database files and committal of the transaction. If we
* crash before committing, we'll leave an orphaned set of files on
* disk, which is not fatal but not good either.
*/

View File

@@ -3401,7 +3401,7 @@ ExplainYAMLLineStarting(ExplainState *es)
}
/*
* YAML is a superset of JSON; unfortuantely, the YAML quoting rules are
* YAML is a superset of JSON; unfortunately, the YAML quoting rules are
* ridiculously complicated -- as documented in sections 5.3 and 7.3.3 of
* http://yaml.org/spec/1.2/spec.html -- so we chose to just quote everything.
* Empty strings, strings with leading or trailing whitespace, and strings

View File

@@ -1040,7 +1040,7 @@ CreateFunction(ParseState *pstate, CreateFunctionStmt *stmt)
}
else
{
/* store SQL NULL instead of emtpy array */
/* store SQL NULL instead of empty array */
trftypes = NULL;
}
@@ -1441,7 +1441,7 @@ CreateCast(CreateCastStmt *stmt)
(errcode(ERRCODE_WRONG_OBJECT_TYPE),
errmsg("cast will be ignored because the target data type is a domain")));
/* Detemine the cast method */
/* Determine the cast method */
if (stmt->func != NULL)
castmethod = COERCION_METHOD_FUNCTION;
else if (stmt->inout)

View File

@@ -99,7 +99,7 @@ static void RangeVarCallbackForReindexIndex(const RangeVar *relation,
* Errors arising from the attribute list still apply.
*
* Most column type changes that can skip a table rewrite do not invalidate
* indexes. We ackowledge this when all operator classes, collations and
* indexes. We acknowledge this when all operator classes, collations and
* exclusion operators match. Though we could further permit intra-opfamily
* changes for btree and hash indexes, that adds subtle complexity with no
* concrete benefit for core types.
@@ -965,7 +965,7 @@ CheckMutability(Expr *expr)
* indxpath.c could do something with. However, that seems overly
* restrictive. One useful application of partial indexes is to apply
* a UNIQUE constraint across a subset of a table, and in that scenario
* any evaluatable predicate will work. So accept any predicate here
* any evaluable predicate will work. So accept any predicate here
* (except ones requiring a plan), and let indxpath.c fend for itself.
*/
static void

View File

@@ -525,7 +525,7 @@ OpenTableList(List *tables)
myrelid = RelationGetRelid(rel);
/*
* filter out duplicates when user specifies "foo, foo"
* Note that this algrithm is know to not be very effective (O(N^2))
* Note that this algorithm is know to not be very effective (O(N^2))
* but given that it only works on list of tables given to us by user
* it's deemed acceptable.
*/

View File

@@ -474,7 +474,7 @@ DropSubscription(DropSubscriptionStmt *stmt)
InvokeObjectDropHook(SubscriptionRelationId, subid, 0);
/*
* Lock the subscription so noboby else can do anything with it
* Lock the subscription so nobody else can do anything with it
* (including the replication workers).
*/
LockSharedObject(SubscriptionRelationId, subid, 0, AccessExclusiveLock);

View File

@@ -6630,7 +6630,7 @@ ATAddCheckConstraint(List **wqueue, AlteredTableInfo *tab, Relation rel,
/*
* Check if ONLY was specified with ALTER TABLE. If so, allow the
* contraint creation only if there are no children currently. Error out
* constraint creation only if there are no children currently. Error out
* otherwise.
*/
if (!recurse && children != NIL)