|
The doubly linked list is a fundamental data structure in computer science, |
I first checked in problem-specifications thinking the error were there, but it is rather here ;)
The paragraph starting with the line above (for some reason I couldn't highlight the whole selection) states that doubly linked lists are pervasive in functional programming languages like Haskell, lisps, et al., but this is not true. Our pervasive lists in functional languages are singly linked. Take this simple re-implementation of [a] in haskell as an example. NB. Lists are built into haskell's runtime or I would just link the definition from its standard library.
data List a = Cons a (List a) | Nil
The above definition while less efficient is isomorphic to the implementation of lists that is so pervasive in Haskell.
rust/exercises/practice/doubly-linked-list/.docs/instructions.md
Line 6 in a450099
I first checked in
problem-specificationsthinking the error were there, but it is rather here ;)The paragraph starting with the line above (for some reason I couldn't highlight the whole selection) states that doubly linked lists are pervasive in functional programming languages like Haskell, lisps, et al., but this is not true. Our pervasive lists in functional languages are singly linked. Take this simple re-implementation of
[a]in haskell as an example. NB. Lists are built into haskell's runtime or I would just link the definition from its standard library.The above definition while less efficient is isomorphic to the implementation of lists that is so pervasive in Haskell.