blob: 134cd6879b39177758cd7348e8c7d10f07ee150f (
plain) (
blame)
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
|
package scala.collection.immutable
import org.openjdk.jmh.annotations._
import org.openjdk.jmh.infra._
import org.openjdk.jmh.runner.IterationType
import benchmark._
import java.util.concurrent.TimeUnit
@BenchmarkMode(Array(Mode.AverageTime))
@Fork(2)
@Threads(1)
@Warmup(iterations = 10)
@Measurement(iterations = 10)
@OutputTimeUnit(TimeUnit.NANOSECONDS)
@State(Scope.Benchmark)
class HashMapBenchmark {
@Param(Array("10", "100", "1000"))
var size: Int = _
var existingKeys: Array[Any] = _
var missingKeys: Array[Any] = _
@Setup(Level.Trial) def initKeys(): Unit = {
existingKeys = (0 to size).map(i => (i % 4) match {
case 0 => i.toString
case 1 => i.toChar
case 2 => i.toDouble
case 3 => i.toInt
}).toArray
missingKeys = (size to 2 * size).toArray
}
var map: collection.immutable.HashMap[Any, Any] = null
@Setup(Level.Trial) def initialize = {
map = collection.immutable.HashMap(existingKeys.map(x => (x, x)) : _*)
}
@Benchmark def contains(bh: Blackhole): Unit = {
var i = 0;
while (i < size) {
bh.consume(map.contains(existingKeys(i)))
bh.consume(map.contains(missingKeys(i)))
i += 1
}
}
@Benchmark def get(bh: Blackhole): Unit = {
var i = 0;
while (i < size) {
bh.consume(map.get(existingKeys(i)))
bh.consume(map.get(missingKeys(i)))
i += 1
}
}
}
|
