@pdftron/pdfnet-node 9.4.2 → 9.5.0

package/node_modules/underscore/LICENSE

@@ -1,23 +1,23 @@
-Copyright (c) 2009-2020 Jeremy Ashkenas, DocumentCloud and Investigative
-Reporters & Editors
-
-Permission is hereby granted, free of charge, to any person
-obtaining a copy of this software and associated documentation
-files (the "Software"), to deal in the Software without
-restriction, including without limitation the rights to use,
-copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the
-Software is furnished to do so, subject to the following
-conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
-OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
-HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
-WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
-OTHER DEALINGS IN THE SOFTWARE.
+Copyright (c) 2009-2020 Jeremy Ashkenas, DocumentCloud and Investigative
+Reporters & Editors
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.

package/node_modules/underscore/README.md

@@ -1,28 +1,28 @@
-                       __
-                      /\ \                                                         __
-     __  __    ___    \_\ \     __   _ __   ____    ___    ___   _ __    __       /\_\    ____
-    /\ \/\ \ /' _ `\  /'_  \  /'__`\/\  __\/ ,__\  / ___\ / __`\/\  __\/'__`\     \/\ \  /',__\
-    \ \ \_\ \/\ \/\ \/\ \ \ \/\  __/\ \ \//\__, `\/\ \__//\ \ \ \ \ \//\  __/  __  \ \ \/\__, `\
-     \ \____/\ \_\ \_\ \___,_\ \____\\ \_\\/\____/\ \____\ \____/\ \_\\ \____\/\_\ _\ \ \/\____/
-      \/___/  \/_/\/_/\/__,_ /\/____/ \/_/ \/___/  \/____/\/___/  \/_/ \/____/\/_//\ \_\ \/___/
-                                                                                  \ \____/
-                                                                                   \/___/
-
-Underscore.js is a utility-belt library for JavaScript that provides
-support for the usual functional suspects (each, map, reduce, filter...)
-without extending any core JavaScript objects.
-
-For Docs, License, Tests, and pre-packed downloads, see:
-https://underscorejs.org
-
-For support and questions, please use
-[the gitter channel](https://gitter.im/jashkenas/underscore)
-or [stackoverflow](https://stackoverflow.com/search?q=underscore.js)
-
-Underscore is an open-sourced component of DocumentCloud:
-https://github.com/documentcloud
-
-Many thanks to our contributors:
-https://github.com/jashkenas/underscore/contributors
-
-This project adheres to a [code of conduct](CODE_OF_CONDUCT.md). By participating, you are expected to uphold this code.
+                       __
+                      /\ \                                                         __
+     __  __    ___    \_\ \     __   _ __   ____    ___    ___   _ __    __       /\_\    ____
+    /\ \/\ \ /' _ `\  /'_  \  /'__`\/\  __\/ ,__\  / ___\ / __`\/\  __\/'__`\     \/\ \  /',__\
+    \ \ \_\ \/\ \/\ \/\ \ \ \/\  __/\ \ \//\__, `\/\ \__//\ \ \ \ \ \//\  __/  __  \ \ \/\__, `\
+     \ \____/\ \_\ \_\ \___,_\ \____\\ \_\\/\____/\ \____\ \____/\ \_\\ \____\/\_\ _\ \ \/\____/
+      \/___/  \/_/\/_/\/__,_ /\/____/ \/_/ \/___/  \/____/\/___/  \/_/ \/____/\/_//\ \_\ \/___/
+                                                                                  \ \____/
+                                                                                   \/___/
+
+Underscore.js is a utility-belt library for JavaScript that provides
+support for the usual functional suspects (each, map, reduce, filter...)
+without extending any core JavaScript objects.
+
+For Docs, License, Tests, and pre-packed downloads, see:
+https://underscorejs.org
+
+For support and questions, please use
+[the gitter channel](https://gitter.im/jashkenas/underscore)
+or [stackoverflow](https://stackoverflow.com/search?q=underscore.js)
+
+Underscore is an open-sourced component of DocumentCloud:
+https://github.com/documentcloud
+
+Many thanks to our contributors:
+https://github.com/jashkenas/underscore/contributors
+
+This project adheres to a [code of conduct](CODE_OF_CONDUCT.md). By participating, you are expected to uphold this code.

package/node_modules/underscore/amd/_apply.js

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

package/node_modules/underscore/amd/_applyProperty.js

@@ -1,14 +1,14 @@
-define(function () {
-
-  // Internal helper that wraps an `iteratee` to call it with the
-  // property of a closed-over `object`. Useful when iterating over
-  // an array of keys of `object`.
-  function applyProperty(iteratee, object) {
-    return function(key) {
-      return iteratee(object[key], key, object);
-    };
-  }
-
-  return applyProperty;
-
-});
+define(function () {
+
+  // Internal helper that wraps an `iteratee` to call it with the
+  // property of a closed-over `object`. Useful when iterating over
+  // an array of keys of `object`.
+  function applyProperty(iteratee, object) {
+    return function(key) {
+      return iteratee(object[key], key, object);
+    };
+  }
+
+  return applyProperty;
+
+});

package/node_modules/underscore/amd/_arrayAccessors.js

@@ -1,11 +1,11 @@
-define(['exports', './concat', './join', './slice'], function (exports, concat, join, slice) {
-
-
-
-	exports.concat = concat;
-	exports.join = join;
-	exports.slice = slice;
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-});
+define(['exports', './concat', './join', './slice'], function (exports, concat, join, slice) {
+
+
+
+	exports.concat = concat;
+	exports.join = join;
+	exports.slice = slice;
+
+	Object.defineProperty(exports, '__esModule', { value: true });
+
+});

package/node_modules/underscore/amd/_arrayMutators.js

@@ -1,15 +1,15 @@
-define(['exports', './pop', './push', './reverse', './shift', './sort', './splice', './unshift'], function (exports, pop, push, reverse, shift, sort, splice, unshift) {
-
-
-
-	exports.pop = pop;
-	exports.push = push;
-	exports.reverse = reverse;
-	exports.shift = shift;
-	exports.sort = sort;
-	exports.splice = splice;
-	exports.unshift = unshift;
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-});
+define(['exports', './pop', './push', './reverse', './shift', './sort', './splice', './unshift'], function (exports, pop, push, reverse, shift, sort, splice, unshift) {
+
+
+
+	exports.pop = pop;
+	exports.push = push;
+	exports.reverse = reverse;
+	exports.shift = shift;
+	exports.sort = sort;
+	exports.splice = splice;
+	exports.unshift = unshift;
+
+	Object.defineProperty(exports, '__esModule', { value: true });
+
+});

package/node_modules/underscore/amd/_baseCreate.js

@@ -1,21 +1,21 @@
-define(['./isObject', './_setup'], function (isObject, _setup) {
-
-  // Create a naked function reference for surrogate-prototype-swapping.
-  function ctor() {
-    return function(){};
-  }
-
-  // An internal function for creating a new object that inherits from another.
-  function baseCreate(prototype) {
-    if (!isObject(prototype)) return {};
-    if (_setup.nativeCreate) return _setup.nativeCreate(prototype);
-    var Ctor = ctor();
-    Ctor.prototype = prototype;
-    var result = new Ctor;
-    Ctor.prototype = null;
-    return result;
-  }
-
-  return baseCreate;
-
-});
+define(['./isObject', './_setup'], function (isObject, _setup) {
+
+  // Create a naked function reference for surrogate-prototype-swapping.
+  function ctor() {
+    return function(){};
+  }
+
+  // An internal function for creating a new object that inherits from another.
+  function baseCreate(prototype) {
+    if (!isObject(prototype)) return {};
+    if (_setup.nativeCreate) return _setup.nativeCreate(prototype);
+    var Ctor = ctor();
+    Ctor.prototype = prototype;
+    var result = new Ctor;
+    Ctor.prototype = null;
+    return result;
+  }
+
+  return baseCreate;
+
+});

package/node_modules/underscore/amd/_baseIteratee.js

@@ -1,15 +1,15 @@
-define(['./isObject', './identity', './isFunction', './isArray', './matcher', './property', './_optimizeCb'], function (isObject, identity, isFunction, isArray, matcher, property, _optimizeCb) {
-
-  // An internal function to generate callbacks that can be applied to each
-  // element in a collection, returning the desired result — either `_.identity`,
-  // an arbitrary callback, a property matcher, or a property accessor.
-  function baseIteratee(value, context, argCount) {
-    if (value == null) return identity;
-    if (isFunction(value)) return _optimizeCb(value, context, argCount);
-    if (isObject(value) && !isArray(value)) return matcher(value);
-    return property(value);
-  }
-
-  return baseIteratee;
-
-});
+define(['./isObject', './identity', './isFunction', './isArray', './matcher', './property', './_optimizeCb'], function (isObject, identity, isFunction, isArray, matcher, property, _optimizeCb) {
+
+  // An internal function to generate callbacks that can be applied to each
+  // element in a collection, returning the desired result — either `_.identity`,
+  // an arbitrary callback, a property matcher, or a property accessor.
+  function baseIteratee(value, context, argCount) {
+    if (value == null) return identity;
+    if (isFunction(value)) return _optimizeCb(value, context, argCount);
+    if (isObject(value) && !isArray(value)) return matcher(value);
+    return property(value);
+  }
+
+  return baseIteratee;
+
+});

package/node_modules/underscore/amd/_binarySearch.js

@@ -1,17 +1,17 @@
-define(['./_getLength'], function (_getLength) {
-
-  // Iteratively cut `array` in half to figure out the index at which `obj` should
-  // be inserted so as to maintain the order defined by `compare`.
-  function binarySearch(array, obj, iteratee, compare) {
-    var value = iteratee(obj);
-    var low = 0, high = _getLength(array);
-    while (low < high) {
-      var mid = Math.floor((low + high) / 2);
-      if (compare(iteratee(array[mid]), value)) low = mid + 1; else high = mid;
-    }
-    return low;
-  }
-
-  return binarySearch;
-
-});
+define(['./_getLength'], function (_getLength) {
+
+  // Iteratively cut `array` in half to figure out the index at which `obj` should
+  // be inserted so as to maintain the order defined by `compare`.
+  function binarySearch(array, obj, iteratee, compare) {
+    var value = iteratee(obj);
+    var low = 0, high = _getLength(array);
+    while (low < high) {
+      var mid = Math.floor((low + high) / 2);
+      if (compare(iteratee(array[mid]), value)) low = mid + 1; else high = mid;
+    }
+    return low;
+  }
+
+  return binarySearch;
+
+});

package/node_modules/underscore/amd/_bindCb.js

@@ -1,14 +1,14 @@
-define(function () {
-
-  // Internal function that returns a bound version of the passed-in callback, to
-  // be repeatedly applied in other Underscore functions.
-  function bindCb(func, context) {
-    if (context === void 0) return func;
-    return function() {
-      return func.apply(context, arguments);
-    };
-  }
-
-  return bindCb;
-
-});
+define(function () {
+
+  // Internal function that returns a bound version of the passed-in callback, to
+  // be repeatedly applied in other Underscore functions.
+  function bindCb(func, context) {
+    if (context === void 0) return func;
+    return function() {
+      return func.apply(context, arguments);
+    };
+  }
+
+  return bindCb;
+
+});

package/node_modules/underscore/amd/_bindCb4.js

@@ -1,17 +1,17 @@
-define(function () {
-
-  // In Firefox, `Function.prototype.call` is faster than
-  // `Function.prototype.apply`. In the optimized variant of
-  // `bindCb` below, we exploit the fact that no Underscore
-  // function passes more than four arguments to a callback.
-  // **NOT general enough for use outside of Underscore.**
-  function bindCb4(func, context) {
-    if (context === void 0) return func;
-    return function(a1, a2, a3, a4) {
-      return func.call(context, a1, a2, a3, a4);
-    };
-  }
-
-  return bindCb4;
-
-});
+define(function () {
+
+  // In Firefox, `Function.prototype.call` is faster than
+  // `Function.prototype.apply`. In the optimized variant of
+  // `bindCb` below, we exploit the fact that no Underscore
+  // function passes more than four arguments to a callback.
+  // **NOT general enough for use outside of Underscore.**
+  function bindCb4(func, context) {
+    if (context === void 0) return func;
+    return function(a1, a2, a3, a4) {
+      return func.call(context, a1, a2, a3, a4);
+    };
+  }
+
+  return bindCb4;
+
+});

package/node_modules/underscore/amd/_byValue.js

@@ -1,11 +1,11 @@
-define(function () {
-
-  // Internal wrapper to enable match-by-value mode in `linearSearch`.
-  function byValue(value) {
-    if (!(this instanceof byValue)) return new byValue(value);
-    this.value = value;
-  }
-
-  return byValue;
-
-});
+define(function () {
+
+  // Internal wrapper to enable match-by-value mode in `linearSearch`.
+  function byValue(value) {
+    if (!(this instanceof byValue)) return new byValue(value);
+    this.value = value;
+  }
+
+  return byValue;
+
+});

package/node_modules/underscore/amd/_cb.js

@@ -1,12 +1,12 @@
-define(['./underscore', './_baseIteratee', './iteratee'], function (underscore, _baseIteratee, iteratee) {
-
-  // The function we call internally to generate a callback. It invokes
-  // `_.iteratee` if overridden, otherwise `baseIteratee`.
-  function cb(value, context, argCount) {
-    if (underscore.iteratee !== iteratee) return underscore.iteratee(value, context);
-    return _baseIteratee(value, context, argCount);
-  }
-
-  return cb;
-
-});
+define(['./underscore', './_baseIteratee', './iteratee'], function (underscore, _baseIteratee, iteratee) {
+
+  // The function we call internally to generate a callback. It invokes
+  // `_.iteratee` if overridden, otherwise `baseIteratee`.
+  function cb(value, context, argCount) {
+    if (underscore.iteratee !== iteratee) return underscore.iteratee(value, context);
+    return _baseIteratee(value, context, argCount);
+  }
+
+  return cb;
+
+});

package/node_modules/underscore/amd/_chainResult.js

@@ -1,10 +1,10 @@
-define(['./underscore'], function (underscore) {
-
-  // Helper function to continue chaining intermediate results.
-  function chainResult(instance, obj) {
-    return instance._chain ? underscore(obj).chain() : obj;
-  }
-
-  return chainResult;
-
-});
+define(['./underscore'], function (underscore) {
+
+  // Helper function to continue chaining intermediate results.
+  function chainResult(instance, obj) {
+    return instance._chain ? underscore(obj).chain() : obj;
+  }
+
+  return chainResult;
+
+});

package/node_modules/underscore/amd/_collectNonEnumProps.js

@@ -1,42 +1,42 @@
-define(['./_setup', './isFunction', './_has'], function (_setup, isFunction, _has) {
-
-  // Internal helper to create a simple lookup structure.
-  // `collectNonEnumProps` used to depend on `_.contains`, but this led to
-  // circular imports. `emulatedSet` is a one-off solution that only works for
-  // arrays of strings.
-  function emulatedSet(keys) {
-    var hash = {};
-    for (var l = keys.length, i = 0; i < l; ++i) hash[keys[i]] = true;
-    return {
-      contains: function(key) { return hash[key]; },
-      push: function(key) {
-        hash[key] = true;
-        return keys.push(key);
-      }
-    };
-  }
-
-  // Internal helper. Checks `keys` for the presence of keys in IE < 9 that won't
-  // be iterated by `for key in ...` and thus missed. Extends `keys` in place if
-  // needed.
-  function collectNonEnumProps(obj, keys) {
-    keys = emulatedSet(keys);
-    var nonEnumIdx = _setup.nonEnumerableProps.length;
-    var constructor = obj.constructor;
-    var proto = isFunction(constructor) && constructor.prototype || _setup.ObjProto;
-
-    // Constructor is a special case.
-    var prop = 'constructor';
-    if (_has(obj, prop) && !keys.contains(prop)) keys.push(prop);
-
-    while (nonEnumIdx--) {
-      prop = _setup.nonEnumerableProps[nonEnumIdx];
-      if (prop in obj && obj[prop] !== proto[prop] && !keys.contains(prop)) {
-        keys.push(prop);
-      }
-    }
-  }
-
-  return collectNonEnumProps;
-
-});
+define(['./_setup', './isFunction', './_has'], function (_setup, isFunction, _has) {
+
+  // Internal helper to create a simple lookup structure.
+  // `collectNonEnumProps` used to depend on `_.contains`, but this led to
+  // circular imports. `emulatedSet` is a one-off solution that only works for
+  // arrays of strings.
+  function emulatedSet(keys) {
+    var hash = {};
+    for (var l = keys.length, i = 0; i < l; ++i) hash[keys[i]] = true;
+    return {
+      contains: function(key) { return hash[key]; },
+      push: function(key) {
+        hash[key] = true;
+        return keys.push(key);
+      }
+    };
+  }
+
+  // Internal helper. Checks `keys` for the presence of keys in IE < 9 that won't
+  // be iterated by `for key in ...` and thus missed. Extends `keys` in place if
+  // needed.
+  function collectNonEnumProps(obj, keys) {
+    keys = emulatedSet(keys);
+    var nonEnumIdx = _setup.nonEnumerableProps.length;
+    var constructor = obj.constructor;
+    var proto = isFunction(constructor) && constructor.prototype || _setup.ObjProto;
+
+    // Constructor is a special case.
+    var prop = 'constructor';
+    if (_has(obj, prop) && !keys.contains(prop)) keys.push(prop);
+
+    while (nonEnumIdx--) {
+      prop = _setup.nonEnumerableProps[nonEnumIdx];
+      if (prop in obj && obj[prop] !== proto[prop] && !keys.contains(prop)) {
+        keys.push(prop);
+      }
+    }
+  }
+
+  return collectNonEnumProps;
+
+});

package/node_modules/underscore/amd/_createAssigner.js

@@ -1,24 +1,24 @@
-define(function () {
-
-  // An internal function for creating assigner functions.
-  function createAssigner(keysFunc, defaults) {
-    return function(obj) {
-      var length = arguments.length;
-      if (defaults) obj = Object(obj);
-      if (length < 2 || obj == null) return obj;
-      for (var index = 1; index < length; index++) {
-        var source = arguments[index],
-            keys = keysFunc(source),
-            l = keys.length;
-        for (var i = 0; i < l; i++) {
-          var key = keys[i];
-          if (!defaults || obj[key] === void 0) obj[key] = source[key];
-        }
-      }
-      return obj;
-    };
-  }
-
-  return createAssigner;
-
-});
+define(function () {
+
+  // An internal function for creating assigner functions.
+  function createAssigner(keysFunc, defaults) {
+    return function(obj) {
+      var length = arguments.length;
+      if (defaults) obj = Object(obj);
+      if (length < 2 || obj == null) return obj;
+      for (var index = 1; index < length; index++) {
+        var source = arguments[index],
+            keys = keysFunc(source),
+            l = keys.length;
+        for (var i = 0; i < l; i++) {
+          var key = keys[i];
+          if (!defaults || obj[key] === void 0) obj[key] = source[key];
+        }
+      }
+      return obj;
+    };
+  }
+
+  return createAssigner;
+
+});

package/node_modules/underscore/amd/_createEscaper.js

@@ -1,21 +1,21 @@
-define(['./keys'], function (keys) {
-
-  // Internal helper to generate functions for escaping and unescaping strings
-  // to/from HTML interpolation.
-  function createEscaper(map) {
-    var escaper = function(match) {
-      return map[match];
-    };
-    // Regexes for identifying a key that needs to be escaped.
-    var source = '(?:' + keys(map).join('|') + ')';
-    var testRegexp = RegExp(source);
-    var replaceRegexp = RegExp(source, 'g');
-    return function(string) {
-      string = string == null ? '' : '' + string;
-      return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;
-    };
-  }
-
-  return createEscaper;
-
-});
+define(['./keys'], function (keys) {
+
+  // Internal helper to generate functions for escaping and unescaping strings
+  // to/from HTML interpolation.
+  function createEscaper(map) {
+    var escaper = function(match) {
+      return map[match];
+    };
+    // Regexes for identifying a key that needs to be escaped.
+    var source = '(?:' + keys(map).join('|') + ')';
+    var testRegexp = RegExp(source);
+    var replaceRegexp = RegExp(source, 'g');
+    return function(string) {
+      string = string == null ? '' : '' + string;
+      return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;
+    };
+  }
+
+  return createEscaper;
+
+});