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-7-bit X-Google-Thread: 103376,1116ece181be1aea X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-09-23 01:21:24 PST Path: archiver1.google.com!news1.google.com!sn-xit-03!sn-xit-01!sn-xit-08!supernews.com!newsfeed.stanford.edu!headwall.stanford.edu!newshub.sdsu.edu!small1.nntp.aus1.giganews.com!border3.nntp.aus1.giganews.com!nntp.giganews.com!wn14feed!worldnet.att.net!204.127.198.204!attbi_feed4!attbi.com!sccrnsc02.POSTED!not-for-mail Message-ID: <3F6FFFE7.5040200@attbi.com> From: "Robert I. Eachus" User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.0; en-US; rv:1.0.2) Gecko/20021120 Netscape/7.01 X-Accept-Language: en-us, en MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Is the Writing on the Wall for Ada? References: <3F650BBE.4080107@attbi.com> <3F67AAC6.2000906@attbi.com> <3F6EF608.7010704@attbi.com> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit NNTP-Posting-Host: 24.34.139.183 X-Complaints-To: abuse@comcast.net X-Trace: sccrnsc02 1064304616 24.34.139.183 (Tue, 23 Sep 2003 08:10:16 GMT) NNTP-Posting-Date: Tue, 23 Sep 2003 08:10:16 GMT Organization: Comcast Online Date: Tue, 23 Sep 2003 08:10:16 GMT Xref: archiver1.google.com comp.lang.ada:42780 Date: 2003-09-23T08:10:16+00:00 List-Id: Russ wrote: > First of all, when I discussed the issue of temporaries I was > referring to vector/matrix arithmetic, not floats or ints. Secondly, > I claim that "+=" (or whatever you wish to call it for Ada) is > equivalent to a procedure call, and as such it has no "LHS". I guess this is just another example of what I mean. I used scalars in the first example to make it easy to write, then generalized to vectors: > If instead of the A and B being scalars, they are vectors, and the > intent is to add one to every element (instead of adding a unit > vector), the same sort of thing will happen. But in that case, the > increment and test instructions for several dozen elements of A may > be in flight simultaneously, and only if a trap occurs, will the > processor have to think about generating a consistant state. But what you are still missing is that the whole concept that you as a programmer have any idea of the number of temporary copies made--or not made by the processor is way off base. Not just out of the park on Yawkey Way, but Commonwealth Ave.--if the game is in Yankee Stadium. You program for a finite-state machine. Your code is not run on a finite-state machine. Trying to reason from the FSM representation will only lead you astray. -- Robert I. Eachus Ryan gunned down the last of his third white wine and told himself it would all be over in a few minutes. One thing he'd learned from Operation Beatrix: This field work wasn't for him. --from Red Rabbit by Tom Clancy.