[fpc-other] k-nucleotide implementation (was: Which programming language is fastest?)

[Jeppe Johansen]

Den 09-05-2011 23:45, Isaac Gouy skrev:
> On 08 May 2011, Bernd wrote:
>
>> I am cheating too. Instead of a hash table in the
>> commonly known sense my "hash table" is implemented as a trie.
>
> So don't be surprised when your program is rejected :-)
> _______________________________________________
> fpc-other maillist  -  fpc-other at lists.freepascal.org
> http://lists.freepascal.org/mailman/listinfo/fpc-other
Just a note to the original post about the k-nucleotide implementation:

I've been writing on a crude sampling profiler lately which indicates(on 
a dual core x86) that 22% of the time is spent in ht_hashcode, 25% is 
spent in the loop in FindNew, and 28 is spent in the RTL(looks like 
CompareByte)

Those measurements are far from scientific, but I think it gives a hint 
that maybe the algorithm is wrong(and maybe CompareChar), and not so 
much the code generation/optimization