| From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
|---|---|
| To: | Peter Eisentraut <peter_e(at)gmx(dot)net> |
| Cc: | pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: pg_dump sort order for functions |
| Date: | 2010-01-12 14:44:55 |
| Message-ID: | 3503.1263307495@sss.pgh.pa.us |
| Views: | Whole Thread | Raw Message | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Peter Eisentraut <peter_e(at)gmx(dot)net> writes:
> On mn, 2010-01-11 at 12:54 -0500, Tom Lane wrote:
>> -- Name: binary_coercible(oid, oid); Type: FUNCTION; Schema: public; Owner: postgres
> Um, that tag is the "name", and if you change that, the name in CREATE
> FUNCTION also changes.
So?
> In the mean time, hacking it into the sort function itself as a special
> case works out fine, per attached patch. One might frown upon such an
> exception, but then again, function overloading is an exception to the
> one-name-per-object rule all over the place anyway. ;-)
No, that's a completely bogus solution, because it depends on type
OIDs. It won't be stable across dump/reload, which defeats the purpose
AFAICS.
regards, tom lane
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Magnus Hagander | 2010-01-12 14:53:38 | Re: pg_dump sort order for functions |
| Previous Message | Andrew Chernow | 2010-01-12 14:43:53 | Re: Typed tables |