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)?
1 answers
solution1
14 2013-06-29 13:47:38
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.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.
Related Question
Working with Data.Sequence in Haskell
Why Haskell need Data.Sequence when we already have list?
Instance Data.Sequence with Haskell Aeson
no EmptyL in data.sequence?
Haskell, Data.Sequence trying to change 2 values at same time
Is there anything like Haskell Data.Sequence in C++?
Is there a stricter Data.Sequence?
Why doesn't Data.Sequence have `insert' or `insertBy', and how do I efficiently implement them?
Does Data.Vector replace Data.Sequence?
Why are takeR, dropR and splitAtR missing from Data.Sequence?
Related Tags