On 2006-09-05, Bulat Ziganshin <[EMAIL PROTECTED]> wrote: > Hello Bertram, > > Tuesday, September 5, 2006, 12:24:57 PM, you wrote: > >>> A quick hack up to use Data.ByteString uses a lot less ram, though >>> profiling still shows 95% of time spent in the building the Map. > > Data.HashTable may be a faster alternative for Map (if ordering isn't > required)
Indeed ordering wasn't required, but as HashTable lives in the IO monad, it's not, well, very "Haskellish". -- John _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
