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.7 required=5.0 tests=BAYES_00,INVALID_DATE,
	MSGID_SHORT,REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no
	version=3.4.4
Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!cs.utexas.edu!uunet!seas.gwu.edu!mfeldman
From: mfeldman@seas.gwu.edu (Michael Feldman)
Newsgroups: comp.lang.ada
Subject: Re: LRM 4.1.3 paragraphs 17-19
Keywords: Speeding Up Ada
Message-ID: <2715@sparko.gwu.edu>
Date: 13 Feb 91 04:32:23 GMT
References: <1991Feb8.063458.850@kestrel.edu> <1991Feb09.023913.524@mojsys.com> <2704@sparko.gwu.edu> <631.27b781ac@vger.nsu.edu> <2711@sparko.gwu.edu> <1991Feb12.154418@riddler.Berkeley.EDU>
Reply-To: mfeldman@seas.gwu.edu ()
Distribution: usa
Organization: The George Washington University, Washington D.C.
List-Id: <comp.lang.ada>

In article <1991Feb12.154418@riddler.Berkeley.EDU> yow@riddler.Berkeley.EDU (Billy Yow 283-4009) writes:
>  
>>assert that Ada executables are _necessarily_ slow. They are actually pleased 
>>when I point out the "little" ways in which Ada can be faster.
>>They say "hmmmm... I never focused on that..."
>
>What are the ""little" ways"? 
>
Well, I think that universal assignment and equality testing are one way.
(That's what started this thread...)

Another is the parameter passing scheme, in which reference semantics can
be used to pass arrays to IN parameters with no danger that the actual
will be changed (because IN parameters can't be written to).
Less copying (though a colleague of mine pointed out that the extra
indirection could actually make the program _slower_.)

I think pragma INLINE could be considered one of these, too, in that
it can reduce the number of procedure calls (at the cost of space,
of course) without giving up the abstraction.

I had a few more, but can't think of 'em offhand. Getting old...

Mike