@pdftron/pdfnet-node 10.6.0-beta → 10.6.0-beta-4

package/node_modules/underscore/modules/iteratee.js

@@ -1,10 +0,0 @@
-import _ from './underscore.js';
-import baseIteratee from './_baseIteratee.js';
-
-// External wrapper for our callback generator. Users may customize
-// `_.iteratee` if they want additional predicate/iteratee shorthand styles.
-// This abstraction hides the internal-only `argCount` argument.
-export default function iteratee(value, context) {
-  return baseIteratee(value, context, Infinity);
-}
-_.iteratee = iteratee;

package/node_modules/underscore/modules/keys.js

@@ -1,16 +0,0 @@
-import isObject from './isObject.js';
-import { nativeKeys, hasEnumBug } from './_setup.js';
-import has from './_has.js';
-import collectNonEnumProps from './_collectNonEnumProps.js';
-
-// Retrieve the names of an object's own properties.
-// Delegates to **ECMAScript 5**'s native `Object.keys`.
-export default function keys(obj) {
-  if (!isObject(obj)) return [];
-  if (nativeKeys) return nativeKeys(obj);
-  var keys = [];
-  for (var key in obj) if (has(obj, key)) keys.push(key);
-  // Ahem, IE < 9.
-  if (hasEnumBug) collectNonEnumProps(obj, keys);
-  return keys;
-}

package/node_modules/underscore/modules/last.js

@@ -1,9 +0,0 @@
-import rest from './rest.js';
-
-// Get the last element of an array. Passing **n** will return the last N
-// values in the array.
-export default function last(array, n, guard) {
-  if (array == null || array.length < 1) return n == null || guard ? void 0 : [];
-  if (n == null || guard) return array[array.length - 1];
-  return rest(array, Math.max(0, array.length - n));
-}

package/node_modules/underscore/modules/lastIndexOf.js

@@ -1,6 +0,0 @@
-import findLastIndex from './findLastIndex.js';
-import createIndexFinder from './_createIndexFinder.js';
-
-// Return the position of the last occurrence of an item in an array,
-// or -1 if the item is not included in the array.
-export default createIndexFinder(-1, findLastIndex);

package/node_modules/underscore/modules/map.js

@@ -1,16 +0,0 @@
-import cb from './_cb.js';
-import isArrayLike from './_isArrayLike.js';
-import keys from './keys.js';
-
-// Return the results of applying the iteratee to each element.
-export default function map(obj, iteratee, context) {
-  iteratee = cb(iteratee, context);
-  var _keys = !isArrayLike(obj) && keys(obj),
-      length = (_keys || obj).length,
-      results = Array(length);
-  for (var index = 0; index < length; index++) {
-    var currentKey = _keys ? _keys[index] : index;
-    results[index] = iteratee(obj[currentKey], currentKey, obj);
-  }
-  return results;
-}

package/node_modules/underscore/modules/mapObject.js

@@ -1,16 +0,0 @@
-import cb from './_cb.js';
-import keys from './keys.js';
-
-// Returns the results of applying the `iteratee` to each element of `obj`.
-// In contrast to `_.map` it returns an object.
-export default function mapObject(obj, iteratee, context) {
-  iteratee = cb(iteratee, context);
-  var _keys = keys(obj),
-      length = _keys.length,
-      results = {};
-  for (var index = 0; index < length; index++) {
-    var currentKey = _keys[index];
-    results[currentKey] = iteratee(obj[currentKey], currentKey, obj);
-  }
-  return results;
-}

package/node_modules/underscore/modules/matcher.js

@@ -1,11 +0,0 @@
-import extendOwn from './extendOwn.js';
-import isMatch from './isMatch.js';
-
-// Returns a predicate for checking whether an object has a given set of
-// `key:value` pairs.
-export default function matcher(attrs) {
-  attrs = extendOwn({}, attrs);
-  return function(obj) {
-    return isMatch(obj, attrs);
-  };
-}

package/node_modules/underscore/modules/max.js

@@ -1,29 +0,0 @@
-import isArrayLike from './_isArrayLike.js';
-import values from './values.js';
-import cb from './_cb.js';
-import each from './each.js';
-
-// Return the maximum element (or element-based computation).
-export default function max(obj, iteratee, context) {
-  var result = -Infinity, lastComputed = -Infinity,
-      value, computed;
-  if (iteratee == null || typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null) {
-    obj = isArrayLike(obj) ? obj : values(obj);
-    for (var i = 0, length = obj.length; i < length; i++) {
-      value = obj[i];
-      if (value != null && value > result) {
-        result = value;
-      }
-    }
-  } else {
-    iteratee = cb(iteratee, context);
-    each(obj, function(v, index, list) {
-      computed = iteratee(v, index, list);
-      if (computed > lastComputed || computed === -Infinity && result === -Infinity) {
-        result = v;
-        lastComputed = computed;
-      }
-    });
-  }
-  return result;
-}

package/node_modules/underscore/modules/memoize.js

@@ -1,13 +0,0 @@
-import has from './_has.js';
-
-// Memoize an expensive function by storing its results.
-export default function memoize(func, hasher) {
-  var memoize = function(key) {
-    var cache = memoize.cache;
-    var address = '' + (hasher ? hasher.apply(this, arguments) : key);
-    if (!has(cache, address)) cache[address] = func.apply(this, arguments);
-    return cache[address];
-  };
-  memoize.cache = {};
-  return memoize;
-}

package/node_modules/underscore/modules/min.js

@@ -1,29 +0,0 @@
-import isArrayLike from './_isArrayLike.js';
-import values from './values.js';
-import cb from './_cb.js';
-import each from './each.js';
-
-// Return the minimum element (or element-based computation).
-export default function min(obj, iteratee, context) {
-  var result = Infinity, lastComputed = Infinity,
-      value, computed;
-  if (iteratee == null || typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null) {
-    obj = isArrayLike(obj) ? obj : values(obj);
-    for (var i = 0, length = obj.length; i < length; i++) {
-      value = obj[i];
-      if (value != null && value < result) {
-        result = value;
-      }
-    }
-  } else {
-    iteratee = cb(iteratee, context);
-    each(obj, function(v, index, list) {
-      computed = iteratee(v, index, list);
-      if (computed < lastComputed || computed === Infinity && result === Infinity) {
-        result = v;
-        lastComputed = computed;
-      }
-    });
-  }
-  return result;
-}

package/node_modules/underscore/modules/mixin.js

@@ -1,18 +0,0 @@
-import _ from './underscore.js';
-import each from './each.js';
-import functions from './functions.js';
-import { push } from './_setup.js';
-import chainResult from './_chainResult.js';
-
-// Add your own custom functions to the Underscore object.
-export default function mixin(obj) {
-  each(functions(obj), function(name) {
-    var func = _[name] = obj[name];
-    _.prototype[name] = function() {
-      var args = [this._wrapped];
-      push.apply(args, arguments);
-      return chainResult(this, func.apply(_, args));
-    };
-  });
-  return _;
-}

package/node_modules/underscore/modules/negate.js

@@ -1,6 +0,0 @@
-// Returns a negated version of the passed-in predicate.
-export default function negate(predicate) {
-  return function() {
-    return !predicate.apply(this, arguments);
-  };
-}

package/node_modules/underscore/modules/noop.js

@@ -1,2 +0,0 @@
-// Predicate-generating function. Often useful outside of Underscore.
-export default function noop(){}

package/node_modules/underscore/modules/now.js

@@ -1,4 +0,0 @@
-// A (possibly faster) way to get the current timestamp as an integer.
-export default Date.now || function() {
-  return new Date().getTime();
-};

package/node_modules/underscore/modules/object.js

@@ -1,16 +0,0 @@
-import getLength  from './_getLength.js';
-
-// Converts lists into objects. Pass either a single array of `[key, value]`
-// pairs, or two parallel arrays of the same length -- one of keys, and one of
-// the corresponding values. Passing by pairs is the reverse of `_.pairs`.
-export default function object(list, values) {
-  var result = {};
-  for (var i = 0, length = getLength(list); i < length; i++) {
-    if (values) {
-      result[list[i]] = values[i];
-    } else {
-      result[list[i][0]] = list[i][1];
-    }
-  }
-  return result;
-}

package/node_modules/underscore/modules/omit.js

@@ -1,22 +0,0 @@
-import restArguments from './restArguments.js';
-import isFunction from './isFunction.js';
-import negate from './negate.js';
-import map from './map.js';
-import flatten from './_flatten.js';
-import contains from './contains.js';
-import pick from './pick.js';
-
-// Return a copy of the object without the disallowed properties.
-export default restArguments(function(obj, keys) {
-  var iteratee = keys[0], context;
-  if (isFunction(iteratee)) {
-    iteratee = negate(iteratee);
-    if (keys.length > 1) context = keys[1];
-  } else {
-    keys = map(flatten(keys, false, false), String);
-    iteratee = function(value, key) {
-      return !contains(keys, key);
-    };
-  }
-  return pick(obj, iteratee, context);
-});

package/node_modules/underscore/modules/once.js

@@ -1,6 +0,0 @@
-import partial from './partial.js';
-import before from './before.js';
-
-// Returns a function that will be executed at most one time, no matter how
-// often you call it. Useful for lazy initialization.
-export default partial(before, 2);

package/node_modules/underscore/modules/pairs.js

@@ -1,13 +0,0 @@
-import keys from './keys.js';
-
-// Convert an object into a list of `[key, value]` pairs.
-// The opposite of `_.object` with one argument.
-export default function pairs(obj) {
-  var _keys = keys(obj);
-  var length = _keys.length;
-  var pairs = Array(length);
-  for (var i = 0; i < length; i++) {
-    pairs[i] = [_keys[i], obj[_keys[i]]];
-  }
-  return pairs;
-}

package/node_modules/underscore/modules/partial.js

@@ -1,24 +0,0 @@
-import restArguments from './restArguments.js';
-import executeBound from './_executeBound.js';
-import _ from './underscore.js';
-
-// Partially apply a function by creating a version that has had some of its
-// arguments pre-filled, without changing its dynamic `this` context. `_` acts
-// as a placeholder by default, allowing any combination of arguments to be
-// pre-filled. Set `_.partial.placeholder` for a custom placeholder argument.
-var partial = restArguments(function(func, boundArgs) {
-  var placeholder = partial.placeholder;
-  var bound = function() {
-    var position = 0, length = boundArgs.length;
-    var args = Array(length);
-    for (var i = 0; i < length; i++) {
-      args[i] = boundArgs[i] === placeholder ? arguments[position++] : boundArgs[i];
-    }
-    while (position < arguments.length) args.push(arguments[position++]);
-    return executeBound(func, bound, this, this, args);
-  };
-  return bound;
-});
-
-partial.placeholder = _;
-export default partial;

package/node_modules/underscore/modules/partition.js

@@ -1,7 +0,0 @@
-import group from './_group.js';
-
-// Split a collection into two arrays: one whose elements all pass the given
-// truth test, and one whose elements all do not pass the truth test.
-export default group(function(result, value, pass) {
-  result[pass ? 0 : 1].push(value);
-}, true);

package/node_modules/underscore/modules/pick.js

@@ -1,26 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-// 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 +0,0 @@
-// 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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-// 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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-// 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;
-}