Skip to content

Instantly share code, notes, and snippets.

@jridgewell
Last active August 30, 2019 19:10
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save jridgewell/c1c8a2d525168f7dffc9e7a734d9186a to your computer and use it in GitHub Desktop.
Save jridgewell/c1c8a2d525168f7dffc9e7a734d9186a to your computer and use it in GitHub Desktop.
Array.includes vs Set.has misses #jsbench #jsperf (https://jsbench.github.io/#c1c8a2d525168f7dffc9e7a734d9186a) #jsbench #jsperf
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8"/>
<title>Array.includes vs Set.has misses #jsbench #jsperf</title>
<script src="https://cdnjs.cloudflare.com/ajax/libs/benchmark/1.0.0/benchmark.min.js"></script>
<script src="./suite.js"></script>
</head>
<body>
<h1>Open the console to view the results</h1>
<h2><code>cmd + alt + j</code> or <code>ctrl + alt + j</code></h2>
</body>
</html>
"use strict";
(function (factory) {
if (typeof Benchmark !== "undefined") {
factory(Benchmark);
} else {
factory(require("benchmark"));
}
})(function (Benchmark) {
var suite = new Benchmark.Suite;
Benchmark.prototype.setup = function () {
const shortArray = makeArray(3);
const shortSet = new Set(shortArray);
const mediumArray = makeArray(20);
const mediumSet = new Set(mediumArray);
const longArray = makeArray(200);
const longSet = new Set(longArray);
function makeArray(length) {
const array = [];
for (let i = 0; i < length; i++) {
array.push('key' + i);
}
return array;
}
};
suite.add("Short array miss", function () {
// Short array miss
shortArray.includes('miss');
});
suite.add("Short set miss", function () {
// Short set miss
shortSet.has('miss');
});
suite.add("Medium array miss", function () {
// Medium array miss
mediumArray.includes('miss');
});
suite.add("Medium set miss", function () {
// Medium set miss
mediumSet.has('miss');
});
suite.add("Long array miss", function () {
// Long array miss
longArray.includes('miss');
});
suite.add("Long set miss", function () {
// Long set miss
longSet.has('miss');
});
suite.on("cycle", function (evt) {
console.log(" - " + evt.target);
});
suite.on("complete", function (evt) {
console.log(new Array(30).join("-"));
var results = evt.currentTarget.sort(function (a, b) {
return b.hz - a.hz;
});
results.forEach(function (item) {
console.log((idx + 1) + ". " + item);
});
});
console.log("Array.includes vs Set.has misses #jsbench #jsperf");
console.log(new Array(30).join("-"));
suite.run();
});
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment