@azure/provisioning-core 0.1.0-alpha.20261014.1
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/LICENSE +21 -0
- package/README.md +62 -0
- package/dist/constructs/built-in-resources/resource-group.d.ts +50 -0
- package/dist/constructs/built-in-resources/resource-group.d.ts.map +1 -0
- package/dist/constructs/built-in-resources/resource-group.js +97 -0
- package/dist/constructs/built-in-resources/resource-group.js.map +1 -0
- package/dist/constructs/output.d.ts +80 -0
- package/dist/constructs/output.d.ts.map +1 -0
- package/dist/constructs/output.js +76 -0
- package/dist/constructs/output.js.map +1 -0
- package/dist/constructs/parameter.d.ts +77 -0
- package/dist/constructs/parameter.d.ts.map +1 -0
- package/dist/constructs/parameter.js +93 -0
- package/dist/constructs/parameter.js.map +1 -0
- package/dist/constructs/provisioning-component.d.ts +91 -0
- package/dist/constructs/provisioning-component.d.ts.map +1 -0
- package/dist/constructs/provisioning-component.js +150 -0
- package/dist/constructs/provisioning-component.js.map +1 -0
- package/dist/constructs/resource/resource-proxy.d.ts +134 -0
- package/dist/constructs/resource/resource-proxy.d.ts.map +1 -0
- package/dist/constructs/resource/resource-proxy.js +523 -0
- package/dist/constructs/resource/resource-proxy.js.map +1 -0
- package/dist/constructs/resource/resource-query.d.ts +23 -0
- package/dist/constructs/resource/resource-query.d.ts.map +1 -0
- package/dist/constructs/resource/resource-query.js +71 -0
- package/dist/constructs/resource/resource-query.js.map +1 -0
- package/dist/constructs/resource/resource-registry.d.ts +99 -0
- package/dist/constructs/resource/resource-registry.d.ts.map +1 -0
- package/dist/constructs/resource/resource-registry.js +51 -0
- package/dist/constructs/resource/resource-registry.js.map +1 -0
- package/dist/constructs/resource/resource-type-registry.d.ts +46 -0
- package/dist/constructs/resource/resource-type-registry.d.ts.map +1 -0
- package/dist/constructs/resource/resource-type-registry.js +156 -0
- package/dist/constructs/resource/resource-type-registry.js.map +1 -0
- package/dist/constructs/resource/resource-utils.d.ts +60 -0
- package/dist/constructs/resource/resource-utils.d.ts.map +1 -0
- package/dist/constructs/resource/resource-utils.js +77 -0
- package/dist/constructs/resource/resource-utils.js.map +1 -0
- package/dist/constructs/resource/resource.d.ts +460 -0
- package/dist/constructs/resource/resource.d.ts.map +1 -0
- package/dist/constructs/resource/resource.js +584 -0
- package/dist/constructs/resource/resource.js.map +1 -0
- package/dist/constructs/stack.d.ts +110 -0
- package/dist/constructs/stack.d.ts.map +1 -0
- package/dist/constructs/stack.js +110 -0
- package/dist/constructs/stack.js.map +1 -0
- package/dist/constructs/variable.d.ts +63 -0
- package/dist/constructs/variable.d.ts.map +1 -0
- package/dist/constructs/variable.js +74 -0
- package/dist/constructs/variable.js.map +1 -0
- package/dist/deployment-context/deployment-context.d.ts +27 -0
- package/dist/deployment-context/deployment-context.d.ts.map +1 -0
- package/dist/deployment-context/deployment-context.js +4 -0
- package/dist/deployment-context/deployment-context.js.map +1 -0
- package/dist/expression/ast-nodes.d.ts +100 -0
- package/dist/expression/ast-nodes.d.ts.map +1 -0
- package/dist/expression/ast-nodes.js +127 -0
- package/dist/expression/ast-nodes.js.map +1 -0
- package/dist/expression/expressions.d.ts +164 -0
- package/dist/expression/expressions.d.ts.map +1 -0
- package/dist/expression/expressions.js +211 -0
- package/dist/expression/expressions.js.map +1 -0
- package/dist/fn.d.ts +194 -0
- package/dist/fn.d.ts.map +1 -0
- package/dist/fn.js +353 -0
- package/dist/fn.js.map +1 -0
- package/dist/index.d.ts +25 -0
- package/dist/index.d.ts.map +1 -0
- package/dist/index.js +19 -0
- package/dist/index.js.map +1 -0
- package/dist/internal-loop.d.ts +14 -0
- package/dist/internal-loop.d.ts.map +1 -0
- package/dist/internal-loop.js +16 -0
- package/dist/internal-loop.js.map +1 -0
- package/dist/internal.d.ts +13 -0
- package/dist/internal.d.ts.map +1 -0
- package/dist/internal.js +10 -0
- package/dist/internal.js.map +1 -0
- package/dist/naming/naming-policy.d.ts +56 -0
- package/dist/naming/naming-policy.d.ts.map +1 -0
- package/dist/naming/naming-policy.js +99 -0
- package/dist/naming/naming-policy.js.map +1 -0
- package/dist/naming/naming-rules.d.ts +15 -0
- package/dist/naming/naming-rules.d.ts.map +1 -0
- package/dist/naming/naming-rules.js +15 -0
- package/dist/naming/naming-rules.js.map +1 -0
- package/dist/serialization/contract/generated/ast.d.ts +508 -0
- package/dist/serialization/contract/generated/ast.d.ts.map +1 -0
- package/dist/serialization/contract/generated/ast.js +23 -0
- package/dist/serialization/contract/generated/ast.js.map +1 -0
- package/dist/serialization/contract/index.d.ts +2 -0
- package/dist/serialization/contract/index.d.ts.map +1 -0
- package/dist/serialization/contract/index.js +4 -0
- package/dist/serialization/contract/index.js.map +1 -0
- package/dist/serialization/index.d.ts +4 -0
- package/dist/serialization/index.d.ts.map +1 -0
- package/dist/serialization/index.js +5 -0
- package/dist/serialization/index.js.map +1 -0
- package/dist/serialization/json/deserialize.d.ts +24 -0
- package/dist/serialization/json/deserialize.d.ts.map +1 -0
- package/dist/serialization/json/deserialize.js +476 -0
- package/dist/serialization/json/deserialize.js.map +1 -0
- package/dist/serialization/json/encoding.d.ts +4 -0
- package/dist/serialization/json/encoding.d.ts.map +1 -0
- package/dist/serialization/json/encoding.js +323 -0
- package/dist/serialization/json/encoding.js.map +1 -0
- package/dist/serialization/json/expression.d.ts +32 -0
- package/dist/serialization/json/expression.d.ts.map +1 -0
- package/dist/serialization/json/expression.js +490 -0
- package/dist/serialization/json/expression.js.map +1 -0
- package/dist/serialization/json/lower.d.ts +41 -0
- package/dist/serialization/json/lower.d.ts.map +1 -0
- package/dist/serialization/json/lower.js +343 -0
- package/dist/serialization/json/lower.js.map +1 -0
- package/dist/serialization/json/pluralize-config.d.ts +3 -0
- package/dist/serialization/json/pluralize-config.d.ts.map +1 -0
- package/dist/serialization/json/pluralize-config.js +7 -0
- package/dist/serialization/json/pluralize-config.js.map +1 -0
- package/dist/serialization/json/serialize.d.ts +12 -0
- package/dist/serialization/json/serialize.d.ts.map +1 -0
- package/dist/serialization/json/serialize.js +399 -0
- package/dist/serialization/json/serialize.js.map +1 -0
- package/dist/serialization/json/util.d.ts +2 -0
- package/dist/serialization/json/util.d.ts.map +1 -0
- package/dist/serialization/json/util.js +19 -0
- package/dist/serialization/json/util.js.map +1 -0
- package/dist/serialization/utils.d.ts +3 -0
- package/dist/serialization/utils.d.ts.map +1 -0
- package/dist/serialization/utils.js +146 -0
- package/dist/serialization/utils.js.map +1 -0
- package/dist/shape/shape-registry.d.ts +51 -0
- package/dist/shape/shape-registry.d.ts.map +1 -0
- package/dist/shape/shape-registry.js +41 -0
- package/dist/shape/shape-registry.js.map +1 -0
- package/dist/shape/shape.d.ts +407 -0
- package/dist/shape/shape.d.ts.map +1 -0
- package/dist/shape/shape.js +425 -0
- package/dist/shape/shape.js.map +1 -0
- package/dist/shape/value-encoding.d.ts +121 -0
- package/dist/shape/value-encoding.d.ts.map +1 -0
- package/dist/shape/value-encoding.js +32 -0
- package/dist/shape/value-encoding.js.map +1 -0
- package/dist/tsconfig.tsbuildinfo +1 -0
- package/dist/types.d.ts +9 -0
- package/dist/types.d.ts.map +1 -0
- package/dist/types.js +4 -0
- package/dist/types.js.map +1 -0
- package/dist/util.d.ts +33 -0
- package/dist/util.d.ts.map +1 -0
- package/dist/util.js +78 -0
- package/dist/util.js.map +1 -0
- package/package.json +49 -0
|
@@ -0,0 +1,343 @@
|
|
|
1
|
+
// Copyright (c) Microsoft Corporation.
|
|
2
|
+
// Licensed under the MIT License.
|
|
3
|
+
/**
|
|
4
|
+
* ARM state-shape conversion.
|
|
5
|
+
*
|
|
6
|
+
* lowerState maps JS property names to ARM paths, restores flattened
|
|
7
|
+
* nesting, and encodes terminal values using the supplied model shape.
|
|
8
|
+
* raiseState performs the inverse conversion for deserialization.
|
|
9
|
+
* Both follow nested model, array, and record shapes and preserve unknown
|
|
10
|
+
* keys. Property-access expression lowering lives in expression.ts.
|
|
11
|
+
*/
|
|
12
|
+
import { isTerminalValueShape, resolveModelShape, } from "../../shape/shape.js";
|
|
13
|
+
import { isExpression } from "../../expression/expressions.js";
|
|
14
|
+
import { isExpressionNode } from "../../expression/ast-nodes.js";
|
|
15
|
+
import { decodeWireValue, encodeWireValue } from "./encoding.js";
|
|
16
|
+
const MISSING = Symbol("missing");
|
|
17
|
+
function assertNeverValueShape(shape) {
|
|
18
|
+
throw new Error(`Unhandled value shape: ${String(shape)}`);
|
|
19
|
+
}
|
|
20
|
+
// ---------------------------------------------------------------------------
|
|
21
|
+
// State lowering
|
|
22
|
+
// ---------------------------------------------------------------------------
|
|
23
|
+
function isPlainObject(value) {
|
|
24
|
+
if (value === null || typeof value !== "object")
|
|
25
|
+
return false;
|
|
26
|
+
// Expression proxies are opaque values (despite a null prototype) — they
|
|
27
|
+
// must not be treated as cloneable plain objects.
|
|
28
|
+
if (isExpression(value))
|
|
29
|
+
return false;
|
|
30
|
+
const proto = Object.getPrototypeOf(value);
|
|
31
|
+
return proto === Object.prototype || proto === null;
|
|
32
|
+
}
|
|
33
|
+
/**
|
|
34
|
+
* Recursively rewrite a raw state object into its ARM wire shape. Keys
|
|
35
|
+
* not present in `shape.byJsName` pass through unchanged. Multi-
|
|
36
|
+
* segment ARM paths (from `@flattenProperty`) re-nest objects; nested
|
|
37
|
+
* models, arrays-of-models and records-of-models recurse via
|
|
38
|
+
* `target`. Empty ARM paths fall back to the JS property name.
|
|
39
|
+
*
|
|
40
|
+
* Collisions where two JS-side keys map to overlapping ARM paths merge
|
|
41
|
+
* when both sides are compatible objects; non-object / object collisions
|
|
42
|
+
* throw.
|
|
43
|
+
*/
|
|
44
|
+
export function lowerState(state, shape, visited = new WeakSet()) {
|
|
45
|
+
if (visited.has(state)) {
|
|
46
|
+
throw new Error("Cycle detected while lowering ARM state.");
|
|
47
|
+
}
|
|
48
|
+
visited.add(state);
|
|
49
|
+
try {
|
|
50
|
+
const out = Object.create(null);
|
|
51
|
+
// Select the variant once, from the state we're about to lower —
|
|
52
|
+
// every key below is looked up against that one concrete shape.
|
|
53
|
+
const flat = resolveModelShape(shape, state, "js");
|
|
54
|
+
for (const [jsKey, rawValue] of Object.entries(state)) {
|
|
55
|
+
const propShape = flat?.byJsName[jsKey];
|
|
56
|
+
const path = propShape?.armPath.length ? propShape.armPath : [jsKey];
|
|
57
|
+
const loweredValue = lowerValue(rawValue, propShape?.value, visited, path);
|
|
58
|
+
if (!propShape) {
|
|
59
|
+
// Passthrough: key not in shape (e.g. CDK-internal, or emitter
|
|
60
|
+
// didn't include it).
|
|
61
|
+
assignPath(out, [jsKey], loweredValue);
|
|
62
|
+
continue;
|
|
63
|
+
}
|
|
64
|
+
assignPath(out, path, loweredValue);
|
|
65
|
+
}
|
|
66
|
+
return out;
|
|
67
|
+
}
|
|
68
|
+
finally {
|
|
69
|
+
visited.delete(state);
|
|
70
|
+
}
|
|
71
|
+
}
|
|
72
|
+
function lowerValue(value, shape, visited, path) {
|
|
73
|
+
if (value === null || value === undefined)
|
|
74
|
+
return value;
|
|
75
|
+
if (isExpression(value) || isExpressionNode(value))
|
|
76
|
+
return value;
|
|
77
|
+
if (!shape) {
|
|
78
|
+
return value;
|
|
79
|
+
}
|
|
80
|
+
if (isTerminalValueShape(shape)) {
|
|
81
|
+
if ("encoding" in shape && shape.encoding) {
|
|
82
|
+
return encodeWireValue(value, shape.encoding, path);
|
|
83
|
+
}
|
|
84
|
+
return value;
|
|
85
|
+
}
|
|
86
|
+
switch (shape.kind) {
|
|
87
|
+
case "deferred":
|
|
88
|
+
if (!isPlainObject(value))
|
|
89
|
+
return value;
|
|
90
|
+
// `lowerState` resolves the variant itself, per property, using
|
|
91
|
+
// `value` as the discriminator source.
|
|
92
|
+
return lowerState(value, shape.value(), visited);
|
|
93
|
+
case "array":
|
|
94
|
+
if (!Array.isArray(value))
|
|
95
|
+
return value;
|
|
96
|
+
return value.map((item, index) => lowerValue(item, shape.element, visited, [...path, String(index)]));
|
|
97
|
+
case "record": {
|
|
98
|
+
if (!isPlainObject(value))
|
|
99
|
+
return value;
|
|
100
|
+
const out = Object.create(null);
|
|
101
|
+
for (const [k, v] of Object.entries(value)) {
|
|
102
|
+
defineOwn(out, k, lowerValue(v, shape.value, visited, [...path, k]));
|
|
103
|
+
}
|
|
104
|
+
return out;
|
|
105
|
+
}
|
|
106
|
+
case "tuple":
|
|
107
|
+
if (!Array.isArray(value))
|
|
108
|
+
return value;
|
|
109
|
+
return value.map((item, index) => lowerValue(item, shape.values[index], visited, [
|
|
110
|
+
...path,
|
|
111
|
+
String(index),
|
|
112
|
+
]));
|
|
113
|
+
default:
|
|
114
|
+
return assertNeverValueShape(shape);
|
|
115
|
+
}
|
|
116
|
+
}
|
|
117
|
+
/**
|
|
118
|
+
* Write `value` into `target` at the given ARM path, deep-merging with
|
|
119
|
+
* existing object values. Throws on non-object/object or
|
|
120
|
+
* object/non-object collisions.
|
|
121
|
+
*/
|
|
122
|
+
function assignPath(target, path, value) {
|
|
123
|
+
if (path.length === 0)
|
|
124
|
+
return;
|
|
125
|
+
let cursor = target;
|
|
126
|
+
for (let i = 0; i < path.length - 1; i++) {
|
|
127
|
+
const seg = path[i];
|
|
128
|
+
const existing = Object.prototype.hasOwnProperty.call(cursor, seg)
|
|
129
|
+
? cursor[seg]
|
|
130
|
+
: undefined;
|
|
131
|
+
if (existing === undefined) {
|
|
132
|
+
const next = Object.create(null);
|
|
133
|
+
defineOwn(cursor, seg, next);
|
|
134
|
+
cursor = next;
|
|
135
|
+
}
|
|
136
|
+
else if (isPlainObject(existing)) {
|
|
137
|
+
cursor = existing;
|
|
138
|
+
}
|
|
139
|
+
else {
|
|
140
|
+
throw new Error(`ARM path collision at "${path.slice(0, i + 1).join(".")}": expected object, got ${typeof existing}.`);
|
|
141
|
+
}
|
|
142
|
+
}
|
|
143
|
+
const leafKey = path[path.length - 1];
|
|
144
|
+
const existingLeaf = Object.prototype.hasOwnProperty.call(cursor, leafKey)
|
|
145
|
+
? cursor[leafKey]
|
|
146
|
+
: undefined;
|
|
147
|
+
if (existingLeaf === undefined) {
|
|
148
|
+
defineOwn(cursor, leafKey, value);
|
|
149
|
+
return;
|
|
150
|
+
}
|
|
151
|
+
if (isPlainObject(existingLeaf) && isPlainObject(value)) {
|
|
152
|
+
defineOwn(cursor, leafKey, deepMerge(existingLeaf, value, path));
|
|
153
|
+
return;
|
|
154
|
+
}
|
|
155
|
+
throw new Error(`ARM path collision at "${path.join(".")}": cannot merge ${typeof existingLeaf} with ${typeof value}.`);
|
|
156
|
+
}
|
|
157
|
+
function deepMerge(a, b, prefix) {
|
|
158
|
+
const out = Object.create(null);
|
|
159
|
+
for (const [key, value] of Object.entries(a))
|
|
160
|
+
defineOwn(out, key, value);
|
|
161
|
+
for (const [k, v] of Object.entries(b)) {
|
|
162
|
+
const existing = Object.prototype.hasOwnProperty.call(out, k)
|
|
163
|
+
? out[k]
|
|
164
|
+
: undefined;
|
|
165
|
+
if (existing === undefined) {
|
|
166
|
+
defineOwn(out, k, v);
|
|
167
|
+
continue;
|
|
168
|
+
}
|
|
169
|
+
if (isPlainObject(existing) && isPlainObject(v)) {
|
|
170
|
+
defineOwn(out, k, deepMerge(existing, v, [...prefix, k]));
|
|
171
|
+
continue;
|
|
172
|
+
}
|
|
173
|
+
throw new Error(`ARM path collision at "${[...prefix, k].join(".")}": cannot merge ${typeof existing} with ${typeof v}.`);
|
|
174
|
+
}
|
|
175
|
+
return out;
|
|
176
|
+
}
|
|
177
|
+
function defineOwn(target, key, value) {
|
|
178
|
+
Object.defineProperty(target, key, {
|
|
179
|
+
value,
|
|
180
|
+
enumerable: true,
|
|
181
|
+
configurable: true,
|
|
182
|
+
writable: true,
|
|
183
|
+
});
|
|
184
|
+
}
|
|
185
|
+
// ---------------------------------------------------------------------------
|
|
186
|
+
// State raising (inverse of lowerState)
|
|
187
|
+
// ---------------------------------------------------------------------------
|
|
188
|
+
/**
|
|
189
|
+
* Inverse of `lowerState`: walks a wire-shape state object and lifts
|
|
190
|
+
* values at each property entry's `armPath` back onto the flat
|
|
191
|
+
* `jsName` key. Recurses into nested model / array / record values via
|
|
192
|
+
* `target`. Empty ARM paths fall back to the JS property name.
|
|
193
|
+
*
|
|
194
|
+
* ARM-shape keys that consumed a nested object entirely (single-segment
|
|
195
|
+
* paths carrying a model `target`) pop that segment from the source
|
|
196
|
+
* so leftovers at intermediate nodes don't silently leak into the
|
|
197
|
+
* output. For multi-segment paths (`@flattenProperty`), only the leaf
|
|
198
|
+
* is extracted; intermediate shared objects may survive as their own
|
|
199
|
+
* top-level entries if the shape also declares a jsName for them.
|
|
200
|
+
*
|
|
201
|
+
* Keys present in the state but not consumed by any property entry
|
|
202
|
+
* pass through unchanged (preserving the "unknown key" escape hatch
|
|
203
|
+
* documented in `lowerState`).
|
|
204
|
+
*/
|
|
205
|
+
export function raiseState(state, shape, visited = new WeakSet()) {
|
|
206
|
+
if (visited.has(state)) {
|
|
207
|
+
throw new Error("Cycle detected while raising ARM state.");
|
|
208
|
+
}
|
|
209
|
+
visited.add(state);
|
|
210
|
+
try {
|
|
211
|
+
// Wire-shaped input, so the variant is selected against ARM keys.
|
|
212
|
+
const flat = resolveModelShape(shape, state, "arm");
|
|
213
|
+
if (!flat)
|
|
214
|
+
return structuredCloneLike(state, new WeakSet());
|
|
215
|
+
// Clone into a mutable working copy so we can prune consumed paths.
|
|
216
|
+
const working = structuredCloneLike(state, new WeakSet());
|
|
217
|
+
const out = Object.create(null);
|
|
218
|
+
const consumedTopLevel = new Set();
|
|
219
|
+
for (const [jsName, propShape] of Object.entries(flat.byJsName)) {
|
|
220
|
+
const path = propShape.armPath.length > 0 ? propShape.armPath : [jsName];
|
|
221
|
+
const extracted = extractPath(working, path);
|
|
222
|
+
if (extracted === MISSING)
|
|
223
|
+
continue;
|
|
224
|
+
const raised = raiseValue(extracted, propShape.value, visited, path);
|
|
225
|
+
defineOwn(out, jsName, raised);
|
|
226
|
+
consumedTopLevel.add(path[0]);
|
|
227
|
+
}
|
|
228
|
+
// Passthrough: anything left in `working` that wasn't consumed by a
|
|
229
|
+
// shape-driven extraction and doesn't collide with an already-
|
|
230
|
+
// placed jsName.
|
|
231
|
+
for (const [k, v] of Object.entries(working)) {
|
|
232
|
+
if (consumedTopLevel.has(k)) {
|
|
233
|
+
// Top-level segment was touched by at least one armPath. If
|
|
234
|
+
// residue remains (e.g. sibling properties the shape didn't
|
|
235
|
+
// cover), surface it under the original ARM key so it's not
|
|
236
|
+
// silently dropped.
|
|
237
|
+
if (isPlainObject(v) && Object.keys(v).length === 0)
|
|
238
|
+
continue;
|
|
239
|
+
if (v === undefined)
|
|
240
|
+
continue;
|
|
241
|
+
}
|
|
242
|
+
if (Object.prototype.hasOwnProperty.call(out, k))
|
|
243
|
+
continue;
|
|
244
|
+
defineOwn(out, k, v);
|
|
245
|
+
}
|
|
246
|
+
return out;
|
|
247
|
+
}
|
|
248
|
+
finally {
|
|
249
|
+
visited.delete(state);
|
|
250
|
+
}
|
|
251
|
+
}
|
|
252
|
+
function raiseValue(value, shape, visited, path) {
|
|
253
|
+
if (value === null || value === undefined)
|
|
254
|
+
return value;
|
|
255
|
+
if (isExpression(value) || isExpressionNode(value))
|
|
256
|
+
return value;
|
|
257
|
+
if (!shape)
|
|
258
|
+
return value;
|
|
259
|
+
if (isTerminalValueShape(shape)) {
|
|
260
|
+
if ("encoding" in shape && shape.encoding) {
|
|
261
|
+
return decodeWireValue(value, shape.encoding, path);
|
|
262
|
+
}
|
|
263
|
+
return value;
|
|
264
|
+
}
|
|
265
|
+
switch (shape.kind) {
|
|
266
|
+
case "deferred":
|
|
267
|
+
if (!isPlainObject(value))
|
|
268
|
+
return value;
|
|
269
|
+
// `raiseState` selects the variant itself, against ARM keys.
|
|
270
|
+
return raiseState(value, shape.value(), visited);
|
|
271
|
+
case "array":
|
|
272
|
+
if (!Array.isArray(value))
|
|
273
|
+
return value;
|
|
274
|
+
return value.map((item, index) => raiseValue(item, shape.element, visited, [...path, String(index)]));
|
|
275
|
+
case "record": {
|
|
276
|
+
if (!isPlainObject(value))
|
|
277
|
+
return value;
|
|
278
|
+
const out = Object.create(null);
|
|
279
|
+
for (const [k, v] of Object.entries(value)) {
|
|
280
|
+
defineOwn(out, k, raiseValue(v, shape.value, visited, [...path, k]));
|
|
281
|
+
}
|
|
282
|
+
return out;
|
|
283
|
+
}
|
|
284
|
+
case "tuple":
|
|
285
|
+
if (!Array.isArray(value))
|
|
286
|
+
return value;
|
|
287
|
+
return value.map((item, index) => raiseValue(item, shape.values[index], visited, [
|
|
288
|
+
...path,
|
|
289
|
+
String(index),
|
|
290
|
+
]));
|
|
291
|
+
default:
|
|
292
|
+
return assertNeverValueShape(shape);
|
|
293
|
+
}
|
|
294
|
+
}
|
|
295
|
+
/**
|
|
296
|
+
* Walk `obj` along `path`, returning the leaf value and pruning it
|
|
297
|
+
* from the tree. Empty intermediate objects are left in place (caller
|
|
298
|
+
* decides how to treat residue).
|
|
299
|
+
*
|
|
300
|
+
* Returns `MISSING` when any segment is absent or not a plain object.
|
|
301
|
+
*/
|
|
302
|
+
function extractPath(obj, path) {
|
|
303
|
+
if (path.length === 0)
|
|
304
|
+
return obj;
|
|
305
|
+
let cursor = obj;
|
|
306
|
+
for (let i = 0; i < path.length - 1; i++) {
|
|
307
|
+
const seg = path[i];
|
|
308
|
+
const next = Object.prototype.hasOwnProperty.call(cursor, seg)
|
|
309
|
+
? cursor[seg]
|
|
310
|
+
: undefined;
|
|
311
|
+
if (!isPlainObject(next))
|
|
312
|
+
return MISSING;
|
|
313
|
+
cursor = next;
|
|
314
|
+
}
|
|
315
|
+
const leafKey = path[path.length - 1];
|
|
316
|
+
if (!Object.prototype.hasOwnProperty.call(cursor, leafKey))
|
|
317
|
+
return MISSING;
|
|
318
|
+
const value = cursor[leafKey];
|
|
319
|
+
delete cursor[leafKey];
|
|
320
|
+
return value;
|
|
321
|
+
}
|
|
322
|
+
/**
|
|
323
|
+
* Shallow-clone recursively enough to avoid mutating caller state.
|
|
324
|
+
* We only copy plain objects; arrays and other values are shared
|
|
325
|
+
* (raiseValue handles arrays via `.map` so mutation is contained).
|
|
326
|
+
*/
|
|
327
|
+
function structuredCloneLike(value, seen) {
|
|
328
|
+
if (seen.has(value)) {
|
|
329
|
+
// Preserve the cycle for downstream detection in raiseState.
|
|
330
|
+
return value;
|
|
331
|
+
}
|
|
332
|
+
seen.add(value);
|
|
333
|
+
const out = Object.create(null);
|
|
334
|
+
for (const [k, v] of Object.entries(value)) {
|
|
335
|
+
defineOwn(out, k, isExpression(v) || isExpressionNode(v)
|
|
336
|
+
? v
|
|
337
|
+
: isPlainObject(v)
|
|
338
|
+
? structuredCloneLike(v, seen)
|
|
339
|
+
: v);
|
|
340
|
+
}
|
|
341
|
+
return out;
|
|
342
|
+
}
|
|
343
|
+
//# sourceMappingURL=lower.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"lower.js","sourceRoot":"","sources":["../../../src/serialization/json/lower.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAElC;;;;;;;;GAQG;AAEH,OAAO,EACL,oBAAoB,EAGpB,iBAAiB,GAClB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAC/D,OAAO,EAAE,gBAAgB,EAAE,MAAM,+BAA+B,CAAC;AACjE,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAEjE,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;AAElC,SAAS,qBAAqB,CAAC,KAAY;IACzC,MAAM,IAAI,KAAK,CAAC,0BAA0B,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;AAC7D,CAAC;AAED,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E,SAAS,aAAa,CAAC,KAAc;IACnC,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC9D,yEAAyE;IACzE,kDAAkD;IAClD,IAAI,YAAY,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACtC,MAAM,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;IAC3C,OAAO,KAAK,KAAK,MAAM,CAAC,SAAS,IAAI,KAAK,KAAK,IAAI,CAAC;AACtD,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,UAAU,CACxB,KAA8B,EAC9B,KAAiB,EACjB,UAA2B,IAAI,OAAO,EAAE;IAExC,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC9D,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnB,IAAI,CAAC;QACH,MAAM,GAAG,GAA4B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzD,iEAAiE;QACjE,gEAAgE;QAChE,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAEnD,KAAK,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACtD,MAAM,SAAS,GAAG,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;YACxC,MAAM,IAAI,GAAG,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACrE,MAAM,YAAY,GAAG,UAAU,CAC7B,QAAQ,EACR,SAAS,EAAE,KAAK,EAChB,OAAO,EACP,IAAI,CACL,CAAC;YAEF,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,+DAA+D;gBAC/D,sBAAsB;gBACtB,UAAU,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,YAAY,CAAC,CAAC;gBACvC,SAAS;YACX,CAAC;YAED,UAAU,CAAC,GAAG,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;QACtC,CAAC;QAED,OAAO,GAAG,CAAC;IACb,CAAC;YAAS,CAAC;QACT,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CACjB,KAAc,EACd,KAA6B,EAC7B,OAAwB,EACxB,IAAuB;IAEvB,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACxD,IAAI,YAAY,CAAC,KAAK,CAAC,IAAI,gBAAgB,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAEjE,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,oBAAoB,CAAC,KAAK,CAAC,EAAE,CAAC;QAChC,IAAI,UAAU,IAAI,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC1C,OAAO,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,UAAU;YACb,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,gEAAgE;YAChE,uCAAuC;YACvC,OAAO,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,CAAC;QACnD,KAAK,OAAO;YACV,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAC/B,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CACnE,CAAC;QACJ,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,GAAG,GAA4B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACzD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3C,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACvE,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,OAAO;YACV,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAC/B,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE;gBAC7C,GAAG,IAAI;gBACP,MAAM,CAAC,KAAK,CAAC;aACd,CAAC,CACH,CAAC;QACJ;YACE,OAAO,qBAAqB,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CACjB,MAA+B,EAC/B,IAAuB,EACvB,KAAc;IAEd,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAE9B,IAAI,MAAM,GAAG,MAAM,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACrB,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;YAChE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;YACb,CAAC,CAAC,SAAS,CAAC;QACd,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,IAAI,GAA4B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1D,SAAS,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;YAC7B,MAAM,GAAG,IAAI,CAAC;QAChB,CAAC;aAAM,IAAI,aAAa,CAAC,QAAQ,CAAC,EAAE,CAAC;YACnC,MAAM,GAAG,QAAQ,CAAC;QACpB,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CACb,0BAA0B,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,2BAA2B,OAAO,QAAQ,GAAG,CACtG,CAAC;QACJ,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;IACvC,MAAM,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC;QACxE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC;QACjB,CAAC,CAAC,SAAS,CAAC;IACd,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;QAC/B,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAClC,OAAO;IACT,CAAC;IAED,IAAI,aAAa,CAAC,YAAY,CAAC,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QACxD,SAAS,CACP,MAAM,EACN,OAAO,EACP,SAAS,CACP,YAAuC,EACvC,KAAgC,EAChC,IAAI,CACL,CACF,CAAC;QACF,OAAO;IACT,CAAC;IAED,MAAM,IAAI,KAAK,CACb,0BAA0B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,mBAAmB,OAAO,YAAY,SAAS,OAAO,KAAK,GAAG,CACvG,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAChB,CAA0B,EAC1B,CAA0B,EAC1B,MAAyB;IAEzB,MAAM,GAAG,GAA4B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACzD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,SAAS,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IACzE,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;YAC3D,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACR,CAAC,CAAC,SAAS,CAAC;QACd,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACrB,SAAS;QACX,CAAC;QACD,IAAI,aAAa,CAAC,QAAQ,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;YAChD,SAAS,CACP,GAAG,EACH,CAAC,EACD,SAAS,CACP,QAAmC,EACnC,CAA4B,EAC5B,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,CACf,CACF,CAAC;YACF,SAAS;QACX,CAAC;QACD,MAAM,IAAI,KAAK,CACb,0BAA0B,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,mBAAmB,OAAO,QAAQ,SAAS,OAAO,CAAC,GAAG,CACzG,CAAC;IACJ,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,SAAS,CAChB,MAA+B,EAC/B,GAAW,EACX,KAAc;IAEd,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE;QACjC,KAAK;QACL,UAAU,EAAE,IAAI;QAChB,YAAY,EAAE,IAAI;QAClB,QAAQ,EAAE,IAAI;KACf,CAAC,CAAC;AACL,CAAC;AAED,8EAA8E;AAC9E,wCAAwC;AACxC,8EAA8E;AAE9E;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,UAAU,CACxB,KAA8B,EAC9B,KAAiB,EACjB,UAA2B,IAAI,OAAO,EAAE;IAExC,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;IAC7D,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnB,IAAI,CAAC;QACH,kEAAkE;QAClE,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,CAAC,IAAI;YAAE,OAAO,mBAAmB,CAAC,KAAK,EAAE,IAAI,OAAO,EAAE,CAAC,CAAC;QAE5D,oEAAoE;QACpE,MAAM,OAAO,GAA4B,mBAAmB,CAC1D,KAAK,EACL,IAAI,OAAO,EAAE,CACd,CAAC;QACF,MAAM,GAAG,GAA4B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzD,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC;QAE3C,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACzE,MAAM,SAAS,GAAG,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAC7C,IAAI,SAAS,KAAK,OAAO;gBAAE,SAAS;YAEpC,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;YACrE,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YAE/B,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QACjC,CAAC;QAED,oEAAoE;QACpE,+DAA+D;QAC/D,iBAAiB;QACjB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YAC7C,IAAI,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5B,4DAA4D;gBAC5D,4DAA4D;gBAC5D,4DAA4D;gBAC5D,oBAAoB;gBACpB,IAAI,aAAa,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;oBAAE,SAAS;gBAC9D,IAAI,CAAC,KAAK,SAAS;oBAAE,SAAS;YAChC,CAAC;YACD,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;gBAAE,SAAS;YAC3D,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,OAAO,GAAG,CAAC;IACb,CAAC;YAAS,CAAC;QACT,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CACjB,KAAc,EACd,KAA6B,EAC7B,OAAwB,EACxB,IAAuB;IAEvB,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACxD,IAAI,YAAY,CAAC,KAAK,CAAC,IAAI,gBAAgB,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACjE,IAAI,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC;IAEzB,IAAI,oBAAoB,CAAC,KAAK,CAAC,EAAE,CAAC;QAChC,IAAI,UAAU,IAAI,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC1C,OAAO,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,UAAU;YACb,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,6DAA6D;YAC7D,OAAO,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,CAAC;QACnD,KAAK,OAAO;YACV,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAC/B,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CACnE,CAAC;QACJ,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,GAAG,GAA4B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACzD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3C,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACvE,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,OAAO;YACV,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAC/B,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE;gBAC7C,GAAG,IAAI;gBACP,MAAM,CAAC,KAAK,CAAC;aACd,CAAC,CACH,CAAC;QACJ;YACE,OAAO,qBAAqB,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,WAAW,CAClB,GAA4B,EAC5B,IAAuB;IAEvB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAElC,IAAI,MAAM,GAA4B,GAAG,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACrB,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;YAC5D,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;YACb,CAAC,CAAC,SAAS,CAAC;QACd,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;YAAE,OAAO,OAAO,CAAC;QACzC,MAAM,GAAG,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;IACvC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IAC3E,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9B,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC;IACvB,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAS,mBAAmB,CAC1B,KAA8B,EAC9B,IAAqB;IAErB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACpB,6DAA6D;QAC7D,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAChB,MAAM,GAAG,GAA4B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACzD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3C,SAAS,CACP,GAAG,EACH,CAAC,EACD,YAAY,CAAC,CAAC,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC;YACpC,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;gBAChB,CAAC,CAAC,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC;gBAC9B,CAAC,CAAC,CAAC,CACR,CAAC;IACJ,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"pluralize-config.d.ts","sourceRoot":"","sources":["../../../src/serialization/json/pluralize-config.ts"],"names":[],"mappings":"AAGA,OAAO,YAAY,MAAM,WAAW,CAAC;AAKrC,eAAe,YAAY,CAAC"}
|
|
@@ -0,0 +1,7 @@
|
|
|
1
|
+
// Copyright (c) Microsoft Corporation.
|
|
2
|
+
// Licensed under the MIT License.
|
|
3
|
+
import pluralizeLib from "pluralize";
|
|
4
|
+
pluralizeLib.addUncountableRule("redis");
|
|
5
|
+
pluralizeLib.addSingularRule(/(cache)s$/i, "$1");
|
|
6
|
+
export default pluralizeLib;
|
|
7
|
+
//# sourceMappingURL=pluralize-config.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"pluralize-config.js","sourceRoot":"","sources":["../../../src/serialization/json/pluralize-config.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAElC,OAAO,YAAY,MAAM,WAAW,CAAC;AAErC,YAAY,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;AACzC,YAAY,CAAC,eAAe,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;AAEjD,eAAe,YAAY,CAAC"}
|
|
@@ -0,0 +1,12 @@
|
|
|
1
|
+
import type { Stack } from "../../constructs/stack.js";
|
|
2
|
+
import type { SerializationDocument } from "../contract/index.js";
|
|
3
|
+
/**
|
|
4
|
+
* Serializes a stack or a nonempty array of stacks into a JSON-compatible
|
|
5
|
+
* {@link SerializationDocument} with one `infras` entry per stack.
|
|
6
|
+
*
|
|
7
|
+
* The document preserves declarations and symbolic expressions for rendering
|
|
8
|
+
* or restoration. Pass `JSON.stringify(serialize(stack))` to {@link deserialize}
|
|
9
|
+
* to reconstruct the authored stack; this does not deploy any resources.
|
|
10
|
+
*/
|
|
11
|
+
export declare function serialize(input: Stack | readonly Stack[]): SerializationDocument;
|
|
12
|
+
//# sourceMappingURL=serialize.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"serialize.d.ts","sourceRoot":"","sources":["../../../src/serialization/json/serialize.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,2BAA2B,CAAC;AAsBvD,OAAO,KAAK,EAQV,qBAAqB,EAEtB,MAAM,sBAAsB,CAAC;AAmf9B;;;;;;;GAOG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,KAAK,GAAG,SAAS,KAAK,EAAE,GAC9B,qBAAqB,CAavB"}
|