<div dir="ltr"><div class="gmail_extra">Book seems to use a quicksort (in package type-level-sets) to avoid duplicates. A couple years ago I did a benchmark <a href="http://code.haskell.org/~aavogt/HList-nodup/Run.html">http://code.haskell.org/~aavogt/HList-nodup/Run.html</a> that includes a different quicksort. It is a good method, but maybe type-level-sets has a better implementation. Provided my timings generalize, I think dealing with many records of 50 elements will be frustrating.<br><br><div class="gmail_quote">On Wed, Aug 24, 2016 at 5:10 PM, Dmitry Olshansky <span dir="ltr"><<a href="mailto:olshanskydr@gmail.com" target="_blank">olshanskydr@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div dir="ltr"><div>This is really interesting. But how many fields in Book could be? I'm afraid there could be a problem for time and memory consumption by compiler. Isn't it?</div><div><br></div><div>Best regards,</div><div>Dmitry</div></div><div class="gmail_extra"><br><div class="gmail_quote"><div><div class="h5">2016-08-24 22:39 GMT+03:00 Julian Arni <span dir="ltr"><<a href="mailto:jkarni@turingjump.com" target="_blank">jkarni@turingjump.com</a>></span>:<br></div></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div><div class="h5">I was playing around with GHC 8 yesterday, and ended up writing another<br>
extensible records library:<br>
<br>
    <a href="https://hackage.haskell.org/package/bookkeeper" rel="noreferrer" target="_blank">https://hackage.haskell.org/pa<wbr>ckage/bookkeeper</a><br>
<br>
And a blog post about it:<br>
<br>
    <a href="https://turingjump.com/blog/bookkeeper/" rel="noreferrer" target="_blank">https://turingjump.com/blog/bo<wbr>okkeeper/</a><br>
<br>
<br>
I hope someone finds this useful!<br>
<br>
--<br>
Julian K. Arni<br>
Haskell Consultant, Turing Jump<br>
<a href="https://turingjump.com" rel="noreferrer" target="_blank">https://turingjump.com</a><br>
<br></div></div>______________________________<wbr>_________________<br>
Haskell-Cafe mailing list<br>
To (un)subscribe, modify options or view archives go to:<br>
<a href="http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe" rel="noreferrer" target="_blank">http://mail.haskell.org/cgi-bi<wbr>n/mailman/listinfo/haskell-caf<wbr>e</a><br>
Only members subscribed via the mailman list are allowed to post.<br></blockquote></div><br></div>
<br>______________________________<wbr>_________________<br>
Haskell-Cafe mailing list<br>
To (un)subscribe, modify options or view archives go to:<br>
<a href="http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe" rel="noreferrer" target="_blank">http://mail.haskell.org/cgi-<wbr>bin/mailman/listinfo/haskell-<wbr>cafe</a><br>
Only members subscribed via the mailman list are allowed to post.<br></blockquote></div><br></div></div>