Replace the implementation of mergesort with a 2x faster one.
authorMalcolm.Wallace@cs.york.ac.uk <unknown>
Thu, 24 Dec 2009 15:20:14 +0000 (15:20 +0000)
committerMalcolm.Wallace@cs.york.ac.uk <unknown>
Thu, 24 Dec 2009 15:20:14 +0000 (15:20 +0000)
commita1caf8ef316aafbd2d75ce56ccfa85af8ac77f96
tree36900214dd83efe20e6b2526ce59180a78a8d4e0
parent171fcc3ed2f927bd571643d2d27e44d0d72f1d8d
Replace the implementation of mergesort with a 2x faster one.
See ticket http://hackage.haskell.org/trac/ghc/ticket/2143.
Data/List.hs