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=-0.3 required=5.0 tests=BAYES_00, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Thread: a07f3367d7,13280cdb905844e4 X-Google-Attributes: gida07f3367d7,public,usenet X-Google-NewGroupId: yes X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news4.google.com!feeder.news-service.com!188.40.43.213.MISMATCH!feeder.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: Colin Paul Gloster Newsgroups: comp.lang.ada Subject: Re: Is there an Ada compiler whose Ada.Numerics.Generic_Elementary_Functions.Log(Base=>10, X=>variable) is efficient? Date: Wed, 17 Feb 2010 10:25:03 +0000 Organization: A noiseless patient Spider Message-ID: References: Reply-To: Colin Paul Gloster Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Injection-Date: Wed, 17 Feb 2010 10:27:22 +0000 (UTC) Injection-Info: feeder.eternal-september.org; posting-host="kheEuXGHhE2Z5eF1gAST+A"; logging-data="4150"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19jcUKof9/cVFDOGJrHhFa7VrVVEmI9hp/Q9iLAIxjs5w==" User-Agent: Alpine 2.00 (LNX 1167 2008-08-23) In-Reply-To: Cancel-Lock: sha1:HU9kshH4AtH6lo/4p0mtJSgyB7Y= X-X-Sender: Colin_Paul@Bluewhite64.example.net Xref: g2news1.google.com comp.lang.ada:9273 Date: 2010-02-17T10:25:03+00:00 List-Id: On Tue, 16 Feb 2010, Jeffrey R. Carter sent: |------------------------------------------------------------------| |"[..] | | | |[..] when comparing execution times between Ada and a language | |like C++, it's important not to try to compare apples to lugnuts."| |------------------------------------------------------------------| Fair enough, but when I say Ada is better than C++ I am not comparing an apple with an apple. Anyway, as I mentioned in news:alpine.LNX.2.00.1002161654110.21651@Bluewhite64.example.net in response to Bill Findlay, G++ has produced much slower code than GNAT (the GNATism is in standard Ada, merely the obvious way to do it in standard Ada is different)... gnatmake -O3 -ffast-math Logarithmic_Work_In_Ada_with_a_Findlay_loop_with_a_Parker_GNATism_compiled_by_GCC4.4.3_with_-ffast-math.adb -o Logarithmic_Work_In_Ada_with_a_Findlay_loop_with_a_Parker_GNATism_compiled_by_GCC4.4.3_with_-ffast-math time ./Logarithmic_Work_In_Ada_with_a_Findlay_loop_with_a_Parker_GNATism_compiled_by_GCC4.4.3_with_-ffast-math 6.34086408606382E+08 real 0m14.434s user 0m14.433s sys 0m0.004s g++ -O3 -ffast-math logarithmic_work_in_CPlusPlus_with_a_Findlay_loop.cc -o logarithmic_work_in_CPlusPlus_with_a_Findlay_loop_compiled_by_GCC4.4.3_with_-ffast-math time ./logarithmic_work_in_CPlusPlus_with_a_Findlay_loop_compiled_by_GCC4.4.3_with_-ffast-math 6.34086e+08 real 0m38.388s user 0m38.390s sys 0m0.000s