crc32.js 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145
  1. /* eslint-disable no-bitwise */
  2. var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
  3. function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
  4. return new (P || (P = Promise))(function (resolve, reject) {
  5. function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
  6. function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
  7. function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
  8. step((generator = generator.apply(thisArg, _arguments || [])).next());
  9. });
  10. };
  11. var __generator = (this && this.__generator) || function (thisArg, body) {
  12. var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
  13. return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
  14. function verb(n) { return function (v) { return step([n, v]); }; }
  15. function step(op) {
  16. if (f) throw new TypeError("Generator is already executing.");
  17. while (_) try {
  18. if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
  19. if (y = 0, t) op = [op[0] & 2, t.value];
  20. switch (op[0]) {
  21. case 0: case 1: t = op; break;
  22. case 4: _.label++; return { value: op[1], done: false };
  23. case 5: _.label++; y = op[1]; op = [0]; continue;
  24. case 7: op = _.ops.pop(); _.trys.pop(); continue;
  25. default:
  26. if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
  27. if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
  28. if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
  29. if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
  30. if (t[2]) _.ops.pop();
  31. _.trys.pop(); continue;
  32. }
  33. op = body.call(thisArg, _);
  34. } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
  35. if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
  36. }
  37. };
  38. import { MB } from './helper';
  39. /**
  40. * 以下 class 实现参考
  41. * https://github.com/Stuk/jszip/blob/d4702a70834bd953d4c2d0bc155fad795076631a/lib/crc32.js
  42. * 该实现主要针对大文件优化、对计算的值进行了 `>>> 0` 运算(为与服务端保持一致)
  43. */
  44. var CRC32 = /** @class */ (function () {
  45. function CRC32() {
  46. this.crc = -1;
  47. this.table = this.makeTable();
  48. }
  49. CRC32.prototype.makeTable = function () {
  50. var table = new Array();
  51. for (var i = 0; i < 256; i++) {
  52. var t = i;
  53. for (var j = 0; j < 8; j++) {
  54. if (t & 1) {
  55. // IEEE 标准
  56. t = (t >>> 1) ^ 0xEDB88320;
  57. }
  58. else {
  59. t >>>= 1;
  60. }
  61. }
  62. table[i] = t;
  63. }
  64. return table;
  65. };
  66. CRC32.prototype.append = function (data) {
  67. var crc = this.crc;
  68. for (var offset = 0; offset < data.byteLength; offset++) {
  69. crc = (crc >>> 8) ^ this.table[(crc ^ data[offset]) & 0xFF];
  70. }
  71. this.crc = crc;
  72. };
  73. CRC32.prototype.compute = function () {
  74. return (this.crc ^ -1) >>> 0;
  75. };
  76. CRC32.prototype.readAsUint8Array = function (file) {
  77. return __awaiter(this, void 0, void 0, function () {
  78. var _a;
  79. return __generator(this, function (_b) {
  80. switch (_b.label) {
  81. case 0:
  82. if (!(typeof file.arrayBuffer === 'function')) return [3 /*break*/, 2];
  83. _a = Uint8Array.bind;
  84. return [4 /*yield*/, file.arrayBuffer()];
  85. case 1: return [2 /*return*/, new (_a.apply(Uint8Array, [void 0, _b.sent()]))()];
  86. case 2: return [2 /*return*/, new Promise(function (resolve, reject) {
  87. var reader = new FileReader();
  88. reader.onload = function () {
  89. if (reader.result == null) {
  90. reject();
  91. return;
  92. }
  93. if (typeof reader.result === 'string') {
  94. reject();
  95. return;
  96. }
  97. resolve(new Uint8Array(reader.result));
  98. };
  99. reader.readAsArrayBuffer(file);
  100. })];
  101. }
  102. });
  103. });
  104. };
  105. CRC32.prototype.file = function (file) {
  106. return __awaiter(this, void 0, void 0, function () {
  107. var _a, count, index, start, end, chuck;
  108. return __generator(this, function (_b) {
  109. switch (_b.label) {
  110. case 0:
  111. if (!(file.size <= MB)) return [3 /*break*/, 2];
  112. _a = this.append;
  113. return [4 /*yield*/, this.readAsUint8Array(file)];
  114. case 1:
  115. _a.apply(this, [_b.sent()]);
  116. return [2 /*return*/, this.compute()];
  117. case 2:
  118. count = Math.ceil(file.size / MB);
  119. index = 0;
  120. _b.label = 3;
  121. case 3:
  122. if (!(index < count)) return [3 /*break*/, 6];
  123. start = index * MB;
  124. end = index === (count - 1) ? file.size : start + MB;
  125. return [4 /*yield*/, this.readAsUint8Array(file.slice(start, end))];
  126. case 4:
  127. chuck = _b.sent();
  128. this.append(new Uint8Array(chuck));
  129. _b.label = 5;
  130. case 5:
  131. index++;
  132. return [3 /*break*/, 3];
  133. case 6: return [2 /*return*/, this.compute()];
  134. }
  135. });
  136. });
  137. };
  138. CRC32.file = function (file) {
  139. var crc = new CRC32();
  140. return crc.file(file);
  141. };
  142. return CRC32;
  143. }());
  144. export { CRC32 };
  145. //# sourceMappingURL=crc32.js.map