code review 3076041: sort.Search: slightly more precise wording in comment

sort.Search: slightly more precise wording in comment

(+ some cosmetic changes)

[gri, 2010-11-13 00:03:47]

Hello iant (cc: golang-dev@googlegroups.com),

I'd like you to review this change.

[iant2, 2010-11-13 00:08:31]

LGTM

gri@golang.org writes:

> Reviewers: iant,
>
> Message:
> Hello iant (cc: golang-dev@googlegroups.com),
>
> I'd like you to review this change.
>
>
> Description:
> sort.Search: slightly more precise wording in comment
>
> (+ some cosmetic changes)
>
> Please review this at http://codereview.appspot.com/3076041/
>
> Affected files:
>   M src/pkg/sort/search.go
>
>
> Index: src/pkg/sort/search.go
> ===================================================================
> --- a/src/pkg/sort/search.go
> +++ b/src/pkg/sort/search.go
> @@ -27,7 +27,7 @@
>  //	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 @@
>  //	} 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 @@
>  			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
>  }

[gri, 2010-11-13 00:08:59]

*** Submitted as http://code.google.com/p/go/source/detail?r=9ebe96310387 ***

sort.Search: slightly more precise wording in comment

(+ some cosmetic changes)

R=iant, iant2
CC=golang-dev
http://codereview.appspot.com/3076041