[GHC] #3909: Priority queues in containers

[GHC]

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

 Agreed.  I've got a few (mostly aesthetic) updates to the binomial
 implementation, by the way -- uploading those now.  Mostly, they just make
 the type details prettier, and they also provide fromDescList, toDescList,
 foldrDesc, etcetera.  (These are strict, and are essentially just
 implemented as dual to the ascending-order implementation, but there's no
 reason not to have them.)

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