From: Volker Dobler <dr.volker.dobler@gmail.com>
Date: Tue, 27 Aug 2013 15:41:43 +0000 (-0700)
Subject: sort: harden limit in stable test
X-Git-Tag: go1.2rc2~417
X-Git-Url: http://www.git.cypherpunks.su/?a=commitdiff_plain;h=2f81dfd53f5f0b422b038793f514cbf4ce58e573;p=gostls13.git

sort: harden limit in stable test

Reduce the number of allowed swap operations during stable sort. 

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

diff --git a/src/pkg/sort/sort_test.go b/src/pkg/sort/sort_test.go
index fb872c2941..3b705d7a24 100644
--- a/src/pkg/sort/sort_test.go
+++ b/src/pkg/sort/sort_test.go
@@ -350,7 +350,7 @@ func TestHeapsortBM(t *testing.T) {
 }
 
 func TestStableBM(t *testing.T) {
-	testBentleyMcIlroy(t, Stable, func(n int) int { return n * lg(n) * lg(n) })
+	testBentleyMcIlroy(t, Stable, func(n int) int { return n * lg(n) * lg(n) / 3 })
 }
 
 // This is based on the "antiquicksort" implementation by M. Douglas McIlroy.