#2227: (fgl) reimplement Data.Graph.Inductive.Query.Dominators
-------------------------+--------------------------------------------------
Reporter: int-e | Owner:
Type: proposal | Status: new
Priority: normal | Component: libraries (other)
Version: 6.9 | Severity: normal
Keywords: | Testcase:
Architecture: Multiple | Os: Multiple
-------------------------+--------------------------------------------------
As pointed out at http://www.haskell.org/pipermail/haskell-
cafe/2008-April/041739.html ff.,
{{{Data.Graph.Inductive.Query.Dominators.dom}}} is buggy. Furthermore,
it's slow, so instead of submitting the quick fix from that thread, I've
rewritten the module from scratch using a more efficient algorithm.
The algorithm works by calculating the immediate dominators of the graph
nodes first, so the patch also adds a function that returns those. It
should be handy for flow graph analysis.
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/2227>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
_______________________________________________
Glasgow-haskell-bugs mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
