[Haskell-cafe] Computing the memory footprint of a HashMap ByteString Int (Was: How on Earth Do You Reason about Space?)

Jason Dagit dagitj at gmail.com
Thu Jun 2 05:10:30 CEST 2011

On Wed, Jun 1, 2011 at 8:33 AM, Johan Tibell <johan.tibell at gmail.com> wrote:
> On Wed, Jun 1, 2011 at 4:24 PM, Aleksandar Dimitrov
> <aleks.dimitrov at googlemail.com> wrote:
>> One additional thought: it might be interesting to provide this outside of this
>> mailing list, perhaps as a documentation addendum to unordered-containers, since
>> it really explains the size needs for HashMaps of ByteStrings to folks without
>> knowledge of higher arcane wizardry.
> I think it would be a good answer on StackOverflow, but no one asked
> me this question there. I could list the size overhead of a HashMap in
> the docs, but I'm about to change it so I won't do so until after the
> change. I don't know how big guarantees I want to make in the docs
> either, as it might constrain future improvements to the
> implementation. Perhaps in an addendum, like you said.

One of the cool things about SO is that you can answer your own
question.  For example, you might do that if you're anticipating an
FAQ.  I think asking this question on SO and reposting your answer
from this thread would be great.


More information about the Haskell-Cafe mailing list