Re: [GENERAL] Documentation - PgAdmin

From: Guillaume Lelarge <guillaume(at)lelarge(dot)info>
To: db(dot)subscriptions(at)shepherdhill(dot)biz
Cc: pgsql-general(at)postgresql(dot)org, pgadmin-support(at)postgresql(dot)org
Subject: Re: [GENERAL] Documentation - PgAdmin
Date: 2009-07-06 06:57:26
Message-ID: 200907060857.26273.guillaume@lelarge.info
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgadmin-support pgsql-general

Le lundi 6 juillet 2009 à 05:49:24, db(dot)subscriptions(at)shepherdhill(dot)biz a écrit
:
> Quoting Guillaume Lelarge <guillaume(at)lelarge(dot)info>:
> > If I remember well, the reason was the installer would be much bigger if
> > we still included it. And we would also have to carry the pgAdmin CHM,
> > and the Slony one, and the EnterpriseDB one and now the Greenplum one.
> > And what about translations? If we do this, 90% of the installer size
> > would be for docs. Kind
> > of strange if you want my opinion.
>
> I totally disagree with you. I am asking for core postgreSQL CHM and
> not Slony, Greenplum or EnterpriseDB. And postgreSQL CHM is only about
> 3MB.
>
> If I want Slony, Greenplum or EnterpriseDB, I will go to their sites.
>

It's not because *you* don't need the other CHM that *others* don't need them
too. We supply quick access to each of these manuals, so if we bundle one,
others will ask we bundle the other CHM.

Anyways, this question should better be asked on the pgAdmin support mailing
list (I CC-ed them) than on the pgsql-general list.

--
Guillaume.
http://www.postgresqlfr.org
http://dalibo.com

In response to

Browse pgadmin-support by date

  From Date Subject
Next Message Dave Page 2009-07-06 07:33:50 Re: Documentation - PgAdmin
Previous Message Ricardo Pinho 2009-07-06 00:49:08 GISVM Server pre-release available

Browse pgsql-general by date

  From Date Subject
Next Message Konstantin Izmailov 2009-07-06 07:21:43 howto determine rows count to be returned by DECLARE ... SELECT ...
Previous Message A. Kretschmer 2009-07-06 06:19:51 Re: LIKE problem