@pdftron/pdfnet-node 10.3.0 → 10.3.1-beta

package/node_modules/underscore/amd/sample.js

@@ -1,27 +1,27 @@
-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;
-
-});
+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 +1,7 @@
-define(['./_unmethodize', './_setup'], function (_unmethodize, _setup) {
-
-	var shift = _unmethodize(_setup.ArrayProto.shift);
-
-	return shift;
-
-});
+define(['./_unmethodize', './_setup'], function (_unmethodize, _setup) {
+
+	var shift = _unmethodize(_setup.ArrayProto.shift);
+
+	return shift;
+
+});

package/node_modules/underscore/amd/shuffle.js

@@ -1,10 +1,10 @@
-define(['./sample'], function (sample) {
-
-  // Shuffle a collection.
-  function shuffle(obj) {
-    return sample(obj, Infinity);
-  }
-
-  return shuffle;
-
-});
+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 +1,11 @@
-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;
-
-});
+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 +1,7 @@
-define(['./_unmethodize', './_setup'], function (_unmethodize, _setup) {
-
-	var slice = _unmethodize(_setup.ArrayProto.slice);
-
-	return slice;
-
-});
+define(['./_unmethodize', './_setup'], function (_unmethodize, _setup) {
+
+	var slice = _unmethodize(_setup.ArrayProto.slice);
+
+	return slice;
+
+});

package/node_modules/underscore/amd/some.js

@@ -1,17 +1,17 @@
-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;
-
-});
+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 +1,7 @@
-define(['./_unmethodize', './_setup'], function (_unmethodize, _setup) {
-
-	var sort = _unmethodize(_setup.ArrayProto.sort);
-
-	return sort;
-
-});
+define(['./_unmethodize', './_setup'], function (_unmethodize, _setup) {
+
+	var sort = _unmethodize(_setup.ArrayProto.sort);
+
+	return sort;
+
+});

package/node_modules/underscore/amd/sortBy.js

@@ -1,26 +1,26 @@
-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;
-
-});
+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 +1,18 @@
-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;
-
-});
+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 +1,11 @@
-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;
-
-});
+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 +1,7 @@
-define(['./_unmethodize', './_setup'], function (_unmethodize, _setup) {
-
-	var splice = _unmethodize(_setup.ArrayProto.splice);
-
-	return splice;
-
-});
+define(['./_unmethodize', './_setup'], function (_unmethodize, _setup) {
+
+	var splice = _unmethodize(_setup.ArrayProto.splice);
+
+	return splice;
+
+});

package/node_modules/underscore/amd/tap.js

@@ -1,13 +1,13 @@
-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;
-
-});
+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;
+
+});

package/node_modules/underscore/amd/template.js

@@ -1,95 +1,95 @@
-define(['./underscore', './defaults', './templateSettings'], function (underscore, defaults, templateSettings) {
-
-  // When customizing `_.templateSettings`, if you don't want to define an
-  // interpolation, evaluation or escaping regex, we need one that is
-  // guaranteed not to match.
-  var noMatch = /(.)^/;
-
-  // Certain characters need to be escaped so that they can be put into a
-  // string literal.
-  var escapes = {
-    "'": "'",
-    '\\': '\\',
-    '\r': 'r',
-    '\n': 'n',
-    '\u2028': 'u2028',
-    '\u2029': 'u2029'
-  };
-
-  var escapeRegExp = /\\|'|\r|\n|\u2028|\u2029/g;
-
-  function escapeChar(match) {
-    return '\\' + escapes[match];
-  }
-
-  var bareIdentifier = /^\s*(\w|\$)+\s*$/;
-
-  // JavaScript micro-templating, similar to John Resig's implementation.
-  // Underscore templating handles arbitrary delimiters, preserves whitespace,
-  // and correctly escapes quotes within interpolated code.
-  // NB: `oldSettings` only exists for backwards compatibility.
-  function template(text, settings, oldSettings) {
-    if (!settings && oldSettings) settings = oldSettings;
-    settings = defaults({}, settings, underscore.templateSettings);
-
-    // Combine delimiters into one regular expression via alternation.
-    var matcher = RegExp([
-      (settings.escape || noMatch).source,
-      (settings.interpolate || noMatch).source,
-      (settings.evaluate || noMatch).source
-    ].join('|') + '|$', 'g');
-
-    // Compile the template source, escaping string literals appropriately.
-    var index = 0;
-    var source = "__p+='";
-    text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {
-      source += text.slice(index, offset).replace(escapeRegExp, escapeChar);
-      index = offset + match.length;
-
-      if (escape) {
-        source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'";
-      } else if (interpolate) {
-        source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'";
-      } else if (evaluate) {
-        source += "';\n" + evaluate + "\n__p+='";
-      }
-
-      // Adobe VMs need the match returned to produce the correct offset.
-      return match;
-    });
-    source += "';\n";
-
-    var argument = settings.variable;
-    if (argument) {
-      if (!bareIdentifier.test(argument)) throw new Error(argument);
-    } else {
-      // If a variable is not specified, place data values in local scope.
-      source = 'with(obj||{}){\n' + source + '}\n';
-      argument = 'obj';
-    }
-
-    source = "var __t,__p='',__j=Array.prototype.join," +
-      "print=function(){__p+=__j.call(arguments,'');};\n" +
-      source + 'return __p;\n';
-
-    var render;
-    try {
-      render = new Function(argument, '_', source);
-    } catch (e) {
-      e.source = source;
-      throw e;
-    }
-
-    var template = function(data) {
-      return render.call(this, data, underscore);
-    };
-
-    // Provide the compiled source as a convenience for precompilation.
-    template.source = 'function(' + argument + '){\n' + source + '}';
-
-    return template;
-  }
-
-  return template;
-
-});
+define(['./underscore', './defaults', './templateSettings'], function (underscore, defaults, templateSettings) {
+
+  // When customizing `_.templateSettings`, if you don't want to define an
+  // interpolation, evaluation or escaping regex, we need one that is
+  // guaranteed not to match.
+  var noMatch = /(.)^/;
+
+  // Certain characters need to be escaped so that they can be put into a
+  // string literal.
+  var escapes = {
+    "'": "'",
+    '\\': '\\',
+    '\r': 'r',
+    '\n': 'n',
+    '\u2028': 'u2028',
+    '\u2029': 'u2029'
+  };
+
+  var escapeRegExp = /\\|'|\r|\n|\u2028|\u2029/g;
+
+  function escapeChar(match) {
+    return '\\' + escapes[match];
+  }
+
+  var bareIdentifier = /^\s*(\w|\$)+\s*$/;
+
+  // JavaScript micro-templating, similar to John Resig's implementation.
+  // Underscore templating handles arbitrary delimiters, preserves whitespace,
+  // and correctly escapes quotes within interpolated code.
+  // NB: `oldSettings` only exists for backwards compatibility.
+  function template(text, settings, oldSettings) {
+    if (!settings && oldSettings) settings = oldSettings;
+    settings = defaults({}, settings, underscore.templateSettings);
+
+    // Combine delimiters into one regular expression via alternation.
+    var matcher = RegExp([
+      (settings.escape || noMatch).source,
+      (settings.interpolate || noMatch).source,
+      (settings.evaluate || noMatch).source
+    ].join('|') + '|$', 'g');
+
+    // Compile the template source, escaping string literals appropriately.
+    var index = 0;
+    var source = "__p+='";
+    text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {
+      source += text.slice(index, offset).replace(escapeRegExp, escapeChar);
+      index = offset + match.length;
+
+      if (escape) {
+        source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'";
+      } else if (interpolate) {
+        source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'";
+      } else if (evaluate) {
+        source += "';\n" + evaluate + "\n__p+='";
+      }
+
+      // Adobe VMs need the match returned to produce the correct offset.
+      return match;
+    });
+    source += "';\n";
+
+    var argument = settings.variable;
+    if (argument) {
+      if (!bareIdentifier.test(argument)) throw new Error(argument);
+    } else {
+      // If a variable is not specified, place data values in local scope.
+      source = 'with(obj||{}){\n' + source + '}\n';
+      argument = 'obj';
+    }
+
+    source = "var __t,__p='',__j=Array.prototype.join," +
+      "print=function(){__p+=__j.call(arguments,'');};\n" +
+      source + 'return __p;\n';
+
+    var render;
+    try {
+      render = new Function(argument, '_', source);
+    } catch (e) {
+      e.source = source;
+      throw e;
+    }
+
+    var template = function(data) {
+      return render.call(this, data, underscore);
+    };
+
+    // Provide the compiled source as a convenience for precompilation.
+    template.source = 'function(' + argument + '){\n' + source + '}';
+
+    return template;
+  }
+
+  return template;
+
+});

package/node_modules/underscore/amd/templateSettings.js

@@ -1,13 +1,13 @@
-define(['./underscore'], function (underscore) {
-
-  // By default, Underscore uses ERB-style template delimiters. Change the
-  // following template settings to use alternative delimiters.
-  var templateSettings = underscore.templateSettings = {
-    evaluate: /<%([\s\S]+?)%>/g,
-    interpolate: /<%=([\s\S]+?)%>/g,
-    escape: /<%-([\s\S]+?)%>/g
-  };
-
-  return templateSettings;
-
-});
+define(['./underscore'], function (underscore) {
+
+  // By default, Underscore uses ERB-style template delimiters. Change the
+  // following template settings to use alternative delimiters.
+  var templateSettings = underscore.templateSettings = {
+    evaluate: /<%([\s\S]+?)%>/g,
+    interpolate: /<%=([\s\S]+?)%>/g,
+    escape: /<%-([\s\S]+?)%>/g
+  };
+
+  return templateSettings;
+
+});