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

 Update: a less-typesafe binomial queue, which handles sparse binomial
 forests better, does not do significantly better (a millisecond average
 difference) than the nicely typesafe version.  Uploading code for grins,
 but I don't think there are any significant optimizations left to make to
 this data structure.

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