#14667: Compiling a function with a lot of alternatives bottlenecks on insertIntHeap -------------------------------------+------------------------------------- Reporter: niteria | Owner: niteria Type: bug | Status: new Priority: normal | Milestone: Component: Compiler | Version: Resolution: | Keywords: Operating System: Unknown/Multiple | Architecture: Type of failure: Compile-time | Unknown/Multiple performance bug | Test Case: Blocked By: | Blocking: Related Tickets: | Differential Rev(s): Wiki Page: | -------------------------------------+------------------------------------- Comment (by simonpj): I wonder ''why'' you replaced a set with a list? Was it just perf? Doing so would yield at best a small perf improvement. In any case, a well-implemented set abstraction should probably keep small sets as lists anyway (if that's a perf improvement). If it doesn't, it'd be better to improve the set abstraction than to commit to a list regardless of size. -- Ticket URL: http://ghc.haskell.org/trac/ghc/ticket/14667#comment:7 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler