3 ms·
IMO, the biggest thing missing from Haskell is a fast Mutable Map (like Python's). The current workaround is to use a tree structure with O(log N) lookup time,
by ramanujan 17y ago
IMO, the biggest thing missing from Haskell is a fast Mutable Map (like Python's).
The current workaround is to use a tree structure with O(log N) lookup time, which is obviously not good.
Yes, I know such a data structure isn't pure, but there are other Mutable objects which are implemented and available.
Perhaps someone should just write a wrapper to a good standalone C/C++ implementation and make it available on Hackage. Would be a huge help.
- jamii 17y ago> the biggest thing missing from Haskell is a fast Mutable Map (like Python's) Data.HashTable is part of the core library and has improved a lot over the last few years.
- jamii 17y agoHmm, I tried with GHC 6.10 and the python dicts are still faster. I'm told that the judy array on hackage is the way to go for mutable maps but I haven't tried it personally.