Created
December 4, 2017 03:51
-
-
Save arccoza/c21f6f4d50a24a4f39fa2bd8455e6bb1 to your computer and use it in GitHub Desktop.
Fastest way to slice an array (http://jsbench.github.io/#c21f6f4d50a24a4f39fa2bd8455e6bb1) #jsbench #jsperf
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html> | |
<head> | |
<meta charset="utf-8"/> | |
<title>Fastest way to slice an array</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> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
"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 () { | |
var arr = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]; | |
function dice(arr, idx) { | |
var len = arr.length, snip = new Array(len - idx), i; | |
for (i = idx; i < len; snip[i - idx] = arr[i++]); | |
return snip; | |
} | |
}; | |
suite.add("var snip = arr.slice(5);", function () { | |
var snip = arr.slice(5); | |
}); | |
suite.add("var snip = new Array(arr.length - 5);", function () { | |
var snip = new Array(arr.length - 5); | |
for (let i = 5; snip[i - 5] = arr[i], i < arr.length - 1; i++); | |
}); | |
suite.add("var snip = new Array(arr.length - 5);", function () { | |
var snip = new Array(arr.length - 5); | |
for (let i = 5; i < arr.length; snip[i - 5] = arr[i++]); | |
}); | |
suite.add("var len = arr.length, snip = new Array(len - 5);", function () { | |
var len = arr.length, snip = new Array(len - 5); | |
for (let i = 5; i < len; snip[i - 5] = arr[i++]); | |
}); | |
suite.add("var len = arr.length, snip = new Array(len - 5), i = 5;", function () { | |
var len = arr.length, snip = new Array(len - 5), i = 5; | |
while(i < len) { snip[i - 5] = arr[i++] } | |
}); | |
suite.add("var snip = dice(arr, 5);", function () { | |
var snip = dice(arr, 5); | |
}); | |
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("Fastest way to slice an array"); | |
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