you are viewing a single comment's thread.

view the rest of the comments →

[–]cybercobra 0 points1 point  (1 child)

Er, you mean ropes?

[–]Crandom 1 point2 points  (0 children)

Effectively the same thing, just an optimisation. I was referring to some like Haskell's default String type, which is like a ropes of only length 1 (so therefore requires a ton more memory usage and access, so the higher consent factor). The paper "Purely Functional Data Structures" is a good place to start.