Skip to content

Instantly share code, notes, and snippets.

@KillyMXI

KillyMXI/index.html

Last active December 7, 2020 19:17
Show Gist options
  • Save KillyMXI/e3d72a6878183b542deb67833d9a05c5 to your computer and use it in GitHub Desktop.
Save KillyMXI/e3d72a6878183b542deb67833d9a05c5 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
index.html
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8"/>
<title>longest string</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>
Raw
suite.js
"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 () {
function randomString(len) {
const charSet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';
let randomString = '';
for (let i = 0; i < len; i++) {
const randomPoz = Math.floor(Math.random() * charSet.length);
randomString += charSet.substring(randomPoz,randomPoz+1);
}
return randomString;
}
function randomLengthString(min, max) {
min = Math.ceil(min);
max = Math.floor(max);
const len = Math.floor(Math.random() * (max - min) + min);
return randomString(len);
}
var array = [...new Array(100)].map(() => randomLengthString(1, 100));
};
suite.add("var maxLen = 0;", function () {
var maxLen = 0;
for (const line of array) {
maxLen = Math.max(line.length, maxLen);
}
});
suite.add("var maxLen = 0;", function () {
var maxLen = 0;
for (var i = 0; i < array.length; i++) {
maxLen = Math.max(array[i].length, maxLen);
}
});
suite.add("var maxLen = 0;", function () {
var maxLen = 0;
for (let i = 0; i < array.length; i++) {
const len = array[i].length;
maxLen = len > maxLen ? len : maxLen;
}
});
suite.add("var maxLen = 0;", function () {
var maxLen = 0;
const arrLen = array.length;
for (let i = 0; i < arrLen; i++) {
const len = array[i].length;
maxLen = len > maxLen ? len : maxLen;
}
});
suite.add("var maxLen = array.reduce((acc, { length }) => acc > length ? acc : length)", function () {
var maxLen = array.reduce((acc, { length }) => acc > length ? acc : length)
});
suite.add("var maxLen = array.reduce((acc, { length }) => Math.max(acc, length))", function () {
var maxLen = array.reduce((acc, { length }) => Math.max(acc, length))
});
suite.add("var maxLen = array.map(s => s.length).reduce((a,b) => Math.max(a, b))", function () {
var maxLen = array.map(s => s.length).reduce((a,b) => Math.max(a, b))
});
suite.add("var maxLen = 0;", function () {
var maxLen = 0;
array.forEach(s => { maxLen = Math.max(s.length, maxLen); })
});
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("longest string");
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