code review 7279045: container/heap: fix comment typo in example test

src/pkg/container/heap/example_pq_test.go

 // Copyright 2012 The Go Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style
 // license that can be found in the LICENSE file.
 
 // This example demonstrates a priority queue built using the heap interface.
 package heap_test
 
 import (
         "container/heap"
         "fmt"
 )
 
 // An Item is something we manage in a priority queue.
 type Item struct {
         value    string // The value of the item; arbitrary.
         priority int    // The priority of the item in the queue.
-        // The index is needed by changePriority and is maintained by the heap.Interface methods.
+        // The index is needed by update and is maintained by the heap.Interface methods.
         index int // The index of the item in the heap.
 }
 
 // A PriorityQueue implements heap.Interface and holds Items.
 type PriorityQueue []*Item
 
 func (pq PriorityQueue) Len() int { return len(pq) }
 
 func (pq PriorityQueue) Less(i, j int) bool {
         // We want Pop to give us the highest, not lowest, priority so we use greater than here.
@@ skipping 58 matching lines @@
         pq.update(item, item.value, 5)
 
         // Take the items out; they arrive in decreasing priority order.
         for pq.Len() > 0 {
                 item := heap.Pop(pq).(*Item)
                 fmt.Printf("%.2d:%s ", item.priority, item.value)
         }
         // Output:
         // 05:orange 04:pear 03:banana 02:apple
 }