[Haskell-cafe] two problems with Data.Binary and Data.ByteString
dons at galois.com
Tue Aug 12 23:12:05 EDT 2008
> On Tue, Aug 12, 2008 at 6:01 PM, Tim Newsham <newsham at lava.net> wrote:
> > (my keys are dates, which are Enum). This should look at
> > every key in every inner map. Shouldn't that be sufficient to
> > force the entire data set (or do I have to touch the fields in the
> > data elements too?)
> You might have to force the last value of the alist that the map gets
> flattened into, since otherwise there's no guarantee that it will be
> You really, really want to be using rnf for this job, instead of
> turning your brain into a pretzel shape.
The Pretzel being one of the lesser-known lazy, cyclic, functional data structures.
More information about the Haskell-Cafe