languages/go
languages/go
1
0
Fork 0
mirror of https://github.com/golang/go synced 2024-11-02 11:50:30 +00:00
Code Issues Projects Releases Packages Wiki Activity

sort: fix a slice benchmark not using the stable variant, add another

Browse source 
Change-Id: I9783d8023d453a72c4605a308064bef98168bcb8
Reviewed-on: https://go-review.googlesource.com/30360
Reviewed-by: Ian Lance Taylor <iant@golang.org>
Run-TryBot: Ian Lance Taylor <iant@golang.org>
TryBot-Result: Gobot Gobot <gobot@golang.org>
This commit is contained in:
Brad Fitzpatrick 2016-10-05 04:35:59 +00:00
parent ee8ec42929
commit aad29eba29
1 changed files with 14 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

15
src/sort/sort_test.go
View file

@ -245,7 +245,7 @@ func BenchmarkStableInt1K_Slice(b *testing.B) {
for i := 0; i < b.N; i++ {
copy(data, unsorted)
b.StartTimer()
Slice(data, func(i, j int) bool { return data[i] < data[j] })
SliceStable(data, func(i, j int) bool { return data[i] < data[j] })
b.StopTimer()
}
}
@ -263,6 +263,19 @@ func BenchmarkSortInt64K(b *testing.B) {
}
}
func BenchmarkSortInt64K_Slice(b *testing.B) {
b.StopTimer()
for i := 0; i < b.N; i++ {
data := make([]int, 1<<16)
for i := 0; i < len(data); i++ {
data[i] = i ^ 0xcccc
}
b.StartTimer()
Slice(data, func(i, j int) bool { return data[i] < data[j] })
b.StopTimer()
}
}
func BenchmarkStableInt64K(b *testing.B) {
b.StopTimer()
for i := 0; i < b.N; i++ {