From 2f81dfd53f5f0b422b038793f514cbf4ce58e573 Mon Sep 17 00:00:00 2001 From: Volker Dobler Date: Tue, 27 Aug 2013 08:41:43 -0700 Subject: [PATCH] sort: harden limit in stable test MIME-Version: 1.0 Content-Type: text/plain; charset=utf8 Content-Transfer-Encoding: 8bit Reduce the number of allowed swap operations during stable sort.  R=golang-dev, bradfitz CC=golang-dev https://golang.org/cl/12907045 --- src/pkg/sort/sort_test.go | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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. -- 2.48.1