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-Thread: 103376,703c4f68db81387d
X-Google-Thread: 109fba,703c4f68db81387d
X-Google-Thread: 115aec,703c4f68db81387d
X-Google-Thread: f43e6,703c4f68db81387d
X-Google-Attributes: gid103376,gid109fba,gid115aec,gidf43e6,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news3.google.com!news.glorb.com!newscon02.news.prodigy.com!newscon06.news.prodigy.com!prodigy.net!newsfeed-00.mathworks.com!nntp.TheWorld.com!not-for-mail
From: Robert A Duff <bobduff@shell01.TheWorld.com>
Newsgroups: comp.lang.ada,comp.lang.c++,comp.realtime,comp.software-eng
Subject: Re: Teaching new tricks to an old dog (C++ -->Ada)
Date: 12 Mar 2005 18:06:42 -0500
Organization: The World Public Access UNIX, Brookline, MA
Message-ID: <wccfyz0tqf1.fsf@shell01.TheWorld.com>
References: <4229bad9$0$1019$afc38c87@news.optusnet.com.au>
 <1110032222.447846.167060@g14g2000cwa.googlegroups.com>
 <871xau9nlh.fsf@insalien.org>
 <3SjWd.103128$Vf.3969241@news000.worldonline.dk>
 <87r7iu85lf.fsf@insalien.org> <1110052142.832650@athnrd02>
 <d0dkq6$781$1@titan.btinternet.com>
 <1110284070.410136.205090@o13g2000cwo.googlegroups.com>
 <395uqaF5rhu2mU1@individual.net> <112rs0bdr2aftdf@corp.supernews.com>
 <1inxxr988rxgg$.1w9dedak41k89.dlg@40tude.net>
 <112s1r0rf0o8nca@corp.supernews.com> <u7jkhhmnv.fsf@obry.org>
 <x7vwtsdrvp9.fsf@smaug.pushface.org> <1136a5sr4at3v3d@corp.supernews.com>
NNTP-Posting-Host: shell01-e.theworld.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
X-Trace: pcls4.std.com 1110668804 8714 69.38.147.31 (12 Mar 2005 23:06:44 GMT)
X-Complaints-To: abuse@TheWorld.com
NNTP-Posting-Date: Sat, 12 Mar 2005 23:06:44 +0000 (UTC)
User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.2
Xref: g2news1.google.com comp.lang.ada:9271 comp.lang.c++:45361
 comp.realtime:1394 comp.software-eng:4958
Date: 2005-03-12T18:06:42-05:00
List-Id: <comp.lang.ada>

CTips <ctips@bestweb.net> writes:

> Umm ... look at the set of lock-free data-structures out there. Quite
> heavy-weight structures can be implemented, including a queue where a
> thread can be adding elements while other threads are removing elements.

Umm ... what does this have to do with the discussion, which was about
C++ vs. Ada, or perhaps C vs. Ada?

Of course you can write lock-free algorithms equally well in all the
languages in question.  Of course all these languages allow machine-code
inserts, and of course you can't know from the language standard what
the compiler does with them.  If you have evidence to the contrary,
let's hear it.

- Bob