Last active
November 30, 2020 13:15
-
-
Save warpech/2b685a20300cb1d78785b727782559af to your computer and use it in GitHub Desktop.
Lookup tables - Iterator generation and iteration #jsbench #jsperf #jsbench #jsperf (http://jsbench.github.io/#2b685a20300cb1d78785b727782559af) #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>Lookup tables - Iterator generation and iteration #jsbench #jsperf #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 () { | |
| const obj = {}; | |
| const map1 = new Map(); | |
| const map2 = new Map(); | |
| const KEY = 0; | |
| const VALUE = 1; | |
| const aaa = { | |
| }; | |
| const bbb = { | |
| }; | |
| obj["aaa"] = 1; | |
| obj["bbb"] = obj["aaa"] + 1; | |
| map1.set("aaa", 1); | |
| map1.set("bbb", map1.get("aaa") + 1) | |
| map2.set(aaa, {val: 1}); | |
| map2.set(bbb, {val: map2.get(aaa).val + 1}) | |
| }; | |
| suite.add("const keys = Object.keys(obj);", function () { | |
| const keys = Object.keys(obj); | |
| let sum = 0; | |
| for (let i = 0; i < keys.length; i++) { | |
| sum += obj[keys[i]]; | |
| } | |
| }); | |
| suite.add("const keys = map1.keys();", function () { | |
| const keys = map1.keys(); | |
| let sum = 0; | |
| for (const key of keys) { | |
| sum += map1.get(key); | |
| } | |
| }); | |
| suite.add("const keys = map2.keys();", function () { | |
| const keys = map2.keys(); | |
| let sum = 0; | |
| for (const key of keys) { | |
| sum += map2.get(key); | |
| } | |
| }); | |
| suite.add("let sum = 0;", function () { | |
| let sum = 0; | |
| for (const [key, value] of map1) { | |
| sum += value; | |
| } | |
| }); | |
| suite.add("const values = map1.values();", function () { | |
| const values = map1.values(); | |
| let sum = 0; | |
| for (const value of values) { | |
| sum += value; | |
| } | |
| }); | |
| suite.add("const arr = [...map1.values()];", function () { | |
| const arr = [...map1.values()]; | |
| let sum = 0; | |
| for (let i = 0; i < arr.length; i++) { | |
| sum += arr[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("Lookup tables - Iterator generation and iteration #jsbench #jsperf #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