I think what you are remembering is "just" a effect of copying GC. As you said that won't get rid of the pointer chasing nor magically transform the result into some kind of dense structure internally.
Am 13/11/2024 um 13:39 schrieb Hécate via ghc-devs:
I remember that I heard that in some cases, GHC would be able to lay down in memory the elements of a linked list next to each other. I don't think this gets rid of the pointer-chasing, but I'm interested to know more about the circumstances in which linked lists are optimised.
_______________________________________________ ghc-devs mailing list ghc-devs@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/ghc-devs
