mirror of
https://github.com/golang/go
synced 2024-11-11 21:50:21 -07:00
08a5614597
Avoids a dependency on a somewhat nonstandard part of package syscall. R=golang-dev, dave, r CC=golang-dev https://golang.org/cl/15570046
57 lines
1.1 KiB
Go
57 lines
1.1 KiB
Go
// +build darwin linux
|
|
// run
|
|
|
|
// Copyright 2013 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
// Test that NaNs in maps don't go quadratic.
|
|
|
|
package main
|
|
|
|
import (
|
|
"fmt"
|
|
"math"
|
|
"time"
|
|
)
|
|
|
|
func main() {
|
|
|
|
// Test that NaNs in maps don't go quadratic.
|
|
t := func(n int) time.Duration {
|
|
t1 := time.Now()
|
|
m := map[float64]int{}
|
|
nan := math.NaN()
|
|
for i := 0; i < n; i++ {
|
|
m[nan] = 1
|
|
}
|
|
if len(m) != n {
|
|
panic("wrong size map after nan insertion")
|
|
}
|
|
return time.Since(t1)
|
|
}
|
|
|
|
// Depending on the machine and OS, this test might be too fast
|
|
// to measure with accurate enough granularity. On failure,
|
|
// make it run longer, hoping that the timing granularity
|
|
// is eventually sufficient.
|
|
|
|
n := 30000 // ~8ms user time on a Mid 2011 MacBook Air (1.8 GHz Core i7)
|
|
fails := 0
|
|
for {
|
|
t1 := t(n)
|
|
t2 := t(2 * n)
|
|
// should be 2x (linear); allow up to 3x
|
|
if t2 < 3*t1 {
|
|
return
|
|
}
|
|
fails++
|
|
if fails == 6 {
|
|
panic(fmt.Sprintf("too slow: %d inserts: %v; %d inserts: %v\n", n, t1, 2*n, t2))
|
|
}
|
|
if fails < 4 {
|
|
n *= 2
|
|
}
|
|
}
|
|
}
|