PriorityQueuePriority, ValuePop Method

Get the value with the lowest priority creates a "hole" at the root of the tree. The algorithm swaps the hole with the appropriate child, until the last entry will fit correctly into the hole (ie is lower priority than its children)

public virtual Value Pop()

Public Overridable Function Pop As Value

public:
virtual Value Pop()

abstract Pop : unit -> 'Value 
override Pop : unit -> 'Value