Last active
December 8, 2017 07:39
-
-
Save arccoza/188cbe041026832a50a61a0fd674e1be to your computer and use it in GitHub Desktop.
Fastest way to fill an array #jsbench #jsperf (http://jsbench.github.io/#188cbe041026832a50a61a0fd674e1be) #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 fill an array #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> |
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 () { | |
| let n = 120000; | |
| var arr = null; | |
| }; | |
| suite.add("(arr = []).length = n;", function () { | |
| (arr = []).length = n; | |
| for (let i = 0; i < n; ++i) { | |
| arr[i] = 0; | |
| } | |
| }); | |
| suite.add("(arr = []).length = n;", function () { | |
| (arr = []).length = n; | |
| let i = 0; | |
| while (i < n) { | |
| arr[i] = 0; | |
| i++; | |
| } | |
| }); | |
| suite.add("arr = new Array(n);", function () { | |
| arr = new Array(n); | |
| for (let i = 0; i < n; arr[i++] = 0); | |
| }); | |
| suite.add("arr = new Array(n);", function () { | |
| arr = new Array(n); | |
| for (let i = n - 1; i > -1; arr[i--] = 0); | |
| }); | |
| suite.add("arr = [];", function () { | |
| arr = []; | |
| for (let i = 0; i < n; arr[i++] = 0); | |
| }); | |
| suite.add("arr = new Array(n);", function () { | |
| arr = new Array(n); | |
| var i = 0; | |
| n%2 ? (i = 1, arr[0] = 1, arr) : arr; | |
| for (; i < n; arr[i++] = 0, arr[i++] = 0); | |
| }); | |
| suite.add("arr = new Array(n);", function () { | |
| arr = new Array(n); | |
| arr = arr.fill(0); | |
| }); | |
| 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 fill an array #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