No subject

being extremely fast. It comes with optimized prepared instances for common=
 data structures which is very nice, because you don't have to roll you=
r own version with library like cereal (which is indeed very fast, but simp=
ly less=C2=A0convenient).<div>

<br></div><div>Best regards,</div><div>Krzysztof Skrz=C4=99tnicki=C2=A0<br>=
<br><div class=3D"gmail_quote">On Tue, Jan 24, 2012 at 00:37, Nick Rudnick =
<span dir=3D"ltr">&lt;<a href=3D"mailto:nick.rudnick at googlemail.com">nick.r=
udnick at googlemail.com</a>&gt;</span> wrote:<br>

<blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-left:1p=
x #ccc solid;padding-left:1ex">Dear all,<div><br></div><div>if you want to =
temporarily store haskell data in a file =E2=80=93 do you have a special wa=
y to get it done efficiently?</div>

<div><br></div><div>In an offline, standalone app, I am continuously reusin=
g data volumes of about 200MB, representing Map like tables of a rather sim=
ple structure,<br>
<div><br></div></div><blockquote style=3D"margin:0 0 0 40px;border:none;pad=
ding:0px"><div><div>key: (Int,Int,Int)=C2=A0</div></div><div><div>value: [(=
(Int,Int),LinkId)]</div></div></blockquote><br><div>which take quite a good=
 deal of time to produce.</div>


<div><br></div><div>Is there a recommendation about how to &#39;park&#39; s=
uch data tables most efficiently in files =E2=80=93 any format acceptable, =
quick loading time is the most desirable thing.</div><div><br></div><div>Th=
anks a lot in advance, Nick</div>


<br>_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href=3D"mailto:Haskell-Cafe at haskell.org">Haskell-Cafe at haskell.org</a><br=
>
<a href=3D"http://www.haskell.org/mailman/listinfo/haskell-cafe" target=3D"=
_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
<br></blockquote></div><br></div>

--bcaec54696a1fc07d704b73abd72--