为什么Haskell有Data.Sequence？
[英]Why does Haskell have Data.Sequence?
问题描述
Why does Haskell have Data.Sequence? 
为什么Haskell有Data.Sequence？ Aren't (lazy) lists already the most general forward iterators possible (by virtue of being free monoids)? 是不是（懒惰）列表已经是最普遍的前向迭代器（由于是免费的幺半群）？
1 个解决方案
解决方案1
14 2013-06-29 13:47:38
The details are mentioned on the first paragraph on hackage . 关于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. 正如@AndrewC指出的那样，它们提供了许多操作，例如连接两个序列，查看序列的右端或在序列的末尾添加元素。
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.
相关问题
在Haskell中使用Data.Sequence - Working with Data.Sequence in Haskell
当我们已经有列表时，为什么Haskell需要Data.Sequence？ - Why Haskell need Data.Sequence when we already have list?
实例Data.Sequence与Haskell Aeson - Instance Data.Sequence with Haskell Aeson
data.sequence中没有EmptyL？ - no EmptyL in data.sequence?
Haskell Data.Sequence试图同时更改2个值 - Haskell, Data.Sequence trying to change 2 values at same time
在C ++中有什么类似Haskell Data.Sequence的吗？ - Is there anything like Haskell Data.Sequence in C++?
是否有更严格的Data.Sequence？ - Is there a stricter Data.Sequence?
为什么Data.Sequence没有`insert'或`insertBy'，我该如何有效地实现它们呢？ - Why doesn't Data.Sequence have `insert' or `insertBy', and how do I efficiently implement them?
Data.Vector会替换Data.Sequence吗？ - Does Data.Vector replace Data.Sequence?
为什么Data.Sequence中缺少takeR，dropR和splitAtR？ - Why are takeR, dropR and splitAtR missing from Data.Sequence?
相关标签