Re: The Computer Language Shootout Benchmarks

[Martin Krischik <krischik@users.sourceforge.net>]

jimmaureenrogers@worldnet.att.net wrote:

> 
> Martin Krischik wrote:
>> Hello
>>
>> Ada is currently missing 2 programs on the "The Computer Language
>> Shootout Benchmarks" [1].
>>
>> I would not mind having a go. But before I start:
>>
>> One test [2] needs a hash table implementation. The compiler used has
>> no Ada 2005 features so one need to add the implementation to the code
>> itself. Anybody can got a stand alone implementation? Or knows which
>> collections class lib could easily been torn apart?
>>
>> The  other test [3] needs some Unbounded_Integer / BigInt etc. type. We
>> could bind to gmp - but I don't like the idea if pragma Import in the
>> code.
> 
> This is precisely why I have not found the motivation to complete those
> two benchmarks.

And somehow I feel that one of those tests has been make to make debians
hash tables for C shine.

Also C cheats:

1) Thy don't check for ">THREE" as demanded but only for ">TH" making up for
a propper string compare. I think that Ada won't need that

2) They use a dynamicly growing buffer with an initial size large enough to
hold the hole dateset. This we can dupplicate using the old recursive
string concaternation with an initial string size just as big as C's so it
never goes into recursion.

Martin
-- 
mailto://krischik@users.sourceforge.net
Ada programming at: http://ada.krischik.com