RE: [Haskell-cafe] Nice way to calculate character frequency in astring
| Ugh! These are all horrid. If something on the lines of | | > calc = accumArray (+) 0 (minBound, maxBound) . (map (\x->(x,1))) | | isn't fast enough, complain to the implementors! What's the | point of functional programming if one has to twist into a | shape that allows inspection of one's own fundament to get | stuff to run in decent time? I agree. Better still, help us make it faster! Simon
On Tue, 25 Oct 2005, Simon Peyton-Jones wrote:
| Ugh! These are all horrid. If something on the lines of | | > calc = accumArray (+) 0 (minBound, maxBound) . (map (\x->(x,1))) | | isn't fast enough, complain to the implementors! What's the | point of functional programming if one has to twist into a | shape that allows inspection of one's own fundament to get | stuff to run in decent time?
I agree.
Better still, help us make it faster!
Simon
What can your average Haskell user do to help other than point out things they don't like?
participants (2)
-
Creighton Hogg -
Simon Peyton-Jones