Re: for x'address or variant

["John R. Strohm" <strohm@airmail.net>]

"kat-Zygfryd" <6667@wp.pl> wrote in message
news:b81jc5$4u7$1@news.onet.pl...
> "Robert A Duff" <bobduff@shell01.TheWorld.com> wrote in message
> news:wccfzob6384.fsf@shell01.TheWorld.com...
> > I was trying to help, but I need to understand what you're trying to do.
> > I'm not willing to download and read all the LIBAVL code.
> > I looked for it briefly, and it's too much hassle.
> >
> > I'm guessing you've got some C code, and you want to know how to do
> > similar things in Ada.  So post some simple examples in C.
> > If that's what you're after, please explain.
>
> Not really, I have code in C which is easily translatable to Ada,
> I just wanted to know how to perform the thing I was talking
> about (it isn't nessessary for this code, just a bit helpful)
>
> > I'm not interested in discussing your *skills*.
> > But you seem to be asking about Ada *style*, so...
> >
> > - Bob
>
> Oh I didn't mean you, but mr. Strohm.

I stand by my statement.  Until you have correct, RUNNING code, in your
target language, it is premature to worry about "efficiency".  You should
give thought to choosing the appropriate algorithm, but trying to make
micro-optimizations before the code is known to be correct and working is
the wrong approach.

Furthermore, many years of study have shown conclusively that human
programmers are very poor at finding the real "hot spots" where optimization
can really help.  Profiling the actual execution time, mapping out where the
program is actually spending the cycles, is absolutely critical.