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=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII
X-Google-Thread: 103376,b99897135d6631cc
X-Google-Attributes: gid103376,public
Path: 
 g2news1.google.com!news1.google.com!news.glorb.com!border1.nntp.dca.giganews.com!nntp.giganews.com!newsfeed-east.nntpserver.com!nntpserver.com!newsfeed1.sea.pnap.net!newsfeed.pnap.net!brmea-news-1.sun.com!news1nwk.sfbay.sun.com!new-usenet.uk.sun.com!not-for-mail
From: Ole-Hjalmar Kristensen
 <ole-hjalmar.kristensen@substitute_employer_here.com>
Newsgroups: comp.lang.ada
Subject: Re: memory management and productivity
Date: 24 Jun 2004 09:35:57 +0200
Organization: Sun Microsystems
Message-ID: <wvbrisdhqug2.fsf@sun.com>
References: <bebbba07.0406162056.334745ed@posting.google.com>
 <40d15023$1_1@baen1673807.greenlnk.net>
 <bebbba07.0406181510.37b8f5e2@posting.google.com>
 <cb0vjl$8hp$1@sparta.btinternet.com>
 <bebbba07.0406202016.1f15c133@posting.google.com>
 <40d69121$1_1@baen1673807.greenlnk.net>
 <bebbba07.0406211103.20060edb@posting.google.com>
 <pan.2004.06.22.02.32.11.718494@email.ro> <wvbrr7s8qatj.fsf@sun.com>
 <bebbba07.0406222041.593ab7c3@posting.google.com>
 <qc2e5zFQJM1y@eisner.encompasserve.org>
 <X_iCc.96716$dP1.318289@newsc.telia.net>
NNTP-Posting-Host: khepri06.norway.sun.com
Mime-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
X-Trace: new-usenet.uk.sun.com 1088062557 19886 129.159.112.195 (24 Jun 2004
 07:35:57 GMT)
X-Complaints-To: usenet@new-usenet.uk.sun.com
NNTP-Posting-Date: 24 Jun 2004 07:35:57 GMT
User-Agent: Gnus/5.0808 (Gnus v5.8.8) Emacs/21.2
Xref: g2news1.google.com comp.lang.ada:1847
Date: 2004-06-24T07:35:57+00:00
List-Id: <comp.lang.ada>

>>>>> "BP" == Bj�rn Persson <spam-away@nowhere.nil> writes:

    BP> Larry Kilgallen wrote:
    >> In article <bebbba07.0406222041.593ab7c3@posting.google.com>, 18k11tm001@sneakemail.com (Russ) writes:
    >> 

    >>> Bingo. That's exactly what Ada should have. And it shouldn't take a
    >>> rocket scientist to figure that out.
    >> ACT  says  they  have  not  really seen  market  demand  from  their
    >> customers,

    >> and some of them are presumably rocket scientists.

    BP> Well, I'd think rocket scientists don't want garbage collection. Their
    BP> programs are real-time systems.

In that case, you do not want any dynamic allocation whatsoever, so
the availability of garbage collection is not important.  On the other
hand, *IF* you can live with dynamic allocation, there are garbage
collection algorithms which will give hard real-time performance,
provided you have an upper bound on the size of your objects. Baker's
treadmill, the incremental copying collector, and reference-counting
schemes can all do this with a very slight loss of generality.


    BP> Developers  of desktop applications  are more  likely to  want garbage
    BP> collection,  but very  few  of them  use  Ada, and  of  those who  do,
    BP> probably very few can afford support contracts from ACT.


    BP> -- 
    BP> Bj�rn Persson                              PGP key A88682FD
    BP>                     omb jor ers @sv ge.
    BP>                     r o.b n.p son eri nu


-- 
   C++: The power, elegance and simplicity of a hand grenade.