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,701270dccdaf7b2 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-06-01 06:51:29 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed.icl.net!newsfeed.fjserv.net!diablo.theplanet.net!newspeer1-gui.server.ntli.net!ntli.net!newsfep4-glfd.server.ntli.net.POSTED!53ab2750!not-for-mail From: "chris.danx" User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.4b) Gecko/20030507 X-Accept-Language: en-us, en MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: In place matrix multiplication? References: <1JcCa.16479$Mu3.361103@newsfep4-glfd.server.ntli.net> In-Reply-To: Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Message-ID: Date: Sun, 01 Jun 2003 14:54:02 +0200 NNTP-Posting-Host: 81.107.63.23 X-Complaints-To: abuse@ntlworld.com X-Trace: newsfep4-glfd.server.ntli.net 1054475489 81.107.63.23 (Sun, 01 Jun 2003 14:51:29 BST) NNTP-Posting-Date: Sun, 01 Jun 2003 14:51:29 BST Organization: ntl Cablemodem News Service Xref: archiver1.google.com comp.lang.ada:38284 Date: 2003-06-01T14:54:02+02:00 List-Id: Dmitry A. Kazakov wrote: > Something like this, I presume: > Thanks Dmitry. I've simplified it by just using a floating point type, rather than an abstraction (the abstraction provided only additional complexity and little benefit otherwise). Now I'm wondering if the cost of the more complex code is more expensive than doing an out of place multiplication followed by a copy back to the original array. I guess that'd depend on the code and the compiler. How do I find out which is cheaper in time for a given compiler (GNAT)? Thanks Again, Chris