From f71145d0ec163439805d0433acb2e44a782e01f7 Mon Sep 17 00:00:00 2001 From: Peter Eisentraut Date: Tue, 17 Aug 2010 04:37:19 +0000 Subject: Spell and markup checking --- doc/src/sgml/gist.sgml | 24 ++++++++++++------------ 1 file changed, 12 insertions(+), 12 deletions(-) (limited to 'doc/src/sgml/gist.sgml') diff --git a/doc/src/sgml/gist.sgml b/doc/src/sgml/gist.sgml index eddaaad5dfa..5757ce80025 100644 --- a/doc/src/sgml/gist.sgml +++ b/doc/src/sgml/gist.sgml @@ -1,4 +1,4 @@ - + GiST Indexes @@ -102,7 +102,7 @@ decompress, which allow an index to have internal tree data of a different type than the data it indexes. The leaves are to be of the indexed data type, while the other tree nodes can be of any C struct (but - you still have to follow PostgreSQL datatype rules here, + you still have to follow PostgreSQL data type rules here, see about varlena for variable sized data). If the tree's internal data type exists at the SQL level, the STORAGE option of the CREATE OPERATOR CLASS command can be used. @@ -561,7 +561,7 @@ my_same(PG_FUNCTION_ARGS) For historical reasons, the same function doesn't - just return a boolean result; instead it has to store the flag + just return a Boolean result; instead it has to store the flag at the location indicated by the third argument. @@ -583,58 +583,58 @@ my_same(PG_FUNCTION_ARGS) (see src/backend/access/gist/gistproc.c). The following contrib modules also contain GiST operator classes: - - btree_gist + btree_gist - B-Tree equivalent functionality for several data types + B-tree equivalent functionality for several data types - cube + cube Indexing for multidimensional cubes - hstore + hstore Module for storing (key, value) pairs - intarray + intarray RD-Tree for one-dimensional array of int4 values - ltree + ltree Indexing for tree-like structures - pg_trgm + pg_trgm Text similarity using trigram matching - seg + seg Indexing for float ranges + -- cgit v1.2.3