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
Looking for the fastest hash function to get a unique id of a string.
function bitwise(str) {
var hash = 0;
if (str.length == 0) return hash;
for (i = 0; i < str.length; i++) {
char = str.charCodeAt(i);
hash = ((hash << 5) - hash) + char;
}
return hash;
}
function numbers(str) {
var res = 0,
len = str.length;
for (var i = 0; i < len; i++) {
res = res * 31 + str.charCodeAt(i);
}
return res;
}
function bitwiseconv(str) {
var hash = 0;
if (str.length == 0) return hash;
for (i = 0; i < str.length; i++) {
char = str.charCodeAt(i);
hash = ((hash << 5) - hash) + char;
hash = hash & hash; // Convert to 32bit integer
}
return hash;
}
function numbersconv(str) {
var res = 0,
len = str.length;
for (var i = 0; i < len; i++) {
res = res * 31 + str.charCodeAt(i);
res = res & res;
}
return res;
}
function smallconv(e) {
for (var r = 0, i = 0; i < e.length; i++)
r = (r << 5) - r + e.charCodeAt(i), r & = r;
return r
}
function hashcode(str) {
var hash = 0;
if (str.length == 0) return hash;
for (var i = 0; i < str.length; i++) {
var char = str.charCodeAt(i);
hash = ((hash << 5) - hash) + char;
hash = hash & hash; // Convert to 32bit integer
}
return hash;
}
Ready to run.
Test | Ops/sec | |
---|---|---|
Bitwise based function (No integer conversion) |
| ready |
Number based function (No integer conversion) |
| ready |
Bitwise based function |
| ready |
Number based function |
| ready |
Small version |
| ready |
Java hashCode |
| ready |
You can edit these tests or add more tests to this page by appending /edit to the URL.