[GHC] #1160: drop regex-posix in favour of regex-tdfa?

[GHC]

#1160: drop regex-posix in favour of regex-tdfa?
----------------------------------+-----------------------------------------
    Reporter:  simonmar           |       Owner:         
        Type:  task               |      Status:  new    
    Priority:  normal             |   Milestone:  6.8    
   Component:  libraries (other)  |     Version:  6.7    
    Severity:  normal             |    Keywords:  regex  
  Difficulty:  Moderate (1 day)   |    Testcase:         
Architecture:  Unknown            |          Os:  Unknown
----------------------------------+-----------------------------------------
regex-tdfa is written in Haskell (regex-posix uses a C backend), and it
 uses the standard DFA algorithm compared to regex-posix's naive
 backtracking, so it is asymptotically better (though it would probably be
 a good idea to check performance on some non-pathalogical examples to make
 sure the constant factor isn't too bad).

 [http://article.gmane.org/gmane.comp.lang.haskell.cafe/18553]

 For GHC 6.8 we should drop regex-posix in favour of this.

-- 
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/1160>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler