Lo van den Berg <lvd### [at] baannl> wrote in article
<34c709eb.0@news.povray.org>...
> Hi,
> 
> I have a simple pythagoras tree. As you all know this is made using
> recursion. I have one problem with it : the recursion level cannot be
higher
> than 8.
> 
> Is there something that I missed?
> 
> Lo van den Berg
> lvd### [at] baannl
> 

	You're not running out of memory are you ? All that recursive #include-ing
of files is going to eat up memory fast! Do you get any errors during
parsing ? Think about how many copies of the file and all the objects your
going to be creating - from looking at the code it looks like in each
recursion you produce two more copies of everything, so you start with 1,
then you have 3, then 7, then 15, and so on until at level 8 you've got 255
copies, even if the file and objects only take up 100k per level that's
25500k or 24Mb!

-- 
Scott Hill
Sco### [at] DDLinkscouk
Software Engineer (and all round nice guy)

"The best trick the devil ever pulled was convincing people he didn't
exist..."
								- Verbal Kent.

"the Internet is here so we can waste time talking about nothing in 
 particular when we should be working" - Marcus Hill.

Post a reply to this message