@pdftron/pdfnet-node 10.3.0 → 10.3.1-beta

package/node_modules/underscore/modules/pick.js

@@ -1,26 +1,26 @@
-import restArguments from './restArguments.js';
-import isFunction from './isFunction.js';
-import optimizeCb from './_optimizeCb.js';
-import allKeys from './allKeys.js';
-import keyInObj from './_keyInObj.js';
-import flatten from './_flatten.js';
-
-// Return a copy of the object only containing the allowed properties.
-export default restArguments(function(obj, keys) {
-  var result = {}, iteratee = keys[0];
-  if (obj == null) return result;
-  if (isFunction(iteratee)) {
-    if (keys.length > 1) iteratee = optimizeCb(iteratee, keys[1]);
-    keys = allKeys(obj);
-  } else {
-    iteratee = keyInObj;
-    keys = flatten(keys, false, false);
-    obj = Object(obj);
-  }
-  for (var i = 0, length = keys.length; i < length; i++) {
-    var key = keys[i];
-    var value = obj[key];
-    if (iteratee(value, key, obj)) result[key] = value;
-  }
-  return result;
-});
+import restArguments from './restArguments.js';
+import isFunction from './isFunction.js';
+import optimizeCb from './_optimizeCb.js';
+import allKeys from './allKeys.js';
+import keyInObj from './_keyInObj.js';
+import flatten from './_flatten.js';
+
+// Return a copy of the object only containing the allowed properties.
+export default restArguments(function(obj, keys) {
+  var result = {}, iteratee = keys[0];
+  if (obj == null) return result;
+  if (isFunction(iteratee)) {
+    if (keys.length > 1) iteratee = optimizeCb(iteratee, keys[1]);
+    keys = allKeys(obj);
+  } else {
+    iteratee = keyInObj;
+    keys = flatten(keys, false, false);
+    obj = Object(obj);
+  }
+  for (var i = 0, length = keys.length; i < length; i++) {
+    var key = keys[i];
+    var value = obj[key];
+    if (iteratee(value, key, obj)) result[key] = value;
+  }
+  return result;
+});

package/node_modules/underscore/modules/pluck.js

@@ -1,7 +1,7 @@
-import map from './map.js';
-import property from './property.js';
-
-// Convenience version of a common use case of `_.map`: fetching a property.
-export default function pluck(obj, key) {
-  return map(obj, property(key));
-}
+import map from './map.js';
+import property from './property.js';
+
+// Convenience version of a common use case of `_.map`: fetching a property.
+export default function pluck(obj, key) {
+  return map(obj, property(key));
+}

package/node_modules/underscore/modules/property.js

@@ -1,11 +1,11 @@
-import deepGet from './_deepGet.js';
-import toPath from './_toPath.js';
-
-// Creates a function that, when passed an object, will traverse that object’s
-// properties down the given `path`, specified as an array of keys or indices.
-export default function property(path) {
-  path = toPath(path);
-  return function(obj) {
-    return deepGet(obj, path);
-  };
-}
+import deepGet from './_deepGet.js';
+import toPath from './_toPath.js';
+
+// Creates a function that, when passed an object, will traverse that object’s
+// properties down the given `path`, specified as an array of keys or indices.
+export default function property(path) {
+  path = toPath(path);
+  return function(obj) {
+    return deepGet(obj, path);
+  };
+}

package/node_modules/underscore/modules/propertyOf.js

@@ -1,10 +1,10 @@
-import noop from './noop.js';
-import get from './get.js';
-
-// Generates a function for a given object that returns a given property.
-export default function propertyOf(obj) {
-  if (obj == null) return noop;
-  return function(path) {
-    return get(obj, path);
-  };
-}
+import noop from './noop.js';
+import get from './get.js';
+
+// Generates a function for a given object that returns a given property.
+export default function propertyOf(obj) {
+  if (obj == null) return noop;
+  return function(path) {
+    return get(obj, path);
+  };
+}

package/node_modules/underscore/modules/random.js

@@ -1,8 +1,8 @@
-// Return a random integer between `min` and `max` (inclusive).
-export default function random(min, max) {
-  if (max == null) {
-    max = min;
-    min = 0;
-  }
-  return min + Math.floor(Math.random() * (max - min + 1));
-}
+// Return a random integer between `min` and `max` (inclusive).
+export default function random(min, max) {
+  if (max == null) {
+    max = min;
+    min = 0;
+  }
+  return min + Math.floor(Math.random() * (max - min + 1));
+}

package/node_modules/underscore/modules/range.js

@@ -1,21 +1,21 @@
-// Generate an integer Array containing an arithmetic progression. A port of
-// the native Python `range()` function. See
-// [the Python documentation](https://docs.python.org/library/functions.html#range).
-export default function range(start, stop, step) {
-  if (stop == null) {
-    stop = start || 0;
-    start = 0;
-  }
-  if (!step) {
-    step = stop < start ? -1 : 1;
-  }
-
-  var length = Math.max(Math.ceil((stop - start) / step), 0);
-  var range = Array(length);
-
-  for (var idx = 0; idx < length; idx++, start += step) {
-    range[idx] = start;
-  }
-
-  return range;
-}
+// Generate an integer Array containing an arithmetic progression. A port of
+// the native Python `range()` function. See
+// [the Python documentation](https://docs.python.org/library/functions.html#range).
+export default function range(start, stop, step) {
+  if (stop == null) {
+    stop = start || 0;
+    start = 0;
+  }
+  if (!step) {
+    step = stop < start ? -1 : 1;
+  }
+
+  var length = Math.max(Math.ceil((stop - start) / step), 0);
+  var range = Array(length);
+
+  for (var idx = 0; idx < length; idx++, start += step) {
+    range[idx] = start;
+  }
+
+  return range;
+}

package/node_modules/underscore/modules/reduce.js

@@ -1,5 +1,5 @@
-import createReduce from './_createReduce.js';
-
-// **Reduce** builds up a single result from a list of values, aka `inject`,
-// or `foldl`.
-export default createReduce(1);
+import createReduce from './_createReduce.js';
+
+// **Reduce** builds up a single result from a list of values, aka `inject`,
+// or `foldl`.
+export default createReduce(1);

package/node_modules/underscore/modules/reduceRight.js

@@ -1,4 +1,4 @@
-import createReduce from './_createReduce.js';
-
-// The right-associative version of reduce, also known as `foldr`.
-export default createReduce(-1);
+import createReduce from './_createReduce.js';
+
+// The right-associative version of reduce, also known as `foldr`.
+export default createReduce(-1);

package/node_modules/underscore/modules/reject.js

@@ -1,8 +1,8 @@
-import filter from './filter.js';
-import negate from './negate.js';
-import cb from './_cb.js';
-
-// Return all the elements for which a truth test fails.
-export default function reject(obj, predicate, context) {
-  return filter(obj, negate(cb(predicate)), context);
-}
+import filter from './filter.js';
+import negate from './negate.js';
+import cb from './_cb.js';
+
+// Return all the elements for which a truth test fails.
+export default function reject(obj, predicate, context) {
+  return filter(obj, negate(cb(predicate)), context);
+}

package/node_modules/underscore/modules/rest.js

@@ -1,8 +1,8 @@
-import { slice } from './_setup.js';
-
-// Returns everything but the first entry of the `array`. Especially useful on
-// the `arguments` object. Passing an **n** will return the rest N values in the
-// `array`.
-export default function rest(array, n, guard) {
-  return slice.call(array, n == null || guard ? 1 : n);
-}
+import { slice } from './_setup.js';
+
+// Returns everything but the first entry of the `array`. Especially useful on
+// the `arguments` object. Passing an **n** will return the rest N values in the
+// `array`.
+export default function rest(array, n, guard) {
+  return slice.call(array, n == null || guard ? 1 : n);
+}

package/node_modules/underscore/modules/restArguments.js

@@ -1,27 +1,27 @@
-// Some functions take a variable number of arguments, or a few expected
-// arguments at the beginning and then a variable number of values to operate
-// on. This helper accumulates all remaining arguments past the function’s
-// argument length (or an explicit `startIndex`), into an array that becomes
-// the last argument. Similar to ES6’s "rest parameter".
-export default function restArguments(func, startIndex) {
-  startIndex = startIndex == null ? func.length - 1 : +startIndex;
-  return function() {
-    var length = Math.max(arguments.length - startIndex, 0),
-        rest = Array(length),
-        index = 0;
-    for (; index < length; index++) {
-      rest[index] = arguments[index + startIndex];
-    }
-    switch (startIndex) {
-      case 0: return func.call(this, rest);
-      case 1: return func.call(this, arguments[0], rest);
-      case 2: return func.call(this, arguments[0], arguments[1], rest);
-    }
-    var args = Array(startIndex + 1);
-    for (index = 0; index < startIndex; index++) {
-      args[index] = arguments[index];
-    }
-    args[startIndex] = rest;
-    return func.apply(this, args);
-  };
-}
+// Some functions take a variable number of arguments, or a few expected
+// arguments at the beginning and then a variable number of values to operate
+// on. This helper accumulates all remaining arguments past the function’s
+// argument length (or an explicit `startIndex`), into an array that becomes
+// the last argument. Similar to ES6’s "rest parameter".
+export default function restArguments(func, startIndex) {
+  startIndex = startIndex == null ? func.length - 1 : +startIndex;
+  return function() {
+    var length = Math.max(arguments.length - startIndex, 0),
+        rest = Array(length),
+        index = 0;
+    for (; index < length; index++) {
+      rest[index] = arguments[index + startIndex];
+    }
+    switch (startIndex) {
+      case 0: return func.call(this, rest);
+      case 1: return func.call(this, arguments[0], rest);
+      case 2: return func.call(this, arguments[0], arguments[1], rest);
+    }
+    var args = Array(startIndex + 1);
+    for (index = 0; index < startIndex; index++) {
+      args[index] = arguments[index];
+    }
+    args[startIndex] = rest;
+    return func.apply(this, args);
+  };
+}

package/node_modules/underscore/modules/result.js

@@ -1,22 +1,22 @@
-import isFunction from './isFunction.js';
-import toPath from './_toPath.js';
-
-// Traverses the children of `obj` along `path`. If a child is a function, it
-// is invoked with its parent as context. Returns the value of the final
-// child, or `fallback` if any child is undefined.
-export default function result(obj, path, fallback) {
-  path = toPath(path);
-  var length = path.length;
-  if (!length) {
-    return isFunction(fallback) ? fallback.call(obj) : fallback;
-  }
-  for (var i = 0; i < length; i++) {
-    var prop = obj == null ? void 0 : obj[path[i]];
-    if (prop === void 0) {
-      prop = fallback;
-      i = length; // Ensure we don't continue iterating.
-    }
-    obj = isFunction(prop) ? prop.call(obj) : prop;
-  }
-  return obj;
-}
+import isFunction from './isFunction.js';
+import toPath from './_toPath.js';
+
+// Traverses the children of `obj` along `path`. If a child is a function, it
+// is invoked with its parent as context. Returns the value of the final
+// child, or `fallback` if any child is undefined.
+export default function result(obj, path, fallback) {
+  path = toPath(path);
+  var length = path.length;
+  if (!length) {
+    return isFunction(fallback) ? fallback.call(obj) : fallback;
+  }
+  for (var i = 0; i < length; i++) {
+    var prop = obj == null ? void 0 : obj[path[i]];
+    if (prop === void 0) {
+      prop = fallback;
+      i = length; // Ensure we don't continue iterating.
+    }
+    obj = isFunction(prop) ? prop.call(obj) : prop;
+  }
+  return obj;
+}

package/node_modules/underscore/modules/sample.js

@@ -1,27 +1,27 @@
-import isArrayLike from './_isArrayLike.js';
-import clone from './clone.js';
-import values from './values.js';
-import getLength from './_getLength.js';
-import random from './random.js';
-
-// Sample **n** random values from a collection using the modern version of the
-// [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher–Yates_shuffle).
-// If **n** is not specified, returns a single random element.
-// The internal `guard` argument allows it to work with `_.map`.
-export default function sample(obj, n, guard) {
-  if (n == null || guard) {
-    if (!isArrayLike(obj)) obj = values(obj);
-    return obj[random(obj.length - 1)];
-  }
-  var sample = isArrayLike(obj) ? clone(obj) : values(obj);
-  var length = getLength(sample);
-  n = Math.max(Math.min(n, length), 0);
-  var last = length - 1;
-  for (var index = 0; index < n; index++) {
-    var rand = random(index, last);
-    var temp = sample[index];
-    sample[index] = sample[rand];
-    sample[rand] = temp;
-  }
-  return sample.slice(0, n);
-}
+import isArrayLike from './_isArrayLike.js';
+import clone from './clone.js';
+import values from './values.js';
+import getLength from './_getLength.js';
+import random from './random.js';
+
+// Sample **n** random values from a collection using the modern version of the
+// [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher–Yates_shuffle).
+// If **n** is not specified, returns a single random element.
+// The internal `guard` argument allows it to work with `_.map`.
+export default function sample(obj, n, guard) {
+  if (n == null || guard) {
+    if (!isArrayLike(obj)) obj = values(obj);
+    return obj[random(obj.length - 1)];
+  }
+  var sample = isArrayLike(obj) ? clone(obj) : values(obj);
+  var length = getLength(sample);
+  n = Math.max(Math.min(n, length), 0);
+  var last = length - 1;
+  for (var index = 0; index < n; index++) {
+    var rand = random(index, last);
+    var temp = sample[index];
+    sample[index] = sample[rand];
+    sample[rand] = temp;
+  }
+  return sample.slice(0, n);
+}

package/node_modules/underscore/modules/shuffle.js

@@ -1,6 +1,6 @@
-import sample from './sample.js';
-
-// Shuffle a collection.
-export default function shuffle(obj) {
-  return sample(obj, Infinity);
-}
+import sample from './sample.js';
+
+// Shuffle a collection.
+export default function shuffle(obj) {
+  return sample(obj, Infinity);
+}

package/node_modules/underscore/modules/size.js

@@ -1,8 +1,8 @@
-import isArrayLike from './_isArrayLike.js';
-import keys from './keys.js';
-
-// Return the number of elements in a collection.
-export default function size(obj) {
-  if (obj == null) return 0;
-  return isArrayLike(obj) ? obj.length : keys(obj).length;
-}
+import isArrayLike from './_isArrayLike.js';
+import keys from './keys.js';
+
+// Return the number of elements in a collection.
+export default function size(obj) {
+  if (obj == null) return 0;
+  return isArrayLike(obj) ? obj.length : keys(obj).length;
+}

package/node_modules/underscore/modules/some.js

@@ -1,15 +1,15 @@
-import cb from './_cb.js';
-import isArrayLike from './_isArrayLike.js';
-import keys from './keys.js';
-
-// Determine if at least one element in the object passes a truth test.
-export default function some(obj, predicate, context) {
-  predicate = cb(predicate, context);
-  var _keys = !isArrayLike(obj) && keys(obj),
-      length = (_keys || obj).length;
-  for (var index = 0; index < length; index++) {
-    var currentKey = _keys ? _keys[index] : index;
-    if (predicate(obj[currentKey], currentKey, obj)) return true;
-  }
-  return false;
-}
+import cb from './_cb.js';
+import isArrayLike from './_isArrayLike.js';
+import keys from './keys.js';
+
+// Determine if at least one element in the object passes a truth test.
+export default function some(obj, predicate, context) {
+  predicate = cb(predicate, context);
+  var _keys = !isArrayLike(obj) && keys(obj),
+      length = (_keys || obj).length;
+  for (var index = 0; index < length; index++) {
+    var currentKey = _keys ? _keys[index] : index;
+    if (predicate(obj[currentKey], currentKey, obj)) return true;
+  }
+  return false;
+}

package/node_modules/underscore/modules/sortBy.js

@@ -1,24 +1,24 @@
-import cb from './_cb.js';
-import pluck from './pluck.js';
-import map from './map.js';
-
-// Sort the object's values by a criterion produced by an iteratee.
-export default function sortBy(obj, iteratee, context) {
-  var index = 0;
-  iteratee = cb(iteratee, context);
-  return pluck(map(obj, function(value, key, list) {
-    return {
-      value: value,
-      index: index++,
-      criteria: iteratee(value, key, list)
-    };
-  }).sort(function(left, right) {
-    var a = left.criteria;
-    var b = right.criteria;
-    if (a !== b) {
-      if (a > b || a === void 0) return 1;
-      if (a < b || b === void 0) return -1;
-    }
-    return left.index - right.index;
-  }), 'value');
-}
+import cb from './_cb.js';
+import pluck from './pluck.js';
+import map from './map.js';
+
+// Sort the object's values by a criterion produced by an iteratee.
+export default function sortBy(obj, iteratee, context) {
+  var index = 0;
+  iteratee = cb(iteratee, context);
+  return pluck(map(obj, function(value, key, list) {
+    return {
+      value: value,
+      index: index++,
+      criteria: iteratee(value, key, list)
+    };
+  }).sort(function(left, right) {
+    var a = left.criteria;
+    var b = right.criteria;
+    if (a !== b) {
+      if (a > b || a === void 0) return 1;
+      if (a < b || b === void 0) return -1;
+    }
+    return left.index - right.index;
+  }), 'value');
+}

package/node_modules/underscore/modules/sortedIndex.js

@@ -1,15 +1,15 @@
-import cb from './_cb.js';
-import getLength from './_getLength.js';
-
-// Use a comparator function to figure out the smallest index at which
-// an object should be inserted so as to maintain order. Uses binary search.
-export default function sortedIndex(array, obj, iteratee, context) {
-  iteratee = cb(iteratee, context, 1);
-  var value = iteratee(obj);
-  var low = 0, high = getLength(array);
-  while (low < high) {
-    var mid = Math.floor((low + high) / 2);
-    if (iteratee(array[mid]) < value) low = mid + 1; else high = mid;
-  }
-  return low;
-}
+import cb from './_cb.js';
+import getLength from './_getLength.js';
+
+// Use a comparator function to figure out the smallest index at which
+// an object should be inserted so as to maintain order. Uses binary search.
+export default function sortedIndex(array, obj, iteratee, context) {
+  iteratee = cb(iteratee, context, 1);
+  var value = iteratee(obj);
+  var low = 0, high = getLength(array);
+  while (low < high) {
+    var mid = Math.floor((low + high) / 2);
+    if (iteratee(array[mid]) < value) low = mid + 1; else high = mid;
+  }
+  return low;
+}

package/node_modules/underscore/modules/tap.js

@@ -1,7 +1,7 @@
-// Invokes `interceptor` with the `obj` and then returns `obj`.
-// The primary purpose of this method is to "tap into" a method chain, in
-// order to perform operations on intermediate results within the chain.
-export default function tap(obj, interceptor) {
-  interceptor(obj);
-  return obj;
-}
+// Invokes `interceptor` with the `obj` and then returns `obj`.
+// The primary purpose of this method is to "tap into" a method chain, in
+// order to perform operations on intermediate results within the chain.
+export default function tap(obj, interceptor) {
+  interceptor(obj);
+  return obj;
+}