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=-0.3 required=5.0 tests=BAYES_00,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,ed3a51e96a1c868b
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!news3.google.com!feeder.news-service.com!ecngs!feeder.ecngs.de!Xl.tags.giganews.com!border1.nntp.ams.giganews.com!nntp.giganews.com!local2.nntp.ams.giganews.com!nntp.bt.com!news.bt.com.POSTED!not-for-mail
NNTP-Posting-Date: Thu, 24 Feb 2011 04:36:44 -0600
From: Brian Drummond <brian_drummond@btconnect.com>
Newsgroups: comp.lang.ada
Subject: Re: Using local storage pools...
Date: Thu, 24 Feb 2011 10:39:38 +0000
Reply-To: brian@shapes.demon.co.uk
Message-ID: <f2dcm6pbrtt7v93clgjpv76lakvl7ucij0@4ax.com>
References: <7elam6trrv39c3p9iop4fiduqa1jrat4r4@4ax.com>
 <1s8rimsarxcf5$.11o58i7ssmfic.dlg@40tude.net>
 <fd7bm6hbsihk68rnjvh6vt5mjgob1kngh7@4ax.com>
 <17i1ytb9bptzk$.1b6rl6rjp4p79.dlg@40tude.net>
 <4d662a37$0$7659$9b4e6d93@newsspool1.arcor-online.net>
X-Newsreader: Forte Agent 1.7/32.534
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-Usenet-Provider: http://www.giganews.com
X-AuthenticatedUsername: NoAuthUser
X-Trace: 
 sv3-YAcr/HRMiz/bW6svmXSTZdtO63/GBYYLlzGWdcfgDEK+OS5TUvM3gwSO1hooBjJgQJ/aKtmII0P++9H!SEvPoWwnKNgkFuJwzn/i47Vs7XDDtb3gCkUuccGflWXBzDvriOJ+DrqUpIP2js8kKB2KiR+vFSVd!5g==
X-Complaints-To: abuse@btinternet.com
X-DMCA-Complaints-To: abuse@btinternet.com
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint
 properly
X-Postfilter: 1.3.40
X-Original-Bytes: 2158
Xref: g2news2.google.com comp.lang.ada:18555
Date: 2011-02-24T10:39:38+00:00
List-Id: <comp.lang.ada>

On Thu, 24 Feb 2011 10:51:51 +0100, Georg Bauhaus
<rm-host.bauhaus@maps.futureapps.de> wrote:

>On 2/24/11 10:26 AM, Dmitry A. Kazakov wrote:
>> On Wed, 23 Feb 2011 23:55:05 +0000, Brian Drummond wrote:

>"Each program should
>...
>"allocate, walk, and deallocate many bottom-up binary trees
>   * allocate a tree
>   * walk the tree nodes, checksum the node items (and maybe deallocate the node)

^^^^^^^^^^^^^^^^^^
 ... aha - I hadn't noticed this clause before...
>   * deallocate the tree
so the strategy of releasing the entire tree is explicitly allowed, releasing
individual nodes is optional. I withdraw any suggestion that the leading
contenders may be cheating.

>"<strong>Please don't implement your own custom memory pool or free list.</>"

So, Thank You Dmitry for "simple components". I'll give them a try.

- Brian