From: Georg Bauhaus <see.reply.to@maps.futureapps.de>
Subject: Re: speed of generic code in Ada (vs Java)
Date: Sat, 17 May 2008 04:04:55 +0200
Date: 2008-05-17T04:04:55+02:00 [thread overview]
Message-ID: <482e3d47$0$6552$9b4e6d93@newsspool3.arcor-online.net> (raw)
In-Reply-To: <24bf14ef-ff0f-4309-88e0-550cd4a0dd9d@p25g2000pri.googlegroups.com>
jhc0033@gmail.com wrote:
> So, if I write a, say, linear equation solver using generics in Ada,
> and then instantiate it with single precision, double precision,
> complex number single precision and complex number double precision,
> you'd expect it to be as fast as the equivalent non-generic versions?
That's the point.
next prev parent reply other threads:[~2008-05-17 2:04 UTC|newest]
Thread overview: 15+ messages / expand[flat|nested] mbox.gz Atom feed top
2008-05-16 17:31 speed of generic code in Ada (vs Java) jhc0033
2008-05-16 18:12 ` jimmaureenrogers
2008-05-16 18:54 ` Ludovic Brenta
2008-05-17 1:50 ` jhc0033
2008-05-17 2:04 ` Georg Bauhaus [this message]
2008-05-17 6:32 ` Niklas Holsti
2008-05-17 8:07 ` Ludovic Brenta
2008-05-17 21:37 ` Gautier
2008-05-17 23:31 ` Ivan Levashew
2008-05-22 22:01 ` Florian Weimer
2008-05-21 8:12 ` Graham
2008-05-21 15:41 ` Robert A Duff
2008-05-22 0:06 ` Randy Brukardt
2008-05-23 22:55 ` Robert A Duff
2008-05-24 0:16 ` Randy Brukardt
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox