#3149: Data.HashTable is slow
------------------------------+---------------------------------------------
Reporter: dons | Owner:
Type: bug | Status: new
Priority: normal | Milestone:
Component: Runtime System | Version: 6.10.1
Severity: normal | Resolution:
Keywords: | Testcase:
Os: Unknown/Multiple | Architecture: Unknown/Multiple
------------------------------+---------------------------------------------
Comment (by dons):
This is one interesting way we avoided the "mutable boxed array problem"
in the shootout:
http://shootout.alioth.debian.org/u64q/benchmark.php?test=knucleotide&lang=ghc&id=4
The hashtable is represent as:
{{{
data Hashtable = Hashtable {
keySize :: {-# UNPACK #-}!Int,
noOfSlots :: {-# UNPACK #-}!Int,
spine :: {-# UNPACK #-}!(Ptr Word8)
}
}}}
avoiding all issues of GC wandering. Give up on
Might be one candidate approach for replacing the current IOArray
[(Int,a)] version.
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/3149#comment:4>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler_______________________________________________
Glasgow-haskell-bugs mailing list
Glasgow-haskell-bugs@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
