[GHC] #9960: Performance problem with TrieMap

[GHC]

#9960: Performance problem with TrieMap
-------------------------------------+-------------------------------------
        Reporter:  simonpj           |                   Owner:
            Type:  bug               |                  Status:  new
        Priority:  normal            |               Milestone:
       Component:  Compiler          |                 Version:  7.8.4
      Resolution:                    |                Keywords:
Operating System:  Unknown/Multiple  |            Architecture:
 Type of failure:  None/Unknown      |  Unknown/Multiple
      Blocked By:                    |               Test Case:
 Related Tickets:                    |                Blocking:
                                     |  Differential Revisions:
-------------------------------------+-------------------------------------

Comment (by simonpj):

 True.  If you had just two big keys, say
 {{{
   T A A A A A A A A A A A A A A B
   T A A A A A A A A A A A A A A C
 }}}
 then even with `SingletonTM` performance of a fold would be 2*10, not just
 2 as it would with an association list.  But I'm guessing that trees tend
 to diverge early in practice.

--
Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/9960#comment:2>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler