mirror of
https://github.com/postgres/postgres.git
synced 2025-07-28 23:42:10 +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:
@ -912,7 +912,7 @@ SELECT cube_dim('(0,0,0)'::cube);
|
||||
3
|
||||
(1 row)
|
||||
|
||||
-- Test of cube_ll_coord function (retrieves LL coodinate values)
|
||||
-- Test of cube_ll_coord function (retrieves LL coordinate values)
|
||||
--
|
||||
SELECT cube_ll_coord('(-1,1),(2,-2)'::cube, 1);
|
||||
cube_ll_coord
|
||||
@ -932,7 +932,7 @@ SELECT cube_ll_coord('(-1,1),(2,-2)'::cube, 3);
|
||||
0
|
||||
(1 row)
|
||||
|
||||
-- Test of cube_ur_coord function (retrieves UR coodinate values)
|
||||
-- Test of cube_ur_coord function (retrieves UR coordinate values)
|
||||
--
|
||||
SELECT cube_ur_coord('(-1,1),(2,-2)'::cube, 1);
|
||||
cube_ur_coord
|
||||
|
@ -912,7 +912,7 @@ SELECT cube_dim('(0,0,0)'::cube);
|
||||
3
|
||||
(1 row)
|
||||
|
||||
-- Test of cube_ll_coord function (retrieves LL coodinate values)
|
||||
-- Test of cube_ll_coord function (retrieves LL coordinate values)
|
||||
--
|
||||
SELECT cube_ll_coord('(-1,1),(2,-2)'::cube, 1);
|
||||
cube_ll_coord
|
||||
@ -932,7 +932,7 @@ SELECT cube_ll_coord('(-1,1),(2,-2)'::cube, 3);
|
||||
0
|
||||
(1 row)
|
||||
|
||||
-- Test of cube_ur_coord function (retrieves UR coodinate values)
|
||||
-- Test of cube_ur_coord function (retrieves UR coordinate values)
|
||||
--
|
||||
SELECT cube_ur_coord('(-1,1),(2,-2)'::cube, 1);
|
||||
cube_ur_coord
|
||||
|
@ -912,7 +912,7 @@ SELECT cube_dim('(0,0,0)'::cube);
|
||||
3
|
||||
(1 row)
|
||||
|
||||
-- Test of cube_ll_coord function (retrieves LL coodinate values)
|
||||
-- Test of cube_ll_coord function (retrieves LL coordinate values)
|
||||
--
|
||||
SELECT cube_ll_coord('(-1,1),(2,-2)'::cube, 1);
|
||||
cube_ll_coord
|
||||
@ -932,7 +932,7 @@ SELECT cube_ll_coord('(-1,1),(2,-2)'::cube, 3);
|
||||
0
|
||||
(1 row)
|
||||
|
||||
-- Test of cube_ur_coord function (retrieves UR coodinate values)
|
||||
-- Test of cube_ur_coord function (retrieves UR coordinate values)
|
||||
--
|
||||
SELECT cube_ur_coord('(-1,1),(2,-2)'::cube, 1);
|
||||
cube_ur_coord
|
||||
|
@ -912,7 +912,7 @@ SELECT cube_dim('(0,0,0)'::cube);
|
||||
3
|
||||
(1 row)
|
||||
|
||||
-- Test of cube_ll_coord function (retrieves LL coodinate values)
|
||||
-- Test of cube_ll_coord function (retrieves LL coordinate values)
|
||||
--
|
||||
SELECT cube_ll_coord('(-1,1),(2,-2)'::cube, 1);
|
||||
cube_ll_coord
|
||||
@ -932,7 +932,7 @@ SELECT cube_ll_coord('(-1,1),(2,-2)'::cube, 3);
|
||||
0
|
||||
(1 row)
|
||||
|
||||
-- Test of cube_ur_coord function (retrieves UR coodinate values)
|
||||
-- Test of cube_ur_coord function (retrieves UR coordinate values)
|
||||
--
|
||||
SELECT cube_ur_coord('(-1,1),(2,-2)'::cube, 1);
|
||||
cube_ur_coord
|
||||
|
@ -224,13 +224,13 @@ SELECT cube_dim('(0)'::cube);
|
||||
SELECT cube_dim('(0,0)'::cube);
|
||||
SELECT cube_dim('(0,0,0)'::cube);
|
||||
|
||||
-- Test of cube_ll_coord function (retrieves LL coodinate values)
|
||||
-- Test of cube_ll_coord function (retrieves LL coordinate values)
|
||||
--
|
||||
SELECT cube_ll_coord('(-1,1),(2,-2)'::cube, 1);
|
||||
SELECT cube_ll_coord('(-1,1),(2,-2)'::cube, 2);
|
||||
SELECT cube_ll_coord('(-1,1),(2,-2)'::cube, 3);
|
||||
|
||||
-- Test of cube_ur_coord function (retrieves UR coodinate values)
|
||||
-- Test of cube_ur_coord function (retrieves UR coordinate values)
|
||||
--
|
||||
SELECT cube_ur_coord('(-1,1),(2,-2)'::cube, 1);
|
||||
SELECT cube_ur_coord('(-1,1),(2,-2)'::cube, 2);
|
||||
|
@ -11,7 +11,7 @@ CREATE FUNCTION earth() RETURNS float8
|
||||
LANGUAGE SQL IMMUTABLE
|
||||
AS 'SELECT ''6378168''::float8';
|
||||
|
||||
-- Astromers may want to change the earth function so that distances will be
|
||||
-- Astronomers may want to change the earth function so that distances will be
|
||||
-- returned in degrees. To do this comment out the above definition and
|
||||
-- uncomment the one below. Note that doing this will break the regression
|
||||
-- tests.
|
||||
|
@ -23,7 +23,7 @@
|
||||
* Product 9 + 21 + 7 + 3 + 1 + 12 + 4 + 24 + 7 + 15 + 0 + 0 = 103
|
||||
* 103 / 10 = 10 remainder 3
|
||||
* Check digit 10 - 3 = 7
|
||||
* => 977-1144875-00-7 ?? <- suplemental number (number of the week, month, etc.)
|
||||
* => 977-1144875-00-7 ?? <- supplemental number (number of the week, month, etc.)
|
||||
* ^^ 00 for non-daily publications (01=Monday, 02=Tuesday, ...)
|
||||
*
|
||||
* The hyphenation is always in after the four digits of the ISSN code.
|
||||
|
@ -160,7 +160,7 @@ dehyphenate(char *bufO, char *bufI)
|
||||
* into bufO using the given hyphenation range TABLE.
|
||||
* Assumes the input string to be used is of only digits.
|
||||
*
|
||||
* Returns the number of characters acctually hyphenated.
|
||||
* Returns the number of characters actually hyphenated.
|
||||
*/
|
||||
static unsigned
|
||||
hyphenate(char *bufO, char *bufI, const char *(*TABLE)[2], const unsigned TABLE_index[10][2])
|
||||
@ -748,7 +748,7 @@ string2ean(const char *str, bool errorOK, ean13 *result,
|
||||
}
|
||||
else if (*aux2 == '!' && *(aux2 + 1) == '\0')
|
||||
{
|
||||
/* the invalid check digit sufix was found, set it */
|
||||
/* the invalid check digit suffix was found, set it */
|
||||
if (!magic)
|
||||
valid = false;
|
||||
magic = true;
|
||||
|
@ -1105,7 +1105,7 @@ SELECT '{a.b.c.d.e,B.df}'::ltree[] ? '{A.b.c.d.e,*.df}';
|
||||
t
|
||||
(1 row)
|
||||
|
||||
--exractors
|
||||
--extractors
|
||||
SELECT ('{3456,1.2.3.34}'::ltree[] ?@> '1.2.3.4') is null;
|
||||
?column?
|
||||
----------
|
||||
|
@ -200,7 +200,7 @@ pushval_asis(QPRS_STATE *state, int type, char *strval, int lenval, uint16 flag)
|
||||
|
||||
#define STACKDEPTH 32
|
||||
/*
|
||||
* make polish notaion of query
|
||||
* make polish notation of query
|
||||
*/
|
||||
static int32
|
||||
makepol(QPRS_STATE *state)
|
||||
|
@ -204,7 +204,7 @@ SELECT 'a.b.c.d.e'::ltree ? '{A.b.c.d.e, a.*}';
|
||||
SELECT '{a.b.c.d.e,B.df}'::ltree[] ? '{A.b.c.d.e}';
|
||||
SELECT '{a.b.c.d.e,B.df}'::ltree[] ? '{A.b.c.d.e,*.df}';
|
||||
|
||||
--exractors
|
||||
--extractors
|
||||
SELECT ('{3456,1.2.3.34}'::ltree[] ?@> '1.2.3.4') is null;
|
||||
SELECT '{3456,1.2.3}'::ltree[] ?@> '1.2.3.4';
|
||||
SELECT '{3456,1.2.3.4}'::ltree[] ?<@ '1.2.3';
|
||||
|
@ -806,7 +806,7 @@ main(int argc, char **argv)
|
||||
{
|
||||
/*
|
||||
* Once we have restored this file successfully we can remove some
|
||||
* prior WAL files. If this restore fails we musn't remove any
|
||||
* prior WAL files. If this restore fails we mustn't remove any
|
||||
* file because some of them will be requested again immediately
|
||||
* after the failed restore, or when we restart recovery.
|
||||
*/
|
||||
|
@ -311,7 +311,7 @@ pullf_read_max(PullFilter *pf, int len, uint8 **data_p, uint8 *tmpbuf)
|
||||
}
|
||||
|
||||
/*
|
||||
* caller wants exatly len bytes and dont bother with references
|
||||
* caller wants exactly len bytes and don't bother with references
|
||||
*/
|
||||
int
|
||||
pullf_read_fixed(PullFilter *src, int len, uint8 *dst)
|
||||
|
@ -140,7 +140,7 @@ bn_to_mpi(mpz_t *bn)
|
||||
}
|
||||
|
||||
/*
|
||||
* Decide the number of bits in the random componont k
|
||||
* Decide the number of bits in the random component k
|
||||
*
|
||||
* It should be in the same range as p for signing (which
|
||||
* is deprecated), but can be much smaller for encrypting.
|
||||
@ -148,8 +148,8 @@ bn_to_mpi(mpz_t *bn)
|
||||
* Until I research it further, I just mimic gpg behaviour.
|
||||
* It has a special mapping table, for values <= 5120,
|
||||
* above that it uses 'arbitrary high number'. Following
|
||||
* algorihm hovers 10-70 bits above gpg values. And for
|
||||
* larger p, it uses gpg's algorihm.
|
||||
* algorithm hovers 10-70 bits above gpg values. And for
|
||||
* larger p, it uses gpg's algorithm.
|
||||
*
|
||||
* The point is - if k gets large, encryption will be
|
||||
* really slow. It does not matter for decryption.
|
||||
|
@ -75,7 +75,7 @@ bn_to_mpi(BIGNUM *bn)
|
||||
}
|
||||
|
||||
/*
|
||||
* Decide the number of bits in the random componont k
|
||||
* Decide the number of bits in the random component k
|
||||
*
|
||||
* It should be in the same range as p for signing (which
|
||||
* is deprecated), but can be much smaller for encrypting.
|
||||
@ -83,8 +83,8 @@ bn_to_mpi(BIGNUM *bn)
|
||||
* Until I research it further, I just mimic gpg behaviour.
|
||||
* It has a special mapping table, for values <= 5120,
|
||||
* above that it uses 'arbitrary high number'. Following
|
||||
* algorihm hovers 10-70 bits above gpg values. And for
|
||||
* larger p, it uses gpg's algorihm.
|
||||
* algorithm hovers 10-70 bits above gpg values. And for
|
||||
* larger p, it uses gpg's algorithm.
|
||||
*
|
||||
* The point is - if k gets large, encryption will be
|
||||
* really slow. It does not matter for decryption.
|
||||
|
@ -904,7 +904,7 @@ restore(char *result, float val, int n)
|
||||
if (Abs(exp) <= 4)
|
||||
{
|
||||
/*
|
||||
* remove the decimal point from the mantyssa and write the digits
|
||||
* remove the decimal point from the mantissa and write the digits
|
||||
* to the buf array
|
||||
*/
|
||||
for (p = result + sign, i = 10, dp = 0; *p != 'e'; p++, i++)
|
||||
|
@ -23,7 +23,7 @@
|
||||
* When we ask SELinux whether the required privileges are allowed or not,
|
||||
* we use security_compute_av(3). It needs us to represent object classes
|
||||
* and access vectors using 'external' codes defined in the security policy.
|
||||
* It is determinded in the runtime, not build time. So, it needs an internal
|
||||
* It is determined in the runtime, not build time. So, it needs an internal
|
||||
* service to translate object class/access vectors which we want to check
|
||||
* into the code which kernel want to be given.
|
||||
*/
|
||||
|
@ -206,7 +206,7 @@ SELECT * FROM auth_tbl; -- failed
|
||||
SELECT sepgsql_setcon(NULL); -- end of session
|
||||
SELECT sepgsql_getcon();
|
||||
|
||||
-- the pooler cannot touch these tables directry
|
||||
-- the pooler cannot touch these tables directly
|
||||
SELECT * FROM foo_tbl; -- failed
|
||||
|
||||
SELECT * FROM var_tbl; -- failed
|
||||
|
@ -93,7 +93,7 @@ check_primary_key(PG_FUNCTION_ARGS)
|
||||
/* internal error */
|
||||
elog(ERROR, "check_primary_key: cannot process DELETE events");
|
||||
|
||||
/* If UPDATion the must check new Tuple, not old one */
|
||||
/* If UPDATE, then must check new Tuple, not old one */
|
||||
else
|
||||
tuple = trigdata->tg_newtuple;
|
||||
|
||||
|
@ -29,7 +29,7 @@
|
||||
# modified by Ray Aspeitia 12-03-2003 :
|
||||
# added log rotation script to db startup
|
||||
# modified StartupParameters.plist "Provides" parameter to make it easier to
|
||||
# start and stop with the SystemStarter utitlity
|
||||
# start and stop with the SystemStarter utility
|
||||
|
||||
# use the below command in order to correctly start/stop/restart PG with log rotation script:
|
||||
# SystemStarter [start|stop|restart] PostgreSQL
|
||||
|
@ -414,7 +414,7 @@ CREATE FUNCTION stat(text,text)
|
||||
LANGUAGE INTERNAL
|
||||
RETURNS NULL ON NULL INPUT;
|
||||
|
||||
--reset - just for debuging
|
||||
--reset - just for debugging
|
||||
CREATE FUNCTION reset_tsearch()
|
||||
RETURNS void
|
||||
as 'MODULE_PATHNAME', 'tsa_reset_tsearch'
|
||||
|
@ -623,7 +623,7 @@ xpath_table(PG_FUNCTION_ARGS)
|
||||
|
||||
/*
|
||||
* At the moment we assume that the returned attributes make sense for the
|
||||
* XPath specififed (i.e. we trust the caller). It's not fatal if they get
|
||||
* XPath specified (i.e. we trust the caller). It's not fatal if they get
|
||||
* it wrong - the input function for the column type will raise an error
|
||||
* if the path result can't be converted into the correct binary
|
||||
* representation.
|
||||
|
Reference in New Issue
Block a user