From 8f651ff742a3dc69b03afa6ba6a09c5c1d47c450 Mon Sep 17 00:00:00 2001 From: Robert Griesemer Date: Fri, 12 Nov 2010 16:08:56 -0800 Subject: [PATCH] sort.Search: slightly more precise wording in comment (+ some cosmetic changes) R=iant, iant2 CC=golang-dev https://golang.org/cl/3076041 --- src/pkg/sort/search.go | 7 ++++--- 1 file changed, 4 insertions(+), 3 deletions(-) diff --git a/src/pkg/sort/search.go b/src/pkg/sort/search.go index 6b053c2b1d5..aaaa0c84a12 100644 --- a/src/pkg/sort/search.go +++ b/src/pkg/sort/search.go @@ -27,7 +27,7 @@ package sort // data[i-1] < x && x <= data[i] // // where data[-1] is assumed to be smaller than any x and data[n] is -// assumed to be larger than any x. Thus 0 <= i <= n and i is the first +// assumed to be larger than any x. Thus 0 <= i <= n and i is the smallest // index of x if x is present in the data. It is the responsibility of // the caller to verify the actual presence by testing if i < n and // data[i] == x. @@ -42,6 +42,7 @@ package sort // } else { // // elem is not present in data // } +// func Search(n int, f func(int) bool) int { i, j := 0, n for i+1 < j { @@ -55,11 +56,11 @@ func Search(n int, f func(int) bool) int { j = h } } - // test the final element that the loop did not. + // test the final element that the loop did not if i < j && f(i) { + // data[i] < x i++ } - return i }