How do you plan to consume the running sums of these data? How many different keys do you have? <div><br></div><div>If all pure stuff fails, you can always revert to imperative techniques, using a <a href="http://www.haskell.org/ghc/docs/6.6.1/html/libraries/base/Data-Array-ST.html">mutable array</a> or something :)</div>
<div><div><div><div><div><div><br><div class="gmail_quote">On Fri, Mar 27, 2009 at 3:18 PM, Günther Schmidt <span dir="ltr"><<a href="mailto:gue.schmidt@web.de">gue.schmidt@web.de</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
Guys,<br>
<br>
I appreciate the contribution but I'm now more confused than ever :)<br>
<br>
On the Co-Induction-whatever thingy: Thanks, that's certainly something interesting and I'll try to find out more about it.<br>
<br>
But it looks like none of all the proposals offers a true solution, at least none from start to finish. The amount of data is large, but finite.<br>
<br>
So for now, I'll just stick with my initial approach as I'm running out of time.<div><div></div><div class="h5"><br>
<br>
Günther<br>
<br>
_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org" target="_blank">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
</div></div></blockquote></div><br></div></div></div></div></div></div>