database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-07-31 22:04:40 +03:00
Code Activity

This patch fixes a bunch of spelling mistakes in comments throughout the

Browse Source 
PostgreSQL source code.

Neil Conway
This commit is contained in:
Tom Lane
2003-03-10 22:28:22 +00:00
parent 081fa240a1
commit e4704001ea
64 changed files with 149 additions and 149 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
contrib/dbase/dbf2pg.c
View File

@ -199,7 +199,7 @@ usage(void)
}
/* patch submitted by Jeffrey Y. Sue <jysue@aloha.net> */
/* Provides functionallity for substituting dBase-fieldnames for others */
/* Provides functionality for substituting dBase-fieldnames for others */
/* Mainly for avoiding conflicts between fieldnames and SQL-reserved */
/* keywords */

2
contrib/fulltextindex/fti.c
View File

@ -83,7 +83,7 @@
* nothing in it, then re-populate the fti-table)
*
* can we do something with operator overloading or a seperate function
* that can build the final query automatigally?
* that can build the final query automagically?
*/
#define MAX_FTI_QUERY_LENGTH 8192

6
contrib/fuzzystrmatch/fuzzystrmatch.c
View File

@ -76,7 +76,7 @@ levenshtein(PG_FUNCTION_ARGS)
/*
* Restrict the length of the strings being compared to something
* reasonable because we will have to perform rows * cols
* calcualtions. If longer strings need to be compared, increase
* calculations. If longer strings need to be compared, increase
* MAX_LEVENSHTEIN_STRLEN to suit (but within your tolerance for speed
* and memory usage).
*/
@ -250,7 +250,7 @@ metaphone(PG_FUNCTION_ARGS)
*------------------------------------------------------------------*/
/* I suppose I could have been using a character pointer instead of
* accesssing the array directly... */
* accessing the array directly... */
/* Look at the next letter in the word */
#define Next_Letter (toupper((unsigned char) word[w_idx+1]))
@ -421,7 +421,7 @@ _metaphone(
w_idx++)
{
/*
* How many letters to skip because an eariler encoding handled
* How many letters to skip because an earlier encoding handled
* multiple letters
*/
unsigned short int skip_letter = 0;

4
contrib/intagg/int_aggregate.c
View File

@ -191,7 +191,7 @@ int_agg_state(PG_FUNCTION_ARGS)
}
/* This is the final function used for the integer aggregator. It returns all the integers
* collected as a one dimentional integer array */
* collected as a one dimensional integer array */
Datum
int_agg_final_array(PG_FUNCTION_ARGS)
{
@ -225,7 +225,7 @@ int_enum(PG_FUNCTION_ARGS)
/* Allocate a working context */
pc = (CTX *) palloc(sizeof(CTX));
/* Don't copy atribute if you don't need too */
/* Don't copy attribute if you don't need too */
if (VARATT_IS_EXTENDED(p))
{
/* Toasted!!! */

8
contrib/intarray/_int.c
View File

@ -133,7 +133,7 @@ typedef ArrayType *(*formarray) (ArrayType *, ArrayType *);
typedef void (*formfloat) (ArrayType *, float *);
/*
** usefull function
** useful function
*/
static bool isort(int4 *a, const int len);
static ArrayType *new_intArrayType(int num);
@ -446,7 +446,7 @@ g_int_decompress(PG_FUNCTION_ARGS)
lenin = ARRNELEMS(in);
if (lenin < 2 * MAXNUMRANGE || ISLEAFKEY(in))
{ /* not comressed value */
{ /* not compressed value */
if (in != (ArrayType *) DatumGetPointer(entry->key))
{
retval = palloc(sizeof(GISTENTRY));
@ -1642,7 +1642,7 @@ typedef struct
char *buf;
int4 state;
int4 count;
/* reverse polish notation in list (for temprorary usage) */
/* reverse polish notation in list (for temporary usage) */
NODE *str;
/* number in str */
int4 num;
@ -1747,7 +1747,7 @@ pushquery(WORKSTATE * state, int4 type, int4 val)
#define STACKDEPTH 16
/*
* make polish notaion of query
* make polish notation of query
*/
static int4
makepol(WORKSTATE * state)

2
contrib/ltree/ltxtquery_io.c
View File

@ -38,7 +38,7 @@ typedef struct
char *buf;
int4 state;
int4 count;
/* reverse polish notation in list (for temprorary usage) */
/* reverse polish notation in list (for temporary usage) */
NODE *str;
/* number in str */
int4 num;

2
contrib/oid2name/oid2name.c
View File

@ -50,7 +50,7 @@ void sql_exec_dumptable(PGconn *, int);
void sql_exec_searchtable(PGconn *, const char *);
void sql_exec_searchoid(PGconn *, int);
/* fuction to parse command line options and check for some usage errors. */
/* function to parse command line options and check for some usage errors. */
void
get_opts(int argc, char **argv, struct options * my_opts)
{

4
contrib/pgcrypto/random.c
View File

@ -26,7 +26,7 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* $Id: random.c,v 1.5 2001/11/05 17:46:23 momjian Exp $
* $Id: random.c,v 1.6 2003/03/10 22:28:17 tgl Exp $
*/
@ -115,7 +115,7 @@ px_get_random_bytes(uint8 *dst, unsigned count)
/*
* OpenSSL random should re-feeded occasionally. From /dev/urandom
* preferrably.
* preferably.
*/
res = RAND_bytes(dst, count);

6
contrib/spi/moddatetime.c
View File

@ -2,7 +2,7 @@
moddatetime.c
What is this?
It is a function to be called from a trigger for the perpose of updating
It is a function to be called from a trigger for the purpose of updating
a modification datetime stamp in a record when that record is UPDATEd.
Credits
@ -70,14 +70,14 @@ moddatetime(PG_FUNCTION_ARGS)
Int32GetDatum(-1));
/*
* This gets the position in the turple of the field we want. args[0]
* This gets the position in the tuple of the field we want. args[0]
* being the name of the field to update, as passed in from the
* trigger.
*/
attnum = SPI_fnumber(tupdesc, args[0]);
/*
* This is were we check to see if the feild we are suppost to update
* This is were we check to see if the field we are supposed to update
* even exits. The above function must return -1 if name not found?
*/
if (attnum < 0)

2
contrib/string/string_io.c
View File

@ -166,7 +166,7 @@ string_output(unsigned char *data, int size)
*
* This function accepts a C string in input and copies it into a new
* object allocated with palloc() translating all escape sequences.
* An optional header can be allocatd before the string, for example
* An optional header can be allocated before the string, for example
* to hold the length of a varlena object.
* This function is not necessary for input from sql commands because
* the parser already does escape translation, all data input routines

16
contrib/tablefunc/tablefunc.c
View File

@ -44,7 +44,7 @@ static bool compatCrosstabTupleDescs(TupleDesc tupdesc1, TupleDesc tupdesc2);
static bool compatConnectbyTupleDescs(TupleDesc tupdesc1, TupleDesc tupdesc2);
static void get_normal_pair(float8 *x1, float8 *x2);
static TupleDesc make_crosstab_tupledesc(TupleDesc spi_tupdesc,
int num_catagories);
int num_categories);
static Tuplestorestate *connectby(char *relname,
char *key_fld,
char *parent_key_fld,
@ -373,9 +373,9 @@ crosstab(PG_FUNCTION_ARGS)
elog(ERROR, "Wrong number of arguments specified for function");
else
{
int num_catagories = PG_GETARG_INT32(1);
int num_categories = PG_GETARG_INT32(1);
tupdesc = make_crosstab_tupledesc(spi_tupdesc, num_catagories);
tupdesc = make_crosstab_tupledesc(spi_tupdesc, num_categories);
}
}
else if (functyptype == 'b')
@ -1034,7 +1034,7 @@ compatCrosstabTupleDescs(TupleDesc ret_tupdesc, TupleDesc sql_tupdesc)
}
static TupleDesc
make_crosstab_tupledesc(TupleDesc spi_tupdesc, int num_catagories)
make_crosstab_tupledesc(TupleDesc spi_tupdesc, int num_categories)
{
Form_pg_attribute sql_attr;
Oid sql_atttypid;
@ -1046,10 +1046,10 @@ make_crosstab_tupledesc(TupleDesc spi_tupdesc, int num_catagories)
/*
* We need to build a tuple description with one column for the
* rowname, and num_catagories columns for the values. Each must be of
* rowname, and num_categories columns for the values. Each must be of
* the same type as the corresponding spi result input column.
*/
natts = num_catagories + 1;
natts = num_categories + 1;
tupdesc = CreateTemplateTupleDesc(natts, false);
/* first the rowname column */
@ -1063,11 +1063,11 @@ make_crosstab_tupledesc(TupleDesc spi_tupdesc, int num_catagories)
TupleDescInitEntry(tupdesc, attnum, attname, sql_atttypid,
-1, 0, false);
/* now the catagory values columns */
/* now the category values columns */
sql_attr = spi_tupdesc->attrs[2];
sql_atttypid = sql_attr->atttypid;
for (i = 0; i < num_catagories; i++)
for (i = 0; i < num_categories; i++)
{
attnum++;

2
contrib/tsearch/morph.c
View File

@ -187,7 +187,7 @@ lemmatize(char *word, int *len, int type)
int oldlen = *len;
char *newword = (*(dict->lemmatize)) (dictobjs[nd], word, len);
/* word is recognized by distionary */
/* word is recognized by dictionary */
if (newword != word || *len != oldlen)
{
if (dict->is_stemstoplemm &&

4
contrib/tsearch/query.c
View File

@ -79,7 +79,7 @@ typedef struct
char *buf;
int4 state;
int4 count;
/* reverse polish notation in list (for temprorary usage) */
/* reverse polish notation in list (for temporary usage) */
NODE *str;
/* number in str */
int4 num;
@ -247,7 +247,7 @@ pushval_morph(QPRS_STATE * state, int typeval, char *strval, int lenval)
#define STACKDEPTH 32
/*
* make polish notaion of query
* make polish notation of query
*/
static int4
makepol(QPRS_STATE * state, void (*pushval) (QPRS_STATE *, int, char *, int))

2
contrib/tsearch/rewrite.c
View File

@ -116,7 +116,7 @@ freetree(NODE * node)
/*
* clean tree for ! operator.
* It's usefull for debug, but in
* It's useful for debug, but in
* other case, such view is used with search in index.
* Operator ! always return TRUE
*/