pdfjs-dist 2.0.487 → 2.1.266

package/lib/core/jpx_stream.js

@@ -2,7 +2,7 @@
  * @licstart The following is the entire license notice for the
  * Javascript code in this page
  *
- * Copyright 2017 Mozilla Foundation
+ * Copyright 2018 Mozilla Foundation
  *
  * Licensed under the Apache License, Version 2.0 (the "License");
  * you may not use this file except in compliance with the License.
@@ -19,18 +19,18 @@
  * @licend The above is the entire license notice for the
  * Javascript code in this page
  */
-'use strict';
+"use strict";
 
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.JpxStream = undefined;
+exports.JpxStream = void 0;
 
-var _stream = require('./stream');
+var _stream = require("./stream");
 
-var _jpx = require('./jpx');
+var _jpx = require("./jpx");
 
-var _util = require('../shared/util');
+var _util = require("../shared/util");
 
 var JpxStream = function JpxStreamClosure() {
   function JpxStream(stream, maybeLength, dict, params) {
@@ -38,8 +38,10 @@ var JpxStream = function JpxStreamClosure() {
     this.maybeLength = maybeLength;
     this.dict = dict;
     this.params = params;
+
     _stream.DecodeStream.call(this, maybeLength);
   }
+
   JpxStream.prototype = Object.create(_stream.DecodeStream.prototype);
   Object.defineProperty(JpxStream.prototype, 'bytes', {
     get: function JpxStream_bytes() {
@@ -47,21 +49,26 @@ var JpxStream = function JpxStreamClosure() {
     },
     configurable: true
   });
+
   JpxStream.prototype.ensureBuffer = function (requested) {};
+
   JpxStream.prototype.readBlock = function () {
     if (this.eof) {
       return;
     }
+
     var jpxImage = new _jpx.JpxImage();
     jpxImage.parse(this.bytes);
     var width = jpxImage.width;
     var height = jpxImage.height;
     var componentsCount = jpxImage.componentsCount;
     var tileCount = jpxImage.tiles.length;
+
     if (tileCount === 1) {
       this.buffer = jpxImage.tiles[0].items;
     } else {
       var data = new Uint8ClampedArray(width * height * componentsCount);
+
       for (var k = 0; k < tileCount; k++) {
         var tileComponents = jpxImage.tiles[k];
         var tileWidth = tileComponents.width;
@@ -73,6 +80,7 @@ var JpxStream = function JpxStreamClosure() {
         var dataPosition = (width * tileTop + tileLeft) * componentsCount;
         var imgRowSize = width * componentsCount;
         var tileRowSize = tileWidth * componentsCount;
+
         for (var j = 0; j < tileHeight; j++) {
           var rowBytes = src.subarray(srcPosition, srcPosition + tileRowSize);
           data.set(rowBytes, dataPosition);
@@ -80,11 +88,15 @@ var JpxStream = function JpxStreamClosure() {
           dataPosition += imgRowSize;
         }
       }
+
       this.buffer = data;
     }
+
     this.bufferLength = this.buffer.length;
     this.eof = true;
   };
+
   return JpxStream;
 }();
+
 exports.JpxStream = JpxStream;

package/lib/core/metrics.js

@@ -2,7 +2,7 @@
  * @licstart The following is the entire license notice for the
  * Javascript code in this page
  *
- * Copyright 2017 Mozilla Foundation
+ * Copyright 2018 Mozilla Foundation
  *
  * Licensed under the Apache License, Version 2.0 (the "License");
  * you may not use this file except in compliance with the License.
@@ -19,14 +19,14 @@
  * @licend The above is the entire license notice for the
  * Javascript code in this page
  */
-'use strict';
+"use strict";
 
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.getMetrics = undefined;
+exports.getMetrics = void 0;
 
-var _util = require('../shared/util');
+var _util = require("../shared/util");
 
 var getMetrics = (0, _util.getLookupTableFactory)(function (t) {
   t['Courier'] = 600;

package/lib/core/murmurhash3.js

@@ -2,7 +2,7 @@
  * @licstart The following is the entire license notice for the
  * Javascript code in this page
  *
- * Copyright 2017 Mozilla Foundation
+ * Copyright 2018 Mozilla Foundation
  *
  * Licensed under the Apache License, Version 2.0 (the "License");
  * you may not use this file except in compliance with the License.
@@ -19,32 +19,36 @@
  * @licend The above is the entire license notice for the
  * Javascript code in this page
  */
-'use strict';
+"use strict";
 
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.MurmurHash3_64 = undefined;
+exports.MurmurHash3_64 = void 0;
 
-var _util = require('../shared/util');
+var _util = require("../shared/util");
 
 var MurmurHash3_64 = function MurmurHash3_64Closure(seed) {
   var MASK_HIGH = 0xffff0000;
   var MASK_LOW = 0xffff;
+
   function MurmurHash3_64(seed) {
     var SEED = 0xc3d2e1f0;
     this.h1 = seed ? seed & 0xffffffff : SEED;
     this.h2 = seed ? seed & 0xffffffff : SEED;
   }
+
   MurmurHash3_64.prototype = {
     update: function MurmurHash3_64_update(input) {
-      var data = void 0,
-          length = void 0;
+      var data, length;
+
       if ((0, _util.isString)(input)) {
         data = new Uint8Array(input.length * 2);
         length = 0;
+
         for (var i = 0, ii = input.length; i < ii; i++) {
           var code = input.charCodeAt(i);
+
           if (code <= 0xff) {
             data[length++] = code;
           } else {
@@ -58,6 +62,7 @@ var MurmurHash3_64 = function MurmurHash3_64Closure(seed) {
       } else {
         throw new Error('Wrong data format in MurmurHash3_64_update. ' + 'Input must be a string or array.');
       }
+
       var blockCounts = length >> 2;
       var tailLength = length - blockCounts * 4;
       var dataUint32 = new Uint32Array(data.buffer, 0, blockCounts);
@@ -69,6 +74,7 @@ var MurmurHash3_64 = function MurmurHash3_64Closure(seed) {
       var C2 = 0x1b873593;
       var C1_LOW = C1 & MASK_LOW;
       var C2_LOW = C2 & MASK_LOW;
+
       for (var _i = 0; _i < blockCounts; _i++) {
         if (_i & 1) {
           k1 = dataUint32[_i];
@@ -88,23 +94,30 @@ var MurmurHash3_64 = function MurmurHash3_64Closure(seed) {
           h2 = h2 * 5 + 0xe6546b64;
         }
       }
+
       k1 = 0;
+
       switch (tailLength) {
         case 3:
           k1 ^= data[blockCounts * 4 + 2] << 16;
+
         case 2:
           k1 ^= data[blockCounts * 4 + 1] << 8;
+
         case 1:
           k1 ^= data[blockCounts * 4];
           k1 = k1 * C1 & MASK_HIGH | k1 * C1_LOW & MASK_LOW;
           k1 = k1 << 15 | k1 >>> 17;
           k1 = k1 * C2 & MASK_HIGH | k1 * C2_LOW & MASK_LOW;
+
           if (blockCounts & 1) {
             h1 ^= k1;
           } else {
             h2 ^= k1;
           }
+
       }
+
       this.h1 = h1;
       this.h2 = h2;
       return this;
@@ -119,16 +132,21 @@ var MurmurHash3_64 = function MurmurHash3_64Closure(seed) {
       h1 = h1 * 0x1a85ec53 & MASK_HIGH | h1 * 0xec53 & MASK_LOW;
       h2 = h2 * 0xc4ceb9fe & MASK_HIGH | ((h2 << 16 | h1 >>> 16) * 0xb9fe1a85 & MASK_HIGH) >>> 16;
       h1 ^= h2 >>> 1;
+
       for (var i = 0, arr = [h1, h2], str = ''; i < arr.length; i++) {
         var hex = (arr[i] >>> 0).toString(16);
+
         while (hex.length < 8) {
           hex = '0' + hex;
         }
+
         str += hex;
       }
+
       return str;
     }
   };
   return MurmurHash3_64;
 }();
+
 exports.MurmurHash3_64 = MurmurHash3_64;