FreeBlockNumberArray notFullPage;
} BloomMetaPageData;
-/* Magic number to distinguish bloom pages among anothers */
+/* Magic number to distinguish bloom pages from others */
#define BLOOM_MAGICK_NUMBER (0xDBAC0DED)
/* Number of blocks numbers fit in BloomMetaPageData */
-- This generates a random string of 16366 bytes. This is chosen
-- as random so that it does not get compressed, and the decompression
-- would work on a string with the same length as the origin, making the
- -- test behavior more predictible. lpad() ensures that the generated
+ -- test behavior more predictable. lpad() ensures that the generated
-- hexadecimal value is completed by extra zero characters if random()
-- has generated a value strictly lower than 16.
SELECT string_agg(decode(lpad(to_hex((random()*256)::int), 2, '0'), 'hex'), '') as bytes
/*
* Test if key len is supported. BF_set_key silently cut large keys and it
- * could be a problem when user transfer crypted data from one server to
+ * could be a problem when user transfer encrypted data from one server to
* another.
*/
-- This generates a random string of 16366 bytes. This is chosen
-- as random so that it does not get compressed, and the decompression
-- would work on a string with the same length as the origin, making the
- -- test behavior more predictible. lpad() ensures that the generated
+ -- test behavior more predictable. lpad() ensures that the generated
-- hexadecimal value is completed by extra zero characters if random()
-- has generated a value strictly lower than 16.
SELECT string_agg(decode(lpad(to_hex((random()*256)::int), 2, '0'), 'hex'), '') as bytes
925 | 5 | 00925 | Mon Jan 26 00:00:00 1970 PST | Mon Jan 26 00:00:00 1970 | 5 | 5 | foo
(10 rows)
--- EXISTS should be propogated to the highest upper inner join
+-- EXISTS should be propagated to the highest upper inner join
EXPLAIN (verbose, costs off)
SELECT ft2.*, ft4.* FROM ft2 INNER JOIN
(SELECT * FROM ft4 WHERE EXISTS (
AND ftupper.c1 > 900
ORDER BY ftupper.c1 LIMIT 10;
--- EXISTS should be propogated to the highest upper inner join
+-- EXISTS should be propagated to the highest upper inner join
EXPLAIN (verbose, costs off)
SELECT ft2.*, ft4.* FROM ft2 INNER JOIN
(SELECT * FROM ft4 WHERE EXISTS (
bool autosummarize = BrinGetAutoSummarize(idxRel);
/*
- * If firt time through in this statement, initialize the insert state
+ * If first time through in this statement, initialize the insert state
* that we keep for all the inserts in the command.
*/
if (!bistate)
/*
* If we're in a block that belongs to a different range, summarize what
* we've got and start afresh. Note the scan might have skipped many
- * pages, if they were devoid of live tuples; we do not create emptry BRIN
+ * pages, if they were devoid of live tuples; we do not create empty BRIN
* ranges here - the leader is responsible for filling them in.
*
* Unlike serial builds, parallel index builds allow synchronized seqscans
* brin_vacuum_scan
* Do a complete scan of the index during VACUUM.
*
- * This routine scans the complete index looking for uncatalogued index pages,
+ * This routine scans the complete index looking for uncataloged index pages,
* i.e. those that might have been lost due to a crash after index extension
* and such.
*/
((att)->attstorage != TYPSTORAGE_PLAIN)
/*
- * Setup for cacheing pass-by-ref missing attributes in a way that survives
+ * Setup for caching pass-by-ref missing attributes in a way that survives
* tupleDesc destruction.
*/
Page metapage;
/*
- * Initalize the metapage.
+ * Initialize the metapage.
*
* Regular index build bypasses the buffer manager and uses smgr functions
* directly, with an smgrimmedsync() call at the end. That makes sense
entry = spcache_insert(searchPath, roleid);
/*
- * An OOM may have resulted in a cache entry with mising 'oidlist' or
+ * An OOM may have resulted in a cache entry with missing 'oidlist' or
* 'finalPath', so just compute whatever is missing.
*/
/*
* Return the OID of the constraint enforced by the given index in the
- * given relation; or InvalidOid if no such index is catalogued.
+ * given relation; or InvalidOid if no such index is cataloged.
*
* Much like get_constraint_index, this function is concerned only with the
* one constraint that "owns" the given index. Therefore, constraints of
HeapTuple tuple;
/*
- * Use shared lock to prevent a conflit with EventTriggerOnLogin() trying
+ * Use shared lock to prevent a conflict with EventTriggerOnLogin() trying
* to reset pg_database.dathasloginevt flag. Note, this lock doesn't
* effectively blocks database or other objection. It's just custom lock
* tag used to prevent multiple backends changing
econtext->ecxt_scantuple = slot;
/*
- * As in case of the catalogued constraints, we treat a NULL result as
+ * As in case of the cataloged constraints, we treat a NULL result as
* success here, not a failure.
*/
success = ExecCheck(resultRelInfo->ri_PartitionCheckExpr, econtext);
* jtitems list to be ordered that way.
*
* We first strip out all the nullingrels bits corresponding to
- * commutating joins below this one, and then successively put them
- * back as we crawl up the join stack.
+ * commuting joins below this one, and then successively put them back
+ * as we crawl up the join stack.
*/
quals = jtitem->oj_joinclauses;
if (!bms_is_empty(joins_below))
* values into a range object. They are modeled after heaptuple.c's
* heap_compute_data_size() and heap_fill_tuple(), but we need not handle
* null values here. TYPE_IS_PACKABLE must test the same conditions as
- * heaptuple.c's ATT_IS_PACKABLE macro. See the comments thare for more
+ * heaptuple.c's ATT_IS_PACKABLE macro. See the comments there for more
* details.
*/
static void freestate_cluster(Tuplesortstate *state);
/*
- * Data struture pointed by "TuplesortPublic.arg" for the CLUSTER case. Set by
+ * Data structure pointed by "TuplesortPublic.arg" for the CLUSTER case. Set by
* the tuplesort_begin_cluster.
*/
typedef struct
} TuplesortClusterArg;
/*
- * Data struture pointed by "TuplesortPublic.arg" for the IndexTuple case.
+ * Data structure pointed by "TuplesortPublic.arg" for the IndexTuple case.
* Set by tuplesort_begin_index_xxx and used only by the IndexTuple routines.
*/
typedef struct
} TuplesortIndexArg;
/*
- * Data struture pointed by "TuplesortPublic.arg" for the index_btree subcase.
+ * Data structure pointed by "TuplesortPublic.arg" for the index_btree subcase.
*/
typedef struct
{
} TuplesortIndexBTreeArg;
/*
- * Data struture pointed by "TuplesortPublic.arg" for the index_hash subcase.
+ * Data structure pointed by "TuplesortPublic.arg" for the index_hash subcase.
*/
typedef struct
{
} TuplesortIndexHashArg;
/*
- * Data struture pointed by "TuplesortPublic.arg" for the Datum case.
+ * Data structure pointed by "TuplesortPublic.arg" for the Datum case.
* Set by tuplesort_begin_datum and used only by the DatumTuple routines.
*/
typedef struct
* Combo command ID support routines
*
* Before version 8.3, HeapTupleHeaderData had separate fields for cmin
- * and cmax. To reduce the header size, cmin and cmax are now overlayed
+ * and cmax. To reduce the header size, cmin and cmax are now overlaid
* in the same field in the header. That usually works because you rarely
* insert and delete a tuple in the same transaction, and we don't need
* either field to remain valid after the originating transaction exits.
# Insert a row in the old primary. This causes the primary and standby
# to have "diverged", it's no longer possible to just apply the
- # standy's logs over primary directory - you need to rewind.
+ # standby's logs over primary directory - you need to rewind.
primary_psql("INSERT INTO tbl1 VALUES ('in primary, after promotion')");
# Also insert a new row in the standby, which won't be present in the
# Insert a row in the old primary. This causes the primary and standby
# to have "diverged", it's no longer possible to just apply the
- # standy's logs over primary directory - you need to rewind.
+ # standby's logs over primary directory - you need to rewind.
primary_psql("INSERT INTO tbl1 VALUES ('in primary, after promotion')");
# Also insert a new row in the standby, which won't be present in the
# Insert a row in A. This causes A/B and C to have "diverged", so that it's
-# no longer possible to just apply the standy's logs over primary directory
+# no longer possible to just apply the standby's logs over primary directory
# - you need to rewind.
$node_a->safe_psql('postgres',
"INSERT INTO tbl1 VALUES ('in A, after C was promoted')");
RewindTest::promote_standby();
# Insert a row in the old primary. This causes the primary and standby to have
-# "diverged", it's no longer possible to just apply the standy's logs over
+# "diverged", it's no longer possible to just apply the standby's logs over
# primary directory - you need to rewind. Also insert a new row in the
# standby, which won't be present in the old primary.
primary_psql("INSERT INTO tbl1 VALUES ('in primary, after promotion')");
/*
* Define this to force Bitmapset reallocation on each modification. Helps
- * to find hangling pointers to Bitmapset's.
+ * to find dangling pointers to Bitmapset's.
*/
/* #define REALLOCATE_BITMAPSETS */
s1_table_insert
s1_begin
s1_table_update_k1 # should *not* be counted, different rel
- s1_table_update_k1 # dito
+ s1_table_update_k1 # ditto
s1_table_truncate
s1_table_insert_k1 # should be counted
- s1_table_update_k1 # dito
+ s1_table_update_k1 # ditto
s1_prepare_a
s1_commit_prepared_a
s1_ff
s1_table_insert
s1_begin
s1_table_update_k1 # should *not* be counted, different rel
- s1_table_update_k1 # dito
+ s1_table_update_k1 # ditto
s1_table_truncate
s1_table_insert_k1 # should be counted
- s1_table_update_k1 # dito
+ s1_table_update_k1 # ditto
s1_prepare_a
s1_ff # flush out non-transactional stats, might happen anyway
s2_commit_prepared_a
s1_table_insert
s1_begin
s1_table_update_k1 # should be counted
- s1_table_update_k1 # dito
+ s1_table_update_k1 # ditto
s1_table_truncate
s1_table_insert_k1 # should *not* be counted, different rel
- s1_table_update_k1 # dito
+ s1_table_update_k1 # ditto
s1_prepare_a
s1_rollback_prepared_a
s1_ff
s1_table_insert
s1_begin
s1_table_update_k1 # should be counted
- s1_table_update_k1 # dito
+ s1_table_update_k1 # ditto
s1_table_truncate
s1_table_insert_k1 # should *not* be counted, different rel
- s1_table_update_k1 # dito
+ s1_table_update_k1 # ditto
s1_prepare_a
s2_rollback_prepared_a
s1_ff s2_ff
-- Test to make sure short-circuiting and NULL handling is
-- correct. Use a table as source to prevent constant simplification
--- to interfer.
+-- from interfering.
CREATE TABLE booltbl4(isfalse bool, istrue bool, isnul bool);
INSERT INTO booltbl4 VALUES (false, true, null);
\pset null '(null)'
-- test overflows during CREATE INDEX with extreme timestamp values
CREATE TABLE brin_timestamp_test(a TIMESTAMPTZ);
SET datestyle TO iso;
--- values close to timetamp minimum
+-- values close to timestamp minimum
INSERT INTO brin_timestamp_test
SELECT '4713-01-01 00:00:01 BC'::timestamptz + (i || ' seconds')::interval
FROM generate_series(1,30) s(i);
--- values close to timetamp maximum
+-- values close to timestamp maximum
INSERT INTO brin_timestamp_test
SELECT '294276-12-01 00:00:01'::timestamptz + (i || ' seconds')::interval
FROM generate_series(1,30) s(i);
(7 rows)
--
----- Only one side is unqiue
+---- Only one side is unique
--select * from sl t1, sl t2 where t1.a = t2.a and t1.b = 1;
--select * from sl t1, sl t2 where t1.a = t2.a and t2.b = 1;
--
-- Test to make sure short-circuiting and NULL handling is
-- correct. Use a table as source to prevent constant simplification
--- to interfer.
+-- from interfering.
CREATE TABLE booltbl4(isfalse bool, istrue bool, isnul bool);
INSERT INTO booltbl4 VALUES (false, true, null);
\pset null '(null)'
SET datestyle TO iso;
--- values close to timetamp minimum
+-- values close to timestamp minimum
INSERT INTO brin_timestamp_test
SELECT '4713-01-01 00:00:01 BC'::timestamptz + (i || ' seconds')::interval
FROM generate_series(1,30) s(i);
--- values close to timetamp maximum
+-- values close to timestamp maximum
INSERT INTO brin_timestamp_test
SELECT '294276-12-01 00:00:01'::timestamptz + (i || ' seconds')::interval
FROM generate_series(1,30) s(i);
WHERE q0.a = 1;
--
----- Only one side is unqiue
+---- Only one side is unique
--select * from sl t1, sl t2 where t1.a = t2.a and t1.b = 1;
--select * from sl t1, sl t2 where t1.a = t2.a and t2.b = 1;
--
projects / postgresql.git / commitdiff