On Wed, Jun 1, 2011 at 8:33 AM, Johan Tibell <johan.tib...@gmail.com> wrote: > On Wed, Jun 1, 2011 at 4:24 PM, Aleksandar Dimitrov > <aleks.dimit...@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. Jason _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
