@langchain/langgraph-checkpoint 0.1.1 → 1.0.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +6 -0
- package/dist/_virtual/rolldown_runtime.cjs +25 -0
- package/dist/base.cjs +74 -88
- package/dist/base.cjs.map +1 -0
- package/dist/base.d.cts +95 -0
- package/dist/base.d.cts.map +1 -0
- package/dist/base.d.ts +79 -73
- package/dist/base.d.ts.map +1 -0
- package/dist/base.js +69 -80
- package/dist/base.js.map +1 -1
- package/dist/cache/base.cjs +17 -21
- package/dist/cache/base.cjs.map +1 -0
- package/dist/cache/base.d.cts +43 -0
- package/dist/cache/base.d.cts.map +1 -0
- package/dist/cache/base.d.ts +41 -36
- package/dist/cache/base.d.ts.map +1 -0
- package/dist/cache/base.js +16 -16
- package/dist/cache/base.js.map +1 -1
- package/dist/cache/index.cjs +2 -19
- package/dist/cache/index.js +4 -3
- package/dist/cache/memory.cjs +53 -58
- package/dist/cache/memory.cjs.map +1 -0
- package/dist/cache/memory.d.cts +19 -0
- package/dist/cache/memory.d.cts.map +1 -0
- package/dist/cache/memory.d.ts +18 -13
- package/dist/cache/memory.d.ts.map +1 -0
- package/dist/cache/memory.js +52 -53
- package/dist/cache/memory.js.map +1 -1
- package/dist/id.cjs +12 -16
- package/dist/id.cjs.map +1 -0
- package/dist/id.d.cts +10 -0
- package/dist/id.d.cts.map +1 -0
- package/dist/id.d.ts +10 -2
- package/dist/id.d.ts.map +1 -0
- package/dist/id.js +10 -12
- package/dist/id.js.map +1 -1
- package/dist/index.cjs +36 -27
- package/dist/index.d.cts +12 -0
- package/dist/index.d.ts +12 -8
- package/dist/index.js +12 -9
- package/dist/memory.cjs +194 -268
- package/dist/memory.cjs.map +1 -0
- package/dist/memory.d.cts +22 -0
- package/dist/memory.d.cts.map +1 -0
- package/dist/memory.d.ts +19 -12
- package/dist/memory.d.ts.map +1 -0
- package/dist/memory.js +193 -263
- package/dist/memory.js.map +1 -1
- package/dist/serde/base.d.cts +10 -0
- package/dist/serde/base.d.cts.map +1 -0
- package/dist/serde/base.d.ts +9 -3
- package/dist/serde/base.d.ts.map +1 -0
- package/dist/serde/jsonplus.cjs +92 -141
- package/dist/serde/jsonplus.cjs.map +1 -0
- package/dist/serde/jsonplus.js +90 -136
- package/dist/serde/jsonplus.js.map +1 -1
- package/dist/serde/types.cjs +15 -9
- package/dist/serde/types.cjs.map +1 -0
- package/dist/serde/types.d.cts +55 -0
- package/dist/serde/types.d.cts.map +1 -0
- package/dist/serde/types.d.ts +53 -47
- package/dist/serde/types.d.ts.map +1 -0
- package/dist/serde/types.js +9 -5
- package/dist/serde/types.js.map +1 -1
- package/dist/serde/utils/fast-safe-stringify/index.cjs +88 -208
- package/dist/serde/utils/fast-safe-stringify/index.cjs.map +1 -0
- package/dist/serde/utils/fast-safe-stringify/index.js +87 -205
- package/dist/serde/utils/fast-safe-stringify/index.js.map +1 -1
- package/dist/store/base.cjs +200 -209
- package/dist/store/base.cjs.map +1 -0
- package/dist/store/base.d.cts +392 -0
- package/dist/store/base.d.cts.map +1 -0
- package/dist/store/base.d.ts +336 -332
- package/dist/store/base.d.ts.map +1 -0
- package/dist/store/base.js +198 -204
- package/dist/store/base.js.map +1 -1
- package/dist/store/batch.cjs +116 -147
- package/dist/store/batch.cjs.map +1 -0
- package/dist/store/batch.d.cts +49 -0
- package/dist/store/batch.d.cts.map +1 -0
- package/dist/store/batch.d.ts +48 -40
- package/dist/store/batch.d.ts.map +1 -0
- package/dist/store/batch.js +116 -143
- package/dist/store/batch.js.map +1 -1
- package/dist/store/memory.cjs +262 -363
- package/dist/store/memory.cjs.map +1 -0
- package/dist/store/memory.d.cts +64 -0
- package/dist/store/memory.d.cts.map +1 -0
- package/dist/store/memory.d.ts +30 -24
- package/dist/store/memory.d.ts.map +1 -0
- package/dist/store/memory.js +261 -358
- package/dist/store/memory.js.map +1 -1
- package/dist/store/utils.cjs +141 -249
- package/dist/store/utils.cjs.map +1 -0
- package/dist/store/utils.js +140 -245
- package/dist/store/utils.js.map +1 -1
- package/dist/types.d.cts +35 -0
- package/dist/types.d.cts.map +1 -0
- package/dist/types.d.ts +29 -28
- package/dist/types.d.ts.map +1 -0
- package/package.json +16 -18
- package/dist/cache/index.d.ts +0 -2
- package/dist/cache/index.js.map +0 -1
- package/dist/index.js.map +0 -1
- package/dist/serde/base.cjs +0 -3
- package/dist/serde/base.js +0 -2
- package/dist/serde/base.js.map +0 -1
- package/dist/serde/jsonplus.d.ts +0 -7
- package/dist/serde/utils/fast-safe-stringify/index.d.ts +0 -1
- package/dist/store/index.cjs +0 -20
- package/dist/store/index.d.ts +0 -3
- package/dist/store/index.js +0 -4
- package/dist/store/index.js.map +0 -1
- package/dist/store/utils.d.ts +0 -26
- package/dist/types.cjs +0 -3
- package/dist/types.js +0 -2
- package/dist/types.js.map +0 -1
- package/index.cjs +0 -1
- package/index.d.cts +0 -1
- package/index.d.ts +0 -1
- package/index.js +0 -1
|
@@ -1,219 +1,101 @@
|
|
|
1
|
-
|
|
2
|
-
// @ts-nocheck
|
|
3
|
-
// Stringify that can handle circular references.
|
|
4
|
-
// Inlined due to ESM import issues
|
|
5
|
-
// Source: https://www.npmjs.com/package/fast-safe-stringify
|
|
1
|
+
//#region src/serde/utils/fast-safe-stringify/index.ts
|
|
6
2
|
var LIMIT_REPLACE_NODE = "[...]";
|
|
7
3
|
var CIRCULAR_REPLACE_NODE = "[Circular]";
|
|
8
4
|
var arr = [];
|
|
9
5
|
var replacerStack = [];
|
|
10
6
|
function defaultOptions() {
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
7
|
+
return {
|
|
8
|
+
depthLimit: Number.MAX_SAFE_INTEGER,
|
|
9
|
+
edgesLimit: Number.MAX_SAFE_INTEGER
|
|
10
|
+
};
|
|
15
11
|
}
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
}
|
|
34
|
-
finally {
|
|
35
|
-
while (arr.length !== 0) {
|
|
36
|
-
var part = arr.pop();
|
|
37
|
-
if (part.length === 4) {
|
|
38
|
-
Object.defineProperty(part[0], part[1], part[3]);
|
|
39
|
-
}
|
|
40
|
-
else {
|
|
41
|
-
part[0][part[1]] = part[2];
|
|
42
|
-
}
|
|
43
|
-
}
|
|
44
|
-
}
|
|
45
|
-
return res;
|
|
12
|
+
function stringify(obj, replacer, spacer, options) {
|
|
13
|
+
if (typeof options === "undefined") options = defaultOptions();
|
|
14
|
+
decirc(obj, "", 0, [], void 0, 0, options);
|
|
15
|
+
var res;
|
|
16
|
+
try {
|
|
17
|
+
if (replacerStack.length === 0) res = JSON.stringify(obj, replacer, spacer);
|
|
18
|
+
else res = JSON.stringify(obj, replaceGetterValues(replacer), spacer);
|
|
19
|
+
} catch (_) {
|
|
20
|
+
return JSON.stringify("[unable to serialize, circular reference is too complex to analyze]");
|
|
21
|
+
} finally {
|
|
22
|
+
while (arr.length !== 0) {
|
|
23
|
+
var part = arr.pop();
|
|
24
|
+
if (part.length === 4) Object.defineProperty(part[0], part[1], part[3]);
|
|
25
|
+
else part[0][part[1]] = part[2];
|
|
26
|
+
}
|
|
27
|
+
}
|
|
28
|
+
return res;
|
|
46
29
|
}
|
|
47
30
|
function setReplace(replace, val, k, parent) {
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
31
|
+
var propertyDescriptor = Object.getOwnPropertyDescriptor(parent, k);
|
|
32
|
+
if (propertyDescriptor.get !== void 0) if (propertyDescriptor.configurable) {
|
|
33
|
+
Object.defineProperty(parent, k, { value: replace });
|
|
34
|
+
arr.push([
|
|
35
|
+
parent,
|
|
36
|
+
k,
|
|
37
|
+
val,
|
|
38
|
+
propertyDescriptor
|
|
39
|
+
]);
|
|
40
|
+
} else replacerStack.push([
|
|
41
|
+
val,
|
|
42
|
+
k,
|
|
43
|
+
replace
|
|
44
|
+
]);
|
|
45
|
+
else {
|
|
46
|
+
parent[k] = replace;
|
|
47
|
+
arr.push([
|
|
48
|
+
parent,
|
|
49
|
+
k,
|
|
50
|
+
val
|
|
51
|
+
]);
|
|
52
|
+
}
|
|
62
53
|
}
|
|
63
54
|
function decirc(val, k, edgeIndex, stack, parent, depth, options) {
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
else {
|
|
91
|
-
var keys = Object.keys(val);
|
|
92
|
-
for (i = 0; i < keys.length; i++) {
|
|
93
|
-
var key = keys[i];
|
|
94
|
-
decirc(val[key], key, i, stack, val, depth, options);
|
|
95
|
-
}
|
|
96
|
-
}
|
|
97
|
-
stack.pop();
|
|
98
|
-
}
|
|
55
|
+
depth += 1;
|
|
56
|
+
var i;
|
|
57
|
+
if (typeof val === "object" && val !== null) {
|
|
58
|
+
for (i = 0; i < stack.length; i++) if (stack[i] === val) {
|
|
59
|
+
setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);
|
|
60
|
+
return;
|
|
61
|
+
}
|
|
62
|
+
if (typeof options.depthLimit !== "undefined" && depth > options.depthLimit) {
|
|
63
|
+
setReplace(LIMIT_REPLACE_NODE, val, k, parent);
|
|
64
|
+
return;
|
|
65
|
+
}
|
|
66
|
+
if (typeof options.edgesLimit !== "undefined" && edgeIndex + 1 > options.edgesLimit) {
|
|
67
|
+
setReplace(LIMIT_REPLACE_NODE, val, k, parent);
|
|
68
|
+
return;
|
|
69
|
+
}
|
|
70
|
+
stack.push(val);
|
|
71
|
+
if (Array.isArray(val)) for (i = 0; i < val.length; i++) decirc(val[i], i, i, stack, val, depth, options);
|
|
72
|
+
else {
|
|
73
|
+
var keys = Object.keys(val);
|
|
74
|
+
for (i = 0; i < keys.length; i++) {
|
|
75
|
+
var key = keys[i];
|
|
76
|
+
decirc(val[key], key, i, stack, val, depth, options);
|
|
77
|
+
}
|
|
78
|
+
}
|
|
79
|
+
stack.pop();
|
|
80
|
+
}
|
|
99
81
|
}
|
|
100
|
-
// Stable-stringify
|
|
101
|
-
function compareFunction(a, b) {
|
|
102
|
-
if (a < b) {
|
|
103
|
-
return -1;
|
|
104
|
-
}
|
|
105
|
-
if (a > b) {
|
|
106
|
-
return 1;
|
|
107
|
-
}
|
|
108
|
-
return 0;
|
|
109
|
-
}
|
|
110
|
-
function deterministicStringify(obj, replacer, spacer, options) {
|
|
111
|
-
if (typeof options === "undefined") {
|
|
112
|
-
options = defaultOptions();
|
|
113
|
-
}
|
|
114
|
-
var tmp = deterministicDecirc(obj, "", 0, [], undefined, 0, options) || obj;
|
|
115
|
-
var res;
|
|
116
|
-
try {
|
|
117
|
-
if (replacerStack.length === 0) {
|
|
118
|
-
res = JSON.stringify(tmp, replacer, spacer);
|
|
119
|
-
}
|
|
120
|
-
else {
|
|
121
|
-
res = JSON.stringify(tmp, replaceGetterValues(replacer), spacer);
|
|
122
|
-
}
|
|
123
|
-
}
|
|
124
|
-
catch (_) {
|
|
125
|
-
return JSON.stringify("[unable to serialize, circular reference is too complex to analyze]");
|
|
126
|
-
}
|
|
127
|
-
finally {
|
|
128
|
-
// Ensure that we restore the object as it was.
|
|
129
|
-
while (arr.length !== 0) {
|
|
130
|
-
var part = arr.pop();
|
|
131
|
-
if (part.length === 4) {
|
|
132
|
-
Object.defineProperty(part[0], part[1], part[3]);
|
|
133
|
-
}
|
|
134
|
-
else {
|
|
135
|
-
part[0][part[1]] = part[2];
|
|
136
|
-
}
|
|
137
|
-
}
|
|
138
|
-
}
|
|
139
|
-
return res;
|
|
140
|
-
}
|
|
141
|
-
function deterministicDecirc(val, k, edgeIndex, stack, parent, depth, options) {
|
|
142
|
-
depth += 1;
|
|
143
|
-
var i;
|
|
144
|
-
if (typeof val === "object" && val !== null) {
|
|
145
|
-
for (i = 0; i < stack.length; i++) {
|
|
146
|
-
if (stack[i] === val) {
|
|
147
|
-
setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);
|
|
148
|
-
return;
|
|
149
|
-
}
|
|
150
|
-
}
|
|
151
|
-
try {
|
|
152
|
-
if (typeof val.toJSON === "function") {
|
|
153
|
-
return;
|
|
154
|
-
}
|
|
155
|
-
}
|
|
156
|
-
catch (_) {
|
|
157
|
-
return;
|
|
158
|
-
}
|
|
159
|
-
if (typeof options.depthLimit !== "undefined" &&
|
|
160
|
-
depth > options.depthLimit) {
|
|
161
|
-
setReplace(LIMIT_REPLACE_NODE, val, k, parent);
|
|
162
|
-
return;
|
|
163
|
-
}
|
|
164
|
-
if (typeof options.edgesLimit !== "undefined" &&
|
|
165
|
-
edgeIndex + 1 > options.edgesLimit) {
|
|
166
|
-
setReplace(LIMIT_REPLACE_NODE, val, k, parent);
|
|
167
|
-
return;
|
|
168
|
-
}
|
|
169
|
-
stack.push(val);
|
|
170
|
-
// Optimize for Arrays. Big arrays could kill the performance otherwise!
|
|
171
|
-
if (Array.isArray(val)) {
|
|
172
|
-
for (i = 0; i < val.length; i++) {
|
|
173
|
-
deterministicDecirc(val[i], i, i, stack, val, depth, options);
|
|
174
|
-
}
|
|
175
|
-
}
|
|
176
|
-
else {
|
|
177
|
-
// Create a temporary object in the required way
|
|
178
|
-
var tmp = {};
|
|
179
|
-
var keys = Object.keys(val).sort(compareFunction);
|
|
180
|
-
for (i = 0; i < keys.length; i++) {
|
|
181
|
-
var key = keys[i];
|
|
182
|
-
deterministicDecirc(val[key], key, i, stack, val, depth, options);
|
|
183
|
-
tmp[key] = val[key];
|
|
184
|
-
}
|
|
185
|
-
if (typeof parent !== "undefined") {
|
|
186
|
-
arr.push([parent, k, val]);
|
|
187
|
-
parent[k] = tmp;
|
|
188
|
-
}
|
|
189
|
-
else {
|
|
190
|
-
return tmp;
|
|
191
|
-
}
|
|
192
|
-
}
|
|
193
|
-
stack.pop();
|
|
194
|
-
}
|
|
195
|
-
}
|
|
196
|
-
// wraps replacer function to handle values we couldn't replace
|
|
197
|
-
// and mark them as replaced value
|
|
198
82
|
function replaceGetterValues(replacer) {
|
|
199
|
-
|
|
200
|
-
|
|
201
|
-
|
|
202
|
-
|
|
203
|
-
|
|
204
|
-
|
|
205
|
-
|
|
206
|
-
|
|
207
|
-
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
|
|
211
|
-
|
|
212
|
-
|
|
213
|
-
}
|
|
214
|
-
}
|
|
215
|
-
}
|
|
216
|
-
return replacer.call(this, key, val);
|
|
217
|
-
};
|
|
83
|
+
replacer = typeof replacer !== "undefined" ? replacer : function(k, v) {
|
|
84
|
+
return v;
|
|
85
|
+
};
|
|
86
|
+
return function(key, val) {
|
|
87
|
+
if (replacerStack.length > 0) for (var i = 0; i < replacerStack.length; i++) {
|
|
88
|
+
var part = replacerStack[i];
|
|
89
|
+
if (part[1] === key && part[0] === val) {
|
|
90
|
+
val = part[2];
|
|
91
|
+
replacerStack.splice(i, 1);
|
|
92
|
+
break;
|
|
93
|
+
}
|
|
94
|
+
}
|
|
95
|
+
return replacer.call(this, key, val);
|
|
96
|
+
};
|
|
218
97
|
}
|
|
98
|
+
|
|
99
|
+
//#endregion
|
|
100
|
+
export { stringify };
|
|
219
101
|
//# sourceMappingURL=index.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","
|
|
1
|
+
{"version":3,"file":"index.js","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;AACV,IAAI,gBAAgB;AAEpB,SAAS,iBAAiB;AACxB,QAAO;EACL,YAAY,OAAO;EACnB,YAAY,OAAO;;;AAKvB,SAAgB,UAAU,KAAK,UAAW,QAAS,SAAU;AAC3D,KAAI,OAAO,YAAY,YACrB,WAAU;AAGZ,QAAO,KAAK,IAAI,GAAG,IAAI,QAAW,GAAG;CACrC,IAAI;AACJ,KAAI;AACF,MAAI,cAAc,WAAW,EAC3B,OAAM,KAAK,UAAU,KAAK,UAAU;MAEpC,OAAM,KAAK,UAAU,KAAK,oBAAoB,WAAW;UAEpD,GAAG;AACV,SAAO,KAAK,UACV;WAEM;AACR,SAAO,IAAI,WAAW,GAAG;GACvB,IAAI,OAAO,IAAI;AACf,OAAI,KAAK,WAAW,EAClB,QAAO,eAAe,KAAK,IAAI,KAAK,IAAI,KAAK;OAE7C,MAAK,GAAG,KAAK,MAAM,KAAK;;;AAI9B,QAAO;;AAGT,SAAS,WAAW,SAAS,KAAK,GAAG,QAAQ;CAC3C,IAAI,qBAAqB,OAAO,yBAAyB,QAAQ;AACjE,KAAI,mBAAmB,QAAQ,OAC7B,KAAI,mBAAmB,cAAc;AACnC,SAAO,eAAe,QAAQ,GAAG,EAAE,OAAO;AAC1C,MAAI,KAAK;GAAC;GAAQ;GAAG;GAAK;;OAE1B,eAAc,KAAK;EAAC;EAAK;EAAG;;MAEzB;AACL,SAAO,KAAK;AACZ,MAAI,KAAK;GAAC;GAAQ;GAAG;;;;AAIzB,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;AAC1C;;AAIJ,MACE,OAAO,QAAQ,eAAe,eAC9B,QAAQ,QAAQ,YAChB;AACA,cAAW,oBAAoB,KAAK,GAAG;AACvC;;AAGF,MACE,OAAO,QAAQ,eAAe,eAC9B,YAAY,IAAI,QAAQ,YACxB;AACA,cAAW,oBAAoB,KAAK,GAAG;AACvC;;AAGF,QAAM,KAAK;AAEX,MAAI,MAAM,QAAQ,KAChB,MAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC1B,QAAO,IAAI,IAAI,GAAG,GAAG,OAAO,KAAK,OAAO;OAErC;GACL,IAAI,OAAO,OAAO,KAAK;AACvB,QAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;IAChC,IAAI,MAAM,KAAK;AACf,WAAO,IAAI,MAAM,KAAK,GAAG,OAAO,KAAK,OAAO;;;AAGhD,QAAM;;;AA4GV,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;AACxB;;;AAIN,SAAO,SAAS,KAAK,MAAM,KAAK"}
|