<p dir="ltr">I will entertain various such suggestions, certainly, but that is quite orthogonal to this particular question!</p>
<div class="gmail_quote">On May 1, 2016 12:43 PM, "Mario Blažević" <<a href="mailto:blamario@ciktel.net">blamario@ciktel.net</a>> wrote:<br type="attribution"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">On 04/25/2016 11:53 PM, David Feuer wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Last year, I proposed adding chunksOf to Data.Sequence (mimicking the<br>
functionality of Data.List.Split.chunksOf, and taking advantage of<br>
internal structure to improve the efficiency beyond anything<br>
implementable using the current public API). The proposal was met with<br>
deafening silence. I seek advice and consent of anyone who cares.<br>
</blockquote>
<br>
I will provide a general comment about Data.Sequence. I don't care much for it.<br>
<br>
While I occasionally use the data type, its performance characteristics mean that it's rarely what I need. In particular, its O(log n) complexity of mappend is a killer for many applications. The problem with Data.Sequence may be that it attempts to be a jack-of-all-sequences. I can't recall ever needing a fully symmetric queue. It's nice, I guess, to have a general-purpose data-structure at hand when prototyping, but a more specialized implementation should always win in production.<br>
<br>
Would you consider adding (and maintaining) a simpler data structure with O(1) mappend to containers, perhaps something like <a href="https://github.com/nikita-volkov/bytestring-tree-builder/blob/master/library/ByteString/TreeBuilder/Tree.hs" rel="noreferrer" target="_blank">https://github.com/nikita-volkov/bytestring-tree-builder/blob/master/library/ByteString/TreeBuilder/Tree.hs</a> ? That is something I'd be reaching for more often that Data.Sequence as it stands.<br>
<br>
_______________________________________________<br>
Libraries mailing list<br>
<a href="mailto:Libraries@haskell.org" target="_blank">Libraries@haskell.org</a><br>
<a href="http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries" rel="noreferrer" target="_blank">http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries</a><br>
</blockquote></div>