#9675: Unreasonable memory usage on large data structures -------------------------------------+------------------------------------- Reporter: Polarina | Owner: Type: bug | Status: new Priority: normal | Milestone: Component: Compiler | Version: 7.8.3 Resolution: | Keywords: Operating System: Linux | Architecture: x86_64 (amd64) Type of failure: Compile- | Difficulty: Unknown time performance bug | Blocked By: Test Case: | Related Tickets: Blocking: | Differential Revisions: | -------------------------------------+------------------------------------- Comment (by rwbarton): Well, the data declaration does define ~3000 record accessors, each of which pattern matches on a record with ~3000 fields... it's easy for some things to become quadratic (intermediate program code size, strictness/demand info) even if in the end, the code size is only linear. -- Ticket URL: http://ghc.haskell.org/trac/ghc/ticket/9675#comment:2 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler