Re:Are functional languages inherently slow?
by postfuturist on Friday July 27, 2012 @01:08PM
(#4302408)
This is my first Haskell code, so I read several sources, and posted my code to some online sources asking for help. That's what I came up with. I tried a bunch of strictness hints, I found one that cut the time in half. Lots of trial and error. Apparently, there's another one I didn't find. Could you submit a pull request?
Re:Are functional languages inherently slow?
by postfuturist on Friday July 27, 2012 @01:29PM
(#4302520)
Why did you accuse me of being disingenuous? I used an Array (life-array.hs), if Haskell implements Arrays as a linked list... well, that's a problem.
I accused you of that, because it seemed like you knew what you were doing with the other implementations, and then just suddenly forgot data structure performance when you got to Haskell. It was an asshole move, and I am sorry.
They aren't linked lists, but you still used a linked list internal to your "iter" function, where you used a vector (or array) there in other implementations.
None of the other code you wrote uses a linked list, so I don't know why you used them for Haskell. You used vector types for most of them (which Haskell has, by the way). Pretty disingenuous.
I admit that the prominent use of lists in newbie Haskell tutorials could have mislead you, but you seem to know the difference in data types since you used vectors everywhere else.