[Haskell-cafe] Data.Binary suboptimal instance
alexey.skladnoy at gmail.com
Sun May 24 08:48:18 EDT 2009
On Saturday 23 May 2009 23:23:05 Henning Thielemann wrote:
> > Interesting solution however it does not perform very nice. I wrote
> > microbenchmark
> > ... skipped ...
> > I didn'd do any profiling so I have no idea why writing is so slow.
> If you use top-level definition 'xs' the program might cache the list
> and second write is faster. You may change the order of tests in order
> check, whether that is the cause.
There was separate process for each test. So caching could not affect results.
More information about the Haskell-Cafe