Benchmark: Hashing-2 - MeasureThat.net

Script Preparation code:

var s = 'asdlkjhasdjkhasdkjh12381~//~2397yhkasdhjkaals;d~//~lasdk;asdk;lk~//~sd';

Tests:

positive hashcode 1
function hashCode(s) { for (var h = 0, i = 0; i < s.length; ++i) { h = Math.imul(31, h) + s.charCodeAt(i); } return h >>> 0; } hashCode(s);
positive hashcode 2
function hashCode(s) { for (var h = 0, i = 0; i < s.length; ++i) { h = Math.imul(31, h) + s.charCodeAt(i); } return Math.abs(h); } hashCode(s);
32 bit hashcode
function hashCode(s) { for (var h = 0, i = 0; i < s.length; ++i) { h = Math.imul(31, h) + s.charCodeAt(i) | 0; } return h; } hashCode(s);
many bit hashcode
function hashCode(s) { for (var h = 0, i = 0; i < s.length; ++i) { h = Math.imul(31, h) + s.charCodeAt(i); } return h; } hashCode(s);
positive hashcode 1.1
function hashCode(s) { for (var h = 0, i = 0; i < s.length; ++i) { h = Math.imul(31, h) + s.charCodeAt(i) | 0; } return h >>> 0; } hashCode(s);
positive hashcode 2.1
function hashCode(s) { for (var h = 0, i = 0; i < s.length; ++i) { h = Math.imul(31, h) + s.charCodeAt(i) | 0; } return Math.abs(h); } hashCode(s);
positive hashcode 2.2
function hashCode(s) { for (var h = 0, i = 0; i < s.length; ++i) { h = 31 * h + s.charCodeAt(i) | 0; } return Math.abs(h); } hashCode(s);
positive hashcode 1.2
function hashCode(s) { for (var h = 0, i = 0; i < s.length; ++i) { h = 31 * h + s.charCodeAt(i) | 0; } return h >>> 0; } hashCode(s);
positive hashcode 1.3
function hashCode(s) { for (var h = 0, i = 0; i < s.length; ++i) { h = 31 * h + s.charCodeAt(i); } return h >>> 0; } hashCode(s);

Rendered benchmark preparation results:

Previous results

LLMs can make mistakes. Check important info.

Latest run results:

Run details: (Test run date: 3 years ago)

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/89.0.4389.82 Safari/537.36

Browser/OS: Chrome 89 on Windows

Related benchmarks:

Hashing-2 (version: 0)