@pdftron/pdfnet-node 9.5.0-beta → 10.0.0-beta

package/legal.txt

@@ -2,13 +2,13 @@
 Legal Notices:
 -----------------------------------------------------------------------------
 
-Copyright (c) 2001-2021 by PDFTron Systems, Inc. All Rights Reserved.
-PDFTron and PDFNet SDK are either trademarks and/or service marks 
-and/or registered trademarks of PDFTron Systems Incorporated 
+Copyright (c) 2001-2023 by Apryse Software Inc. All Rights Reserved.
+Apryse, PDFTron and PDFNet SDK are either trademarks and/or service marks 
+and/or registered trademarks of Apryse Software Incorporated 
 in Canada and/or other countries.
 
 The Software and information contained herein are proprietary to, and
-comprise valuable trade secrets of, PDFTron Systems Inc., which
+comprise valuable trade secrets of, Apryse Software Inc., which
 intends to preserve as trade secrets such Software and information.
 
 This Software is furnished pursuant to a written license agreement and
@@ -23,13 +23,13 @@ WARRANTIES OR CONDITIONS OF DESIGN, MERCHANTIBILITY, DURABILITY, FITNESS
 FOR A PARTICULAR PURPOSE AND THE WARRANTY AGAINST INFRINGEMENT. THE ENTIRE 
 RISK AS TO THE QUALITY AND PERFORMACE OF THE SOFTWARE IS BORNE BY THE USER.
 
-IN NO EVENT WILL PDFTRON’S AGGREGATE LIABILITY WITH RESPECT TO ANY AND ALL 
+IN NO EVENT WILL APRYSE’S AGGREGATE LIABILITY WITH RESPECT TO ANY AND ALL 
 CLAIMS AT ANY AND ALL TIMES ARISING FROM OR RELATED TO THE SOFTWARE, IN 
 CONTRACT, TORT (INCLUDING NEGLIGENCE OR BREACH OF ANY DUTY) OR OTHERWISE 
-EXCEED THE CONSIDERATION PAID TO PDFTRON, IF ANY, FOR A LICENSE TO THE 
-SOFTWARE. IN NO EVENT WILL PDFTRON BE LIABLE FOR ANY CONSEQUENTIAL, INDIRECT, 
+EXCEED THE CONSIDERATION PAID TO APRYSE, IF ANY, FOR A LICENSE TO THE 
+SOFTWARE. IN NO EVENT WILL APRYSE BE LIABLE FOR ANY CONSEQUENTIAL, INDIRECT, 
 SPECIAL, PUNITIVE, EXEMPLARY OR INCIDENTAL DAMAGES, LOSS OF GOODWILL OR 
-BUSINESS PROFITS, EVEN IF PDFTRON HAS BEEN ADVISED OF THE POSSIBILITY OF ANY
+BUSINESS PROFITS, EVEN IF APRYSE HAS BEEN ADVISED OF THE POSSIBILITY OF ANY
 SUCH LOSS OR DAMAGES. THE FOREGOING LIMITATION OF LIABILITY AND EXCLUSION 
 OF CERTAIN DAMAGES WILL APPLY TO THE EXTENT PERMITTED BY APPLICABLE LAW 
 REGARDLESS OF THE SUCCESS OR EFFECTIVENESS OF OTHER REMEDIES. 
@@ -124,7 +124,7 @@ and fitness for purpose.
 ---------------------------------------------------------------------------
 Boost
 
-CopyRight (c) 2001-2021 by PDFTron Systems Inc. All Rights Reserved.
+CopyRight (c) 2001-2023 by Apryse Software Inc. All Rights Reserved.
 CopyRight Aaron W. LaFramboise, Roland Schwarz, Michael Glassford 2004.
 CopyRight Anthony Williams 2007
 CopyRight Beman Dawes 2002-2010
@@ -629,4 +629,4 @@ Licenced under the MIT License,
 ---------------------------------------------------------------------------
 
 If you have any questions regarding the above information, 
-please contact PDFTron Systems Inc. directly via: info@pdftron.com.
+please contact Apryse Software Inc. directly via: info@apryse.com.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@pdftron/pdfnet-node",
-  "version": "9.5.0-beta",
+  "version": "10.0.0-beta",
   "main": "./lib/pdfnet.js",
   "types": "./lib/types.d.ts",
   "binary": {
@@ -14,8 +14,8 @@
     "install": "node-pre-gyp install --fallback-to-build=false"
   },
   "engines" : { "node" : ">=8 <19" },
-  "description": "This is the PDFTron SDK packaged as a Node.js module.",
-  "author": "PDFTron Systems Inc.",
+  "description": "This is the Apryse SDK packaged as a Node.js module.",
+  "author": "Apryse Software Inc.",
   "license": "Commercial",
   "homepage": "https://www.pdftron.com",
   "bundledDependencies": [

package/node_modules/underscore/LICENSE

@@ -1,23 +0,0 @@
-Copyright (c) 2009-2020 Jeremy Ashkenas, DocumentCloud and Investigative
-Reporters & Editors
-
-Permission is hereby granted, free of charge, to any person
-obtaining a copy of this software and associated documentation
-files (the "Software"), to deal in the Software without
-restriction, including without limitation the rights to use,
-copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the
-Software is furnished to do so, subject to the following
-conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
-OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
-HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
-WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
-OTHER DEALINGS IN THE SOFTWARE.

package/node_modules/underscore/README.md

@@ -1,28 +0,0 @@
-                       __
-                      /\ \                                                         __
-     __  __    ___    \_\ \     __   _ __   ____    ___    ___   _ __    __       /\_\    ____
-    /\ \/\ \ /' _ `\  /'_  \  /'__`\/\  __\/ ,__\  / ___\ / __`\/\  __\/'__`\     \/\ \  /',__\
-    \ \ \_\ \/\ \/\ \/\ \ \ \/\  __/\ \ \//\__, `\/\ \__//\ \ \ \ \ \//\  __/  __  \ \ \/\__, `\
-     \ \____/\ \_\ \_\ \___,_\ \____\\ \_\\/\____/\ \____\ \____/\ \_\\ \____\/\_\ _\ \ \/\____/
-      \/___/  \/_/\/_/\/__,_ /\/____/ \/_/ \/___/  \/____/\/___/  \/_/ \/____/\/_//\ \_\ \/___/
-                                                                                  \ \____/
-                                                                                   \/___/
-
-Underscore.js is a utility-belt library for JavaScript that provides
-support for the usual functional suspects (each, map, reduce, filter...)
-without extending any core JavaScript objects.
-
-For Docs, License, Tests, and pre-packed downloads, see:
-https://underscorejs.org
-
-For support and questions, please use
-[the gitter channel](https://gitter.im/jashkenas/underscore)
-or [stackoverflow](https://stackoverflow.com/search?q=underscore.js)
-
-Underscore is an open-sourced component of DocumentCloud:
-https://github.com/documentcloud
-
-Many thanks to our contributors:
-https://github.com/jashkenas/underscore/contributors
-
-This project adheres to a [code of conduct](CODE_OF_CONDUCT.md). By participating, you are expected to uphold this code.

package/node_modules/underscore/amd/_apply.js

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

package/node_modules/underscore/amd/_applyProperty.js

@@ -1,14 +0,0 @@
-define(function () {
-
-  // Internal helper that wraps an `iteratee` to call it with the
-  // property of a closed-over `object`. Useful when iterating over
-  // an array of keys of `object`.
-  function applyProperty(iteratee, object) {
-    return function(key) {
-      return iteratee(object[key], key, object);
-    };
-  }
-
-  return applyProperty;
-
-});

package/node_modules/underscore/amd/_arrayAccessors.js

@@ -1,11 +0,0 @@
-define(['exports', './concat', './join', './slice'], function (exports, concat, join, slice) {
-
-
-
-	exports.concat = concat;
-	exports.join = join;
-	exports.slice = slice;
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-});

package/node_modules/underscore/amd/_arrayMutators.js

@@ -1,15 +0,0 @@
-define(['exports', './pop', './push', './reverse', './shift', './sort', './splice', './unshift'], function (exports, pop, push, reverse, shift, sort, splice, unshift) {
-
-
-
-	exports.pop = pop;
-	exports.push = push;
-	exports.reverse = reverse;
-	exports.shift = shift;
-	exports.sort = sort;
-	exports.splice = splice;
-	exports.unshift = unshift;
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-});

package/node_modules/underscore/amd/_baseCreate.js

@@ -1,21 +0,0 @@
-define(['./isObject', './_setup'], function (isObject, _setup) {
-
-  // Create a naked function reference for surrogate-prototype-swapping.
-  function ctor() {
-    return function(){};
-  }
-
-  // An internal function for creating a new object that inherits from another.
-  function baseCreate(prototype) {
-    if (!isObject(prototype)) return {};
-    if (_setup.nativeCreate) return _setup.nativeCreate(prototype);
-    var Ctor = ctor();
-    Ctor.prototype = prototype;
-    var result = new Ctor;
-    Ctor.prototype = null;
-    return result;
-  }
-
-  return baseCreate;
-
-});

package/node_modules/underscore/amd/_baseIteratee.js

@@ -1,15 +0,0 @@
-define(['./isObject', './identity', './isFunction', './isArray', './matcher', './property', './_optimizeCb'], function (isObject, identity, isFunction, isArray, matcher, property, _optimizeCb) {
-
-  // An internal function to generate callbacks that can be applied to each
-  // element in a collection, returning the desired result — either `_.identity`,
-  // an arbitrary callback, a property matcher, or a property accessor.
-  function baseIteratee(value, context, argCount) {
-    if (value == null) return identity;
-    if (isFunction(value)) return _optimizeCb(value, context, argCount);
-    if (isObject(value) && !isArray(value)) return matcher(value);
-    return property(value);
-  }
-
-  return baseIteratee;
-
-});

package/node_modules/underscore/amd/_binarySearch.js

@@ -1,17 +0,0 @@
-define(['./_getLength'], function (_getLength) {
-
-  // Iteratively cut `array` in half to figure out the index at which `obj` should
-  // be inserted so as to maintain the order defined by `compare`.
-  function binarySearch(array, obj, iteratee, compare) {
-    var value = iteratee(obj);
-    var low = 0, high = _getLength(array);
-    while (low < high) {
-      var mid = Math.floor((low + high) / 2);
-      if (compare(iteratee(array[mid]), value)) low = mid + 1; else high = mid;
-    }
-    return low;
-  }
-
-  return binarySearch;
-
-});

package/node_modules/underscore/amd/_bindCb.js

@@ -1,14 +0,0 @@
-define(function () {
-
-  // Internal function that returns a bound version of the passed-in callback, to
-  // be repeatedly applied in other Underscore functions.
-  function bindCb(func, context) {
-    if (context === void 0) return func;
-    return function() {
-      return func.apply(context, arguments);
-    };
-  }
-
-  return bindCb;
-
-});

package/node_modules/underscore/amd/_bindCb4.js

@@ -1,17 +0,0 @@
-define(function () {
-
-  // In Firefox, `Function.prototype.call` is faster than
-  // `Function.prototype.apply`. In the optimized variant of
-  // `bindCb` below, we exploit the fact that no Underscore
-  // function passes more than four arguments to a callback.
-  // **NOT general enough for use outside of Underscore.**
-  function bindCb4(func, context) {
-    if (context === void 0) return func;
-    return function(a1, a2, a3, a4) {
-      return func.call(context, a1, a2, a3, a4);
-    };
-  }
-
-  return bindCb4;
-
-});

package/node_modules/underscore/amd/_byValue.js

@@ -1,11 +0,0 @@
-define(function () {
-
-  // Internal wrapper to enable match-by-value mode in `linearSearch`.
-  function byValue(value) {
-    if (!(this instanceof byValue)) return new byValue(value);
-    this.value = value;
-  }
-
-  return byValue;
-
-});

package/node_modules/underscore/amd/_cb.js

@@ -1,12 +0,0 @@
-define(['./underscore', './_baseIteratee', './iteratee'], function (underscore, _baseIteratee, iteratee) {
-
-  // The function we call internally to generate a callback. It invokes
-  // `_.iteratee` if overridden, otherwise `baseIteratee`.
-  function cb(value, context, argCount) {
-    if (underscore.iteratee !== iteratee) return underscore.iteratee(value, context);
-    return _baseIteratee(value, context, argCount);
-  }
-
-  return cb;
-
-});

package/node_modules/underscore/amd/_chainResult.js

@@ -1,10 +0,0 @@
-define(['./underscore'], function (underscore) {
-
-  // Helper function to continue chaining intermediate results.
-  function chainResult(instance, obj) {
-    return instance._chain ? underscore(obj).chain() : obj;
-  }
-
-  return chainResult;
-
-});

package/node_modules/underscore/amd/_collectNonEnumProps.js

@@ -1,42 +0,0 @@
-define(['./_setup', './isFunction', './_has'], function (_setup, isFunction, _has) {
-
-  // Internal helper to create a simple lookup structure.
-  // `collectNonEnumProps` used to depend on `_.contains`, but this led to
-  // circular imports. `emulatedSet` is a one-off solution that only works for
-  // arrays of strings.
-  function emulatedSet(keys) {
-    var hash = {};
-    for (var l = keys.length, i = 0; i < l; ++i) hash[keys[i]] = true;
-    return {
-      contains: function(key) { return hash[key]; },
-      push: function(key) {
-        hash[key] = true;
-        return keys.push(key);
-      }
-    };
-  }
-
-  // Internal helper. Checks `keys` for the presence of keys in IE < 9 that won't
-  // be iterated by `for key in ...` and thus missed. Extends `keys` in place if
-  // needed.
-  function collectNonEnumProps(obj, keys) {
-    keys = emulatedSet(keys);
-    var nonEnumIdx = _setup.nonEnumerableProps.length;
-    var constructor = obj.constructor;
-    var proto = isFunction(constructor) && constructor.prototype || _setup.ObjProto;
-
-    // Constructor is a special case.
-    var prop = 'constructor';
-    if (_has(obj, prop) && !keys.contains(prop)) keys.push(prop);
-
-    while (nonEnumIdx--) {
-      prop = _setup.nonEnumerableProps[nonEnumIdx];
-      if (prop in obj && obj[prop] !== proto[prop] && !keys.contains(prop)) {
-        keys.push(prop);
-      }
-    }
-  }
-
-  return collectNonEnumProps;
-
-});

package/node_modules/underscore/amd/_createAssigner.js

@@ -1,24 +0,0 @@
-define(function () {
-
-  // An internal function for creating assigner functions.
-  function createAssigner(keysFunc, defaults) {
-    return function(obj) {
-      var length = arguments.length;
-      if (defaults) obj = Object(obj);
-      if (length < 2 || obj == null) return obj;
-      for (var index = 1; index < length; index++) {
-        var source = arguments[index],
-            keys = keysFunc(source),
-            l = keys.length;
-        for (var i = 0; i < l; i++) {
-          var key = keys[i];
-          if (!defaults || obj[key] === void 0) obj[key] = source[key];
-        }
-      }
-      return obj;
-    };
-  }
-
-  return createAssigner;
-
-});

package/node_modules/underscore/amd/_createEscaper.js

@@ -1,21 +0,0 @@
-define(['./keys'], function (keys) {
-
-  // Internal helper to generate functions for escaping and unescaping strings
-  // to/from HTML interpolation.
-  function createEscaper(map) {
-    var escaper = function(match) {
-      return map[match];
-    };
-    // Regexes for identifying a key that needs to be escaped.
-    var source = '(?:' + keys(map).join('|') + ')';
-    var testRegexp = RegExp(source);
-    var replaceRegexp = RegExp(source, 'g');
-    return function(string) {
-      string = string == null ? '' : '' + string;
-      return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;
-    };
-  }
-
-  return createEscaper;
-
-});

package/node_modules/underscore/amd/_createIndexFinder.js

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

package/node_modules/underscore/amd/_executeBound.js

@@ -1,16 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-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 +0,0 @@
-define(['./_shallowProperty'], function (_shallowProperty) {
-
-	// Internal helper to obtain the `length` property of an object.
-	var getLength = _shallowProperty('length');
-
-	return getLength;
-
-});