Last active
May 7, 2024 06:49
-
-
Save 7heMech/2d650dc99e4e95c5e8dd1162b74bfd63 to your computer and use it in GitHub Desktop.
Uint vs Array #jsbench #jsperf (https://jsbench.github.io/#2d650dc99e4e95c5e8dd1162b74bfd63) #jsbench #jsperf
This file contains hidden or 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> Uint vs 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 hidden or 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 () { | |
| const alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ234567" | |
| }; | |
| suite.add("const lookup = new Uint8Array(256).fill(255", function () { | |
| const lookup = new Uint8Array(256).fill(255 | |
| for (let i = 0; i < alphabet.length; i++) { | |
| lookup[alphabet.charCodeAt(i)] = i | |
| } | |
| for (let i = 0; i < lookup.length; i++) { | |
| console.log(lookup[i]) | |
| } | |
| }); | |
| suite.add("const lookup = Array(256).fill(255)", function () { | |
| const lookup = Array(256).fill(255) | |
| for (let i = 0; i < alphabet.length; i++) { | |
| lookup[alphabet.charCodeAt(i)] = i | |
| } | |
| for (let i = 0; i < lookup.length; i++) { | |
| console.log(lookup[i]) | |
| } | |
| }); | |
| 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(" Uint vs 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