https://qatardrivingtheorytest.com/wp-content/plugins/user-visiting-pages/hash/murmurhash3.js

1function murmurhash3_32_gc(key, seed) {
2    var remainder, bytes, h1, h1b, c1, c2, k1, i;
3
4    remainder = key.length & 3; // key.length % 4
5    bytes = key.length - remainder;
6    h1 = seed;
7    c1 = 0xcc9e2d51;
8    c2 = 0x1b873593;
9    i = 0;
10
11    while (i < bytes) {
12        k1 =
13            ((key.charCodeAt(i) & 0xff)) |
14            ((key.charCodeAt(++i) & 0xff) << 8) |
15            ((key.charCodeAt(++i) & 0xff) << 16) |
16            ((key.charCodeAt(++i) & 0xff) << 24);
17        ++i;
18
19        k1 = ((((k1 & 0xffff) * c1) + ((((k1 >>> 16) * c1) & 0xffff) << 16))) & 0xffffffff;
20        k1 = (k1 << 15) | (k1 >>> 17);
21        k1 = ((((k1 & 0xffff) * c2) + ((((k1 >>> 16) * c2) & 0xffff) << 16))) & 0xffffffff;
22
23        h1 ^= k1;
24        h1 = (h1 << 13) | (h1 >>> 19);
25        h1b = ((((h1 & 0xffff) * 5) + ((((h1 >>> 16) * 5) & 0xffff) << 16))) & 0xffffffff;
26        h1 = (((h1b & 0xffff) + 0x6b64) + ((((h1b >>> 16) + 0xe654) & 0xffff) << 16));
27    }
28
29    k1 = 0;
30
31    switch (remainder) {
32        case 3: k1 ^= (key.charCodeAt(i + 2) & 0xff) << 16;
33        case 2: k1 ^= (key.charCodeAt(i + 1) & 0xff) << 8;
34        case 1: k1 ^= (key.charCodeAt(i) & 0xff);
35
36            k1 = (((k1 & 0xffff) * c1) + ((((k1 >>> 16) * c1) & 0xffff) << 16)) & 0xffffffff;
37            k1 = (k1 << 15) | (k1 >>> 17);
38            k1 = (((k1 & 0xffff) * c2) + ((((k1 >>> 16) * c2) & 0xffff) << 16)) & 0xffffffff;
39            h1 ^= k1;
40    }
41
42    h1 ^= key.length;
43
44    h1 ^= h1 >>> 16;
45    h1 = (((h1 & 0xffff) * 0x85ebca6b) + ((((h1 >>> 16) * 0x85ebca6b) & 0xffff) << 16)) & 0xffffffff;
46    h1 ^= h1 >>> 13;
47    h1 = ((((h1 & 0xffff) * 0xc2b2ae35) + ((((h1 >>> 16) * 0xc2b2ae35) & 0xffff) << 16))) & 0xffffffff;
48    h1 ^= h1 >>> 16;
49
50    return h1 >>> 0;
51}