#1985: IntSet.deleteMin doesn't agree with Set.deleteMin
----------------------------------+-----------------------------------------
Reporter: dbenbenn | Owner:
Type: bug | Status: new
Priority: normal | Milestone:
Component: libraries (other) | Version: 6.8.1
Severity: normal | Keywords:
Difficulty: Unknown | Testcase:
Architecture: Multiple | Os: Multiple
----------------------------------+-----------------------------------------
(!IntSet.deleteMin !IntSet.empty) is error, while (Set.deleteMin Set.empty
== Set.empty). Set and !IntSet should have identical behavior whenever
possible (so that Set Int can be replaced by !IntSet without introducing
bugs).
Since !IntSet.deleteMin is newer, presumably it should be changed to agree
with Set.deleteMin.
The same issue applies to !IntSet.deleteMax, (snd .
!IntSet.deleteFindMin), and (snd . !IntSet.deleteFindMax). Also
Data.!IntMap.
This behavior was introduced in ticket 1229.
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/1985>
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
