[Haskell-cafe] Byte Histogram
andrewcoppin at btinternet.com
Thu Feb 3 23:10:24 CET 2011
On 03/02/2011 09:37 PM, Daniel Fischer wrote:
> To illustrate your prediction about the side-issues:
> On Thursday 03 February 2011 22:10:51, Andrew Coppin wrote:
>> Consider for a moment the original implementation with Data.Map. Adding
>> a seq or two here will do no good at all; seq reduces to WHNF. What we
>> are wanting is NF, and I can see no way at all of doing that.
> Check out Data.Map.insertWith'
Wouldn't that still mean that the spine of the map is still lazy though?
More information about the Haskell-Cafe