@pdftron/pdfnet-node 9.4.2 → 9.5.0-1

package/node_modules/underscore/amd/memoize.js

@@ -1,17 +0,0 @@
-define(['./_has'], function (_has) {
-
-  // Memoize an expensive function by storing its results.
-  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;
-  }
-
-  return memoize;
-
-});

package/node_modules/underscore/amd/min.js

@@ -1,30 +0,0 @@
-define(['./_cb', './_isArrayLike', './each', './values'], function (_cb, _isArrayLike, each, values) {
-
-  // Return the minimum element (or element-based computation).
-  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;
-  }
-
-  return min;
-
-});

package/node_modules/underscore/amd/mixin.js

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

package/node_modules/underscore/amd/negate.js

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

package/node_modules/underscore/amd/noop.js

@@ -1,8 +0,0 @@
-define(function () {
-
-	// Predicate-generating function. Often useful outside of Underscore.
-	function noop(){}
-
-	return noop;
-
-});

package/node_modules/underscore/amd/now.js

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

package/node_modules/underscore/amd/object.js

@@ -1,20 +0,0 @@
-define(['./_getLength'], function (_getLength) {
-
-  // 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`.
-  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;
-  }
-
-  return object;
-
-});

package/node_modules/underscore/amd/omit.js

@@ -1,20 +0,0 @@
-define(['./isFunction', './_flatten', './restArguments', './contains', './negate', './map', './pick'], function (isFunction, _flatten, restArguments, contains, negate, map, pick) {
-
-  // Return a copy of the object without the disallowed properties.
-  var omit = 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);
-  });
-
-  return omit;
-
-});

package/node_modules/underscore/amd/once.js

@@ -1,9 +0,0 @@
-define(['./before', './partial'], function (before, partial) {
-
-	// Returns a function that will be executed at most one time, no matter how
-	// often you call it. Useful for lazy initialization.
-	var once = partial(before, 2);
-
-	return once;
-
-});

package/node_modules/underscore/amd/pairs.js

@@ -1,17 +0,0 @@
-define(['./keys'], function (keys) {
-
-  // Convert an object into a list of `[key, value]` pairs.
-  // The opposite of `_.object` with one argument.
-  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;
-  }
-
-  return pairs;
-
-});

package/node_modules/underscore/amd/partial.js

@@ -1,25 +0,0 @@
-define(['./underscore', './_executeBound', './restArguments'], function (underscore, _executeBound, restArguments) {
-
-  // 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 = underscore;
-
-  return partial;
-
-});

package/node_modules/underscore/amd/partition.js

@@ -1,11 +0,0 @@
-define(['./_group'], function (_group) {
-
-  // 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.
-  var partition = _group(function(result, value, pass) {
-    result[pass ? 0 : 1].push(value);
-  }, true);
-
-  return partition;
-
-});

package/node_modules/underscore/amd/pick.js

@@ -1,25 +0,0 @@
-define(['./isFunction', './_optimizeCb', './_flatten', './_keyInObj', './allKeys', './restArguments'], function (isFunction, _optimizeCb, _flatten, _keyInObj, allKeys, restArguments) {
-
-  // Return a copy of the object only containing the allowed properties.
-  var pick = 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;
-  });
-
-  return pick;
-
-});

package/node_modules/underscore/amd/pluck.js

@@ -1,10 +0,0 @@
-define(['./property', './map'], function (property, map) {
-
-  // Convenience version of a common use case of `_.map`: fetching a property.
-  function pluck(obj, key) {
-    return map(obj, property(key));
-  }
-
-  return pluck;
-
-});

package/node_modules/underscore/amd/pop.js

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

package/node_modules/underscore/amd/property.js

@@ -1,14 +0,0 @@
-define(['./_deepGet', './_toPath'], function (_deepGet, _toPath) {
-
-  // 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.
-  function property(path) {
-    path = _toPath(path);
-    return function(obj) {
-      return _deepGet(obj, path);
-    };
-  }
-
-  return property;
-
-});

package/node_modules/underscore/amd/propertyOf.js

@@ -1,13 +0,0 @@
-define(['./get', './noop'], function (get, noop) {
-
-  // Generates a function for a given object that returns a given property.
-  function propertyOf(obj) {
-    if (obj == null) return noop;
-    return function(path) {
-      return get(obj, path);
-    };
-  }
-
-  return propertyOf;
-
-});

package/node_modules/underscore/amd/push.js

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

package/node_modules/underscore/amd/random.js

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

package/node_modules/underscore/amd/range.js

@@ -1,27 +0,0 @@
-define(function () {
-
-  // 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).
-  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;
-  }
-
-  return range;
-
-});

package/node_modules/underscore/amd/reduce.js

@@ -1,9 +0,0 @@
-define(['./_createReduce'], function (_createReduce) {
-
-	// **Reduce** builds up a single result from a list of values, aka `inject`,
-	// or `foldl`.
-	var reduce = _createReduce(1);
-
-	return reduce;
-
-});

package/node_modules/underscore/amd/reduceRight.js

@@ -1,8 +0,0 @@
-define(['./_createReduce'], function (_createReduce) {
-
-	// The right-associative version of reduce, also known as `foldr`.
-	var reduceRight = _createReduce(-1);
-
-	return reduceRight;
-
-});

package/node_modules/underscore/amd/reject.js

@@ -1,10 +0,0 @@
-define(['./_cb', './filter', './negate'], function (_cb, filter, negate) {
-
-  // Return all the elements for which a truth test fails.
-  function reject(obj, predicate, context) {
-    return filter(obj, negate(_cb(predicate)), context);
-  }
-
-  return reject;
-
-});

package/node_modules/underscore/amd/rest.js

@@ -1,12 +0,0 @@
-define(['./_setup'], function (_setup) {
-
-  // 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`.
-  function rest(array, n, guard) {
-    return _setup.slice.call(array, n == null || guard ? 1 : n);
-  }
-
-  return rest;
-
-});

package/node_modules/underscore/amd/restArguments.js

@@ -1,33 +0,0 @@
-define(function () {
-
-  // 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".
-  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);
-    };
-  }
-
-  return restArguments;
-
-});

package/node_modules/underscore/amd/result.js

@@ -1,25 +0,0 @@
-define(['./isFunction', './_toPath'], function (isFunction, _toPath) {
-
-  // 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.
-  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;
-  }
-
-  return result;
-
-});

package/node_modules/underscore/amd/reverse.js

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

package/node_modules/underscore/amd/sample.js

@@ -1,27 +0,0 @@
-define(['./_getLength', './_isArrayLike', './clone', './values', './random'], function (_getLength, _isArrayLike, clone, values, random) {
-
-  // 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`.
-  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);
-  }
-
-  return sample;
-
-});

package/node_modules/underscore/amd/shift.js

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

package/node_modules/underscore/amd/shuffle.js

@@ -1,10 +0,0 @@
-define(['./sample'], function (sample) {
-
-  // Shuffle a collection.
-  function shuffle(obj) {
-    return sample(obj, Infinity);
-  }
-
-  return shuffle;
-
-});

package/node_modules/underscore/amd/size.js

@@ -1,11 +0,0 @@
-define(['./keys', './_isArrayLike'], function (keys, _isArrayLike) {
-
-  // Return the number of elements in a collection.
-  function size(obj) {
-    if (obj == null) return 0;
-    return _isArrayLike(obj) ? obj.length : keys(obj).length;
-  }
-
-  return size;
-
-});

package/node_modules/underscore/amd/slice.js

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

package/node_modules/underscore/amd/some.js

@@ -1,17 +0,0 @@
-define(['./keys', './_cb', './_isArrayLike'], function (keys, _cb, _isArrayLike) {
-
-  // Determine if at least one element in the object passes a truth test.
-  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;
-  }
-
-  return some;
-
-});

package/node_modules/underscore/amd/sort.js

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

package/node_modules/underscore/amd/sortBy.js

@@ -1,26 +0,0 @@
-define(['./_cb', './map', './pluck'], function (_cb, map, pluck) {
-
-  // Sort the object's values by a criterion produced by an iteratee.
-  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');
-  }
-
-  return sortBy;
-
-});

package/node_modules/underscore/amd/sortedIndex.js

@@ -1,18 +0,0 @@
-define(['./_cb', './_getLength'], function (_cb, _getLength) {
-
-  // 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.
-  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;
-  }
-
-  return sortedIndex;
-
-});

package/node_modules/underscore/amd/sortedLastIndex.js

@@ -1,11 +0,0 @@
-define(['./_binarySearch', './_cb', './_lessEqual'], function (_binarySearch, _cb, _lessEqual) {
-
-  // Use an iteratee to figure out the greatest index at which an object should be
-  // inserted so as to maintain order. Uses binary search.
-  function sortedLastIndex(array, obj, iteratee, context) {
-    return _binarySearch(array, obj, _cb(iteratee, context), _lessEqual);
-  }
-
-  return sortedLastIndex;
-
-});

package/node_modules/underscore/amd/splice.js

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

package/node_modules/underscore/amd/tap.js

@@ -1,13 +0,0 @@
-define(function () {
-
-  // 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.
-  function tap(obj, interceptor) {
-    interceptor(obj);
-    return obj;
-  }
-
-  return tap;
-
-});