@langchain/langgraph-checkpoint 0.1.1 → 1.0.1

package/dist/serde/types.d.ts

@@ -1,49 +1,52 @@
-export declare const TASKS = "__pregel_tasks";
-export declare const ERROR = "__error__";
-export declare const SCHEDULED = "__scheduled__";
-export declare const INTERRUPT = "__interrupt__";
-export declare const RESUME = "__resume__";
-export interface ChannelProtocol<ValueType = unknown, UpdateType = unknown, CheckpointType = unknown> {
-    ValueType: ValueType;
-    UpdateType: UpdateType;
-    /**
-     * The name of the channel.
-     */
-    lc_graph_name: string;
-    /**
-     * Return a new identical channel, optionally initialized from a checkpoint.
-     * Can be thought of as a "restoration" from a checkpoint which is a "snapshot" of the channel's state.
-     *
-     * @param {CheckpointType | undefined} checkpoint
-     * @param {CheckpointType | undefined} initialValue
-     * @returns {this}
-     */
-    fromCheckpoint(checkpoint?: CheckpointType): this;
-    /**
-     * Update the channel's value with the given sequence of updates.
-     * The order of the updates in the sequence is arbitrary.
-     *
-     * @throws {InvalidUpdateError} if the sequence of updates is invalid.
-     * @param {Array<UpdateType>} values
-     * @returns {void}
-     */
-    update(values: UpdateType[]): void;
-    /**
-     * Return the current value of the channel.
-     *
-     * @throws {EmptyChannelError} if the channel is empty (never updated yet).
-     * @returns {ValueType}
-     */
-    get(): ValueType;
-    /**
-     * Return a string representation of the channel's current state.
-     *
-     * @throws {EmptyChannelError} if the channel is empty (never updated yet), or doesn't support checkpoints.
-     * @returns {CheckpointType | undefined}
-     */
-    checkpoint(): CheckpointType | undefined;
+//#region src/serde/types.d.ts
+declare const TASKS = "__pregel_tasks";
+declare const ERROR = "__error__";
+declare const SCHEDULED = "__scheduled__";
+declare const INTERRUPT = "__interrupt__";
+declare const RESUME = "__resume__";
+interface ChannelProtocol<ValueType = unknown, UpdateType = unknown, CheckpointType = unknown> {
+  ValueType: ValueType;
+  UpdateType: UpdateType;
+  /**
+   * The name of the channel.
+   */
+  lc_graph_name: string;
+  /**
+   * Return a new identical channel, optionally initialized from a checkpoint.
+   * Can be thought of as a "restoration" from a checkpoint which is a "snapshot" of the channel's state.
+   *
+   * @param {CheckpointType | undefined} checkpoint
+   * @returns {this}
+   */
+  fromCheckpoint(checkpoint?: CheckpointType): this;
+  /**
+   * Update the channel's value with the given sequence of updates.
+   * The order of the updates in the sequence is arbitrary.
+   *
+   * @throws {InvalidUpdateError} if the sequence of updates is invalid.
+   * @param {Array<UpdateType>} values
+   * @returns {void}
+   */
+  update(values: UpdateType[]): void;
+  /**
+   * Return the current value of the channel.
+   *
+   * @throws {EmptyChannelError} if the channel is empty (never updated yet).
+   * @returns {ValueType}
+   */
+  get(): ValueType;
+  /**
+   * Return a string representation of the channel's current state.
+   *
+   * @throws {EmptyChannelError} if the channel is empty (never updated yet), or doesn't support checkpoints.
+   * @returns {CheckpointType | undefined}
+   */
+  checkpoint(): CheckpointType | undefined;
 }
-export interface SendProtocol {
-    node: string;
-    args: any;
+interface SendProtocol {
+  node: string;
+  args: any;
 }
+//#endregion
+export { ChannelProtocol, ERROR, INTERRUPT, RESUME, SCHEDULED, SendProtocol, TASKS };
+//# sourceMappingURL=types.d.ts.map

package/dist/serde/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","names":[],"sources":["../../src/serde/types.ts"],"mappings":";cAAa,KAAA;AAAA,cACA,KAAA;AAAA,cACA,SAAA;AAAA,cACA,SAAA;AAAA,cACA,MAAA;AAAA,UAGI,eAAA;EAKf,SAAA,EAAW,SAAA;EAEX,UAAA,EAAY,UAAA;;;;EAKZ,aAAA;EAjBoB;;;;AACtB;;;EAyBE,cAAA,CAAe,UAAA,GAAa,cAAA;EAzBR;AACtB;;;;;AAGA;;EA+BE,MAAA,CAAO,MAAA,EAAQ,UAAA;EA1BJ;;;;;;EAkCX,GAAA,IAAO,SAAA;EAQqB;;;;;;EAA5B,UAAA,IAAc,cAAA;AAAA;AAAA,UAIC,YAAA;EACf,IAAA;EAEA,IAAA;AAAA"}

package/dist/serde/types.js

@@ -1,6 +1,10 @@
-export const TASKS = "__pregel_tasks";
-export const ERROR = "__error__";
-export const SCHEDULED = "__scheduled__";
-export const INTERRUPT = "__interrupt__";
-export const RESUME = "__resume__";
+//#region src/serde/types.ts
+const TASKS = "__pregel_tasks";
+const ERROR = "__error__";
+const SCHEDULED = "__scheduled__";
+const INTERRUPT = "__interrupt__";
+const RESUME = "__resume__";
+//#endregion
+export { ERROR, INTERRUPT, RESUME, SCHEDULED, TASKS };
+
 //# sourceMappingURL=types.js.map

package/dist/serde/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/serde/types.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,MAAM,KAAK,GAAG,gBAAgB,CAAC;AACtC,MAAM,CAAC,MAAM,KAAK,GAAG,WAAW,CAAC;AACjC,MAAM,CAAC,MAAM,SAAS,GAAG,eAAe,CAAC;AACzC,MAAM,CAAC,MAAM,SAAS,GAAG,eAAe,CAAC;AACzC,MAAM,CAAC,MAAM,MAAM,GAAG,YAAY,CAAC"}
+{"version":3,"file":"types.js","names":[],"sources":["../../src/serde/types.ts"],"sourcesContent":["export const TASKS = \"__pregel_tasks\";\nexport const ERROR = \"__error__\";\nexport const SCHEDULED = \"__scheduled__\";\nexport const INTERRUPT = \"__interrupt__\";\nexport const RESUME = \"__resume__\";\n\n// Mirrors BaseChannel in \"@langchain/langgraph\"\nexport interface ChannelProtocol<\n  ValueType = unknown,\n  UpdateType = unknown,\n  CheckpointType = unknown\n> {\n  ValueType: ValueType;\n\n  UpdateType: UpdateType;\n\n  /**\n   * The name of the channel.\n   */\n  lc_graph_name: string;\n\n  /**\n   * Return a new identical channel, optionally initialized from a checkpoint.\n   * Can be thought of as a \"restoration\" from a checkpoint which is a \"snapshot\" of the channel's state.\n   *\n   * @param {CheckpointType | undefined} checkpoint\n   * @returns {this}\n   */\n  fromCheckpoint(checkpoint?: CheckpointType): this;\n\n  /**\n   * Update the channel's value with the given sequence of updates.\n   * The order of the updates in the sequence is arbitrary.\n   *\n   * @throws {InvalidUpdateError} if the sequence of updates is invalid.\n   * @param {Array<UpdateType>} values\n   * @returns {void}\n   */\n  update(values: UpdateType[]): void;\n\n  /**\n   * Return the current value of the channel.\n   *\n   * @throws {EmptyChannelError} if the channel is empty (never updated yet).\n   * @returns {ValueType}\n   */\n  get(): ValueType;\n\n  /**\n   * Return a string representation of the channel's current state.\n   *\n   * @throws {EmptyChannelError} if the channel is empty (never updated yet), or doesn't support checkpoints.\n   * @returns {CheckpointType | undefined}\n   */\n  checkpoint(): CheckpointType | undefined;\n}\n\n// Mirrors SendInterface in \"@langchain/langgraph\"\nexport interface SendProtocol {\n  node: string;\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  args: any;\n}\n"],"mappings":";AAAA,MAAa,QAAQ;AACrB,MAAa,QAAQ;AACrB,MAAa,YAAY;AACzB,MAAa,YAAY;AACzB,MAAa,SAAS"}

package/dist/serde/utils/fast-safe-stringify/index.cjs

@@ -1,222 +1,101 @@
-"use strict";
-/* eslint-disable */
-// @ts-nocheck
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.stringify = stringify;
-// Stringify that can handle circular references.
-// Inlined due to ESM import issues
-// Source: https://www.npmjs.com/package/fast-safe-stringify
+//#region src/serde/utils/fast-safe-stringify/index.ts
 var LIMIT_REPLACE_NODE = "[...]";
 var CIRCULAR_REPLACE_NODE = "[Circular]";
 var arr = [];
 var replacerStack = [];
 function defaultOptions() {
-    return {
-        depthLimit: Number.MAX_SAFE_INTEGER,
-        edgesLimit: Number.MAX_SAFE_INTEGER,
-    };
+	return {
+		depthLimit: Number.MAX_SAFE_INTEGER,
+		edgesLimit: Number.MAX_SAFE_INTEGER
+	};
 }
-// Regular stringify
 function stringify(obj, replacer, spacer, options) {
-    if (typeof options === "undefined") {
-        options = defaultOptions();
-    }
-    decirc(obj, "", 0, [], undefined, 0, options);
-    var res;
-    try {
-        if (replacerStack.length === 0) {
-            res = JSON.stringify(obj, replacer, spacer);
-        }
-        else {
-            res = JSON.stringify(obj, replaceGetterValues(replacer), spacer);
-        }
-    }
-    catch (_) {
-        return JSON.stringify("[unable to serialize, circular reference is too complex to analyze]");
-    }
-    finally {
-        while (arr.length !== 0) {
-            var part = arr.pop();
-            if (part.length === 4) {
-                Object.defineProperty(part[0], part[1], part[3]);
-            }
-            else {
-                part[0][part[1]] = part[2];
-            }
-        }
-    }
-    return res;
+	if (typeof options === "undefined") options = defaultOptions();
+	decirc(obj, "", 0, [], void 0, 0, options);
+	var res;
+	try {
+		if (replacerStack.length === 0) res = JSON.stringify(obj, replacer, spacer);
+		else res = JSON.stringify(obj, replaceGetterValues(replacer), spacer);
+	} catch (_) {
+		return JSON.stringify("[unable to serialize, circular reference is too complex to analyze]");
+	} finally {
+		while (arr.length !== 0) {
+			var part = arr.pop();
+			if (part.length === 4) Object.defineProperty(part[0], part[1], part[3]);
+			else part[0][part[1]] = part[2];
+		}
+	}
+	return res;
 }
 function setReplace(replace, val, k, parent) {
-    var propertyDescriptor = Object.getOwnPropertyDescriptor(parent, k);
-    if (propertyDescriptor.get !== undefined) {
-        if (propertyDescriptor.configurable) {
-            Object.defineProperty(parent, k, { value: replace });
-            arr.push([parent, k, val, propertyDescriptor]);
-        }
-        else {
-            replacerStack.push([val, k, replace]);
-        }
-    }
-    else {
-        parent[k] = replace;
-        arr.push([parent, k, val]);
-    }
+	var propertyDescriptor = Object.getOwnPropertyDescriptor(parent, k);
+	if (propertyDescriptor.get !== void 0) if (propertyDescriptor.configurable) {
+		Object.defineProperty(parent, k, { value: replace });
+		arr.push([
+			parent,
+			k,
+			val,
+			propertyDescriptor
+		]);
+	} else replacerStack.push([
+		val,
+		k,
+		replace
+	]);
+	else {
+		parent[k] = replace;
+		arr.push([
+			parent,
+			k,
+			val
+		]);
+	}
 }
 function decirc(val, k, edgeIndex, stack, parent, depth, options) {
-    depth += 1;
-    var i;
-    if (typeof val === "object" && val !== null) {
-        for (i = 0; i < stack.length; i++) {
-            if (stack[i] === val) {
-                setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);
-                return;
-            }
-        }
-        if (typeof options.depthLimit !== "undefined" &&
-            depth > options.depthLimit) {
-            setReplace(LIMIT_REPLACE_NODE, val, k, parent);
-            return;
-        }
-        if (typeof options.edgesLimit !== "undefined" &&
-            edgeIndex + 1 > options.edgesLimit) {
-            setReplace(LIMIT_REPLACE_NODE, val, k, parent);
-            return;
-        }
-        stack.push(val);
-        // Optimize for Arrays. Big arrays could kill the performance otherwise!
-        if (Array.isArray(val)) {
-            for (i = 0; i < val.length; i++) {
-                decirc(val[i], i, i, stack, val, depth, options);
-            }
-        }
-        else {
-            var keys = Object.keys(val);
-            for (i = 0; i < keys.length; i++) {
-                var key = keys[i];
-                decirc(val[key], key, i, stack, val, depth, options);
-            }
-        }
-        stack.pop();
-    }
-}
-// Stable-stringify
-function compareFunction(a, b) {
-    if (a < b) {
-        return -1;
-    }
-    if (a > b) {
-        return 1;
-    }
-    return 0;
-}
-function deterministicStringify(obj, replacer, spacer, options) {
-    if (typeof options === "undefined") {
-        options = defaultOptions();
-    }
-    var tmp = deterministicDecirc(obj, "", 0, [], undefined, 0, options) || obj;
-    var res;
-    try {
-        if (replacerStack.length === 0) {
-            res = JSON.stringify(tmp, replacer, spacer);
-        }
-        else {
-            res = JSON.stringify(tmp, replaceGetterValues(replacer), spacer);
-        }
-    }
-    catch (_) {
-        return JSON.stringify("[unable to serialize, circular reference is too complex to analyze]");
-    }
-    finally {
-        // Ensure that we restore the object as it was.
-        while (arr.length !== 0) {
-            var part = arr.pop();
-            if (part.length === 4) {
-                Object.defineProperty(part[0], part[1], part[3]);
-            }
-            else {
-                part[0][part[1]] = part[2];
-            }
-        }
-    }
-    return res;
+	depth += 1;
+	var i;
+	if (typeof val === "object" && val !== null) {
+		for (i = 0; i < stack.length; i++) if (stack[i] === val) {
+			setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);
+			return;
+		}
+		if (typeof options.depthLimit !== "undefined" && depth > options.depthLimit) {
+			setReplace(LIMIT_REPLACE_NODE, val, k, parent);
+			return;
+		}
+		if (typeof options.edgesLimit !== "undefined" && edgeIndex + 1 > options.edgesLimit) {
+			setReplace(LIMIT_REPLACE_NODE, val, k, parent);
+			return;
+		}
+		stack.push(val);
+		if (Array.isArray(val)) for (i = 0; i < val.length; i++) decirc(val[i], i, i, stack, val, depth, options);
+		else {
+			var keys = Object.keys(val);
+			for (i = 0; i < keys.length; i++) {
+				var key = keys[i];
+				decirc(val[key], key, i, stack, val, depth, options);
+			}
+		}
+		stack.pop();
+	}
 }
-function deterministicDecirc(val, k, edgeIndex, stack, parent, depth, options) {
-    depth += 1;
-    var i;
-    if (typeof val === "object" && val !== null) {
-        for (i = 0; i < stack.length; i++) {
-            if (stack[i] === val) {
-                setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);
-                return;
-            }
-        }
-        try {
-            if (typeof val.toJSON === "function") {
-                return;
-            }
-        }
-        catch (_) {
-            return;
-        }
-        if (typeof options.depthLimit !== "undefined" &&
-            depth > options.depthLimit) {
-            setReplace(LIMIT_REPLACE_NODE, val, k, parent);
-            return;
-        }
-        if (typeof options.edgesLimit !== "undefined" &&
-            edgeIndex + 1 > options.edgesLimit) {
-            setReplace(LIMIT_REPLACE_NODE, val, k, parent);
-            return;
-        }
-        stack.push(val);
-        // Optimize for Arrays. Big arrays could kill the performance otherwise!
-        if (Array.isArray(val)) {
-            for (i = 0; i < val.length; i++) {
-                deterministicDecirc(val[i], i, i, stack, val, depth, options);
-            }
-        }
-        else {
-            // Create a temporary object in the required way
-            var tmp = {};
-            var keys = Object.keys(val).sort(compareFunction);
-            for (i = 0; i < keys.length; i++) {
-                var key = keys[i];
-                deterministicDecirc(val[key], key, i, stack, val, depth, options);
-                tmp[key] = val[key];
-            }
-            if (typeof parent !== "undefined") {
-                arr.push([parent, k, val]);
-                parent[k] = tmp;
-            }
-            else {
-                return tmp;
-            }
-        }
-        stack.pop();
-    }
-}
-// wraps replacer function to handle values we couldn't replace
-// and mark them as replaced value
 function replaceGetterValues(replacer) {
-    replacer =
-        typeof replacer !== "undefined"
-            ? replacer
-            : function (k, v) {
-                return v;
-            };
-    return function (key, val) {
-        if (replacerStack.length > 0) {
-            for (var i = 0; i < replacerStack.length; i++) {
-                var part = replacerStack[i];
-                if (part[1] === key && part[0] === val) {
-                    val = part[2];
-                    replacerStack.splice(i, 1);
-                    break;
-                }
-            }
-        }
-        return replacer.call(this, key, val);
-    };
+	replacer = typeof replacer !== "undefined" ? replacer : function(k, v) {
+		return v;
+	};
+	return function(key, val) {
+		if (replacerStack.length > 0) for (var i = 0; i < replacerStack.length; i++) {
+			var part = replacerStack[i];
+			if (part[1] === key && part[0] === val) {
+				val = part[2];
+				replacerStack.splice(i, 1);
+				break;
+			}
+		}
+		return replacer.call(this, key, val);
+	};
 }
-//# sourceMappingURL=index.js.map
+//#endregion
+exports.stringify = stringify;
+
+//# sourceMappingURL=index.cjs.map

package/dist/serde/utils/fast-safe-stringify/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","names":[],"sources":["../../../../src/serde/utils/fast-safe-stringify/index.ts"],"sourcesContent":["/* eslint-disable */\n// @ts-nocheck\n\n// Stringify that can handle circular references.\n// Inlined due to ESM import issues\n// Source: https://www.npmjs.com/package/fast-safe-stringify\n\nvar LIMIT_REPLACE_NODE = \"[...]\";\nvar CIRCULAR_REPLACE_NODE = \"[Circular]\";\n\nvar arr = [];\nvar replacerStack = [];\n\nfunction defaultOptions() {\n  return {\n    depthLimit: Number.MAX_SAFE_INTEGER,\n    edgesLimit: Number.MAX_SAFE_INTEGER,\n  };\n}\n\n// Regular stringify\nexport function stringify(obj, replacer?, spacer?, options?) {\n  if (typeof options === \"undefined\") {\n    options = defaultOptions();\n  }\n\n  decirc(obj, \"\", 0, [], undefined, 0, options);\n  var res;\n  try {\n    if (replacerStack.length === 0) {\n      res = JSON.stringify(obj, replacer, spacer);\n    } else {\n      res = JSON.stringify(obj, replaceGetterValues(replacer), spacer);\n    }\n  } catch (_) {\n    return JSON.stringify(\n      \"[unable to serialize, circular reference is too complex to analyze]\"\n    );\n  } finally {\n    while (arr.length !== 0) {\n      var part = arr.pop();\n      if (part.length === 4) {\n        Object.defineProperty(part[0], part[1], part[3]);\n      } else {\n        part[0][part[1]] = part[2];\n      }\n    }\n  }\n  return res;\n}\n\nfunction setReplace(replace, val, k, parent) {\n  var propertyDescriptor = Object.getOwnPropertyDescriptor(parent, k);\n  if (propertyDescriptor.get !== undefined) {\n    if (propertyDescriptor.configurable) {\n      Object.defineProperty(parent, k, { value: replace });\n      arr.push([parent, k, val, propertyDescriptor]);\n    } else {\n      replacerStack.push([val, k, replace]);\n    }\n  } else {\n    parent[k] = replace;\n    arr.push([parent, k, val]);\n  }\n}\n\nfunction decirc(val, k, edgeIndex, stack, parent, depth, options) {\n  depth += 1;\n  var i;\n  if (typeof val === \"object\" && val !== null) {\n    for (i = 0; i < stack.length; i++) {\n      if (stack[i] === val) {\n        setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);\n        return;\n      }\n    }\n\n    if (\n      typeof options.depthLimit !== \"undefined\" &&\n      depth > options.depthLimit\n    ) {\n      setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n      return;\n    }\n\n    if (\n      typeof options.edgesLimit !== \"undefined\" &&\n      edgeIndex + 1 > options.edgesLimit\n    ) {\n      setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n      return;\n    }\n\n    stack.push(val);\n    // Optimize for Arrays. Big arrays could kill the performance otherwise!\n    if (Array.isArray(val)) {\n      for (i = 0; i < val.length; i++) {\n        decirc(val[i], i, i, stack, val, depth, options);\n      }\n    } else {\n      var keys = Object.keys(val);\n      for (i = 0; i < keys.length; i++) {\n        var key = keys[i];\n        decirc(val[key], key, i, stack, val, depth, options);\n      }\n    }\n    stack.pop();\n  }\n}\n\n// Stable-stringify\nfunction compareFunction(a, b) {\n  if (a < b) {\n    return -1;\n  }\n  if (a > b) {\n    return 1;\n  }\n  return 0;\n}\n\nfunction deterministicStringify(obj, replacer, spacer, options) {\n  if (typeof options === \"undefined\") {\n    options = defaultOptions();\n  }\n\n  var tmp = deterministicDecirc(obj, \"\", 0, [], undefined, 0, options) || obj;\n  var res;\n  try {\n    if (replacerStack.length === 0) {\n      res = JSON.stringify(tmp, replacer, spacer);\n    } else {\n      res = JSON.stringify(tmp, replaceGetterValues(replacer), spacer);\n    }\n  } catch (_) {\n    return JSON.stringify(\n      \"[unable to serialize, circular reference is too complex to analyze]\"\n    );\n  } finally {\n    // Ensure that we restore the object as it was.\n    while (arr.length !== 0) {\n      var part = arr.pop();\n      if (part.length === 4) {\n        Object.defineProperty(part[0], part[1], part[3]);\n      } else {\n        part[0][part[1]] = part[2];\n      }\n    }\n  }\n  return res;\n}\n\nfunction deterministicDecirc(val, k, edgeIndex, stack, parent, depth, options) {\n  depth += 1;\n  var i;\n  if (typeof val === \"object\" && val !== null) {\n    for (i = 0; i < stack.length; i++) {\n      if (stack[i] === val) {\n        setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);\n        return;\n      }\n    }\n    try {\n      if (typeof val.toJSON === \"function\") {\n        return;\n      }\n    } catch (_) {\n      return;\n    }\n\n    if (\n      typeof options.depthLimit !== \"undefined\" &&\n      depth > options.depthLimit\n    ) {\n      setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n      return;\n    }\n\n    if (\n      typeof options.edgesLimit !== \"undefined\" &&\n      edgeIndex + 1 > options.edgesLimit\n    ) {\n      setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n      return;\n    }\n\n    stack.push(val);\n    // Optimize for Arrays. Big arrays could kill the performance otherwise!\n    if (Array.isArray(val)) {\n      for (i = 0; i < val.length; i++) {\n        deterministicDecirc(val[i], i, i, stack, val, depth, options);\n      }\n    } else {\n      // Create a temporary object in the required way\n      var tmp = {};\n      var keys = Object.keys(val).sort(compareFunction);\n      for (i = 0; i < keys.length; i++) {\n        var key = keys[i];\n        deterministicDecirc(val[key], key, i, stack, val, depth, options);\n        tmp[key] = val[key];\n      }\n      if (typeof parent !== \"undefined\") {\n        arr.push([parent, k, val]);\n        parent[k] = tmp;\n      } else {\n        return tmp;\n      }\n    }\n    stack.pop();\n  }\n}\n\n// wraps replacer function to handle values we couldn't replace\n// and mark them as replaced value\nfunction replaceGetterValues(replacer) {\n  replacer =\n    typeof replacer !== \"undefined\"\n      ? replacer\n      : function (k, v) {\n          return v;\n        };\n  return function (key, val) {\n    if (replacerStack.length > 0) {\n      for (var i = 0; i < replacerStack.length; i++) {\n        var part = replacerStack[i];\n        if (part[1] === key && part[0] === val) {\n          val = part[2];\n          replacerStack.splice(i, 1);\n          break;\n        }\n      }\n    }\n    return replacer.call(this, key, val);\n  };\n}\n"],"mappings":";AAOA,IAAI,qBAAqB;AACzB,IAAI,wBAAwB;AAE5B,IAAI,MAAM,EAAE;AACZ,IAAI,gBAAgB,EAAE;AAEtB,SAAS,iBAAiB;AACxB,QAAO;EACL,YAAY,OAAO;EACnB,YAAY,OAAO;EACpB;;AAIH,SAAgB,UAAU,KAAK,UAAW,QAAS,SAAU;AAC3D,KAAI,OAAO,YAAY,YACrB,WAAU,gBAAgB;AAG5B,QAAO,KAAK,IAAI,GAAG,EAAE,EAAE,KAAA,GAAW,GAAG,QAAQ;CAC7C,IAAI;AACJ,KAAI;AACF,MAAI,cAAc,WAAW,EAC3B,OAAM,KAAK,UAAU,KAAK,UAAU,OAAO;MAE3C,OAAM,KAAK,UAAU,KAAK,oBAAoB,SAAS,EAAE,OAAO;UAE3D,GAAG;AACV,SAAO,KAAK,UACV,sEACD;WACO;AACR,SAAO,IAAI,WAAW,GAAG;GACvB,IAAI,OAAO,IAAI,KAAK;AACpB,OAAI,KAAK,WAAW,EAClB,QAAO,eAAe,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG;OAEhD,MAAK,GAAG,KAAK,MAAM,KAAK;;;AAI9B,QAAO;;AAGT,SAAS,WAAW,SAAS,KAAK,GAAG,QAAQ;CAC3C,IAAI,qBAAqB,OAAO,yBAAyB,QAAQ,EAAE;AACnE,KAAI,mBAAmB,QAAQ,KAAA,EAC7B,KAAI,mBAAmB,cAAc;AACnC,SAAO,eAAe,QAAQ,GAAG,EAAE,OAAO,SAAS,CAAC;AACpD,MAAI,KAAK;GAAC;GAAQ;GAAG;GAAK;GAAmB,CAAC;OAE9C,eAAc,KAAK;EAAC;EAAK;EAAG;EAAQ,CAAC;MAElC;AACL,SAAO,KAAK;AACZ,MAAI,KAAK;GAAC;GAAQ;GAAG;GAAI,CAAC;;;AAI9B,SAAS,OAAO,KAAK,GAAG,WAAW,OAAO,QAAQ,OAAO,SAAS;AAChE,UAAS;CACT,IAAI;AACJ,KAAI,OAAO,QAAQ,YAAY,QAAQ,MAAM;AAC3C,OAAK,IAAI,GAAG,IAAI,MAAM,QAAQ,IAC5B,KAAI,MAAM,OAAO,KAAK;AACpB,cAAW,uBAAuB,KAAK,GAAG,OAAO;AACjD;;AAIJ,MACE,OAAO,QAAQ,eAAe,eAC9B,QAAQ,QAAQ,YAChB;AACA,cAAW,oBAAoB,KAAK,GAAG,OAAO;AAC9C;;AAGF,MACE,OAAO,QAAQ,eAAe,eAC9B,YAAY,IAAI,QAAQ,YACxB;AACA,cAAW,oBAAoB,KAAK,GAAG,OAAO;AAC9C;;AAGF,QAAM,KAAK,IAAI;AAEf,MAAI,MAAM,QAAQ,IAAI,CACpB,MAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC1B,QAAO,IAAI,IAAI,GAAG,GAAG,OAAO,KAAK,OAAO,QAAQ;OAE7C;GACL,IAAI,OAAO,OAAO,KAAK,IAAI;AAC3B,QAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;IAChC,IAAI,MAAM,KAAK;AACf,WAAO,IAAI,MAAM,KAAK,GAAG,OAAO,KAAK,OAAO,QAAQ;;;AAGxD,QAAM,KAAK;;;AA4Gf,SAAS,oBAAoB,UAAU;AACrC,YACE,OAAO,aAAa,cAChB,WACA,SAAU,GAAG,GAAG;AACd,SAAO;;AAEf,QAAO,SAAU,KAAK,KAAK;AACzB,MAAI,cAAc,SAAS,EACzB,MAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;GAC7C,IAAI,OAAO,cAAc;AACzB,OAAI,KAAK,OAAO,OAAO,KAAK,OAAO,KAAK;AACtC,UAAM,KAAK;AACX,kBAAc,OAAO,GAAG,EAAE;AAC1B;;;AAIN,SAAO,SAAS,KAAK,MAAM,KAAK,IAAI"}