Priority queues are a common data structure, but they are currently missing from the core library. At the moment, users would need to implement their own wrapper around Set or Map combined with List, taking care to handle duplicates correctly. This approach can also lead to suboptimal performance, since Set and Map are more general-purpose data structures.