2
0

murmurhash3.js 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120
  1. /* Copyright 2017 Mozilla Foundation
  2. *
  3. * Licensed under the Apache License, Version 2.0 (the "License");
  4. * you may not use this file except in compliance with the License.
  5. * You may obtain a copy of the License at
  6. *
  7. * http://www.apache.org/licenses/LICENSE-2.0
  8. *
  9. * Unless required by applicable law or agreed to in writing, software
  10. * distributed under the License is distributed on an "AS IS" BASIS,
  11. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. * See the License for the specific language governing permissions and
  13. * limitations under the License.
  14. */
  15. 'use strict';
  16. var sharedUtil = require('../shared/util.js');
  17. var MurmurHash3_64 = function MurmurHash3_64Closure(seed) {
  18. var MASK_HIGH = 0xffff0000;
  19. var MASK_LOW = 0xffff;
  20. function MurmurHash3_64(seed) {
  21. var SEED = 0xc3d2e1f0;
  22. this.h1 = seed ? seed & 0xffffffff : SEED;
  23. this.h2 = seed ? seed & 0xffffffff : SEED;
  24. }
  25. MurmurHash3_64.prototype = {
  26. update: function MurmurHash3_64_update(input) {
  27. var i;
  28. if (typeof input === 'string') {
  29. var data = new Uint8Array(input.length * 2);
  30. var length = 0;
  31. for (i = 0; i < input.length; i++) {
  32. var code = input.charCodeAt(i);
  33. if (code <= 0xff) {
  34. data[length++] = code;
  35. } else {
  36. data[length++] = code >>> 8;
  37. data[length++] = code & 0xff;
  38. }
  39. }
  40. } else if (typeof input === 'object' && 'byteLength' in input) {
  41. data = input;
  42. length = data.byteLength;
  43. } else {
  44. throw new Error('Wrong data format in MurmurHash3_64_update. ' + 'Input must be a string or array.');
  45. }
  46. var blockCounts = length >> 2;
  47. var tailLength = length - blockCounts * 4;
  48. var dataUint32 = new Uint32Array(data.buffer, 0, blockCounts);
  49. var k1 = 0;
  50. var k2 = 0;
  51. var h1 = this.h1;
  52. var h2 = this.h2;
  53. var C1 = 0xcc9e2d51;
  54. var C2 = 0x1b873593;
  55. var C1_LOW = C1 & MASK_LOW;
  56. var C2_LOW = C2 & MASK_LOW;
  57. for (i = 0; i < blockCounts; i++) {
  58. if (i & 1) {
  59. k1 = dataUint32[i];
  60. k1 = k1 * C1 & MASK_HIGH | k1 * C1_LOW & MASK_LOW;
  61. k1 = k1 << 15 | k1 >>> 17;
  62. k1 = k1 * C2 & MASK_HIGH | k1 * C2_LOW & MASK_LOW;
  63. h1 ^= k1;
  64. h1 = h1 << 13 | h1 >>> 19;
  65. h1 = h1 * 5 + 0xe6546b64;
  66. } else {
  67. k2 = dataUint32[i];
  68. k2 = k2 * C1 & MASK_HIGH | k2 * C1_LOW & MASK_LOW;
  69. k2 = k2 << 15 | k2 >>> 17;
  70. k2 = k2 * C2 & MASK_HIGH | k2 * C2_LOW & MASK_LOW;
  71. h2 ^= k2;
  72. h2 = h2 << 13 | h2 >>> 19;
  73. h2 = h2 * 5 + 0xe6546b64;
  74. }
  75. }
  76. k1 = 0;
  77. switch (tailLength) {
  78. case 3:
  79. k1 ^= data[blockCounts * 4 + 2] << 16;
  80. case 2:
  81. k1 ^= data[blockCounts * 4 + 1] << 8;
  82. case 1:
  83. k1 ^= data[blockCounts * 4];
  84. k1 = k1 * C1 & MASK_HIGH | k1 * C1_LOW & MASK_LOW;
  85. k1 = k1 << 15 | k1 >>> 17;
  86. k1 = k1 * C2 & MASK_HIGH | k1 * C2_LOW & MASK_LOW;
  87. if (blockCounts & 1) {
  88. h1 ^= k1;
  89. } else {
  90. h2 ^= k1;
  91. }
  92. }
  93. this.h1 = h1;
  94. this.h2 = h2;
  95. return this;
  96. },
  97. hexdigest: function MurmurHash3_64_hexdigest() {
  98. var h1 = this.h1;
  99. var h2 = this.h2;
  100. h1 ^= h2 >>> 1;
  101. h1 = h1 * 0xed558ccd & MASK_HIGH | h1 * 0x8ccd & MASK_LOW;
  102. h2 = h2 * 0xff51afd7 & MASK_HIGH | ((h2 << 16 | h1 >>> 16) * 0xafd7ed55 & MASK_HIGH) >>> 16;
  103. h1 ^= h2 >>> 1;
  104. h1 = h1 * 0x1a85ec53 & MASK_HIGH | h1 * 0xec53 & MASK_LOW;
  105. h2 = h2 * 0xc4ceb9fe & MASK_HIGH | ((h2 << 16 | h1 >>> 16) * 0xb9fe1a85 & MASK_HIGH) >>> 16;
  106. h1 ^= h2 >>> 1;
  107. for (var i = 0, arr = [h1, h2], str = ''; i < arr.length; i++) {
  108. var hex = (arr[i] >>> 0).toString(16);
  109. while (hex.length < 8) {
  110. hex = '0' + hex;
  111. }
  112. str += hex;
  113. }
  114. return str;
  115. }
  116. };
  117. return MurmurHash3_64;
  118. }();
  119. exports.MurmurHash3_64 = MurmurHash3_64;