Re:Rust: Enable WebAssembly backend by default
by kccqzy on Sunday November 26, 2017 @06:03PM
(#15783607)
I might be nitpicking but in Haskell and typical lisps “lists” don’t have efficient append. They are basically singly linked lists. A structure with efficient append and prepend (sometimes called a deque) is implemented as a finger tree in Haskell (with logarithmic random access), and as a vector of arrays in C++ (constant random access).
[ Parent
| on HN ]