Path: utzoo!attcan!uunet!clyde.concordia.ca!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!zaphod.mps.ohio-state.edu!think.com!mintaka!bloom-beacon!eru!hagbard!sunic!nuug!sigyn.idt.unit.no!news
From: Arne.Venstad@elab-runit.sintef.no
Newsgroups: comp.sys.mac.hypercard
Subject: HC stack overflow
Message-ID: <90Nov9.125535*Arne.Venstad@elab-runit.sintef.no>
Date: 9 Nov 90 11:55:35 GMT
Sender: news@idt.unit.no (Usenet news admin)
Distribution: comp.sys.mac.hypercard
Organization: ELAB-RUNIT, SINTEF, Trondheim, Norway.
Lines: 27

Hi,

I am working on a genealogy stack (still working in HC 1.2.x context, but will be switching
to 2.0 when possible). I have implemented a recursive graph (or really tree) coloring
algorithm in HyperTalk which works nicely in most cases.  The problem is that when the
heigth of the ancestor tree becomes to big (about 18-20 generations), the HC stack will
be exhausted. I know this is an inherent problem in HC (and other systems as well), but
I would be more happy if I could:

    1. Handle the stack overflow situation from my script (like on stackOverflowErr...),
    2. or calculate on beforehand the maximum number of recursions allowed for my message
       handler.
    3. Increase stack of HC.

I guess 3. is out of question, but it would have been fine to get some hints on how to
minimize the stack consumption for each execution of a message handler (like avoiding
to many repeats etc.).

I would also like to thank you people in Apples HyperCard team which are reading this
newsgroup and giving very valuable information.

Best regards,
Arne Venstad         	 Email: Arne.Venstad@elab-runit.sintef.no
ELAB-RUNIT
SINTEF
7034 Trondheim,
Norway.