[GHC] #3909: Priority queues in containers

[GHC]

#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):

 I've written and uploaded a pairing heap implementation for consideration
 as an alternative.
 I am moderately concerned that even implemented strictly, there isn't a
 good way for users to avoid future extract operations taking time linear
 in the size of the heap.  However, I think this is in most respects
 significantly faster overall.  (I used something similar for
 Data.Sequence.unstableSort.)

-- 
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/3909#comment:10>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler