#3909: Priority queues in containers
-------------------------------------------+--------------------------------
Reporter: LouisWasserman | Owner: LouisWasserman
Type: feature request | Status: assigned
Priority: normal | Milestone:
Component: libraries (other) | Version: 6.12.1
Keywords: containers, priority queue | Difficulty:
Os: Unknown/Multiple | Testcase:
Architecture: Unknown/Multiple | Failure: None/Unknown
-------------------------------------------+--------------------------------
Comment(by milan):
Replying to [comment:22 LouisWasserman]:
> Aha! This wasn't how I'd imagined that lazy pairing heaps worked, but I
love it. Yeah, that's beautiful, let me change my own implementation...
**works**
Sorry, I mentioned it only in comment 17, not in the benchmark description
:(
> ViewQ is...tricky. I included it by analogy to Data.Sequence, which has
the same issue. I'm...not entirely sure what the best policy is.
I understand the idea, but personally I am strongly for {{{Maybe (a,
PQueue a)}}}, if there is a poll :)
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/3909#comment:23>
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
