[GHC] #10837: Constant-time indexing of closed type family axioms

[GHC]

#10837: Constant-time indexing of closed type family axioms
-------------------------------------+-------------------------------------
        Reporter:  jstolarek         |                   Owner:
            Type:  task              |                  Status:  patch
        Priority:  low               |               Milestone:
       Component:  Compiler          |                 Version:  7.11
      Resolution:                    |                Keywords:
Operating System:  Unknown/Multiple  |            Architecture:
 Type of failure:  Compile-time      |  Unknown/Multiple
  performance bug                    |               Test Case:
      Blocked By:                    |                Blocking:
 Related Tickets:                    |  Differential Revisions:  Phab:D1261
-------------------------------------+-------------------------------------

Comment (by Richard Eisenberg <eir@…>):

 In [changeset:"cd2840a784f4136a8cfdb704124e892430ad9ead/ghc" cd2840a/ghc]:
 {{{
 #!CommitTicketReference repository="ghc"
 revision="cd2840a784f4136a8cfdb704124e892430ad9ead"
 Refactor BranchLists.

 Now we use Array to store branches. This makes sense because we often
 have to do random access (once inference is done). This also vastly
 simplifies the awkward BranchList type.

 This fixes #10837 and updates submodule utils/haddock.
 }}}

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