> * -Add deleted bit to index tuples to reduce heap access

fixed bug reported by Noel Rappin (nrappin@sockeye.com) java Array type handled Timestamps incorrectly

with the Cursor object's fetchmany() method.  The API and
inline documentation state that the default is 1.  It
currently defaults to 5.

Patrick Macdonald

CONSTRAINTS.

Neil Conway <neilconway@rogers.com>

> * Add FILLFACTOR to btree index creation

 precision storage format. Previously applied the same math as used for the
 64-bit integer storage format case, which was wrong.
 Problem introduced recently when the 64-bit storage format was
 implemented.

a multicolumn-capable index AM *must* support nulls in index columns
after the first one.

that would do the wrong thing with BLOB OIDs exceeding 2G.

> * Add BSD-licensed qsort() for Solaris

one immediately upon forking to handle a new connection, and one after
the authentication cycle is finished.  Per today's pggeneral discussion.

having names conflicting with system objects will work --- the search
path is now user-schema, pg_catalog rather than implicitly the other way
around.  Note this requires being careful to explicitly qualify references
to system names whenever pg_catalog is not first in the search path.
Also, add support for dumping ACLs of schemas.

quotes only when necessary.

Makefile.shlib system, not MakeMaker.

Patch from Teodor Sigaev.

Patch from Teodor Sigaev.

> * Add BSD-licensed qsort() for 32-bit Solaris

From Joe Conway.

where the latter is made slightly larger to allow for in-memory tuples
containing resjunk attributes.  Responds to today's complaint that one
cannot UPDATE a table containing the allegedly-legal maximum number of
columns.

Also, apply Manfred Koizar's recent patch to avoid extra alignment padding
when there is a null bitmap.  This saves bytes in some cases while not
creating any backward-compatibility problem AFAICS.

> * Add getpid() function to backend

and just slow down normal operations (only fractionally, but a cycle saved
is a cycle earned).  Improve documentation of AMI_OVERRIDE behavior.

wasn't seen before, maybe the Tcl compiler flags were less strict.

transaction, so as to avoid returning them out of the index AM.  Saves
repeated heap_fetch operations on frequently-updated rows.  Also detect
queries on unique keys (equality to all columns of a unique index), and
don't bother continuing scan once we have found first match.

Killing is implemented in the btree and hash AMs, but not yet in rtree
or gist, because there isn't an equally convenient place to do it in
those AMs (the outer amgetnext routine can't do it without re-pinning
the index page).

Did some small cleanup on APIs of HeapTupleSatisfies, heap_fetch, and
index_insert to make this a little easier.