I'm running a terabyte-scale (minor compiler changes are necessary to get this to run) genome resequencing simulation at the moment and an interesting question has arisen.
The simulation involved hashing over ~all positions of a genome, either with the key being a string or a [2]string. The difference in the resident memory size for the entire program for these two cases is about a factor of two. What is an estimate of the contribution of key size to the number of bytes required per element for a map? -- afk Dan -- 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.
