File: mapnan.go

package info (click to toggle)
golang 2%3A1.2-2
  • links: PTS, VCS
  • area: main
  • in suites: jessie, stretch
  • size: 45,552 kB
  • ctags: 90,012
  • sloc: ansic: 168,396; asm: 15,852; yacc: 4,966; perl: 4,876; sh: 2,229; xml: 1,085; lisp: 947; python: 267; makefile: 243; awk: 106; cpp: 22
file content (56 lines) | stat: -rw-r--r-- 1,155 bytes parent folder | download | duplicates (11)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
// +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
		}
	}
}