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
	autolearn=unavailable autolearn_force=no version=3.4.4
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!nntp-feed.chiark.greenend.org.uk!ewrotcd!newsfeed.xs3.de!io.xs3.de!news.jacob-sparre.dk!franka.jacob-sparre.dk!pnx.dk!.POSTED.rrsoftware.com!not-for-mail
From: "Randy Brukardt" <randy@rrsoftware.com>
Newsgroups: comp.lang.ada
Subject: Re: meaningfully/compellingly "advertising" Ada on StackOverflow
Date: Thu, 17 May 2018 16:25:07 -0500
Organization: JSA Research & Innovation
Message-ID: <pdkrvk$n53$1@franka.jacob-sparre.dk>
References: <6420bab2-0aef-4d36-b978-525e4de45e7e@googlegroups.com>
 <aed23075-1271-4e2c-b5f2-8da705e1a73e@googlegroups.com>
 <a86dc533-a8f5-4d1c-9b4c-11d7963c6d15@googlegroups.com>
Injection-Date: Thu, 17 May 2018 21:25:08 -0000 (UTC)
Injection-Info: franka.jacob-sparre.dk;
 posting-host="rrsoftware.com:24.196.82.226";
	logging-data="23715"; mail-complaints-to="news@jacob-sparre.dk"
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 6.00.2900.5931
X-RFC2646: Format=Flowed; Original
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2900.7246
Xref: reader02.eternal-september.org comp.lang.ada:52409
Date: 2018-05-17T16:25:07-05:00
List-Id: <comp.lang.ada>

"John Perry" <john.perry@usm.edu> wrote in message 
news:a86dc533-a8f5-4d1c-9b4c-11d7963c6d15@googlegroups.com...
> On Wednesday, May 16, 2018 at 9:46:32 PM UTC-5, John Perry wrote:
>>> It's quite a simple program: adding and removing ~10^6 nodes to a tree, 
>>> and testing if the tree has a value.
>>
> Argh. I knew as I was typing that that the description wasn't quite right,
> but I didn't think to correct it. It adds (10^6/3) nodes, attempts to 
> delete
>(10^6)/3, and tests for a value in the tree (10^6)/3 times. Still, it's 
>relatively
> simple.

Did you try implementing that with the Tree container as opposed to using a 
raw nodes? Probably not quite as fast, but much less work to 
write/read/maintain (since the container does the storage management and 
provides most of the algorithms).

                          Randy.