0a66361d7c
- Add {Map/Set/WeakMap/WeakSet}-Constructor microbenchmarks - Add {Map/Set}-Double microbenchmarks (testing heap number keys) Bug: v8:6604 Change-Id: Icadd5c81bfb59a58a2a65e119663d3f22637165d Reviewed-on: https://chromium-review.googlesource.com/773595 Reviewed-by: Jakob Gruber <jgruber@chromium.org> Commit-Queue: Jakob Gruber <jgruber@chromium.org> Cr-Commit-Position: refs/heads/master@{#49398}
116 lines
2.4 KiB
JavaScript
116 lines
2.4 KiB
JavaScript
// 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 MapBenchmark = new BenchmarkSuite('WeakMap', [1000], [
|
|
new Benchmark('Set', false, false, 0, WeakMapSet, WeakMapSetupBase,
|
|
WeakMapTearDown),
|
|
new Benchmark('Has', false, false, 0, WeakMapHas, WeakMapSetup,
|
|
WeakMapTearDown),
|
|
new Benchmark('Get', false, false, 0, WeakMapGet, WeakMapSetup,
|
|
WeakMapTearDown),
|
|
new Benchmark('Delete', false, false, 0, WeakMapDelete, WeakMapSetup,
|
|
WeakMapTearDown),
|
|
]);
|
|
|
|
var MapBenchmark = new BenchmarkSuite('WeakMapSetGet-Large', [1e7], [
|
|
new Benchmark('Set-Get', false, false, 0, WeakMapSetGetLarge,
|
|
WeakMapSetupBaseLarge, WeakMapTearDown),
|
|
]);
|
|
|
|
var MapBenchmark = new BenchmarkSuite('WeakMap-Constructor', [1000], [
|
|
new Benchmark('Constructor', false, false, 0, WeakMapConstructor, SetupObjectKeyValuePairs,
|
|
WeakMapTearDown),
|
|
]);
|
|
|
|
|
|
var wm;
|
|
|
|
|
|
function WeakMapSetupBase() {
|
|
SetupObjectKeys();
|
|
wm = new WeakMap;
|
|
}
|
|
|
|
|
|
function WeakMapSetupBaseLarge() {
|
|
SetupObjectKeys(2 * LargeN);
|
|
wm = new WeakMap;
|
|
}
|
|
|
|
|
|
function WeakMapSetup() {
|
|
WeakMapSetupBase();
|
|
WeakMapSet();
|
|
}
|
|
|
|
|
|
function WeakMapTearDown() {
|
|
wm = null;
|
|
}
|
|
|
|
|
|
function WeakMapConstructor() {
|
|
wm = new WeakMap(keyValuePairs);
|
|
}
|
|
|
|
function WeakMapSet() {
|
|
for (var i = 0; i < N; i++) {
|
|
wm.set(keys[i], i);
|
|
}
|
|
}
|
|
|
|
|
|
function WeakMapHas() {
|
|
for (var i = 0; i < N; i++) {
|
|
if (!wm.has(keys[i])) {
|
|
throw new Error();
|
|
}
|
|
}
|
|
for (var i = N; i < 2 * N; i++) {
|
|
if (wm.has(keys[i])) {
|
|
throw new Error();
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
function WeakMapGet() {
|
|
for (var i = 0; i < N; i++) {
|
|
if (wm.get(keys[i]) !== i) {
|
|
throw new Error();
|
|
}
|
|
}
|
|
for (var i = N; i < 2 * N; i++) {
|
|
if (wm.get(keys[i]) !== undefined) {
|
|
throw new Error();
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
function WeakMapDelete() {
|
|
// 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++) {
|
|
wm.delete(keys[i]);
|
|
}
|
|
}
|
|
|
|
function WeakMapSetGetLarge() {
|
|
for (var i = 0; i < LargeN; i++) {
|
|
wm.set(keys[i * 2], i);
|
|
}
|
|
for (var i = 0; i < LargeN; i++) {
|
|
if (wm.get(keys[i * 2]) !== i) {
|
|
throw new Error();
|
|
}
|
|
}
|
|
for (var i = N; i < 2 * LargeN; i++) {
|
|
if (wm.get(keys[i * 2 + 1]) !== undefined) {
|
|
throw new Error();
|
|
}
|
|
}
|
|
}
|