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

sort: replace Errorf+FailNow with Fatalf

Browse Source 
Change-Id: I4f8d0178e780b86d1f551b367e2ddac3789be5aa
Reviewed-on: https://go-review.googlesource.com/c/go/+/168880
Run-TryBot: Ian Lance Taylor <iant@golang.org>
Reviewed-by: Ian Lance Taylor <iant@golang.org>
This commit is contained in:
Iskander Sharipov 2019-03-22 15:30:30 +03:00 committed by Ian Lance Taylor
parent cf952e9e62
commit 9889138614
1 changed files with 3 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
src/sort/sort_test.go
View File

@ -323,8 +323,7 @@ func (d *testingData) Less(i, j int) bool {
}
func (d *testingData) Swap(i, j int) {
if d.nswap >= d.maxswap {
d.t.Errorf("%s: used %d swaps sorting slice of %d", d.desc, d.nswap, len(d.data))
d.t.FailNow()
d.t.Fatalf("%s: used %d swaps sorting slice of %d", d.desc, d.nswap, len(d.data))
}
d.nswap++
d.data[i], d.data[j] = d.data[j], d.data[i]
@ -433,9 +432,7 @@ func testBentleyMcIlroy(t *testing.T, sort func(Interface), maxswap func(int) in
// mutating method Sort can call is TestingData.swap,
// it suffices here just to check that the final slice is sorted.
if !IntsAreSorted(mdata) {
t.Errorf("%s: ints not sorted", desc)
t.Errorf("\t%v", mdata)
t.FailNow()
t.Fatalf("%s: ints not sorted\n\t%v", desc, mdata)
}
}
}
@ -517,8 +514,7 @@ func TestAdversary(t *testing.T) {
// Check data is fully populated and sorted.
for i, v := range d.data {
if v != i {
t.Errorf("adversary data not fully sorted")
t.FailNow()
t.Fatalf("adversary data not fully sorted")
}
}
}