#1266: Make Data.Graph.Inductive.NodeMap handle slightly messy input without
crashing
-----------------------------------+----------------------------------------
Reporter: [EMAIL PROTECTED] | Owner:
Type: proposal | Status: new
Priority: normal | Milestone: Not GHC
Component: libraries (other) | Version: 6.6
Severity: normal | Keywords:
Difficulty: Unknown | Testcase:
Architecture: Unknown | Os: Unknown
-----------------------------------+----------------------------------------
Using the current version of Data.Graph.Inductive casually is
unnecessarily difficult because if you insert a node that's already
present in the graph, or try to insert an edge with an endpoint that's not
already in the graph, the library crashes. For the raw graph operations
that's somewhat reasonable since it wouldn't know what labels to use.
NodeMap, on the other hand, has plenty of information, so this patch makes
it safer in these cases.
I've also added the beginning of a test suite runnable with `runhaskell
Setup.hs test`.
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/1266>
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
