Skip to content
Snippets Groups Projects
Commit d1e63688 authored by Thomas G. Lockhart's avatar Thomas G. Lockhart
Browse files

Clean up header for uniform appearance throughout tests.

parent 67ac3808
No related branches found
No related tags found
No related merge requests found
Showing
with 47 additions and 31 deletions
--
-- MISC
--
--
-- BTREE
......
--
-- ALTER_TABLE
-- add attribute
--
......
--
-- btree index
-- test retrieval of min/max keys for each
-- BTREE_INDEX
-- test retrieval of min/max keys for each index
--
SELECT b.*
......
--
-- case.sql
--
-- CASE
-- Test the case statement
--
......
--
-- errors.source
-- ERRORS
--
-- $Header: /cvsroot/pgsql/src/test/regress/sql/errors.sql,v 1.2 1997/05/22 00:17:24 scrappy Exp $
-- bad in postquel, but ok in postsql
select 1
......
--
-- hash index
-- HASH_INDEX
-- grep 843938989 hash.data
--
SELECT hash_i4_heap.*
WHERE hash_i4_heap.random = 843938989;
......
--
-- join.sql
--
-- JOIN
-- Test join clauses
--
......
--
-- LIMIT
-- Check the LIMIT/OFFSET feature of SELECT
--
......
-- ************************************************************
-- *
-- * Tables for the patchfield test of PL/pgSQL
-- *
-- * $Header: /cvsroot/pgsql/src/test/regress/sql/plpgsql.sql,v 1.1 1998/10/01 03:38:45 scrappy Exp $
-- *
-- ************************************************************
--
-- PLPGSQL
--
create table Room (
roomno char(8),
......@@ -104,7 +100,7 @@ create unique index PHone_name on PHone using btree (slotname bpchar_ops);
-- * Trigger procedures and functions for the patchfield
-- * test of PL/pgSQL
-- *
-- * $Header: /cvsroot/pgsql/src/test/regress/sql/plpgsql.sql,v 1.1 1998/10/01 03:38:45 scrappy Exp $
-- * $Header: /cvsroot/pgsql/src/test/regress/sql/plpgsql.sql,v 1.2 2000/01/06 06:41:55 thomas Exp $
-- *
-- ************************************************************
......@@ -1404,3 +1400,4 @@ insert into HSlot values ('HS', 'base.hub1', 20, '');
delete from HSlot;
insert into IFace values ('IF', 'notthere', 'eth0', '');
insert into IFace values ('IF', 'orion', 'ethernet_interface_name_too_long', '');
--
-- portal manipulation
-- PORTALS
--
BEGIN;
DECLARE foo1 CURSOR FOR SELECT * FROM tenk1;
......@@ -166,3 +167,4 @@ CLOSE foo11;
CLOSE foo12;
end;
--
-- PORTALS_P2
--
-- EXTEND INDEX onek2_u1_prtl WHERE onek2.unique1 <= 60;
BEGIN;
......@@ -94,3 +98,4 @@ CLOSE foo24;
CLOSE foo25;
END;
--
-- test the random function
-- RANDOM
-- Test the random function
--
-- count the number of tuples originally
SELECT count(*) FROM onek;
......
--
-- rules.sql
-- RULES
-- From Jan's original setup_ruletest.sql and run_ruletest.sql
-- - thomas 1998-09-13
--
......
--
-- SELECT
--
-- btree index
-- awk '{if($1<10){print;}else{next;}}' onek.data | sort +0n -1
--
......
--
-- SELECT_DISTINCT
--
--
-- awk '{print $3;}' onek.data | sort -n | uniq
--
......@@ -30,4 +34,3 @@ SELECT DISTINCT two, string4, ten
--
SELECT DISTINCT p.age FROM person* p ORDER BY age using >;
--
-- test select distinct on
-- SELECT_DISTINCT_ON
--
SELECT DISTINCT ON string4 two, string4, ten
FROM tmp
ORDER BY two using <, string4 using <, ten using <;
......
--
-- select_having.sql
-- SELECT_HAVING
--
-- load test data
......@@ -25,3 +25,4 @@ SELECT c, max(a) FROM test_having
GROUP BY c HAVING count(*) > 2 OR min(a) = max(a);
DROP TABLE test_having;
--
-- select_implicit.sql
--
-- SELECT_IMPLICIT
-- Test cases for queries with ordering terms missing from the target list.
-- This used to be called "junkfilter.sql".
-- The parser uses the term "resjunk" to handle these cases.
-- - thomas 1998-07-09
--
-- load test data
CREATE TABLE test_missing_target (a int, b int, c char(8), d char);
......@@ -149,4 +149,3 @@ DROP TABLE test_missing_target;
DROP TABLE test_missing_target2;
DROP TABLE test_missing_target3;
--
-- SELECT_INTO
--
SELECT *
INTO TABLE tmp1
FROM tmp
......
--
-- VIEW queries
--
-- test the views defined in create.source
-- SELECT_VIEWS
-- test the views defined in CREATE_VIEWS
--
SELECT * FROM street;
SELECT name, #thepath FROM iexit ORDER BY 1, 2;
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment