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
57
58
59
60
61
62
63
64
65
66
|
// Copyright 2014 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
var SetBenchmark = new BenchmarkSuite('Set', [1000], [
new Benchmark('Add', false, false, 0, SetAdd),
new Benchmark('Has', false, false, 0, SetHas, SetSetup, SetTearDown),
new Benchmark('Delete', false, false, 0, SetDelete, SetSetup, SetTearDown),
new Benchmark('ForEach', false, false, 0, SetForEach, SetSetup, SetTearDown),
]);
var set;
var N = 10;
function SetSetup() {
set = new Set;
for (var i = 0; i < N; i++) {
set.add(i);
}
}
function SetTearDown() {
map = null;
}
function SetAdd() {
SetSetup();
SetTearDown();
}
function SetHas() {
for (var i = 0; i < N; i++) {
if (!set.has(i)) {
throw new Error();
}
}
for (var i = N; i < 2 * N; i++) {
if (set.has(i)) {
throw new Error();
}
}
}
function SetDelete() {
// This is run more than once per setup so we will end up deleting items
// more than once. Therefore, we do not the return value of delete.
for (var i = 0; i < N; i++) {
set.delete(i);
}
}
function SetForEach() {
set.forEach(function(v, k) {
if (v !== k) {
throw new Error();
}
});
}
|
