On 23 September 2013 00:28, John Lawrence Aspden <aspd...@googlemail.com>wrote:
> Nice, but it won't work for me, since I'm trying to avoid computing all > the values in the table, and so I can't use the pump-priming approach. I > don't know what values I'm going to need primed! > I'm sure there are ways round it, but I think they're all complicated and > ugly. > > I think I'll translate my program into python, where presumably it will > just work. Or actually you've reminded me about Racket. I used to like that > when it was PLT scheme. > As far as I can tell, the code you have will generate a stack overflow in any language. It's not tail recursive, and the first time you run the function it can't draw from the cache. - James -- -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
