#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 LouisWasserman):
In retrospect, I'm not sure what the procedure for patching deepseq would
be -- which would be an appropriate approach, except that there's no good
way to expose the functionality to be strict on *just* the roots in the
binomial forest. Fortunately, my tests seem to indicate that keeping the
spine of the binomial heap strict doesn't affect speed too adversely, so
we'll keep it strict for everybody.
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/3909#comment:35>
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
