react-native-murmurhash - npm Package Compare versions

Comparing version 1.0.2 to 1.1.0

index.js

@@ -1,105 +0,123 @@
-(function () {
-  var _global = this;
-  global.Buffer = global.Buffer || require("buffer").Buffer;
-  const createBuffer =
-    Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow
-      ? Buffer.from
-      : // support for Node < 5.10
-        (val) => new Buffer(val);
+global.Buffer = global.Buffer || require("buffer").Buffer;
+const createBuffer =
+  Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow
+    ? Buffer.from
+    : // support for Node < 5.10
+      (val) => new Buffer(val);
 
-  /**
-   * JS Implementation of MurmurHash2
-   *
-   * @author <a href="mailto:[e-mail]">Gary Court</a>
-   * @see http://github.com/garycourt/murmurhash-js
-   * @author <a href="mailto:[e-mail]">Austin Appleby</a>
-   * @see http://sites.google.com/site/murmurhash/
-   *
-   * @param {Buffer} str ASCII only
-   * @param {number} seed Positive integer only
-   * @return {number} 32-bit positive integer hash
-   */
-  function MurmurHashV2(str, seed) {
-    if (!Buffer.isBuffer(str)) str = createBuffer(str);
-    var l = str.length,
-      h = seed ^ l,
-      i = 0,
+/**
+ * JS Implementation of MurmurHash2
+ *
+ * @author <a href="mailto:[e-mail]">Gary Court</a>
+ * @see http://github.com/garycourt/murmurhash-js
+ * @author <a href="mailto:[e-mail]">Austin Appleby</a>
+ * @see http://sites.google.com/site/murmurhash/
+ *
+ * @param {Buffer} str ASCII only
+ * @param {number} seed Positive integer only
+ * @return {number} 32-bit positive integer hash
+ */
+function MurmurHashV2(str, seed) {
+  if (!Buffer.isBuffer(str)) str = createBuffer(str);
+  var l = str.length,
+    h = seed ^ l,
+    i = 0,
+    k;
+
+  while (l >= 4) {
+    k =
+      (str[i] & 0xff) |
+      ((str[++i] & 0xff) << 8) |
+      ((str[++i] & 0xff) << 16) |
+      ((str[++i] & 0xff) << 24);
+
+    k =
+      (k & 0xffff) * 0x5bd1e995 + ((((k >>> 16) * 0x5bd1e995) & 0xffff) << 16);
+    k ^= k >>> 24;
+    k =
+      (k & 0xffff) * 0x5bd1e995 + ((((k >>> 16) * 0x5bd1e995) & 0xffff) << 16);
+
+    h =
+      ((h & 0xffff) * 0x5bd1e995 +
+        ((((h >>> 16) * 0x5bd1e995) & 0xffff) << 16)) ^
       k;
 
-    while (l >= 4) {
-      k =
-        (str[i] & 0xff) |
-        ((str[++i] & 0xff) << 8) |
-        ((str[++i] & 0xff) << 16) |
-        ((str[++i] & 0xff) << 24);
+    l -= 4;
+    ++i;
+  }
 
-      k =
-        (k & 0xffff) * 0x5bd1e995 +
-        ((((k >>> 16) * 0x5bd1e995) & 0xffff) << 16);
-      k ^= k >>> 24;
-      k =
-        (k & 0xffff) * 0x5bd1e995 +
-        ((((k >>> 16) * 0x5bd1e995) & 0xffff) << 16);
-
+  switch (l) {
+    case 3:
+      h ^= (str[i + 2] & 0xff) << 16;
+    case 2:
+      h ^= (str[i + 1] & 0xff) << 8;
+    case 1:
+      h ^= str[i] & 0xff;
       h =
-        ((h & 0xffff) * 0x5bd1e995 +
-          ((((h >>> 16) * 0x5bd1e995) & 0xffff) << 16)) ^
-        k;
+        (h & 0xffff) * 0x5bd1e995 +
+        ((((h >>> 16) * 0x5bd1e995) & 0xffff) << 16);
+  }
 
-      l -= 4;
-      ++i;
-    }
+  h ^= h >>> 13;
+  h = (h & 0xffff) * 0x5bd1e995 + ((((h >>> 16) * 0x5bd1e995) & 0xffff) << 16);
+  h ^= h >>> 15;
 
-    switch (l) {
-      case 3:
-        h ^= (str[i + 2] & 0xff) << 16;
-      case 2:
-        h ^= (str[i + 1] & 0xff) << 8;
-      case 1:
-        h ^= str[i] & 0xff;
-        h =
-          (h & 0xffff) * 0x5bd1e995 +
-          ((((h >>> 16) * 0x5bd1e995) & 0xffff) << 16);
-    }
+  return h >>> 0;
+}
 
-    h ^= h >>> 13;
-    h =
-      (h & 0xffff) * 0x5bd1e995 + ((((h >>> 16) * 0x5bd1e995) & 0xffff) << 16);
-    h ^= h >>> 15;
+/**
+ * JS Implementation of MurmurHash3 (r136) (as of May 20, 2011)
+ *
+ * @author <a href="mailto:[e-mail]">Gary Court</a>
+ * @see http://github.com/garycourt/murmurhash-js
+ * @author <a href="mailto:[e-mail]">Austin Appleby</a>
+ * @see http://sites.google.com/site/murmurhash/
+ *
+ * @param {Buffer} key ASCII only
+ * @param {number} seed Positive integer only
+ * @return {number} 32-bit positive integer hash
+ */
+function MurmurHashV3(key, seed) {
+  if (!Buffer.isBuffer(key)) key = createBuffer(key);
 
-    return h >>> 0;
-  }
+  var remainder, bytes, h1, h1b, c1, c1b, c2, c2b, k1, i;
 
-  /**
-   * JS Implementation of MurmurHash3 (r136) (as of May 20, 2011)
-   *
-   * @author <a href="mailto:[e-mail]">Gary Court</a>
-   * @see http://github.com/garycourt/murmurhash-js
-   * @author <a href="mailto:[e-mail]">Austin Appleby</a>
-   * @see http://sites.google.com/site/murmurhash/
-   *
-   * @param {Buffer} key ASCII only
-   * @param {number} seed Positive integer only
-   * @return {number} 32-bit positive integer hash
-   */
-  function MurmurHashV3(key, seed) {
-    if (!Buffer.isBuffer(key)) key = createBuffer(key);
+  remainder = key.length & 3; // key.length % 4
+  bytes = key.length - remainder;
+  h1 = seed;
+  c1 = 0xcc9e2d51;
+  c2 = 0x1b873593;
+  i = 0;
 
-    var remainder, bytes, h1, h1b, c1, c1b, c2, c2b, k1, i;
+  while (i < bytes) {
+    k1 =
+      (key[i] & 0xff) |
+      ((key[++i] & 0xff) << 8) |
+      ((key[++i] & 0xff) << 16) |
+      ((key[++i] & 0xff) << 24);
+    ++i;
 
-    remainder = key.length & 3; // key.length % 4
-    bytes = key.length - remainder;
-    h1 = seed;
-    c1 = 0xcc9e2d51;
-    c2 = 0x1b873593;
-    i = 0;
+    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;
 
-    while (i < bytes) {
-      k1 =
-        (key[i] & 0xff) |
-        ((key[++i] & 0xff) << 8) |
-        ((key[++i] & 0xff) << 16) |
-        ((key[++i] & 0xff) << 24);
-      ++i;
+    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[i + 2] & 0xff) << 16;
+    case 2:
+      k1 ^= (key[i + 1] & 0xff) << 8;
+    case 1:
+      k1 ^= key[i] & 0xff;
+
       k1 =
@@ -112,61 +130,27 @@ ((k1 & 0xffff) * c1 + ((((k1 >>> 16) * c1) & 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;
+  h1 ^= key.length;
 
-    switch (remainder) {
-      case 3:
-        k1 ^= (key[i + 2] & 0xff) << 16;
-      case 2:
-        k1 ^= (key[i + 1] & 0xff) << 8;
-      case 1:
-        k1 ^= key[i] & 0xff;
+  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;
 
-        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;
-    }
+  return h1 >>> 0;
+}
 
-    h1 ^= key.length;
+const murmur = {
+  MurmurHashV2,
+  MurmurHashV3,
+};
 
-    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;
-  }
-
-  var murmur = MurmurHashV3;
-  murmur.v2 = MurmurHashV2;
-  murmur.v3 = MurmurHashV3;
-
-  if (typeof module != "undefined") {
-    module.exports = murmur;
-  } else {
-    var _previousRoot = _global.murmur;
-    murmur.noConflict = function () {
-      _global.murmur = _previousRoot;
-      return murmur;
-    };
-    _global.murmur = murmur;
-  }
-})();
+module.exports = murmur;

package.json

 {
   "name": "react-native-murmurhash",
-  "version": "1.0.2",
+  "version": "1.1.0",
   "description": "MurmurHash algorithms for react native apps",
@@ -5,0 +5,0 @@ "main": "index.js",

No alert changes

Worsened metrics

Total package byte prevSize

6862

-8.04%

Lines of code

133

-10.74%

No dependency changes