PriorityQueue<E, P>

// Elements with priorities; Dequeue gives one with the smallest priority (among equals, in no set order).
public class System.PriorityQueue<E, P> : System.Any
{
    field elements: E[]
    field priorities: P[]
    field count: i32
    method Grow() -> void
    static method Empty() -> void
    // Moves the entry at `at` (element, priority) up past larger parents.
    method Up(at: i32, element: E, priority: P) -> void
    // Puts (element, priority) at `at` and moves it down past smaller children.
    method Down(at: i32, element: E, priority: P) -> void
    constructor PriorityQueue()
    constructor PriorityQueue(capacity: i32)
    method Enqueue(element: E, priority: P) -> void
    // The element with the smallest priority, taken out.
    method Dequeue() -> E
    // The element with the smallest priority, and that priority (left in).
    method Peek() -> E
    // Enqueue then Dequeue, in one step (the new element comes straight back when it is the smallest).
    method EnqueueDequeue(element: E, priority: P) -> E
    method Clear() -> void
    property Count: i32
    property IsEmpty: bool
    property PeekPriority: P
}