From: Larry Hazel <lhazel@mindspring.com>
Subject: Re: efficient vector/matrix operations in Ada
Date: Mon, 13 Aug 2001 15:23:14 -0500
Date: 2001-08-13T20:24:08+00:00 [thread overview]
Message-ID: <3B783732.A3A1EB82@mindspring.com> (raw)
In-Reply-To: bebbba07.0108131145.8e90df5@posting.google.com
Russ wrote:
>
> Here's how you write "A = B + C + D;" efficiently:
>
> A = B;
> A += C;
> A += D;
>
> This requires no temporary matrices or passing by value. The original
> form (A=B+C+D) is fine for rapid prototyping, but the efficient form
> is preferable for production code. As far as I am concerned, Ada
> really needs arithmetic assignment operators. Sure, you can use
> procedures, but they're intent and effect is not as obvious to the
> reader.
>
Seems to me if a compiler can't generate the most efficient code for
A = B + C + D
or
A := B + C + D
in any language, you need a different compiler.
Larry
next prev parent reply other threads:[~2001-08-13 20:23 UTC|newest]
Thread overview: 20+ messages / expand[flat|nested] mbox.gz Atom feed top
2001-08-07 1:13 efficient vector/matrix operations in Ada Russ
2001-08-07 2:18 ` Dale Stanbrough
2001-08-07 2:21 ` tmoran
2001-08-07 3:04 ` Russ P.
2001-08-10 16:54 ` B.Gaffney
2001-08-13 7:50 ` Dmitry Kazakov
2001-08-13 19:45 ` Russ
2001-08-13 20:23 ` Larry Hazel [this message]
2001-08-13 21:26 ` Ted Dennison
2001-08-14 4:46 ` Russ
2001-08-14 5:28 ` David Starner
2001-08-14 8:17 ` Alexander Boucke
2001-08-14 8:56 ` Lutz Donnerhacke
2001-08-14 10:54 ` Jacob Sparre Andersen
2001-08-13 21:30 ` Ted Dennison
2001-08-14 4:56 ` Russ
2001-08-14 7:32 ` efficient vector/matrix operations in Fortran, was Re: ... " tmoran
2001-08-14 14:05 ` efficient vector/matrix operations " Ted Dennison
-- strict thread matches above, loose matches on Subject: below --
2001-08-07 11:36 Gautier Write-only-address
2001-08-14 12:37 Gautier Write-only-address
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox