@pdftron/pdfnet-node 9.4.0 → 9.4.2

package/node_modules/underscore/amd/_less.js

@@ -1,10 +1,10 @@
-define(function () {
-
-  // A version of the `<` operator that can be passed around as a function.
-  function less(left, right) {
-    return left < right;
-  }
-
-  return less;
-
-});
+define(function () {
+
+  // A version of the `<` operator that can be passed around as a function.
+  function less(left, right) {
+    return left < right;
+  }
+
+  return less;
+
+});

package/node_modules/underscore/amd/_lessEqual.js

@@ -1,10 +1,10 @@
-define(function () {
-
-  // A version of the `<=` operator that can be passed around as a function.
-  function lessEqual(left, right) {
-    return left <= right;
-  }
-
-  return lessEqual;
-
-});
+define(function () {
+
+  // A version of the `<=` operator that can be passed around as a function.
+  function lessEqual(left, right) {
+    return left <= right;
+  }
+
+  return lessEqual;
+
+});

package/node_modules/underscore/amd/_linearSearch.js

@@ -1,31 +1,31 @@
-define(['./_getLength', './isFunction'], function (_getLength, isFunction) {
-
-  // Internal function for linearly iterating over arrays.
-  function linearSearch(array, predicate, dir, start) {
-    var target, length = _getLength(array);
-    dir || (dir = 1);
-    start = (
-      start == null ? (dir > 0 ? 0 : length - 1) :
-      start < 0 ? (dir > 0 ? Math.max(0, start + length) : start + length) :
-      dir > 0 ? start : Math.min(start, length - 1)
-    );
-    // As a special case, in order to elide the `predicate` invocation on every
-    // loop iteration, we allow the caller to pass a value that should be found by
-    // strict equality comparison. This is somewhat like a rudimentary iteratee
-    // shorthand. It is used in `_.indexof` and `_.lastIndexOf`.
-    if (!isFunction(predicate)) {
-      target = predicate && predicate.value;
-      predicate = false;
-    }
-    for (; start >= 0 && start < length; start += dir) {
-      if (
-        predicate ? predicate(array[start], start, array) :
-        array[start] === target
-      ) return start;
-    }
-    return -1;
-  }
-
-  return linearSearch;
-
-});
+define(['./_getLength', './isFunction'], function (_getLength, isFunction) {
+
+  // Internal function for linearly iterating over arrays.
+  function linearSearch(array, predicate, dir, start) {
+    var target, length = _getLength(array);
+    dir || (dir = 1);
+    start = (
+      start == null ? (dir > 0 ? 0 : length - 1) :
+      start < 0 ? (dir > 0 ? Math.max(0, start + length) : start + length) :
+      dir > 0 ? start : Math.min(start, length - 1)
+    );
+    // As a special case, in order to elide the `predicate` invocation on every
+    // loop iteration, we allow the caller to pass a value that should be found by
+    // strict equality comparison. This is somewhat like a rudimentary iteratee
+    // shorthand. It is used in `_.indexof` and `_.lastIndexOf`.
+    if (!isFunction(predicate)) {
+      target = predicate && predicate.value;
+      predicate = false;
+    }
+    for (; start >= 0 && start < length; start += dir) {
+      if (
+        predicate ? predicate(array[start], start, array) :
+        array[start] === target
+      ) return start;
+    }
+    return -1;
+  }
+
+  return linearSearch;
+
+});

package/node_modules/underscore/amd/_mapReduce.js

@@ -1,5 +1,5 @@
-define(function () {
-
-
-
-});
+define(function () {
+
+
+
+});

package/node_modules/underscore/amd/_methodFingerprint.js

@@ -1,44 +1,44 @@
-define(['exports', './isFunction', './_getLength', './allKeys'], function (exports, isFunction, _getLength, allKeys) {
-
-  // Since the regular `Object.prototype.toString` type tests don't work for
-  // some types in IE 11, we use a fingerprinting heuristic instead, based
-  // on the methods. It's not great, but it's the best we got.
-  // The fingerprint method lists are defined below.
-  function ie11fingerprint(methods) {
-    var length = _getLength(methods);
-    return function(obj) {
-      if (obj == null) return false;
-      // `Map`, `WeakMap` and `Set` have no enumerable keys.
-      var keys = allKeys(obj);
-      if (_getLength(keys)) return false;
-      for (var i = 0; i < length; i++) {
-        if (!isFunction(obj[methods[i]])) return false;
-      }
-      // If we are testing against `WeakMap`, we need to ensure that
-      // `obj` doesn't have a `forEach` method in order to distinguish
-      // it from a regular `Map`.
-      return methods !== weakMapMethods || !isFunction(obj[forEachName]);
-    };
-  }
-
-  // In the interest of compact minification, we write
-  // each string in the fingerprints only once.
-  var forEachName = 'forEach',
-      hasName = 'has',
-      commonInit = ['clear', 'delete'],
-      mapTail = ['get', hasName, 'set'];
-
-  // `Map`, `WeakMap` and `Set` each have slightly different
-  // combinations of the above sublists.
-  var mapMethods = commonInit.concat(forEachName, mapTail),
-      weakMapMethods = commonInit.concat(mapTail),
-      setMethods = ['add'].concat(commonInit, forEachName, hasName);
-
-  exports.ie11fingerprint = ie11fingerprint;
-  exports.mapMethods = mapMethods;
-  exports.setMethods = setMethods;
-  exports.weakMapMethods = weakMapMethods;
-
-  Object.defineProperty(exports, '__esModule', { value: true });
-
-});
+define(['exports', './isFunction', './_getLength', './allKeys'], function (exports, isFunction, _getLength, allKeys) {
+
+  // Since the regular `Object.prototype.toString` type tests don't work for
+  // some types in IE 11, we use a fingerprinting heuristic instead, based
+  // on the methods. It's not great, but it's the best we got.
+  // The fingerprint method lists are defined below.
+  function ie11fingerprint(methods) {
+    var length = _getLength(methods);
+    return function(obj) {
+      if (obj == null) return false;
+      // `Map`, `WeakMap` and `Set` have no enumerable keys.
+      var keys = allKeys(obj);
+      if (_getLength(keys)) return false;
+      for (var i = 0; i < length; i++) {
+        if (!isFunction(obj[methods[i]])) return false;
+      }
+      // If we are testing against `WeakMap`, we need to ensure that
+      // `obj` doesn't have a `forEach` method in order to distinguish
+      // it from a regular `Map`.
+      return methods !== weakMapMethods || !isFunction(obj[forEachName]);
+    };
+  }
+
+  // In the interest of compact minification, we write
+  // each string in the fingerprints only once.
+  var forEachName = 'forEach',
+      hasName = 'has',
+      commonInit = ['clear', 'delete'],
+      mapTail = ['get', hasName, 'set'];
+
+  // `Map`, `WeakMap` and `Set` each have slightly different
+  // combinations of the above sublists.
+  var mapMethods = commonInit.concat(forEachName, mapTail),
+      weakMapMethods = commonInit.concat(mapTail),
+      setMethods = ['add'].concat(commonInit, forEachName, hasName);
+
+  exports.ie11fingerprint = ie11fingerprint;
+  exports.mapMethods = mapMethods;
+  exports.setMethods = setMethods;
+  exports.weakMapMethods = weakMapMethods;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+});

package/node_modules/underscore/amd/_optimizeCb.js

@@ -1,27 +1,27 @@
-define(function () {
-
-  // Internal function that returns an efficient (for current engines) version
-  // of the passed-in callback, to be repeatedly applied in other Underscore
-  // functions.
-  function optimizeCb(func, context, argCount) {
-    if (context === void 0) return func;
-    switch (argCount == null ? 3 : argCount) {
-      case 1: return function(value) {
-        return func.call(context, value);
-      };
-      // The 2-argument case is omitted because we’re not using it.
-      case 3: return function(value, index, collection) {
-        return func.call(context, value, index, collection);
-      };
-      case 4: return function(accumulator, value, index, collection) {
-        return func.call(context, accumulator, value, index, collection);
-      };
-    }
-    return function() {
-      return func.apply(context, arguments);
-    };
-  }
-
-  return optimizeCb;
-
-});
+define(function () {
+
+  // Internal function that returns an efficient (for current engines) version
+  // of the passed-in callback, to be repeatedly applied in other Underscore
+  // functions.
+  function optimizeCb(func, context, argCount) {
+    if (context === void 0) return func;
+    switch (argCount == null ? 3 : argCount) {
+      case 1: return function(value) {
+        return func.call(context, value);
+      };
+      // The 2-argument case is omitted because we’re not using it.
+      case 3: return function(value, index, collection) {
+        return func.call(context, value, index, collection);
+      };
+      case 4: return function(accumulator, value, index, collection) {
+        return func.call(context, accumulator, value, index, collection);
+      };
+    }
+    return function() {
+      return func.apply(context, arguments);
+    };
+  }
+
+  return optimizeCb;
+
+});

package/node_modules/underscore/amd/_push.js

@@ -1,7 +1,7 @@
-define(['./_setup', './_unmethodize'], function (_setup, _unmethodize) {
-
-	var push = _unmethodize(_setup.ArrayProto.push);
-
-	return push;
-
-});
+define(['./_setup', './_unmethodize'], function (_setup, _unmethodize) {
+
+	var push = _unmethodize(_setup.ArrayProto.push);
+
+	return push;
+
+});

package/node_modules/underscore/amd/_pusher.js

@@ -1,13 +1,13 @@
-define(function () {
-
-  // Internal helper to generate a callback that will append
-  // its first argument to the closed-over `array`.
-  function pusher(array) {
-    return function(arg) {
-      array.push(arg);
-    };
-  }
-
-  return pusher;
-
-});
+define(function () {
+
+  // Internal helper to generate a callback that will append
+  // its first argument to the closed-over `array`.
+  function pusher(array) {
+    return function(arg) {
+      array.push(arg);
+    };
+  }
+
+  return pusher;
+
+});

package/node_modules/underscore/amd/_sequence.js

@@ -1,18 +1,18 @@
-define(function () {
-
-  function sequence(iteratee, start, stop, step) {
-    if (stop == null) {
-      stop = start || 0;
-      start = 0;
-    }
-    if (!step) {
-      step = stop < start ? -1 : 1;
-    }
-    var rest = (stop - start) % step;
-    stop += (rest && step - rest);
-    for ( ; start != stop ; start += step) if (iteratee(start)) return start;
-  }
-
-  return sequence;
-
-});
+define(function () {
+
+  function sequence(iteratee, start, stop, step) {
+    if (stop == null) {
+      stop = start || 0;
+      start = 0;
+    }
+    if (!step) {
+      step = stop < start ? -1 : 1;
+    }
+    var rest = (stop - start) % step;
+    stop += (rest && step - rest);
+    for ( ; start != stop ; start += step) if (iteratee(start)) return start;
+  }
+
+  return sequence;
+
+});

package/node_modules/underscore/amd/_setup.js

@@ -1,70 +1,70 @@
-define(['exports'], function (exports) {
-
-  // Current version.
-  var VERSION = '1.12.1';
-
-  // Establish the root object, `window` (`self`) in the browser, `global`
-  // on the server, or `this` in some virtual machines. We use `self`
-  // instead of `window` for `WebWorker` support.
-  var root = typeof self == 'object' && self.self === self && self ||
-            typeof global == 'object' && global.global === global && global ||
-            Function('return this')() ||
-            {};
-
-  // Save bytes in the minified (but not gzipped) version:
-  var ArrayProto = Array.prototype, ObjProto = Object.prototype;
-  var SymbolProto = typeof Symbol !== 'undefined' ? Symbol.prototype : null;
-
-  // Create quick reference variables for speed access to core prototypes.
-  var push = ArrayProto.push,
-      slice = ArrayProto.slice,
-      toString = ObjProto.toString,
-      hasOwnProperty = ObjProto.hasOwnProperty;
-
-  // Modern feature detection.
-  var supportsArrayBuffer = typeof ArrayBuffer !== 'undefined',
-      supportsDataView = typeof DataView !== 'undefined';
-
-  // All **ECMAScript 5+** native function implementations that we hope to use
-  // are declared here.
-  var nativeIsArray = Array.isArray,
-      nativeKeys = Object.keys,
-      nativeCreate = Object.create,
-      nativeIsView = supportsArrayBuffer && ArrayBuffer.isView;
-
-  // Create references to these builtin functions because we override them.
-  var _isNaN = isNaN,
-      _isFinite = isFinite;
-
-  // Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.
-  var hasEnumBug = !{toString: null}.propertyIsEnumerable('toString');
-  var nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString',
-    'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];
-
-  // The largest integer that can be represented exactly.
-  var MAX_ARRAY_INDEX = Math.pow(2, 53) - 1;
-
-  exports.ArrayProto = ArrayProto;
-  exports.MAX_ARRAY_INDEX = MAX_ARRAY_INDEX;
-  exports.ObjProto = ObjProto;
-  exports.SymbolProto = SymbolProto;
-  exports.VERSION = VERSION;
-  exports._isFinite = _isFinite;
-  exports._isNaN = _isNaN;
-  exports.hasEnumBug = hasEnumBug;
-  exports.hasOwnProperty = hasOwnProperty;
-  exports.nativeCreate = nativeCreate;
-  exports.nativeIsArray = nativeIsArray;
-  exports.nativeIsView = nativeIsView;
-  exports.nativeKeys = nativeKeys;
-  exports.nonEnumerableProps = nonEnumerableProps;
-  exports.push = push;
-  exports.root = root;
-  exports.slice = slice;
-  exports.supportsArrayBuffer = supportsArrayBuffer;
-  exports.supportsDataView = supportsDataView;
-  exports.toString = toString;
-
-  Object.defineProperty(exports, '__esModule', { value: true });
-
-});
+define(['exports'], function (exports) {
+
+  // Current version.
+  var VERSION = '1.12.1';
+
+  // Establish the root object, `window` (`self`) in the browser, `global`
+  // on the server, or `this` in some virtual machines. We use `self`
+  // instead of `window` for `WebWorker` support.
+  var root = typeof self == 'object' && self.self === self && self ||
+            typeof global == 'object' && global.global === global && global ||
+            Function('return this')() ||
+            {};
+
+  // Save bytes in the minified (but not gzipped) version:
+  var ArrayProto = Array.prototype, ObjProto = Object.prototype;
+  var SymbolProto = typeof Symbol !== 'undefined' ? Symbol.prototype : null;
+
+  // Create quick reference variables for speed access to core prototypes.
+  var push = ArrayProto.push,
+      slice = ArrayProto.slice,
+      toString = ObjProto.toString,
+      hasOwnProperty = ObjProto.hasOwnProperty;
+
+  // Modern feature detection.
+  var supportsArrayBuffer = typeof ArrayBuffer !== 'undefined',
+      supportsDataView = typeof DataView !== 'undefined';
+
+  // All **ECMAScript 5+** native function implementations that we hope to use
+  // are declared here.
+  var nativeIsArray = Array.isArray,
+      nativeKeys = Object.keys,
+      nativeCreate = Object.create,
+      nativeIsView = supportsArrayBuffer && ArrayBuffer.isView;
+
+  // Create references to these builtin functions because we override them.
+  var _isNaN = isNaN,
+      _isFinite = isFinite;
+
+  // Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.
+  var hasEnumBug = !{toString: null}.propertyIsEnumerable('toString');
+  var nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString',
+    'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];
+
+  // The largest integer that can be represented exactly.
+  var MAX_ARRAY_INDEX = Math.pow(2, 53) - 1;
+
+  exports.ArrayProto = ArrayProto;
+  exports.MAX_ARRAY_INDEX = MAX_ARRAY_INDEX;
+  exports.ObjProto = ObjProto;
+  exports.SymbolProto = SymbolProto;
+  exports.VERSION = VERSION;
+  exports._isFinite = _isFinite;
+  exports._isNaN = _isNaN;
+  exports.hasEnumBug = hasEnumBug;
+  exports.hasOwnProperty = hasOwnProperty;
+  exports.nativeCreate = nativeCreate;
+  exports.nativeIsArray = nativeIsArray;
+  exports.nativeIsView = nativeIsView;
+  exports.nativeKeys = nativeKeys;
+  exports.nonEnumerableProps = nonEnumerableProps;
+  exports.push = push;
+  exports.root = root;
+  exports.slice = slice;
+  exports.supportsArrayBuffer = supportsArrayBuffer;
+  exports.supportsDataView = supportsDataView;
+  exports.toString = toString;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+});

package/node_modules/underscore/amd/_shallowProperty.js

@@ -1,12 +1,12 @@
-define(function () {
-
-  // Internal helper to generate a function to obtain property `key` from `obj`.
-  function shallowProperty(key) {
-    return function(obj) {
-      return obj == null ? void 0 : obj[key];
-    };
-  }
-
-  return shallowProperty;
-
-});
+define(function () {
+
+  // Internal helper to generate a function to obtain property `key` from `obj`.
+  function shallowProperty(key) {
+    return function(obj) {
+      return obj == null ? void 0 : obj[key];
+    };
+  }
+
+  return shallowProperty;
+
+});

package/node_modules/underscore/amd/_slice.js

@@ -1,7 +1,7 @@
-define(['./_setup', './_unmethodize'], function (_setup, _unmethodize) {
-
-	var slice = _unmethodize(_setup.ArrayProto.slice);
-
-	return slice;
-
-});
+define(['./_setup', './_unmethodize'], function (_setup, _unmethodize) {
+
+	var slice = _unmethodize(_setup.ArrayProto.slice);
+
+	return slice;
+
+});

package/node_modules/underscore/amd/_strictEqual.js

@@ -1,9 +1,9 @@
-define(function () {
-
-  function strictEqual(left, right) {
-    return left === right;
-  }
-
-  return strictEqual;
-
-});
+define(function () {
+
+  function strictEqual(left, right) {
+    return left === right;
+  }
+
+  return strictEqual;
+
+});

package/node_modules/underscore/amd/_stringTagBug.js

@@ -1,16 +1,16 @@
-define(['exports', './_setup', './_hasObjectTag'], function (exports, _setup, _hasObjectTag) {
-
-    // In IE 10 - Edge 13, `DataView` has string tag `'[object Object]'`.
-    // In IE 11, the most common among them, this problem also applies to
-    // `Map`, `WeakMap` and `Set`.
-    var hasStringTagBug = (
-          _setup.supportsDataView && _hasObjectTag(new DataView(new ArrayBuffer(8)))
-        ),
-        isIE11 = (typeof Map !== 'undefined' && _hasObjectTag(new Map));
-
-    exports.hasStringTagBug = hasStringTagBug;
-    exports.isIE11 = isIE11;
-
-    Object.defineProperty(exports, '__esModule', { value: true });
-
-});
+define(['exports', './_setup', './_hasObjectTag'], function (exports, _setup, _hasObjectTag) {
+
+    // In IE 10 - Edge 13, `DataView` has string tag `'[object Object]'`.
+    // In IE 11, the most common among them, this problem also applies to
+    // `Map`, `WeakMap` and `Set`.
+    var hasStringTagBug = (
+          _setup.supportsDataView && _hasObjectTag(new DataView(new ArrayBuffer(8)))
+        ),
+        isIE11 = (typeof Map !== 'undefined' && _hasObjectTag(new Map));
+
+    exports.hasStringTagBug = hasStringTagBug;
+    exports.isIE11 = isIE11;
+
+    Object.defineProperty(exports, '__esModule', { value: true });
+
+});

package/node_modules/underscore/amd/_tagTester.js

@@ -1,13 +1,13 @@
-define(['./_setup'], function (_setup) {
-
-  // Internal function for creating a `toString`-based type tester.
-  function tagTester(name) {
-    var tag = '[object ' + name + ']';
-    return function(obj) {
-      return _setup.toString.call(obj) === tag;
-    };
-  }
-
-  return tagTester;
-
-});
+define(['./_setup'], function (_setup) {
+
+  // Internal function for creating a `toString`-based type tester.
+  function tagTester(name) {
+    var tag = '[object ' + name + ']';
+    return function(obj) {
+      return _setup.toString.call(obj) === tag;
+    };
+  }
+
+  return tagTester;
+
+});

package/node_modules/underscore/amd/_toBufferView.js

@@ -1,15 +1,15 @@
-define(['./_getByteLength'], function (_getByteLength) {
-
-  // Internal function to wrap or shallow-copy an ArrayBuffer,
-  // typed array or DataView to a new view, reusing the buffer.
-  function toBufferView(bufferSource) {
-    return new Uint8Array(
-      bufferSource.buffer || bufferSource,
-      bufferSource.byteOffset || 0,
-      _getByteLength(bufferSource)
-    );
-  }
-
-  return toBufferView;
-
-});
+define(['./_getByteLength'], function (_getByteLength) {
+
+  // Internal function to wrap or shallow-copy an ArrayBuffer,
+  // typed array or DataView to a new view, reusing the buffer.
+  function toBufferView(bufferSource) {
+    return new Uint8Array(
+      bufferSource.buffer || bufferSource,
+      bufferSource.byteOffset || 0,
+      _getByteLength(bufferSource)
+    );
+  }
+
+  return toBufferView;
+
+});