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,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,38fc011071df5a27
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2003-06-07 11:39:37 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!postnews1.google.com!not-for-mail
From: 18k11tm001@sneakemail.com (Russ)
Newsgroups: comp.lang.ada
Subject: Re: Ideas for Ada 200X
Date: 7 Jun 2003 11:39:35 -0700
Organization: http://groups.google.com/
Message-ID: <bebbba07.0306071039.3d41d843@posting.google.com>
References: <bebbba07.0306062150.23d77158@posting.google.com>
 <CFfEa.48068$d51.104155@sccrnsc01>
NNTP-Posting-Host: 63.194.87.148
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 8bit
X-Trace: posting.google.com 1055011176 30137 127.0.0.1 (7 Jun 2003 18:39:36
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: 7 Jun 2003 18:39:36 GMT
Xref: archiver1.google.com comp.lang.ada:38788
Date: 2003-06-07T18:39:36+00:00
List-Id: <comp.lang.ada>

tmoran@acm.org wrote in message news:<CFfEa.48068$d51.104155@sccrnsc01>...
> >Compare
> >
> >    A := B + C + D
> >
> >with
> >
> >    A := B
> >    A += C
> >    A += D
>   A good Ada programmer would first write a function "+"(Left,Right:Matrices)
> and write
>   A := B + C + D
> and make sure his algorithm worked.
> If he then found there were performance problems, and they were in that
> part of his code, he would then try implementing
> >    A := B
> >    A += C
> >    A += D
> [though he would write it as
>  A := B;
>  Add(A, C);
>  Add(A, D);]

And the person reading this code couldn't be sure what was going on in
"Add" without looking at the procedure itself (or perhaps its
declaration). How would the reader know if the sum will end up in the
first or second argument?