#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 ross):
Replying to [comment:4 LouisWasserman]:
> I'm inclined to think, though, that it's more important to have a good
implementation of just the priority queue abstraction, especially one that
performs reliably quickly, than necessarily also supporting searches, as
in priority ''search'' queues. I like the idea of priority search queues,
but I think they're more appropriate for a popular Hackage package than to
go into containers, which focuses on high-performance, ubiquitous data
structures.
They are two different abstractions, which should have different
implementations.
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/3909#comment:6>
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
