Well - it is not 'compiled' until the first time you run it - this is so that it will work with circular dependancies.
Iam not sure how much it compiles it, but I think it at least stores parse-trees, because if you drop a table and
recreateit and run the same function on it, it will cause an error a la 'can't find relation 11312'.
Regards,
Aasmund.
On Wed, 21 Nov 2001 20:09:42 -0500, "Andrew G. Hammond" <drew@xyzzy.dhs.org> wrote:
> -----BEGIN PGP SIGNED MESSAGE-----
> Hash: SHA1
>
> On 2001 November 19 09:42 am, Roland Roberts wrote:
>
> You're right, they're interpreted at run time. If you want proof, just write
> a bogus function definition. It'll CREATE just fine, but barf with a syntax
> error when you try and execute it.
>
> - --
> Andrew G. Hammond mailto:drew@xyzzy.dhs.org http://xyzzy.dhs.org/~drew/
> 56 2A 54 EF 19 C0 3B 43 72 69 5B E3 69 5B A1 1F 613-389-5481
> 5CD3 62B0 254B DEB1 86E0 8959 093E F70A B457 84B1
> "To blow recursion you must first blow recur" -- me
> -----BEGIN PGP SIGNATURE-----
> Version: GnuPG v1.0.6 (GNU/Linux)
> Comment: For info see http://www.gnupg.org
>
> iEYEARECAAYFAjv8UFoACgkQCT73CrRXhLHSBwCeKEbDRUezLXS/Q1vP1VlXAdTD
> RVoAoI8qA8Q5C2hVdXwPGBt/3UnOKF4T
> =8+Us
> -----END PGP SIGNATURE-----
>
> ---------------------------(end of broadcast)---------------------------
> TIP 5: Have you checked our extensive FAQ?
>
> http://www.postgresql.org/users-lounge/docs/faq.html
Aasmund Midttun Godal
aasmund@godal.com - http://www.godal.com/
+47 40 45 20 46