Re: Toy computational "benchmark" in Ada (new blog post)

[Paul Rubin <no.email@nospam.invalid>]

David Trudgett <dktrudgett@gmail.com> writes:
> But you obviously like C++ better, so that's fine.

I wouldn't say I like C++ better, I just wanted to benchmark it.  I got
the C++ working but it was pretty painful and there is a lot of code.
I've been hanging out here and maintaining some interest in Ada as a
refuge from the perils of C++.  But so far, C++ is easier for me to use
because I'm more familiar with it.

In your reply to Olivier about the C code, you mentioned various
problems in the way of your being able to compile and run it.  But if
you have a copy, I wonder if you could post it for the rest of us to try
even if you can't try it yourself.

I'd also like to try Rust (which I have never tried at all so far), and
Haskell's Accelerate library:

  https://hackage.haskell.org/package/accelerate

I haven't tried Accelerate yet but am an intermediate-level Haskell user
so with luck I can figure it out.

Julia is also supposed to be good for this sort of thing.  I thought of
trying Numpy but I figured that the obvious implementations would either
invoke the Python interpreter too much (slow) or else make extra copies
of the very large array (memory bloat), either way making it
uncompetitive with Ada and C++.  But, I've had only slight exposure to
numpy so far.