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

package/node_modules/underscore/amd/isEqual.js

@@ -1,133 +0,0 @@
-define(['./_setup', './isFunction', './_has', './keys', './underscore', './_getByteLength', './_stringTagBug', './_toBufferView', './isDataView', './isTypedArray'], function (_setup, isFunction, _has, keys, underscore, _getByteLength, _stringTagBug, _toBufferView, isDataView, isTypedArray) {
-
-  // We use this string twice, so give it a name for minification.
-  var tagDataView = '[object DataView]';
-
-  // Internal recursive comparison function for `_.isEqual`.
-  function eq(a, b, aStack, bStack) {
-    // Identical objects are equal. `0 === -0`, but they aren't identical.
-    // See the [Harmony `egal` proposal](https://wiki.ecmascript.org/doku.php?id=harmony:egal).
-    if (a === b) return a !== 0 || 1 / a === 1 / b;
-    // `null` or `undefined` only equal to itself (strict comparison).
-    if (a == null || b == null) return false;
-    // `NaN`s are equivalent, but non-reflexive.
-    if (a !== a) return b !== b;
-    // Exhaust primitive checks
-    var type = typeof a;
-    if (type !== 'function' && type !== 'object' && typeof b != 'object') return false;
-    return deepEq(a, b, aStack, bStack);
-  }
-
-  // Internal recursive comparison function for `_.isEqual`.
-  function deepEq(a, b, aStack, bStack) {
-    // Unwrap any wrapped objects.
-    if (a instanceof underscore) a = a._wrapped;
-    if (b instanceof underscore) b = b._wrapped;
-    // Compare `[[Class]]` names.
-    var className = _setup.toString.call(a);
-    if (className !== _setup.toString.call(b)) return false;
-    // Work around a bug in IE 10 - Edge 13.
-    if (_stringTagBug.hasStringTagBug && className == '[object Object]' && isDataView(a)) {
-      if (!isDataView(b)) return false;
-      className = tagDataView;
-    }
-    switch (className) {
-      // These types are compared by value.
-      case '[object RegExp]':
-        // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i')
-      case '[object String]':
-        // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is
-        // equivalent to `new String("5")`.
-        return '' + a === '' + b;
-      case '[object Number]':
-        // `NaN`s are equivalent, but non-reflexive.
-        // Object(NaN) is equivalent to NaN.
-        if (+a !== +a) return +b !== +b;
-        // An `egal` comparison is performed for other numeric values.
-        return +a === 0 ? 1 / +a === 1 / b : +a === +b;
-      case '[object Date]':
-      case '[object Boolean]':
-        // Coerce dates and booleans to numeric primitive values. Dates are compared by their
-        // millisecond representations. Note that invalid dates with millisecond representations
-        // of `NaN` are not equivalent.
-        return +a === +b;
-      case '[object Symbol]':
-        return _setup.SymbolProto.valueOf.call(a) === _setup.SymbolProto.valueOf.call(b);
-      case '[object ArrayBuffer]':
-      case tagDataView:
-        // Coerce to typed array so we can fall through.
-        return deepEq(_toBufferView(a), _toBufferView(b), aStack, bStack);
-    }
-
-    var areArrays = className === '[object Array]';
-    if (!areArrays && isTypedArray(a)) {
-        var byteLength = _getByteLength(a);
-        if (byteLength !== _getByteLength(b)) return false;
-        if (a.buffer === b.buffer && a.byteOffset === b.byteOffset) return true;
-        areArrays = true;
-    }
-    if (!areArrays) {
-      if (typeof a != 'object' || typeof b != 'object') return false;
-
-      // Objects with different constructors are not equivalent, but `Object`s or `Array`s
-      // from different frames are.
-      var aCtor = a.constructor, bCtor = b.constructor;
-      if (aCtor !== bCtor && !(isFunction(aCtor) && aCtor instanceof aCtor &&
-                               isFunction(bCtor) && bCtor instanceof bCtor)
-                          && ('constructor' in a && 'constructor' in b)) {
-        return false;
-      }
-    }
-    // Assume equality for cyclic structures. The algorithm for detecting cyclic
-    // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.
-
-    // Initializing stack of traversed objects.
-    // It's done here since we only need them for objects and arrays comparison.
-    aStack = aStack || [];
-    bStack = bStack || [];
-    var length = aStack.length;
-    while (length--) {
-      // Linear search. Performance is inversely proportional to the number of
-      // unique nested structures.
-      if (aStack[length] === a) return bStack[length] === b;
-    }
-
-    // Add the first object to the stack of traversed objects.
-    aStack.push(a);
-    bStack.push(b);
-
-    // Recursively compare objects and arrays.
-    if (areArrays) {
-      // Compare array lengths to determine if a deep comparison is necessary.
-      length = a.length;
-      if (length !== b.length) return false;
-      // Deep compare the contents, ignoring non-numeric properties.
-      while (length--) {
-        if (!eq(a[length], b[length], aStack, bStack)) return false;
-      }
-    } else {
-      // Deep compare objects.
-      var _keys = keys(a), key;
-      length = _keys.length;
-      // Ensure that both objects contain the same number of properties before comparing deep equality.
-      if (keys(b).length !== length) return false;
-      while (length--) {
-        // Deep compare each member
-        key = _keys[length];
-        if (!(_has(b, key) && eq(a[key], b[key], aStack, bStack))) return false;
-      }
-    }
-    // Remove the first object from the stack of traversed objects.
-    aStack.pop();
-    bStack.pop();
-    return true;
-  }
-
-  // Perform a deep comparison to check if two objects are equal.
-  function isEqual(a, b) {
-    return eq(a, b);
-  }
-
-  return isEqual;
-
-});

package/node_modules/underscore/amd/isError.js

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

package/node_modules/underscore/amd/isFinite.js

@@ -1,10 +0,0 @@
-define(['./_setup', './isSymbol'], function (_setup, isSymbol) {
-
-  // Is a given object a finite number?
-  function isFinite(obj) {
-    return !isSymbol(obj) && _setup._isFinite(obj) && !isNaN(parseFloat(obj));
-  }
-
-  return isFinite;
-
-});

package/node_modules/underscore/amd/isFunction.js

@@ -1,18 +0,0 @@
-define(['./_setup', './_tagTester'], function (_setup, _tagTester) {
-
-  var isFunction = _tagTester('Function');
-
-  // Optimize `isFunction` if appropriate. Work around some `typeof` bugs in old
-  // v8, IE 11 (#1621), Safari 8 (#1929), and PhantomJS (#2236).
-  var nodelist = _setup.root.document && _setup.root.document.childNodes;
-  if (typeof /./ != 'function' && typeof Int8Array != 'object' && typeof nodelist != 'function') {
-    isFunction = function(obj) {
-      return typeof obj == 'function' || false;
-    };
-  }
-
-  var isFunction$1 = isFunction;
-
-  return isFunction$1;
-
-});

package/node_modules/underscore/amd/isMap.js

@@ -1,7 +0,0 @@
-define(['./_tagTester', './_methodFingerprint', './_stringTagBug'], function (_tagTester, _methodFingerprint, _stringTagBug) {
-
-	var isMap = _stringTagBug.isIE11 ? _methodFingerprint.ie11fingerprint(_methodFingerprint.mapMethods) : _tagTester('Map');
-
-	return isMap;
-
-});

package/node_modules/underscore/amd/isMatch.js

@@ -1,17 +0,0 @@
-define(['./keys'], function (keys) {
-
-  // Returns whether an object has a given set of `key:value` pairs.
-  function isMatch(object, attrs) {
-    var _keys = keys(attrs), length = _keys.length;
-    if (object == null) return !length;
-    var obj = Object(object);
-    for (var i = 0; i < length; i++) {
-      var key = _keys[i];
-      if (attrs[key] !== obj[key] || !(key in obj)) return false;
-    }
-    return true;
-  }
-
-  return isMatch;
-
-});

package/node_modules/underscore/amd/isNaN.js

@@ -1,10 +0,0 @@
-define(['./_setup', './isNumber'], function (_setup, isNumber) {
-
-  // Is the given value `NaN`?
-  function isNaN(obj) {
-    return isNumber(obj) && _setup._isNaN(obj);
-  }
-
-  return isNaN;
-
-});

package/node_modules/underscore/amd/isNull.js

@@ -1,10 +0,0 @@
-define(function () {
-
-  // Is a given value equal to null?
-  function isNull(obj) {
-    return obj === null;
-  }
-
-  return isNull;
-
-});

package/node_modules/underscore/amd/isNumber.js

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

package/node_modules/underscore/amd/isObject.js

@@ -1,11 +0,0 @@
-define(function () {
-
-  // Is a given variable an object?
-  function isObject(obj) {
-    var type = typeof obj;
-    return type === 'function' || type === 'object' && !!obj;
-  }
-
-  return isObject;
-
-});

package/node_modules/underscore/amd/isRegExp.js

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

package/node_modules/underscore/amd/isSet.js

@@ -1,7 +0,0 @@
-define(['./_tagTester', './_methodFingerprint', './_stringTagBug'], function (_tagTester, _methodFingerprint, _stringTagBug) {
-
-	var isSet = _stringTagBug.isIE11 ? _methodFingerprint.ie11fingerprint(_methodFingerprint.setMethods) : _tagTester('Set');
-
-	return isSet;
-
-});

package/node_modules/underscore/amd/isString.js

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

package/node_modules/underscore/amd/isSymbol.js

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

package/node_modules/underscore/amd/isTypedArray.js

@@ -1,16 +0,0 @@
-define(['./_setup', './_isBufferLike', './constant', './isDataView'], function (_setup, _isBufferLike, constant, isDataView) {
-
-  // Is a given value a typed array?
-  var typedArrayPattern = /\[object ((I|Ui)nt(8|16|32)|Float(32|64)|Uint8Clamped|Big(I|Ui)nt64)Array\]/;
-  function isTypedArray(obj) {
-    // `ArrayBuffer.isView` is the most future-proof, so use it when available.
-    // Otherwise, fall back on the above regular expression.
-    return _setup.nativeIsView ? (_setup.nativeIsView(obj) && !isDataView(obj)) :
-                  _isBufferLike(obj) && typedArrayPattern.test(_setup.toString.call(obj));
-  }
-
-  var isTypedArray$1 = _setup.supportsArrayBuffer ? isTypedArray : constant(false);
-
-  return isTypedArray$1;
-
-});

package/node_modules/underscore/amd/isUndefined.js

@@ -1,10 +0,0 @@
-define(function () {
-
-  // Is a given variable undefined?
-  function isUndefined(obj) {
-    return obj === void 0;
-  }
-
-  return isUndefined;
-
-});

package/node_modules/underscore/amd/isWeakMap.js

@@ -1,7 +0,0 @@
-define(['./_tagTester', './_methodFingerprint', './_stringTagBug'], function (_tagTester, _methodFingerprint, _stringTagBug) {
-
-	var isWeakMap = _stringTagBug.isIE11 ? _methodFingerprint.ie11fingerprint(_methodFingerprint.weakMapMethods) : _tagTester('WeakMap');
-
-	return isWeakMap;
-
-});

package/node_modules/underscore/amd/isWeakSet.js

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

package/node_modules/underscore/amd/iteratee.js

@@ -1,13 +0,0 @@
-define(['./underscore', './_baseIteratee'], function (underscore, _baseIteratee) {
-
-  // 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.
-  function iteratee(value, context) {
-    return _baseIteratee(value, context, Infinity);
-  }
-  underscore.iteratee = iteratee;
-
-  return iteratee;
-
-});

package/node_modules/underscore/amd/join.js

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

package/node_modules/underscore/amd/keys.js

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

package/node_modules/underscore/amd/last.js

@@ -1,13 +0,0 @@
-define(['./rest'], function (rest) {
-
-  // Get the last element of an array. Passing **n** will return the last N
-  // values in the array.
-  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));
-  }
-
-  return last;
-
-});

package/node_modules/underscore/amd/lastIndexOf.js

@@ -1,9 +0,0 @@
-define(['./_createIndexFinder', './findLastIndex'], function (_createIndexFinder, findLastIndex) {
-
-	// Return the position of the last occurrence of an item in an array,
-	// or -1 if the item is not included in the array.
-	var lastIndexOf = _createIndexFinder(-1, findLastIndex);
-
-	return lastIndexOf;
-
-});

package/node_modules/underscore/amd/map.js

@@ -1,18 +0,0 @@
-define(['./keys', './_cb', './_isArrayLike'], function (keys, _cb, _isArrayLike) {
-
-  // Return the results of applying the iteratee to each element.
-  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;
-  }
-
-  return map;
-
-});

package/node_modules/underscore/amd/mapObject.js

@@ -1,19 +0,0 @@
-define(['./keys', './_cb'], function (keys, _cb) {
-
-  // Returns the results of applying the `iteratee` to each element of `obj`.
-  // In contrast to `_.map` it returns an object.
-  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;
-  }
-
-  return mapObject;
-
-});

package/node_modules/underscore/amd/matcher.js

@@ -1,14 +0,0 @@
-define(['./extendOwn', './isMatch'], function (extendOwn, isMatch) {
-
-  // Returns a predicate for checking whether an object has a given set of
-  // `key:value` pairs.
-  function matcher(attrs) {
-    attrs = extendOwn({}, attrs);
-    return function(obj) {
-      return isMatch(obj, attrs);
-    };
-  }
-
-  return matcher;
-
-});

package/node_modules/underscore/amd/max.js

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

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