qbit/go
1
0
Fork 0
mirror of https://github.com/golang/go synced 2024-11-13 17:50:23 -07:00
Code Releases Activity

sort: be consistent when describing "less: function in the multiKeys example

Browse Source 
s/ordering/less/g

R=golang-dev, bradfitz
CC=golang-dev
https://golang.org/cl/8267043
This commit is contained in:
Rob Pike 2013-04-02 10:25:02 -07:00
parent 15f276bc53
commit 3a012c02ed
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/pkg/sort/example_multi_test.go
View File

@ -49,9 +49,9 @@ func (ms *multiSorter) Swap(i, j int) {
}
// Less is part of sort.Interface. It is implemented by looping along the
// ordering functions until it finds a comparison that is either Less or
// !Less. Note that it can call the ordering functions twice per call. We
// could change the ordering functions to return -1, 0, 1 and reduce the
// less functions until it finds a comparison that is either Less or
// !Less. Note that it can call the less functions twice per call. We
// could change the functions to return -1, 0, 1 and reduce the
// number of calls for greater efficiency: an exercise for the reader.
func (ms *multiSorter) Less(i, j int) bool {
p, q := &ms.changes[i], &ms.changes[j]