bos: > On Tue, Aug 12, 2008 at 6:01 PM, Tim Newsham <[EMAIL PROTECTED]> 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 > read. > > 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. -- Don _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
