[Haskell-cafe] Strict version of Data.Map.map

Edsko de Vries devriese at cs.tcd.ie
Thu Feb 26 12:13:51 EST 2009

On Thu, Feb 26, 2009 at 12:45:09PM -0300, Felipe Lessa wrote:
> I'd advise you to see Control.Parallel.Strategies, specially the
> NFData class and the rnf function.

What is the time complexity of running rnf on a Data.Map? If it is O(n),
then surely running rnf on my map after every 'map' operation is hardly
going to speed things up? 


More information about the Haskell-Cafe mailing list