From e1829591cbce3f9ff49f81fe895f5c16c136ba21 Mon Sep 17 00:00:00 2001 From: Bruce Momjian Date: Mon, 12 Nov 2007 01:37:34 +0000 Subject: [PATCH] Trim trailing whitespace --- needed commit to update anoncvs. --- doc/src/sgml/intarray.sgml | 52 +++++++++++++++++++------------------- 1 file changed, 26 insertions(+), 26 deletions(-) diff --git a/doc/src/sgml/intarray.sgml b/doc/src/sgml/intarray.sgml index 7e538a894d..e3240f6189 100644 --- a/doc/src/sgml/intarray.sgml +++ b/doc/src/sgml/intarray.sgml @@ -27,8 +27,8 @@ int icount(int[]) - the number of elements in intarray -test=# select icount('{1,2,3}'::int[]); - icount +test=# select icount('{1,2,3}'::int[]); + icount -------- 3 (1 row) @@ -41,7 +41,7 @@ test=# select icount('{1,2,3}'::int[]); test=# select sort('{1,2,3}'::int[],'desc'); - sort + sort --------- {3,2,1} (1 row) @@ -56,7 +56,7 @@ test=# select sort('{1,2,3}'::int[],'desc'); - int[] sort_asc(int[]),sort_desc(int[]) - shortcuts for sort + int[] sort_asc(int[]),sort_desc(int[]) - shortcuts for sort @@ -66,7 +66,7 @@ test=# select sort('{1,2,3}'::int[],'desc'); test=# select uniq(sort('{1,2,3,2,1}'::int[])); - uniq + uniq --------- {1,2,3} (1 row) @@ -75,12 +75,12 @@ test=# select uniq(sort('{1,2,3,2,1}'::int[])); - int idx(int[], int item) - returns index of first + int idx(int[], int item) - returns index of first intarray matching element to item, or '0' if matching failed. test=# select idx('{1,2,3,2,1}'::int[],2); - idx + idx ----- 2 (1 row) @@ -89,12 +89,12 @@ test=# select idx('{1,2,3,2,1}'::int[],2); - int[] subarray(int[],int START [, int LEN]) - returns - part of intarray starting from element number START (from 1) and length LEN. + int[] subarray(int[],int START [, int LEN]) - returns + part of intarray starting from element number START (from 1) and length LEN. test=# select subarray('{1,2,3,2,1}'::int[],2,3); - subarray + subarray ---------- {2,3,2} (1 row) @@ -107,7 +107,7 @@ test=# select subarray('{1,2,3,2,1}'::int[],2,3); test=# select intset(1); - intset + intset -------- {1} (1 row) @@ -178,8 +178,8 @@ test=# select intset(1); int[] @@ query_int - returns TRUE if array satisfies query (like - '1&(2|3)') + returns TRUE if array satisfies query (like + '1&(2|3)') @@ -212,7 +212,7 @@ CREATE unique index message_section_map_key2 ON message_section_map (sid, mid ); CREATE INDEX message_rdtree_idx ON message USING GIST ( sections gist__int_ops); -- select some messages with section in 1 OR 2 - OVERLAP operator -SELECT message.mid FROM message WHERE message.sections && '{1,2}'; +SELECT message.mid FROM message WHERE message.sections && '{1,2}'; -- select messages contains in sections 1 AND 2 - CONTAINS operator SELECT message.mid FROM message WHERE message.sections @> '{1,2}'; @@ -232,29 +232,29 @@ SELECT message.mid FROM message WHERE '{1,2}' <@ message.sections; 2. psql TEST < ../_int.sql 3. ./create_test.pl | psql TEST 4. ./bench.pl - perl script to benchmark queries, supports OR, AND queries - with/without RD-Tree. Run script without arguments to + with/without RD-Tree. Run script without arguments to see availbale options. a)test without RD-Tree (OR) ./bench.pl -d TEST -c -s 1,2 -v - b)test with RD-Tree + b)test with RD-Tree ./bench.pl -d TEST -c -s 1,2 -v -r BENCHMARKS: - + Size of table <message>: 200000 - Size of table <message_section_map>: 269133 - + Size of table <message_section_map>: 269133 + Distribution of messages by sections: - + section 0: 74377 messages section 1: 16284 messages section 50: 1229 messages section 99: 683 messages - + old - without RD-Tree support, new - with RD-Tree - + +----------+---------------+----------------+ |Search set|OR, time in sec|AND, time in sec| | +-------+-------+--------+-------+ @@ -274,10 +274,10 @@ SELECT message.mid FROM message WHERE '{1,2}' <@ message.sections; Authors - All work was done by Teodor Sigaev (teodor@stack.net) and Oleg - Bartunov (oleg@sai.msu.su). See - for - additional information. Andrey Oktyabrski did a great work on adding new + All work was done by Teodor Sigaev (teodor@stack.net) and Oleg + Bartunov (oleg@sai.msu.su). See + for + additional information. Andrey Oktyabrski did a great work on adding new functions and operations.