Why does Haskell have Data.Sequence?

Question

Why does Haskell have Data.Sequence? Aren't (lazy) lists already the most general forward iterators possible (by virtue of being free monoids)?

They're more efficient for many operations, such as concatenation, especially on the right. — AndrewC
– AndrewC, Commented Jun 29, 2013 at 13:34
Another operation worth mentioning is index, which gets an i-th element in O(log(min(i,n-i))) time. For lists, the complexity is O(i). — Petr
– Petr, Commented Jun 29, 2013 at 13:52

Satvik · Accepted Answer · 2013-06-29 13:47:38Z

14

The details are mentioned on the first paragraph on hackage. As pointed by @AndrewC they offer many operations efficiently example concatenating two sequences, viewing the right end of a sequence or adding elements at the end of a sequence.

answered Jun 29, 2013 at 13:47

Satvik

11.2k1 gold badge40 silver badges46 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Why does Haskell have Data.Sequence?

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related