Haskell:列表,数组,向量,序列 - Haskell: Lists, Arrays, Vectors, Sequences

10/14 00:55
阅读数 0

问题:

I'm learning Haskell and read a couple of articles regarding performance differences of Haskell lists and (insert your language)'s arrays. 我正在学习Haskell,并阅读了几篇关于Haskell列表和(插入语言)数组的性能差异的文章。

Being a learner I obviously just use lists without even thinking about performance difference. 作为一个学习者,我显然只是在不考虑性能差异的情况下使用列表。 I recently started investigating and found numerous data structure libraries available in Haskell. 我最近开始调查,发现Haskell中有许多数据结构库。

Can someone please explain the difference between Lists, Arrays, Vectors, Sequences without going very deep in computer science theory of data structures? 有人可以解释一下列表,数组,向量,序列之间的区别,而不是深入研究数据结构的计算机科学理论吗?

Also, are there some common patterns where you would use one data structure instead of another? 此外,是否有一些常见的模式,您将使用一个数据结构而不是另一个?

Are there any other forms of data structures that I am missing and might be useful? 是否有任何其他形式的数据结构我缺少并可能有用?


解决方案:

参考一: https://en.stackoom.com/question/eKUi
参考二: https://stackoom.com/question/eKUi
展开阅读全文
打赏
0
0 收藏
分享
加载中
更多评论
打赏
0 评论
0 收藏
0
分享
返回顶部
顶部