From: Phil Thornley <phil.jpthornley@googlemail.com>
Subject: Re: SPARK and unbounded tree structures
Date: Thu, 11 Jun 2009 01:28:58 -0700 (PDT)
Date: 2009-06-11T01:28:58-07:00 [thread overview]
Message-ID: <4995c478-c8ed-425d-a720-697ea7ad2711@n21g2000vba.googlegroups.com> (raw)
In-Reply-To: 015c9570-0f07-492a-85aa-2289a477e2b0@x5g2000yqk.googlegroups.com
On 11 June, 08:35, Rod Chapman <roderick.chap...@googlemail.com>
wrote:
...
> You also need to consider that SPARK is non-recurive, so
> walking and building such data structures nees to be
> done with wholly iterative algorithms, which is an unusual
> programming style to say the least.
There are some iterative tree algorithms by Julienne Walker at
eternallyconfuzzled.com.
(A variant of the Red-Black tree algorithm there has been used on a
SPARK project.)
Phil Thornley
next prev parent reply other threads:[~2009-06-11 8:28 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
2009-06-10 16:52 SPARK and unbounded tree structures xorquewasp
2009-06-11 7:35 ` Rod Chapman
2009-06-11 8:28 ` Phil Thornley [this message]
2009-06-11 8:43 ` xorque
2009-06-11 10:31 ` Stephen Leake
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox