Re: Seeking recursive solution to replace nested for-loops
From: Daniel Morgan <damorgan_at_x.washington.edu>
Date: Mon, 08 Mar 2004 21:08:11 -0800
Message-ID: <1078808856.366848_at_yasure>
>
>
> Not sure if you are being sarcastic or not so I'll assume not... :)
>
> I never considered it until now. I admit it was fun, but my
> implementation quickly breaks when a result is larger than 1999
> characters long (I could boost that up to varchar2(4000) of course.)
> So an implementation utilizing objects, arrays, and/or tables would be
> better.
>
> I think I would need to see some potential uses for it to consider it
> being a worthwhile task...but it would be fun.
>
> Dave
Date: Mon, 08 Mar 2004 21:08:11 -0800
Message-ID: <1078808856.366848_at_yasure>
Dave wrote:
> afilonov_at_yahoo.com (Alex Filonov) wrote in message news:<336da121.0403080804.6fb55fc@posting.google.com>...
>
>>davidr21_at_hotmail.com (Dave) wrote in message news:<8244b794.0403051147.281957af_at_posting.google.com>... >> [Quoted] >>>Cleaned up the code a little.... >>> >> >>Looks great. Ever thought of writing LISP interpreter in PL/SQL?
>
>
> Not sure if you are being sarcastic or not so I'll assume not... :)
>
> I never considered it until now. I admit it was fun, but my
> implementation quickly breaks when a result is larger than 1999
> characters long (I could boost that up to varchar2(4000) of course.)
> So an implementation utilizing objects, arrays, and/or tables would be
> better.
>
> I think I would need to see some potential uses for it to consider it
> being a worthwhile task...but it would be fun.
>
> Dave
Well if you want to see how to break up 4GB ... click here: http://www.psoug.org/reference/dbms_sql.html and look at the Executing CLOBS demo.
-- Daniel Morgan http://www.outreach.washington.edu/ext/certificates/oad/oad_crs.asp http://www.outreach.washington.edu/ext/certificates/aoa/aoa_crs.asp damorgan_at_x.washington.edu (replace 'x' with a 'u' to reply)Received on Tue Mar 09 2004 - 06:08:11 CET