diff options
Diffstat (limited to 'libgo/go/container/heap/heap.go')
| -rw-r--r-- | libgo/go/container/heap/heap.go | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/libgo/go/container/heap/heap.go b/libgo/go/container/heap/heap.go index 7af636b4513..67018e6baea 100644 --- a/libgo/go/container/heap/heap.go +++ b/libgo/go/container/heap/heap.go @@ -6,10 +6,11 @@ // heap.Interface. A heap is a tree with the property that each node is the // highest-valued node in its subtree. // -// A heap is a common way to impement a priority queue. To build a priority +// A heap is a common way to implement a priority queue. To build a priority // queue, implement the Heap interface with the (negative) priority as the // ordering for the Less method, so Push adds items while Pop removes the -// highest-priority item from the queue. +// highest-priority item from the queue. The Examples include such an +// implementation; the file example_test.go has the complete source. // package heap |