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=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: a07f3367d7,3a6a9f1d654285ba
X-Google-Attributes: gida07f3367d7,public,usenet
X-Google-NewGroupId: yes
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!news2.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!newsfeed00.sul.t-online.de!newsfeed01.sul.t-online.de!t-online.de!newsfeed.straub-nv.de!uucp.gnuu.de!newsfeed.arcor.de!newsspool1.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Date: Thu, 08 Oct 2009 11:54:11 +0200
From: Georg Bauhaus <rm.dash-bauhaus@futureapps.de>
User-Agent: Thunderbird 2.0.0.23 (Macintosh/20090812)
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Ada Shootout program for K-Nucleotide (patches)
References: <4a743343$0$32674$9b4e6d93@newsspool2.arcor-online.net>
 	<4acc7f34$0$2864$ba620e4c@news.skynet.be>
 <3eed54ee-7853-4bba-bcff-c4ab041689f3@p15g2000vbl.googlegroups.com>
 <4acca28d$0$2855$ba620e4c@news.skynet.be>
In-Reply-To: <4acca28d$0$2855$ba620e4c@news.skynet.be>
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
Message-ID: <4acdb6c3$0$6585$9b4e6d93@newsspool3.arcor-online.net>
Organization: Arcor
NNTP-Posting-Date: 08 Oct 2009 11:54:11 CEST
NNTP-Posting-Host: 9f06071d.newsspool3.arcor-online.net
X-Trace: 
 DXC=GfnM9c143bb^Y=RbYBPl4`McF=Q^Z^V3h4Fo<]lROoRa8kF<OcfhCOkoY?3J\f2TTanc\616M64>jLh>_cHTX3jm]jdXnnZa_@d
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news2.google.com comp.lang.ada:8622
Date: 2009-10-08T11:54:11+02:00
List-Id: <comp.lang.ada>

Olivier Scalbert schrieb:
> Martin wrote:
>>
>> I notice that the CPU usage isn't particularly high - unlike the
>> fastest solutions...is that significant?
>>
>> Cheers
>> -- Martin
> 
> And the memory consumption is higher than C++ (254 Mb versus 131 Mb).
> Perhaps it is also significant.

Possibly.  We'd have to know where and which memory
is being used by the Ada program in excess of what
the C++ program is using; just speculating, it could
be the data structure of elements in GNAT's Table.

FWIW, I have tried equality functions for each fragment
length specifically.  This is worth another 5% less time.

I guess it is possible to write tiny hashing functions
for at least small fragments without yet more person
days being wasted on this program.  The C++ programs
offer inspiration  ;-)