No subject

comes with optimized prepared instances for common data structures which is
very nice, because you don't have to roll your own version with library
like cereal (which is indeed very fast, but simply less convenient).

Best regards,
Krzysztof Skrz=C4=99tnicki

On Tue, Jan 24, 2012 at 00:37, Nick Rudnick <nick.rudnick at googlemail.com>wr=
ote:

> Dear all,
>
> if you want to temporarily store haskell data in a file =E2=80=93 do you =
have a
> special way to get it done efficiently?
>
> In an offline, standalone app, I am continuously reusing data volumes of
> about 200MB, representing Map like tables of a rather simple structure,
>
> key: (Int,Int,Int)
> value: [((Int,Int),LinkId)]
>
>
> which take quite a good deal of time to produce.
>
> Is there a recommendation about how to 'park' such data tables most
> efficiently in files =E2=80=93 any format acceptable, quick loading time =
is the
> most desirable thing.
>
> Thanks a lot in advance, Nick
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
>

--bcaec54696a1fc07d704b73abd72
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable