From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news2.google.com!postnews.google.com!n21g2000vba.googlegroups.com!not-for-mail From: Phil Thornley Newsgroups: comp.lang.ada Subject: Re: SPARK and unbounded tree structures Date: Thu, 11 Jun 2009 01:28:58 -0700 (PDT) Organization: http://groups.google.com Message-ID: <4995c478-c8ed-425d-a720-697ea7ad2711@n21g2000vba.googlegroups.com> References: <06f0b9ca-3c00-44e8-9a52-63c840ed0abe@21g2000vbk.googlegroups.com> <015c9570-0f07-492a-85aa-2289a477e2b0@x5g2000yqk.googlegroups.com> NNTP-Posting-Host: 80.177.171.182 Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit X-Trace: posting.google.com 1244708938 29486 127.0.0.1 (11 Jun 2009 08:28:58 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Thu, 11 Jun 2009 08:28:58 +0000 (UTC) Complaints-To: groups-abuse@google.com Injection-Info: n21g2000vba.googlegroups.com; posting-host=80.177.171.182; posting-account=Fz1-yAoAAACc1SDCr-Py2qBj8xQ-qC2q User-Agent: G2/1.0 X-HTTP-UserAgent: Mozilla/4.0 (compatible; MSIE 7.0; Windows NT 5.1; Trident/4.0; .NET CLR 1.1.4322; .NET CLR 2.0.50727),gzip(gfe),gzip(gfe) Xref: g2news2.google.com comp.lang.ada:6427 Date: 2009-06-11T01:28:58-07:00 List-Id: On 11 June, 08:35, Rod Chapman 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