#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:25 LouisWasserman]:
> Another minor concern: I'm not sure lazy pairing heaps can support
linear-time unordered traversals, or anything of the sort. I still need
to think about that, because it's not impossible that the same operations
actually do take linear time still...
Well, that is a good point.
Long story short, with this representation it will take O(N log N) in some
cases. Maybe the representation could be changed, but not
straightforwardly.
So -- the binomial heaps?
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/3909#comment:27>
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
