Proposal: add chunksOf to Data.Sequence

[David Feuer]

I will entertain various such suggestions, certainly, but that is quite
orthogonal to this particular question!
On May 1, 2016 12:43 PM, "Mario Blažević" <blamario at ciktel.net> wrote:

> On 04/25/2016 11:53 PM, David Feuer wrote:
>
>> Last year, I proposed adding chunksOf to Data.Sequence (mimicking the
>> functionality of Data.List.Split.chunksOf, and taking advantage of
>> internal structure to improve the efficiency beyond anything
>> implementable using the current public API). The proposal was met with
>> deafening silence. I seek advice and consent of anyone who cares.
>>
>
> I will provide a general comment about Data.Sequence. I don't care much
> for it.
>
>     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.
>
>     Would you consider adding (and maintaining) a simpler data structure
> with O(1) mappend to containers, perhaps something like
> https://github.com/nikita-volkov/bytestring-tree-builder/blob/master/library/ByteString/TreeBuilder/Tree.hs
> ? That is something I'd be reaching for more often that Data.Sequence as it
> stands.
>
> _______________________________________________
> Libraries mailing list
> Libraries at haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/libraries/attachments/20160501/e9d64dce/attachment.html>