#3909: Priority queues in containers
---------------------------------+------------------------------------------
Reporter: LouisWasserman | Owner: LouisWasserman
Type: feature request | Status: assigned
Priority: normal | Component: libraries (other)
Version: 6.12.1 | Keywords: containers, priority queue
Os: Unknown/Multiple | Testcase:
Architecture: Unknown/Multiple | Failure: None/Unknown
---------------------------------+------------------------------------------
Comment(by LouisWasserman):
Created a new version that answers people's min/max-heap needs with the
following approach:
There are now three modules: Data.PQueue.Min, Data.PQueue.Max, and
Data.PQueue. Data.PQueue reexports Data.PQueue.Min with the type alias
PQueue = MinQueue. (Observation: several other languages, including Java,
default to a min-queue.) Data.PQueue.Max is implemented as a wrapper
around Data.PQueue.Min. Everybody should be happy.
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/3909#comment:5>
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
