Slightly more efficient heap functions in heap.go

[lorenzotinfena]

Sorry I think I duplicated (2 times) this pr, I'm noob.
I have done only a little benchmark, but maybe not coverings all possible cases.
In my benchmark (initialize a a heap) was faster around of 3-4% with this code.

[gopherbot]

This PR (HEAD: 0055dd6) has been imported to Gerrit for code review.

Please visit https://go-review.googlesource.com/c/go/+/451835 to see it.

Tip: You can toggle comments from me using the comments slash command (e.g. /comments off)
See the Wiki page for more info

[ishwar00]

go/src/container/heap/heap.go

Lines 25 to 27 in d5de62d

	//
	// !h.Less(j, i) for 0 <= i < h.Len() and 2*i+1 <= j <= 2*i+2 and j < h.Len()
	//

Hey @lorenzotinfena, please update the comments accordingly.

Thanks

[lorenzotinfena]

Hi, sorry but I don't know what you mean. It seems right to me that comment.
Maybe to be more precise (to count int overflow) I think it can be:
!h.Less(j, i) for 0 <= i < h.Len() and 2*i+1 <= j <= 2*i+2 and 0 <= j < h.Len()

[gopherbot]

Message from Subham Sarkar:

Patch Set 1:

(1 comment)

---

Please don’t reply on this GitHub thread. Visit golang.org/cl/451835.
After addressing review feedback, remember to publish your drafts!

[gopherbot]

Message from Subham Sarkar:

Patch Set 1:

(1 comment)

---

Please don’t reply on this GitHub thread. Visit golang.org/cl/451835.
After addressing review feedback, remember to publish your drafts!