prevents problems when the DECLARE is in a portal and is executed
repeatedly, as is possible in v3 protocol.  Per analysis by Oliver
Jowett, though I didn't use his patch exactly.

<   information, either by name or offset from UTC
>   information, either zone name or offset from UTC
>
>   If the TIMESTAMP value is stored with a time zone name, interval
>   computations should adjust based on the time zone rules, e.g. adding
>   24 hours to a timestamp would yield a different result from adding one
>   day.
>

who use it scan the relevant source files for their own catalog.  It
creates a bit of duplicate work for translators, but it gets the job done
for now.

by Troels Arvin, Simon Riggs, Elein Mustain

Make spelling of SQL standard names uniform.

integration.  It is much better to create a word list of unstemmed words
than stemmed ones.

Chris K-L

8.4.1).  This corrects some curious regex bugs, though not the greediness
issue I was hoping to find a solution for :-(

error conditions during regexp compile, but not during regexp execution;
any sort of "can't happen" errors would be treated as no-match instead
of being reported as they should be.  Noticed while trying to duplicate
a reported Tcl bug.

to be processed by GUC before InitPostgres, because any required lookup
of the encoding conversion function has to be done during InitializeClientEncoding.
So, I broke this last week by moving GUC processing to after InitPostgres :-(.
What we can do as a compromise is process non-SUSET variables during
command line scanning (the same as before), and postpone the processing
of only SUSET variables.  None of the SUSET variables need to be set
before InitPostgres.

Per report from Mark Kirkwood.

include "\s" in \? output when readline is enabled, but that commit
supressed "\s" whether readline was enabled or not.

a home-brewed combination of assertions that boiled down to the same
thing.

has been defined. Previously, pgcrypto would compile but would be
unusable.

data returned from Perl.  Consolidate multiple bits of code to convert
a Perl hash to a tuple, and drive the conversion off the keys present
in the hash rather than the tuple column names, so we detect error if
the hash contains keys it shouldn't.  (This means keys not in the hash
will silently default to NULL, which seems ok to me.)  Fix a bunch of
reference-count leaks too.

covers return value processing, but that was the most broken stuff...

Get rid of static variables for SETOF result, don't crash when called
from non-FROM context, eliminate dead code, etc.

update us to beta5

fill factor has been exceeded.  We usually run with ffactor == 1, but
the way the test was coded, it wouldn't split a bucket until the actual
fill factor reached 2.0, because of use of integer division.  Change
from > to >= so that it will split more aggressively when the table
starts to get full.

few cycles during transaction exit.  A typical session probably
wouldn't have as many as half a dozen portals open at once, so the
original value of 64 seems far larger than needed.

subtransactions quite right either: the ReleaseCurrentSubTransaction
call should occur inside the PG_TRY, so that the proper path is taken
if an error occurs during subtransaction commit.  This assumes that
AbortSubTransaction can cope with the state left behind if
CommitSubTransaction fails partway through, but we were already
requiring that.

it's not really broken.  Andrew Dunstan

operations are now run as subtransactions, so that errors in them
can be reported as ordinary Perl or Tcl errors and caught by the
normal error handling convention of those languages.  Also do some
minor code cleanup in pltcl.c: extract a large chunk of duplicated
code in pltcl_SPI_execute and pltcl_SPI_execute_plan into a shared
subroutine.

the year from a BC date, but failed to make the same fix in
date_part(timestamptz).

is nothing to do, which is most of the time.  This is another simple
improvement to cut subtransaction entry/exit overhead.

no need for it to be nearly as big as the global hash table, and since
it's not in shared memory it can grow if it does need to be bigger.
By reducing the size, we speed up hash_seq_search(), which saves a
significant fraction of subtransaction entry/exit overhead.