From: Rob Pike <r@golang.org>
Date: Tue, 2 Apr 2013 17:25:02 +0000 (-0700)
Subject: sort: be consistent when describing "less: function in the multiKeys example
X-Git-Tag: go1.1rc2~228
X-Git-Url: http://www.git.cypherpunks.su/?a=commitdiff_plain;h=3a012c02ed8e76a6103a1a36d7220580e79a63ac;p=gostls13.git

sort: be consistent when describing "less: function in the multiKeys example
s/ordering/less/g

R=golang-dev, bradfitz
CC=golang-dev
https://golang.org/cl/8267043
---

diff --git a/src/pkg/sort/example_multi_test.go b/src/pkg/sort/example_multi_test.go
index 8a2f277880..d0a9e7dc37 100644
--- a/src/pkg/sort/example_multi_test.go
+++ b/src/pkg/sort/example_multi_test.go
@@ -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]