Permalink
Browse files

container/heap: optimization when selecting smaller child

In down(), if two children are equal, we can choose either one.
Inspired by https://codereview.appspot.com/6613064/

Change-Id: Iaad4ca5e2f5111bf3abb87f606584e7d274c620b
Reviewed-on: https://go-review.googlesource.com/38612
Run-TryBot: Robert Griesemer <gri@golang.org>
Reviewed-by: Robert Griesemer <gri@golang.org>
  • Loading branch information...
gengliangwang authored and griesemer committed Mar 24, 2017
1 parent 716761b commit f5352a7763c8f96f7f092990d64339eae0623263
Showing with 1 addition and 1 deletion.
  1. +1 −1 src/container/heap/heap.go
@@ -107,7 +107,7 @@ func down(h Interface, i0, n int) bool {
break
}
j := j1 // left child
if j2 := j1 + 1; j2 < n && !h.Less(j1, j2) {
if j2 := j1 + 1; j2 < n && h.Less(j2, j1) {
j = j2 // = 2*i + 2 // right child
}
if !h.Less(j, i) {

0 comments on commit f5352a7

Please sign in to comment.