src/graphinate/server/web/static/js/murmurhash3_gc.js - Code Metrics - Inspection of "update formating + refactoring + misc improvements..." - erivlis/graphinate - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Push — main ( b7a647...25fd53 )

by Eran

created 2025-01-27 12:37 UTC

src/graphinate/server/web/static/js/murmurhash3_gc.js A

↳ Parent: Project

Complexity

Total Complexity	3
Complexity/F	3

Size

Lines of Code	51
Function Count	1

Duplication

Duplicated Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
eloc	38
dl	0
loc	51
rs	10
c	0
b	0
f	0
wmc	3
mnd	2
bc	2
fnc	1
bpm	2
cpm	3
noi	4

/**
 * JS Implementation of MurmurHash3 (r136) (as of May 20, 2011)
 * 
 * @author <a href="mailto:[email protected]">Gary Court</a>
 * @see http://github.com/garycourt/murmurhash-js
 * @author <a href="mailto:[email protected]">Austin Appleby</a>
 * @see http://sites.google.com/site/murmurhash/
 * 
 * @param {string} key ASCII only
 * @param {number} seed Positive integer only
 * @return {number} 32-bit positive integer hash 
 */

function murmurhash3_32_gc(key, seed) {
	var remainder, bytes, h1, h1b, c1, c1b, c2, c2b, k1, i;

	
	remainder = key.length & 3; // key.length % 4
	bytes = key.length - remainder;
	h1 = seed;
	c1 = 0xcc9e2d51;
	c2 = 0x1b873593;
	i = 0;
	
	while (i < bytes) {
	  	k1 = 
	  	  ((key.charCodeAt(i) & 0xff)) |
	  	  ((key.charCodeAt(++i) & 0xff) << 8) |
	  	  ((key.charCodeAt(++i) & 0xff) << 16) |
	  	  ((key.charCodeAt(++i) & 0xff) << 24);
		++i;
		
		k1 = ((((k1 & 0xffff) * c1) + ((((k1 >>> 16) * c1) & 0xffff) << 16))) & 0xffffffff;
		k1 = (k1 << 15) | (k1 >>> 17);
		k1 = ((((k1 & 0xffff) * c2) + ((((k1 >>> 16) * c2) & 0xffff) << 16))) & 0xffffffff;

		h1 ^= k1;
        h1 = (h1 << 13) | (h1 >>> 19);
		h1b = ((((h1 & 0xffff) * 5) + ((((h1 >>> 16) * 5) & 0xffff) << 16))) & 0xffffffff;
		h1 = (((h1b & 0xffff) + 0x6b64) + ((((h1b >>> 16) + 0xe654) & 0xffff) << 16));
	}
	
	k1 = 0;
	
	switch (remainder) {
		case 3: k1 ^= (key.charCodeAt(i + 2) & 0xff) << 16;

		case 2: k1 ^= (key.charCodeAt(i + 1) & 0xff) << 8;

		case 1: k1 ^= (key.charCodeAt(i) & 0xff);
		
		k1 = (((k1 & 0xffff) * c1) + ((((k1 >>> 16) * c1) & 0xffff) << 16)) & 0xffffffff;
		k1 = (k1 << 15) | (k1 >>> 17);
		k1 = (((k1 & 0xffff) * c2) + ((((k1 >>> 16) * c2) & 0xffff) << 16)) & 0xffffffff;
		h1 ^= k1;
	}
	
	h1 ^= key.length;

	h1 ^= h1 >>> 16;
	h1 = (((h1 & 0xffff) * 0x85ebca6b) + ((((h1 >>> 16) * 0x85ebca6b) & 0xffff) << 16)) & 0xffffffff;
	h1 ^= h1 >>> 13;
	h1 = ((((h1 & 0xffff) * 0xc2b2ae35) + ((((h1 >>> 16) * 0xc2b2ae35) & 0xffff) << 16))) & 0xffffffff;
	h1 ^= h1 >>> 16;

	return h1 >>> 0;
}

1			/**
2			* JS Implementation of MurmurHash3 (r136) (as of May 20, 2011)
3			*
4			* @author <a href="mailto:[email protected]">Gary Court</a>
5			* @see http://github.com/garycourt/murmurhash-js
6			* @author <a href="mailto:[email protected]">Austin Appleby</a>
7			* @see http://sites.google.com/site/murmurhash/
8			*
9			* @param {string} key ASCII only
10			* @param {number} seed Positive integer only
11			* @return {number} 32-bit positive integer hash
12			*/
13
14			function murmurhash3_32_gc(key, seed) {
15			var remainder, bytes, h1, h1b, c1, c1b, c2, c2b, k1, i;
			0 ignored issues – show Unused Code introduced 2025-01-27 12:40 UTC by Report Bug Copy Issue Report The variable `c2b` seems to be never used. Consider removing it. Loading history... Unused Code introduced 2025-01-27 12:40 UTC by Report Bug Copy Issue Report The variable `c1b` seems to be never used. Consider removing it. Loading history...
16
17			remainder = key.length & 3; // key.length % 4
18			bytes = key.length - remainder;
19			h1 = seed;
20			c1 = 0xcc9e2d51;
21			c2 = 0x1b873593;
22			i = 0;
23
24			while (i < bytes) {
25			k1 =
26			((key.charCodeAt(i) & 0xff)) \|
27			((key.charCodeAt(++i) & 0xff) << 8) \|
28			((key.charCodeAt(++i) & 0xff) << 16) \|
29			((key.charCodeAt(++i) & 0xff) << 24);
30			++i;
31
32			k1 = ((((k1 & 0xffff) * c1) + ((((k1 >>> 16) * c1) & 0xffff) << 16))) & 0xffffffff;
33			k1 = (k1 << 15) \| (k1 >>> 17);
34			k1 = ((((k1 & 0xffff) * c2) + ((((k1 >>> 16) * c2) & 0xffff) << 16))) & 0xffffffff;
35
36			h1 ^= k1;
37			h1 = (h1 << 13) \| (h1 >>> 19);
38			h1b = ((((h1 & 0xffff) * 5) + ((((h1 >>> 16) * 5) & 0xffff) << 16))) & 0xffffffff;
39			h1 = (((h1b & 0xffff) + 0x6b64) + ((((h1b >>> 16) + 0xe654) & 0xffff) << 16));
40			}
41
42			k1 = 0;
43
44			switch (remainder) {
45			case 3: k1 ^= (key.charCodeAt(i + 2) & 0xff) << 16;
			0 ignored issues – show introduced 2025-01-27 12:40 UTC by Report Bug Copy Issue Report This node falls through to the next case due to this statement. Please add a comment either directly below this line or between the cases to explain. Loading history...
46			case 2: k1 ^= (key.charCodeAt(i + 1) & 0xff) << 8;
			0 ignored issues – show introduced 2025-01-27 12:40 UTC by Report Bug Copy Issue Report This node falls through to the next case due to this statement. Please add a comment either directly below this line or between the cases to explain. Loading history...
47			case 1: k1 ^= (key.charCodeAt(i) & 0xff);
48
49			k1 = (((k1 & 0xffff) * c1) + ((((k1 >>> 16) * c1) & 0xffff) << 16)) & 0xffffffff;
50			k1 = (k1 << 15) \| (k1 >>> 17);
51			k1 = (((k1 & 0xffff) * c2) + ((((k1 >>> 16) * c2) & 0xffff) << 16)) & 0xffffffff;
52			h1 ^= k1;
53			}
54
55			h1 ^= key.length;
56
57			h1 ^= h1 >>> 16;
58			h1 = (((h1 & 0xffff) * 0x85ebca6b) + ((((h1 >>> 16) * 0x85ebca6b) & 0xffff) << 16)) & 0xffffffff;
59			h1 ^= h1 >>> 13;
60			h1 = ((((h1 & 0xffff) * 0xc2b2ae35) + ((((h1 >>> 16) * 0xc2b2ae35) & 0xffff) << 16))) & 0xffffffff;
61			h1 ^= h1 >>> 16;
62
63			return h1 >>> 0;
64			}

erivlis / graphinate

Push — main ( b7a647...25fd53 )

src/graphinate/server/web/static/js/murmurhash3_gc.js A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like