removes the items in priority order.</span>
func Example_priorityQueue() {
    <span class="com">// Some items and their priorities.</span>
    items := map[string]int{
        &#34;banana&#34;: 3, &#34;apple&#34;: 2, &#34;pear&#34;: 4,
    }
    <span class="com">// Create a priority queue, put the items in it, and</span>
    <span class="com">// establish the priority queue (heap) invariants.</span>
    pq := make(PriorityQueue, len(items))
    i := 0
    for value, priority := range items {
        pq[i]