On 8/31/16 2:04 AM, Harald Weidner wrote:
Hello,
On Tue, Aug 30, 2016 at 04:41:29PM -0700, 'Eric Johnson' via golang-nuts wrote:
I looked at the k-nucleotide program, and was unable to figure out a way to
make it faster.
This is, of course, exactly what the test is suppose to be checking - the
speed of the built in map. Anyone else have any insight?
The Java counterpart of this benchmark does not use the Java build-in
maps, but imports a map implementation for fixed data types from the
fastutil project.
http://fastutil.di.unimi.it/
I hadn't noticed that. That would seem to violate the spirit of the test:
"The work is to use the built-in or library hash table implementation to
accumulate count values - lookup the count for a key and update the
count in the hash table. Don't optimize away the work."
Eric.
--
You received this message because you are subscribed to the Google Groups
"golang-nuts" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to golang-nuts+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
