preserve double leading slashes on Win32.

e.g.    ////a////b => /a/b

actual executable location.  This allows people to continue to use
setups where, eg, postmaster is symlinked from a convenient place.
Per gripe from Josh Berkus.

won't have trivial differences in their common prefix.

tablespace clauses; this should improve compatibility of dump files.
Philip Warner, some rework by Tom Lane.

type-and-length coercion function, make sure that the coercion function
is told the correct typmod.  Fixes Kris Jurka's example of a domain
over bit(N).

* Allow database recovery where tablespaces can't be created

  When a pg_dump is restored, all tablespaces will attempt to be created
  in their original locations. If this fails, the user must be able to
  adjust the restore process.

duplicates sample entries from comments.

default on Win32.

everywhere not just some places, get rid of . and .. when joining path
sections together.  This should eliminate most of the ugly paths like
/foo/bar/./baz that we've been generating.

RestrictInfo nodes in the query expression.  Per example from James Robinson.

clause implicitly whenever one is not given explicitly.  Remove concept
of a schema having an associated tablespace, and simplify the rules for
selecting a default tablespace for a table or index.  It's now just
(a) explicit TABLESPACE clause; (b) default_tablespace if that's not an
empty string; (c) database's default.  This will allow pg_dump to use
SET commands instead of tablespace clauses to determine object locations
(but I didn't actually make it do so).  All per recent discussions.

<   one column or expression indexes, perhaps using per=index statistics
>   one column or expression indexes, perhaps using per-index statistics

< * Add transaction_timestamp(), statement_timestamp(), clock_timestamp() functionality
> * Add transaction_timestamp(), statement_timestamp(), clock_timestamp()
>   functionality
278c279
<   one column
>   one column or expression indexes, perhaps using per=index statistics
846a848
> * Remove kerberos4 from source tree?

>
> * Add fillfactor to control reserved free space during index creation

> * Allow accurate statistics to be collected on indexes with more than
>   one column

<   that can spam more than one table.
>   that can span more than one table.
239c239
<   rather than just col1
>   rather than just col1; also called skip-scanning.
641c641,642
< * Add free-behind capability for large sequential scans [fadvise]
> * Allow free-behind capability for large sequential scans, perhaps using
>   posix_fadvise() [fadvise]

< * Allow the creation of bitmap indexes which can be quickly combined
<   with other bitmap indexes
> * Allow non-bitmap indexes to be combined by creating bitmaps in memory
259,261c258,259
<   combined.  Such indexes could be more compact if there are few unique
<   value.  Also, perhaps they can be lossy requiring a scan of the heap page
<   to find matching rows.
>   combined.  They can index by tid or can be lossy requiring a scan of the
>   heap page to find matching rows.
263c261,262
< * Allow non-bitmap indexes to be combined
> * Allow the creation of on-disk bitmap indexes which can be quickly
>   combined with other bitmap indexes
265,266c264
<   Do lookups on non-bitmap indexes and create bitmaps in memory that can be
<   combined with other indexes.
>   Such indexes could be more compact if there are few unique value.

for consistency.

- add some additional files to the dbmirror install (approved by
ssinger)

- add a makefile for contrib/mysql, and add mysql to the list of
contribs build by default

- use xml2-config to pickup -I flags for libxml2 in contrib/xml and
contrib/xml2

Original work from Martin Pitt of Debian, minor cleanups by Neil
Conway.

< * Use bitmaps to combine existing indexes [performance]
> * Allow the creation of bitmap indexes which can be quickly combined
>   with other bitmap indexes
255,257c256,266
<   Bitmap indexes allow single indexed columns to be combined to
<   dynamically create a composite index to match a specific query. Each
<   index is a bitmap, and the bitmaps are AND'ed or OR'ed to be combined.
>   Bitmap indexes index single columns that can be combined with other bitmap
>   indexes to dynamically create a composite index to match a specific query.
>   Each index is a bitmap, and the bitmaps are bitwise AND'ed or OR'ed to be
>   combined.  Such indexes could be more compact if there are few unique
>   value.  Also, perhaps they can be lossy requiring a scan of the heap page
>   to find matching rows.
>
> * Allow non-bitmap indexes to be combined
>
>   Do lookups on non-bitmap indexes and create bitmaps in memory that can be
>   combined with other indexes.

Add the script name to the tmp directory name.

Move trap up now that the dir is more unique.

<   This perhaps should use a round-robin allocation system where several
<   tablespaces are used in a cycle.  The cycle pointer should be global.
>   It could start with a random tablespace from a supplied list and cycle
>   through the list.

< 	  store heap rows in hashed groups.
> 	  store heap rows in hashed groups, perhaps using a user-supplied
> 	  hash function.

< 	  automatically access the heap data too.
> 	  automatically access the heap data too.  A third idea would be to
> 	  store heap rows in hashed groups.