jsPerf.app is an online JavaScript performance benchmark test runner & jsperf.com mirror. It is a complete rewrite in homage to the once excellent jsperf.com now with hopefully a more modern & maintainable codebase.
jsperf.com URLs are mirrored at the same path, e.g:
https://jsperf.com/negative-modulo/2
Can be accessed at:
https://jsperf.app/negative-modulo/2
<script>
var arr = [7, 10, 37, 60, 373, 390, 1427, 7879, 7881];
// Code taken from http://ejohn.org/apps/learn/ by John Resig
function isPrime(num) {
var prime = num != 1; // Everything but 1 can be prime
for (var i = 2; i < num; i++) {
if (num % i == 0) {
prime = false;
break;
};
};
return prime;
};
function isPrimeCached(num) {
if (isPrimeCached.cache[num] !== null) {
return isPrimeCached.cache[num];
};
var prime = num != 1; // Everything but 1 can be prime
for (var i = 2; i < num; i++) {
if (num % i == 0) {
prime = false;
break;
};
};
isPrimeCached.cache[num] = prime;
return prime;
};
isPrimeCached.cache = {};
// By Devon Govett
function isPrimeFaster(num) {
var prime = num != 1 || num != 2;
for (var i = 3; i < num; i += 2) { //ignore even numbers > 2
if (num % i == 0) {
prime = false;
break;
}
}
return prime;
}
function isPrimeFasterCached(num) {
if (isPrimeFasterCached.cache[num] !== null) {
return isPrimeFasterCached.cache[num];
};
var prime = num != 1 || num != 2;
for (var i = 3; i < num; i += 2) { // ignore even numbers > 2
if (num % i == 0) {
prime = false;
break;
}
}
isPrimeFasterCached.cache[num] = prime;
return prime;
};
isPrimeFasterCached.cache = {};
// Code by Devon Govett — http://twitter.com/devongovett/status/20019256843, inspired by http://mths.be/ahf
function isPrimeRegex(n) {
return Array(n + 1).join('1').search(/^1?$|^(11+?)\1+$/) === -1;
};
</script>
Ready to run.
Test | Ops/sec | |
---|---|---|
isPrime() |
| ready |
isPrimeCached() |
| ready |
isPrimeRegex() |
| ready |
isPrimeFaster() |
| ready |
isPrimeFasterCached() |
| ready |
You can edit these tests or add more tests to this page by appending /edit to the URL.