From: Muhammad Falak R Wani <falakreyaz@gmail.com>
Date: Mon, 7 Aug 2023 13:44:06 +0000 (+0000)
Subject: sort: use the builtin min function
X-Git-Tag: go1.22rc1~1378
X-Git-Url: http://www.git.cypherpunks.su/?a=commitdiff_plain;h=0dc513b65a3aaf25dfad134b7ef3ac5aaac95159;p=gostls13.git

sort: use the builtin min function

Change-Id: I9603de9abff8d5c8fb9efdf688ff1a5f8c7d19b2
GitHub-Last-Rev: c6fe3acc41a3a9c7d07e3c291985867a704013b1
GitHub-Pull-Request: golang/go#61808
Reviewed-on: https://go-review.googlesource.com/c/go/+/516635
Auto-Submit: Keith Randall <khr@golang.org>
Run-TryBot: Keith Randall <khr@golang.org>
Reviewed-by: Michael Knyszek <mknyszek@google.com>
Reviewed-by: Keith Randall <khr@golang.org>
TryBot-Result: Gopher Robot <gobot@golang.org>
Reviewed-by: Keith Randall <khr@google.com>
---

diff --git a/src/sort/sort_test.go b/src/sort/sort_test.go
index 62f51ba639..ccb89873af 100644
--- a/src/sort/sort_test.go
+++ b/src/sort/sort_test.go
@@ -415,13 +415,6 @@ func (d *testingData) Swap(i, j int) {
 	d.data[i], d.data[j] = d.data[j], d.data[i]
 }
 
-func min(a, b int) int {
-	if a < b {
-		return a
-	}
-	return b
-}
-
 func lg(n int) int {
 	i := 0
 	for 1<<uint(i) < n {