Double-ended priority queues
BSD-3-CLAUSE License
Asymptotically optimal Brodal/Okasaki heaps
Priority Search Queues in three different flavors for Haskell
Min-max priority queue, also known as double-ended priority queue.