diff options
| author | Nigel Tao <nigeltao@golang.org> | 2013-02-04 15:30:41 +1100 |
|---|---|---|
| committer | Nigel Tao <nigeltao@golang.org> | 2013-02-04 15:30:41 +1100 |
| commit | 4e285bac6e6bafb443e0c3aef94c424bc96967e8 (patch) | |
| tree | 55e528c76dd311fb17dd64610d99f502995305a7 /src/pkg/container | |
| parent | f41ffc2bf4a5a29bdff0b11a787e2536859ea61d (diff) | |
| download | go-4e285bac6e6bafb443e0c3aef94c424bc96967e8.tar.xz | |
container/heap: fix package doc comment about ordering.
R=gri, rsc
CC=golang-dev
https://golang.org/cl/7280044
Diffstat (limited to 'src/pkg/container')
| -rw-r--r-- | src/pkg/container/heap/heap.go | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/pkg/container/heap/heap.go b/src/pkg/container/heap/heap.go index d17a30aec3..7fd41f785f 100644 --- a/src/pkg/container/heap/heap.go +++ b/src/pkg/container/heap/heap.go @@ -4,7 +4,7 @@ // Package heap provides heap operations for any type that implements // heap.Interface. A heap is a tree with the property that each node is the -// highest-valued node in its subtree. +// minimum-valued node in its subtree. // // 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 |