@farukada/aws-langgraph-dynamodb-ts 0.0.5 → 0.0.6

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;
-
-});

package/node_modules/underscore/amd/_greater.js

@@ -1,10 +0,0 @@
-define(function () {
-
-  // A version of the `>` operator that can be passed around as a function.
-  function greater(left, right) {
-    return left > right;
-  }
-
-  return greater;
-
-});

package/node_modules/underscore/amd/_group.js

@@ -1,18 +0,0 @@
-define(['./_cb', './each'], function (_cb, each) {
-
-  // An internal function used for aggregate "group by" operations.
-  function group(behavior, partition) {
-    return function(obj, iteratee, context) {
-      var result = partition ? [[], []] : {};
-      iteratee = _cb(iteratee, context);
-      each(obj, function(value, index) {
-        var key = iteratee(value, index, obj);
-        behavior(result, value, key);
-      });
-      return result;
-    };
-  }
-
-  return group;
-
-});

package/node_modules/underscore/amd/_has.js

@@ -1,10 +0,0 @@
-define(['./_setup'], function (_setup) {
-
-  // Internal function to check whether `key` is an own property name of `obj`.
-  function has(obj, key) {
-    return obj != null && _setup.hasOwnProperty.call(obj, key);
-  }
-
-  return has;
-
-});

package/node_modules/underscore/amd/_hasObjectTag.js

@@ -1,7 +0,0 @@
-define(['./_tagTester'], function (_tagTester) {
-
-	var hasObjectTag = _tagTester('Object');
-
-	return hasObjectTag;
-
-});

package/node_modules/underscore/amd/_isArrayLike.js

@@ -1,11 +0,0 @@
-define(['./_getLength', './_createSizePropertyCheck'], function (_getLength, _createSizePropertyCheck) {
-
-	// Internal helper for collection methods to determine whether a collection
-	// should be iterated as an array or as an object.
-	// Related: https://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength
-	// Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094
-	var isArrayLike = _createSizePropertyCheck(_getLength);
-
-	return isArrayLike;
-
-});

package/node_modules/underscore/amd/_isBufferLike.js

@@ -1,9 +0,0 @@
-define(['./_createSizePropertyCheck', './_getByteLength'], function (_createSizePropertyCheck, _getByteLength) {
-
-	// Internal helper to determine whether we should spend extensive checks against
-	// `ArrayBuffer` et al.
-	var isBufferLike = _createSizePropertyCheck(_getByteLength);
-
-	return isBufferLike;
-
-});

package/node_modules/underscore/amd/_keyInObj.js

@@ -1,11 +0,0 @@
-define(function () {
-
-  // Internal `_.pick` helper function to determine whether `key` is an enumerable
-  // property name of `obj`.
-  function keyInObj(value, key, obj) {
-    return key in obj;
-  }
-
-  return keyInObj;
-
-});

package/node_modules/underscore/amd/_less.js

@@ -1,10 +0,0 @@
-define(function () {
-
-  // A version of the `<` operator that can be passed around as a function.
-  function less(left, right) {
-    return left < right;
-  }
-
-  return less;
-
-});

package/node_modules/underscore/amd/_lessEqual.js

@@ -1,10 +0,0 @@
-define(function () {
-
-  // A version of the `<=` operator that can be passed around as a function.
-  function lessEqual(left, right) {
-    return left <= right;
-  }
-
-  return lessEqual;
-
-});

package/node_modules/underscore/amd/_linearSearch.js

@@ -1,31 +0,0 @@
-define(['./_getLength', './isFunction'], function (_getLength, isFunction) {
-
-  // Internal function for linearly iterating over arrays.
-  function linearSearch(array, predicate, dir, start) {
-    var target, length = _getLength(array);
-    dir || (dir = 1);
-    start = (
-      start == null ? (dir > 0 ? 0 : length - 1) :
-      start < 0 ? (dir > 0 ? Math.max(0, start + length) : start + length) :
-      dir > 0 ? start : Math.min(start, length - 1)
-    );
-    // As a special case, in order to elide the `predicate` invocation on every
-    // loop iteration, we allow the caller to pass a value that should be found by
-    // strict equality comparison. This is somewhat like a rudimentary iteratee
-    // shorthand. It is used in `_.indexof` and `_.lastIndexOf`.
-    if (!isFunction(predicate)) {
-      target = predicate && predicate.value;
-      predicate = false;
-    }
-    for (; start >= 0 && start < length; start += dir) {
-      if (
-        predicate ? predicate(array[start], start, array) :
-        array[start] === target
-      ) return start;
-    }
-    return -1;
-  }
-
-  return linearSearch;
-
-});

package/node_modules/underscore/amd/_mapReduce.js

@@ -1,5 +0,0 @@
-define(function () {
-
-
-
-});

package/node_modules/underscore/amd/_methodFingerprint.js

@@ -1,44 +0,0 @@
-define(['exports', './isFunction', './_getLength', './allKeys'], function (exports, isFunction, _getLength, allKeys) {
-
-  // Since the regular `Object.prototype.toString` type tests don't work for
-  // some types in IE 11, we use a fingerprinting heuristic instead, based
-  // on the methods. It's not great, but it's the best we got.
-  // The fingerprint method lists are defined below.
-  function ie11fingerprint(methods) {
-    var length = _getLength(methods);
-    return function(obj) {
-      if (obj == null) return false;
-      // `Map`, `WeakMap` and `Set` have no enumerable keys.
-      var keys = allKeys(obj);
-      if (_getLength(keys)) return false;
-      for (var i = 0; i < length; i++) {
-        if (!isFunction(obj[methods[i]])) return false;
-      }
-      // If we are testing against `WeakMap`, we need to ensure that
-      // `obj` doesn't have a `forEach` method in order to distinguish
-      // it from a regular `Map`.
-      return methods !== weakMapMethods || !isFunction(obj[forEachName]);
-    };
-  }
-
-  // In the interest of compact minification, we write
-  // each string in the fingerprints only once.
-  var forEachName = 'forEach',
-      hasName = 'has',
-      commonInit = ['clear', 'delete'],
-      mapTail = ['get', hasName, 'set'];
-
-  // `Map`, `WeakMap` and `Set` each have slightly different
-  // combinations of the above sublists.
-  var mapMethods = commonInit.concat(forEachName, mapTail),
-      weakMapMethods = commonInit.concat(mapTail),
-      setMethods = ['add'].concat(commonInit, forEachName, hasName);
-
-  exports.ie11fingerprint = ie11fingerprint;
-  exports.mapMethods = mapMethods;
-  exports.setMethods = setMethods;
-  exports.weakMapMethods = weakMapMethods;
-
-  Object.defineProperty(exports, '__esModule', { value: true });
-
-});

package/node_modules/underscore/amd/_optimizeCb.js

@@ -1,27 +0,0 @@
-define(function () {
-
-  // Internal function that returns an efficient (for current engines) version
-  // of the passed-in callback, to be repeatedly applied in other Underscore
-  // functions.
-  function optimizeCb(func, context, argCount) {
-    if (context === void 0) return func;
-    switch (argCount == null ? 3 : argCount) {
-      case 1: return function(value) {
-        return func.call(context, value);
-      };
-      // The 2-argument case is omitted because we’re not using it.
-      case 3: return function(value, index, collection) {
-        return func.call(context, value, index, collection);
-      };
-      case 4: return function(accumulator, value, index, collection) {
-        return func.call(context, accumulator, value, index, collection);
-      };
-    }
-    return function() {
-      return func.apply(context, arguments);
-    };
-  }
-
-  return optimizeCb;
-
-});

package/node_modules/underscore/amd/_push.js

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

package/node_modules/underscore/amd/_pusher.js

@@ -1,13 +0,0 @@
-define(function () {
-
-  // Internal helper to generate a callback that will append
-  // its first argument to the closed-over `array`.
-  function pusher(array) {
-    return function(arg) {
-      array.push(arg);
-    };
-  }
-
-  return pusher;
-
-});

package/node_modules/underscore/amd/_sequence.js

@@ -1,18 +0,0 @@
-define(function () {
-
-  function sequence(iteratee, start, stop, step) {
-    if (stop == null) {
-      stop = start || 0;
-      start = 0;
-    }
-    if (!step) {
-      step = stop < start ? -1 : 1;
-    }
-    var rest = (stop - start) % step;
-    stop += (rest && step - rest);
-    for ( ; start != stop ; start += step) if (iteratee(start)) return start;
-  }
-
-  return sequence;
-
-});