@pdftron/pdfnet-node 9.4.2 → 9.5.0

package/node_modules/underscore/amd/_createIndexFinder.js

@@ -1,30 +1,30 @@
-define(['./_setup', './_getLength', './isNaN'], function (_setup, _getLength, _isNaN) {
-
-  // Internal function to generate the `_.indexOf` and `_.lastIndexOf` functions.
-  function createIndexFinder(dir, predicateFind, sortedIndex) {
-    return function(array, item, idx) {
-      var i = 0, length = _getLength(array);
-      if (typeof idx == 'number') {
-        if (dir > 0) {
-          i = idx >= 0 ? idx : Math.max(idx + length, i);
-        } else {
-          length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;
-        }
-      } else if (sortedIndex && idx && length) {
-        idx = sortedIndex(array, item);
-        return array[idx] === item ? idx : -1;
-      }
-      if (item !== item) {
-        idx = predicateFind(_setup.slice.call(array, i, length), _isNaN);
-        return idx >= 0 ? idx + i : -1;
-      }
-      for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) {
-        if (array[idx] === item) return idx;
-      }
-      return -1;
-    };
-  }
-
-  return createIndexFinder;
-
-});
+define(['./_setup', './_getLength', './isNaN'], function (_setup, _getLength, _isNaN) {
+
+  // Internal function to generate the `_.indexOf` and `_.lastIndexOf` functions.
+  function createIndexFinder(dir, predicateFind, sortedIndex) {
+    return function(array, item, idx) {
+      var i = 0, length = _getLength(array);
+      if (typeof idx == 'number') {
+        if (dir > 0) {
+          i = idx >= 0 ? idx : Math.max(idx + length, i);
+        } else {
+          length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;
+        }
+      } else if (sortedIndex && idx && length) {
+        idx = sortedIndex(array, item);
+        return array[idx] === item ? idx : -1;
+      }
+      if (item !== item) {
+        idx = predicateFind(_setup.slice.call(array, i, length), _isNaN);
+        return idx >= 0 ? idx + i : -1;
+      }
+      for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) {
+        if (array[idx] === item) return idx;
+      }
+      return -1;
+    };
+  }
+
+  return createIndexFinder;
+
+});

package/node_modules/underscore/amd/_createPredicateIndexFinder.js

@@ -1,18 +1,18 @@
-define(['./_cb', './_getLength'], function (_cb, _getLength) {
-
-  // Internal function to generate `_.findIndex` and `_.findLastIndex`.
-  function createPredicateIndexFinder(dir) {
-    return function(array, predicate, context) {
-      predicate = _cb(predicate, context);
-      var length = _getLength(array);
-      var index = dir > 0 ? 0 : length - 1;
-      for (; index >= 0 && index < length; index += dir) {
-        if (predicate(array[index], index, array)) return index;
-      }
-      return -1;
-    };
-  }
-
-  return createPredicateIndexFinder;
-
-});
+define(['./_cb', './_getLength'], function (_cb, _getLength) {
+
+  // Internal function to generate `_.findIndex` and `_.findLastIndex`.
+  function createPredicateIndexFinder(dir) {
+    return function(array, predicate, context) {
+      predicate = _cb(predicate, context);
+      var length = _getLength(array);
+      var index = dir > 0 ? 0 : length - 1;
+      for (; index >= 0 && index < length; index += dir) {
+        if (predicate(array[index], index, array)) return index;
+      }
+      return -1;
+    };
+  }
+
+  return createPredicateIndexFinder;
+
+});

package/node_modules/underscore/amd/_createReduce.js

@@ -1,30 +1,30 @@
-define(['./keys', './_optimizeCb', './_isArrayLike'], function (keys, _optimizeCb, _isArrayLike) {
-
-  // Internal helper to create a reducing function, iterating left or right.
-  function createReduce(dir) {
-    // Wrap code that reassigns argument variables in a separate function than
-    // the one that accesses `arguments.length` to avoid a perf hit. (#1991)
-    var reducer = function(obj, iteratee, memo, initial) {
-      var _keys = !_isArrayLike(obj) && keys(obj),
-          length = (_keys || obj).length,
-          index = dir > 0 ? 0 : length - 1;
-      if (!initial) {
-        memo = obj[_keys ? _keys[index] : index];
-        index += dir;
-      }
-      for (; index >= 0 && index < length; index += dir) {
-        var currentKey = _keys ? _keys[index] : index;
-        memo = iteratee(memo, obj[currentKey], currentKey, obj);
-      }
-      return memo;
-    };
-
-    return function(obj, iteratee, memo, context) {
-      var initial = arguments.length >= 3;
-      return reducer(obj, _optimizeCb(iteratee, context, 4), memo, initial);
-    };
-  }
-
-  return createReduce;
-
-});
+define(['./keys', './_optimizeCb', './_isArrayLike'], function (keys, _optimizeCb, _isArrayLike) {
+
+  // Internal helper to create a reducing function, iterating left or right.
+  function createReduce(dir) {
+    // Wrap code that reassigns argument variables in a separate function than
+    // the one that accesses `arguments.length` to avoid a perf hit. (#1991)
+    var reducer = function(obj, iteratee, memo, initial) {
+      var _keys = !_isArrayLike(obj) && keys(obj),
+          length = (_keys || obj).length,
+          index = dir > 0 ? 0 : length - 1;
+      if (!initial) {
+        memo = obj[_keys ? _keys[index] : index];
+        index += dir;
+      }
+      for (; index >= 0 && index < length; index += dir) {
+        var currentKey = _keys ? _keys[index] : index;
+        memo = iteratee(memo, obj[currentKey], currentKey, obj);
+      }
+      return memo;
+    };
+
+    return function(obj, iteratee, memo, context) {
+      var initial = arguments.length >= 3;
+      return reducer(obj, _optimizeCb(iteratee, context, 4), memo, initial);
+    };
+  }
+
+  return createReduce;
+
+});

package/node_modules/underscore/amd/_createSizePropertyCheck.js

@@ -1,13 +1,13 @@
-define(['./_setup'], function (_setup) {
-
-  // Common internal logic for `isArrayLike` and `isBufferLike`.
-  function createSizePropertyCheck(getSizeProperty) {
-    return function(collection) {
-      var sizeProperty = getSizeProperty(collection);
-      return typeof sizeProperty == 'number' && sizeProperty >= 0 && sizeProperty <= _setup.MAX_ARRAY_INDEX;
-    }
-  }
-
-  return createSizePropertyCheck;
-
-});
+define(['./_setup'], function (_setup) {
+
+  // Common internal logic for `isArrayLike` and `isBufferLike`.
+  function createSizePropertyCheck(getSizeProperty) {
+    return function(collection) {
+      var sizeProperty = getSizeProperty(collection);
+      return typeof sizeProperty == 'number' && sizeProperty >= 0 && sizeProperty <= _setup.MAX_ARRAY_INDEX;
+    }
+  }
+
+  return createSizePropertyCheck;
+
+});

package/node_modules/underscore/amd/_deepGet.js

@@ -1,15 +1,15 @@
-define(function () {
-
-  // Internal function to obtain a nested property in `obj` along `path`.
-  function deepGet(obj, path) {
-    var length = path.length;
-    for (var i = 0; i < length; i++) {
-      if (obj == null) return void 0;
-      obj = obj[path[i]];
-    }
-    return length ? obj : void 0;
-  }
-
-  return deepGet;
-
-});
+define(function () {
+
+  // Internal function to obtain a nested property in `obj` along `path`.
+  function deepGet(obj, path) {
+    var length = path.length;
+    for (var i = 0; i < length; i++) {
+      if (obj == null) return void 0;
+      obj = obj[path[i]];
+    }
+    return length ? obj : void 0;
+  }
+
+  return deepGet;
+
+});

package/node_modules/underscore/amd/_escapeMap.js

@@ -1,15 +1,15 @@
-define(function () {
-
-  // Internal list of HTML entities for escaping.
-  var escapeMap = {
-    '&': '&',
-    '<': '&lt;',
-    '>': '&gt;',
-    '"': '&quot;',
-    "'": '&#x27;',
-    '`': '&#x60;'
-  };
-
-  return escapeMap;
-
-});
+define(function () {
+
+  // Internal list of HTML entities for escaping.
+  var escapeMap = {
+    '&': '&amp;',
+    '<': '&lt;',
+    '>': '&gt;',
+    '"': '&quot;',
+    "'": '&#x27;',
+    '`': '&#x60;'
+  };
+
+  return escapeMap;
+
+});

package/node_modules/underscore/amd/_executeBound.js

@@ -1,16 +1,16 @@
-define(['./isObject', './_baseCreate'], function (isObject, _baseCreate) {
-
-  // Internal function to execute `sourceFunc` bound to `context` with optional
-  // `args`. Determines whether to execute a function as a constructor or as a
-  // normal function.
-  function executeBound(sourceFunc, boundFunc, context, callingContext, args) {
-    if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args);
-    var self = _baseCreate(sourceFunc.prototype);
-    var result = sourceFunc.apply(self, args);
-    if (isObject(result)) return result;
-    return self;
-  }
-
-  return executeBound;
-
-});
+define(['./isObject', './_baseCreate'], function (isObject, _baseCreate) {
+
+  // Internal function to execute `sourceFunc` bound to `context` with optional
+  // `args`. Determines whether to execute a function as a constructor or as a
+  // normal function.
+  function executeBound(sourceFunc, boundFunc, context, callingContext, args) {
+    if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args);
+    var self = _baseCreate(sourceFunc.prototype);
+    var result = sourceFunc.apply(self, args);
+    if (isObject(result)) return result;
+    return self;
+  }
+
+  return executeBound;
+
+});

package/node_modules/underscore/amd/_extremum.js

@@ -1,35 +1,35 @@
-define(['./identity', './_cb', './find'], function (identity, _cb, find) {
-
-  // The general algorithm behind `_.min` and `_.max`. `compare` should return
-  // `true` if its first argument is more extreme than (i.e., should be preferred
-  // over) its second argument, `false` otherwise. `iteratee` and `context`, like
-  // in other collection functions, let you map the actual values in `collection`
-  // to the values to `compare`. `decide` is an optional customization point
-  // which is only present for historical reasons; please don't use it, as it will
-  // likely be removed in the future.
-  function extremum(collection, compare, iteratee, context, decide) {
-    decide || (decide = identity);
-    // `extremum` is essentially a combined map+reduce with **two** accumulators:
-    // `result` and `iterResult`, respectively the unmapped and the mapped version
-    // corresponding to the same element.
-    var result, iterResult;
-    iteratee = _cb(iteratee, context);
-    var first = true;
-    find(collection, function(value, key) {
-      var iterValue = iteratee(value, key, collection);
-      if (first || compare(iterValue, iterResult)) {
-        result = value;
-        iterResult = iterValue;
-        first = false;
-      }
-    });
-    // `extremum` normally returns an unmapped element from `collection`. However,
-    // `_.min` and `_.max` forcibly return a number even if there is no element
-    // that maps to a numeric value. Passing both accumulators through `decide`
-    // before returning enables this behavior.
-    return decide(result, iterResult);
-  }
-
-  return extremum;
-
-});
+define(['./identity', './_cb', './find'], function (identity, _cb, find) {
+
+  // The general algorithm behind `_.min` and `_.max`. `compare` should return
+  // `true` if its first argument is more extreme than (i.e., should be preferred
+  // over) its second argument, `false` otherwise. `iteratee` and `context`, like
+  // in other collection functions, let you map the actual values in `collection`
+  // to the values to `compare`. `decide` is an optional customization point
+  // which is only present for historical reasons; please don't use it, as it will
+  // likely be removed in the future.
+  function extremum(collection, compare, iteratee, context, decide) {
+    decide || (decide = identity);
+    // `extremum` is essentially a combined map+reduce with **two** accumulators:
+    // `result` and `iterResult`, respectively the unmapped and the mapped version
+    // corresponding to the same element.
+    var result, iterResult;
+    iteratee = _cb(iteratee, context);
+    var first = true;
+    find(collection, function(value, key) {
+      var iterValue = iteratee(value, key, collection);
+      if (first || compare(iterValue, iterResult)) {
+        result = value;
+        iterResult = iterValue;
+        first = false;
+      }
+    });
+    // `extremum` normally returns an unmapped element from `collection`. However,
+    // `_.min` and `_.max` forcibly return a number even if there is no element
+    // that maps to a numeric value. Passing both accumulators through `decide`
+    // before returning enables this behavior.
+    return decide(result, iterResult);
+  }
+
+  return extremum;
+
+});

package/node_modules/underscore/amd/_flatten.js

@@ -1,32 +1,32 @@
-define(['./isArray', './_getLength', './_isArrayLike', './isArguments'], function (isArray, _getLength, _isArrayLike, isArguments) {
-
-  // Internal implementation of a recursive `flatten` function.
-  function flatten(input, depth, strict, output) {
-    output = output || [];
-    if (!depth && depth !== 0) {
-      depth = Infinity;
-    } else if (depth <= 0) {
-      return output.concat(input);
-    }
-    var idx = output.length;
-    for (var i = 0, length = _getLength(input); i < length; i++) {
-      var value = input[i];
-      if (_isArrayLike(value) && (isArray(value) || isArguments(value))) {
-        // Flatten current level of array or arguments object.
-        if (depth > 1) {
-          flatten(value, depth - 1, strict, output);
-          idx = output.length;
-        } else {
-          var j = 0, len = value.length;
-          while (j < len) output[idx++] = value[j++];
-        }
-      } else if (!strict) {
-        output[idx++] = value;
-      }
-    }
-    return output;
-  }
-
-  return flatten;
-
-});
+define(['./isArray', './_getLength', './_isArrayLike', './isArguments'], function (isArray, _getLength, _isArrayLike, isArguments) {
+
+  // Internal implementation of a recursive `flatten` function.
+  function flatten(input, depth, strict, output) {
+    output = output || [];
+    if (!depth && depth !== 0) {
+      depth = Infinity;
+    } else if (depth <= 0) {
+      return output.concat(input);
+    }
+    var idx = output.length;
+    for (var i = 0, length = _getLength(input); i < length; i++) {
+      var value = input[i];
+      if (_isArrayLike(value) && (isArray(value) || isArguments(value))) {
+        // Flatten current level of array or arguments object.
+        if (depth > 1) {
+          flatten(value, depth - 1, strict, output);
+          idx = output.length;
+        } else {
+          var j = 0, len = value.length;
+          while (j < len) output[idx++] = value[j++];
+        }
+      } else if (!strict) {
+        output[idx++] = value;
+      }
+    }
+    return output;
+  }
+
+  return flatten;
+
+});

package/node_modules/underscore/amd/_forceNumericMinMax.js

@@ -1,16 +1,16 @@
-define(['exports', './isNaN'], function (exports, _isNaN) {
-
-  // Internal `extremum` return value adapter for `_.min` and `_.max`.
-  // Ensures that a number is returned even if no element of the
-  // collection maps to a numeric value.
-  function decideNumeric(fallback) {
-    return function(result, iterResult) {
-      return _isNaN(+iterResult) ? fallback : result;
-    }
-  }
-
-  exports.decideNumeric = decideNumeric;
-
-  Object.defineProperty(exports, '__esModule', { value: true });
-
-});
+define(['exports', './isNaN'], function (exports, _isNaN) {
+
+  // Internal `extremum` return value adapter for `_.min` and `_.max`.
+  // Ensures that a number is returned even if no element of the
+  // collection maps to a numeric value.
+  function decideNumeric(fallback) {
+    return function(result, iterResult) {
+      return _isNaN(+iterResult) ? fallback : result;
+    }
+  }
+
+  exports.decideNumeric = decideNumeric;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+});

package/node_modules/underscore/amd/_getByteLength.js

@@ -1,8 +1,8 @@
-define(['./_shallowProperty'], function (_shallowProperty) {
-
-	// Internal helper to obtain the `byteLength` property of an object.
-	var getByteLength = _shallowProperty('byteLength');
-
-	return getByteLength;
-
-});
+define(['./_shallowProperty'], function (_shallowProperty) {
+
+	// Internal helper to obtain the `byteLength` property of an object.
+	var getByteLength = _shallowProperty('byteLength');
+
+	return getByteLength;
+
+});

package/node_modules/underscore/amd/_getLength.js

@@ -1,8 +1,8 @@
-define(['./_shallowProperty'], function (_shallowProperty) {
-
-	// Internal helper to obtain the `length` property of an object.
-	var getLength = _shallowProperty('length');
-
-	return getLength;
-
-});
+define(['./_shallowProperty'], function (_shallowProperty) {
+
+	// Internal helper to obtain the `length` property of an object.
+	var getLength = _shallowProperty('length');
+
+	return getLength;
+
+});

package/node_modules/underscore/amd/_greater.js

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

package/node_modules/underscore/amd/_group.js

@@ -1,18 +1,18 @@
-define(['./_cb', './each'], function (_cb, each) {
-
-  // An internal function used for aggregate "group by" operations.
-  function group(behavior, partition) {
-    return function(obj, iteratee, context) {
-      var result = partition ? [[], []] : {};
-      iteratee = _cb(iteratee, context);
-      each(obj, function(value, index) {
-        var key = iteratee(value, index, obj);
-        behavior(result, value, key);
-      });
-      return result;
-    };
-  }
-
-  return group;
-
-});
+define(['./_cb', './each'], function (_cb, each) {
+
+  // An internal function used for aggregate "group by" operations.
+  function group(behavior, partition) {
+    return function(obj, iteratee, context) {
+      var result = partition ? [[], []] : {};
+      iteratee = _cb(iteratee, context);
+      each(obj, function(value, index) {
+        var key = iteratee(value, index, obj);
+        behavior(result, value, key);
+      });
+      return result;
+    };
+  }
+
+  return group;
+
+});

package/node_modules/underscore/amd/_has.js

@@ -1,10 +1,10 @@
-define(['./_setup'], function (_setup) {
-
-  // Internal function to check whether `key` is an own property name of `obj`.
-  function has(obj, key) {
-    return obj != null && _setup.hasOwnProperty.call(obj, key);
-  }
-
-  return has;
-
-});
+define(['./_setup'], function (_setup) {
+
+  // Internal function to check whether `key` is an own property name of `obj`.
+  function has(obj, key) {
+    return obj != null && _setup.hasOwnProperty.call(obj, key);
+  }
+
+  return has;
+
+});

package/node_modules/underscore/amd/_hasObjectTag.js

@@ -1,7 +1,7 @@
-define(['./_tagTester'], function (_tagTester) {
-
-	var hasObjectTag = _tagTester('Object');
-
-	return hasObjectTag;
-
-});
+define(['./_tagTester'], function (_tagTester) {
+
+	var hasObjectTag = _tagTester('Object');
+
+	return hasObjectTag;
+
+});

package/node_modules/underscore/amd/_isArrayLike.js

@@ -1,11 +1,11 @@
-define(['./_getLength', './_createSizePropertyCheck'], function (_getLength, _createSizePropertyCheck) {
-
-	// Internal helper for collection methods to determine whether a collection
-	// should be iterated as an array or as an object.
-	// Related: https://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength
-	// Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094
-	var isArrayLike = _createSizePropertyCheck(_getLength);
-
-	return isArrayLike;
-
-});
+define(['./_getLength', './_createSizePropertyCheck'], function (_getLength, _createSizePropertyCheck) {
+
+	// Internal helper for collection methods to determine whether a collection
+	// should be iterated as an array or as an object.
+	// Related: https://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength
+	// Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094
+	var isArrayLike = _createSizePropertyCheck(_getLength);
+
+	return isArrayLike;
+
+});

package/node_modules/underscore/amd/_isBufferLike.js

@@ -1,9 +1,9 @@
-define(['./_createSizePropertyCheck', './_getByteLength'], function (_createSizePropertyCheck, _getByteLength) {
-
-	// Internal helper to determine whether we should spend extensive checks against
-	// `ArrayBuffer` et al.
-	var isBufferLike = _createSizePropertyCheck(_getByteLength);
-
-	return isBufferLike;
-
-});
+define(['./_createSizePropertyCheck', './_getByteLength'], function (_createSizePropertyCheck, _getByteLength) {
+
+	// Internal helper to determine whether we should spend extensive checks against
+	// `ArrayBuffer` et al.
+	var isBufferLike = _createSizePropertyCheck(_getByteLength);
+
+	return isBufferLike;
+
+});

package/node_modules/underscore/amd/_keyInObj.js

@@ -1,11 +1,11 @@
-define(function () {
-
-  // Internal `_.pick` helper function to determine whether `key` is an enumerable
-  // property name of `obj`.
-  function keyInObj(value, key, obj) {
-    return key in obj;
-  }
-
-  return keyInObj;
-
-});
+define(function () {
+
+  // Internal `_.pick` helper function to determine whether `key` is an enumerable
+  // property name of `obj`.
+  function keyInObj(value, key, obj) {
+    return key in obj;
+  }
+
+  return keyInObj;
+
+});