@azure/provisioning-core 1.0.0-beta.1

package/dist/browser/serialization/json/lower.js

@@ -0,0 +1,334 @@
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+/**
+ * ARM state-shape conversion.
+ *
+ * lowerState maps JS property names to ARM paths, restores flattened
+ * nesting, and encodes terminal values using the supplied model shape.
+ * raiseState performs the inverse conversion for deserialization.
+ * Both follow nested model, array, and record shapes and preserve unknown
+ * keys. Property-access expression lowering lives in expression.ts.
+ */
+import { isTerminalValueShape, resolveModelShape, } from "../../shape/shape.js";
+import { isExpression } from "../../expression/expressions.js";
+import { isExpressionNode } from "../../expression/ast-nodes.js";
+import { decodeWireValue, encodeWireValue } from "./encoding.js";
+const MISSING = Symbol("missing");
+function assertNeverValueShape(shape) {
+    throw new Error(`Unhandled value shape: ${String(shape)}`);
+}
+// ---------------------------------------------------------------------------
+// State lowering
+// ---------------------------------------------------------------------------
+function isPlainObject(value) {
+    if (value === null || typeof value !== "object")
+        return false;
+    // Expression proxies are opaque values (despite a null prototype) — they
+    // must not be treated as cloneable plain objects.
+    if (isExpression(value))
+        return false;
+    const proto = Object.getPrototypeOf(value);
+    return proto === Object.prototype || proto === null;
+}
+/**
+ * Recursively rewrite a raw state object into its ARM wire shape. Keys
+ * not present in `shape.byJsName` pass through unchanged. Multi-
+ * segment ARM paths (from `@flattenProperty`) re-nest objects; nested
+ * models, arrays-of-models and records-of-models recurse via
+ * `target`. Empty ARM paths fall back to the JS property name.
+ *
+ * Collisions where two JS-side keys map to overlapping ARM paths merge
+ * when both sides are compatible objects; non-object / object collisions
+ * throw.
+ */
+export function lowerState(state, shape, visited = new WeakSet()) {
+    if (visited.has(state)) {
+        throw new Error("Cycle detected while lowering ARM state.");
+    }
+    visited.add(state);
+    try {
+        const out = Object.create(null);
+        // Select the variant once, from the state we're about to lower —
+        // every key below is looked up against that one concrete shape.
+        const flat = resolveModelShape(shape, state, "js");
+        for (const [jsKey, rawValue] of Object.entries(state)) {
+            const propShape = flat?.byJsName[jsKey];
+            const path = propShape?.armPath.length ? propShape.armPath : [jsKey];
+            const loweredValue = lowerValue(rawValue, propShape?.value, visited, path);
+            if (!propShape) {
+                // Passthrough: key not in shape (e.g. CDK-internal, or emitter
+                // didn't include it).
+                assignPath(out, [jsKey], loweredValue);
+                continue;
+            }
+            assignPath(out, path, loweredValue);
+        }
+        return out;
+    }
+    finally {
+        visited.delete(state);
+    }
+}
+function lowerValue(value, shape, visited, path) {
+    if (value === null || value === undefined)
+        return value;
+    if (isExpression(value) || isExpressionNode(value))
+        return value;
+    if (!shape) {
+        return value;
+    }
+    if (isTerminalValueShape(shape)) {
+        if ("encoding" in shape && shape.encoding) {
+            return encodeWireValue(value, shape.encoding, path);
+        }
+        return value;
+    }
+    switch (shape.kind) {
+        case "deferred":
+            if (!isPlainObject(value))
+                return value;
+            // `lowerState` resolves the variant itself, per property, using
+            // `value` as the discriminator source.
+            return lowerState(value, shape.value(), visited);
+        case "array":
+            if (!Array.isArray(value))
+                return value;
+            return value.map((item, index) => lowerValue(item, shape.element, visited, [...path, String(index)]));
+        case "record": {
+            if (!isPlainObject(value))
+                return value;
+            const out = Object.create(null);
+            for (const [k, v] of Object.entries(value)) {
+                defineOwn(out, k, lowerValue(v, shape.value, visited, [...path, k]));
+            }
+            return out;
+        }
+        case "tuple":
+            if (!Array.isArray(value))
+                return value;
+            return value.map((item, index) => lowerValue(item, shape.values[index], visited, [...path, String(index)]));
+        default:
+            return assertNeverValueShape(shape);
+    }
+}
+/**
+ * Write `value` into `target` at the given ARM path, deep-merging with
+ * existing object values. Throws on non-object/object or
+ * object/non-object collisions.
+ */
+function assignPath(target, path, value) {
+    if (path.length === 0)
+        return;
+    let cursor = target;
+    for (let i = 0; i < path.length - 1; i++) {
+        const seg = path[i];
+        const existing = Object.prototype.hasOwnProperty.call(cursor, seg) ? cursor[seg] : undefined;
+        if (existing === undefined) {
+            const next = Object.create(null);
+            defineOwn(cursor, seg, next);
+            cursor = next;
+        }
+        else if (isPlainObject(existing)) {
+            cursor = existing;
+        }
+        else {
+            throw new Error(`ARM path collision at "${path.slice(0, i + 1).join(".")}": expected object, got ${typeof existing}.`);
+        }
+    }
+    const leafKey = path[path.length - 1];
+    const existingLeaf = Object.prototype.hasOwnProperty.call(cursor, leafKey)
+        ? cursor[leafKey]
+        : undefined;
+    if (existingLeaf === undefined) {
+        defineOwn(cursor, leafKey, value);
+        return;
+    }
+    if (isPlainObject(existingLeaf) && isPlainObject(value)) {
+        defineOwn(cursor, leafKey, deepMerge(existingLeaf, value, path));
+        return;
+    }
+    throw new Error(`ARM path collision at "${path.join(".")}": cannot merge ${typeof existingLeaf} with ${typeof value}.`);
+}
+function deepMerge(a, b, prefix) {
+    const out = Object.create(null);
+    for (const [key, value] of Object.entries(a))
+        defineOwn(out, key, value);
+    for (const [k, v] of Object.entries(b)) {
+        const existing = Object.prototype.hasOwnProperty.call(out, k) ? out[k] : undefined;
+        if (existing === undefined) {
+            defineOwn(out, k, v);
+            continue;
+        }
+        if (isPlainObject(existing) && isPlainObject(v)) {
+            defineOwn(out, k, deepMerge(existing, v, [
+                ...prefix,
+                k,
+            ]));
+            continue;
+        }
+        throw new Error(`ARM path collision at "${[...prefix, k].join(".")}": cannot merge ${typeof existing} with ${typeof v}.`);
+    }
+    return out;
+}
+function defineOwn(target, key, value) {
+    Object.defineProperty(target, key, {
+        value,
+        enumerable: true,
+        configurable: true,
+        writable: true,
+    });
+}
+// ---------------------------------------------------------------------------
+// State raising (inverse of lowerState)
+// ---------------------------------------------------------------------------
+/**
+ * Inverse of `lowerState`: walks a wire-shape state object and lifts
+ * values at each property entry's `armPath` back onto the flat
+ * `jsName` key. Recurses into nested model / array / record values via
+ * `target`. Empty ARM paths fall back to the JS property name.
+ *
+ * ARM-shape keys that consumed a nested object entirely (single-segment
+ * paths carrying a model `target`) pop that segment from the source
+ * so leftovers at intermediate nodes don't silently leak into the
+ * output. For multi-segment paths (`@flattenProperty`), only the leaf
+ * is extracted; intermediate shared objects may survive as their own
+ * top-level entries if the shape also declares a jsName for them.
+ *
+ * Keys present in the state but not consumed by any property entry
+ * pass through unchanged (preserving the "unknown key" escape hatch
+ * documented in `lowerState`).
+ */
+export function raiseState(state, shape, visited = new WeakSet()) {
+    if (visited.has(state)) {
+        throw new Error("Cycle detected while raising ARM state.");
+    }
+    visited.add(state);
+    try {
+        // Wire-shaped input, so the variant is selected against ARM keys.
+        const flat = resolveModelShape(shape, state, "arm");
+        if (!flat)
+            return structuredCloneLike(state, new WeakSet());
+        // Clone into a mutable working copy so we can prune consumed paths.
+        const working = structuredCloneLike(state, new WeakSet());
+        const out = Object.create(null);
+        const consumedTopLevel = new Set();
+        for (const [jsName, propShape] of Object.entries(flat.byJsName)) {
+            const path = propShape.armPath.length > 0 ? propShape.armPath : [jsName];
+            const extracted = extractPath(working, path);
+            if (extracted === MISSING)
+                continue;
+            const raised = raiseValue(extracted, propShape.value, visited, path);
+            defineOwn(out, jsName, raised);
+            consumedTopLevel.add(path[0]);
+        }
+        // Passthrough: anything left in `working` that wasn't consumed by a
+        // shape-driven extraction and doesn't collide with an already-
+        // placed jsName.
+        for (const [k, v] of Object.entries(working)) {
+            if (consumedTopLevel.has(k)) {
+                // Top-level segment was touched by at least one armPath. If
+                // residue remains (e.g. sibling properties the shape didn't
+                // cover), surface it under the original ARM key so it's not
+                // silently dropped.
+                if (isPlainObject(v) && Object.keys(v).length === 0)
+                    continue;
+                if (v === undefined)
+                    continue;
+            }
+            if (Object.prototype.hasOwnProperty.call(out, k))
+                continue;
+            defineOwn(out, k, v);
+        }
+        return out;
+    }
+    finally {
+        visited.delete(state);
+    }
+}
+function raiseValue(value, shape, visited, path) {
+    if (value === null || value === undefined)
+        return value;
+    if (isExpression(value) || isExpressionNode(value))
+        return value;
+    if (!shape)
+        return value;
+    if (isTerminalValueShape(shape)) {
+        if ("encoding" in shape && shape.encoding) {
+            return decodeWireValue(value, shape.encoding, path);
+        }
+        return value;
+    }
+    switch (shape.kind) {
+        case "deferred":
+            if (!isPlainObject(value))
+                return value;
+            // `raiseState` selects the variant itself, against ARM keys.
+            return raiseState(value, shape.value(), visited);
+        case "array":
+            if (!Array.isArray(value))
+                return value;
+            return value.map((item, index) => raiseValue(item, shape.element, visited, [...path, String(index)]));
+        case "record": {
+            if (!isPlainObject(value))
+                return value;
+            const out = Object.create(null);
+            for (const [k, v] of Object.entries(value)) {
+                defineOwn(out, k, raiseValue(v, shape.value, visited, [...path, k]));
+            }
+            return out;
+        }
+        case "tuple":
+            if (!Array.isArray(value))
+                return value;
+            return value.map((item, index) => raiseValue(item, shape.values[index], visited, [...path, String(index)]));
+        default:
+            return assertNeverValueShape(shape);
+    }
+}
+/**
+ * Walk `obj` along `path`, returning the leaf value and pruning it
+ * from the tree. Empty intermediate objects are left in place (caller
+ * decides how to treat residue).
+ *
+ * Returns `MISSING` when any segment is absent or not a plain object.
+ */
+function extractPath(obj, path) {
+    if (path.length === 0)
+        return obj;
+    let cursor = obj;
+    for (let i = 0; i < path.length - 1; i++) {
+        const seg = path[i];
+        const next = Object.prototype.hasOwnProperty.call(cursor, seg) ? cursor[seg] : undefined;
+        if (!isPlainObject(next))
+            return MISSING;
+        cursor = next;
+    }
+    const leafKey = path[path.length - 1];
+    if (!Object.prototype.hasOwnProperty.call(cursor, leafKey))
+        return MISSING;
+    const value = cursor[leafKey];
+    delete cursor[leafKey];
+    return value;
+}
+/**
+ * Shallow-clone recursively enough to avoid mutating caller state.
+ * We only copy plain objects; arrays and other values are shared
+ * (raiseValue handles arrays via `.map` so mutation is contained).
+ */
+function structuredCloneLike(value, seen) {
+    if (seen.has(value)) {
+        // Preserve the cycle for downstream detection in raiseState.
+        return value;
+    }
+    seen.add(value);
+    const out = Object.create(null);
+    for (const [k, v] of Object.entries(value)) {
+        defineOwn(out, k, isExpression(v) || isExpressionNode(v)
+            ? v
+            : isPlainObject(v)
+                ? structuredCloneLike(v, seen)
+                : v);
+    }
+    return out;
+}
+//# sourceMappingURL=lower.js.map

package/dist/browser/serialization/json/lower.js.map

@@ -0,0 +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,CAAC,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;YAE3E,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,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CACzE,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,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7F,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,CAAC,YAAuC,EAAE,KAAgC,EAAE,IAAI,CAAC,CAC3F,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,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACnF,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,CAAC,QAAmC,EAAE,CAA4B,EAAE;gBAC3E,GAAG,MAAM;gBACT,CAAC;aACF,CAAC,CACH,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,CAAC,MAA+B,EAAE,GAAW,EAAE,KAAc;IAC7E,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,CAAC,KAAK,EAAE,IAAI,OAAO,EAAE,CAAC,CAAC;QACnF,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,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CACzE,CAAC;QACJ;YACE,OAAO,qBAAqB,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,WAAW,CAAC,GAA4B,EAAE,IAAuB;IACxE,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,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACzF,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","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\n/**\n * ARM state-shape conversion.\n *\n * lowerState maps JS property names to ARM paths, restores flattened\n * nesting, and encodes terminal values using the supplied model shape.\n * raiseState performs the inverse conversion for deserialization.\n * Both follow nested model, array, and record shapes and preserve unknown\n * keys. Property-access expression lowering lives in expression.ts.\n */\n\nimport {\n  isTerminalValueShape,\n  type ModelShape,\n  type ValueShape,\n  resolveModelShape,\n} from \"../../shape/shape.js\";\nimport { isExpression } from \"../../expression/expressions.js\";\nimport { isExpressionNode } from \"../../expression/ast-nodes.js\";\nimport { decodeWireValue, encodeWireValue } from \"./encoding.js\";\n\nconst MISSING = Symbol(\"missing\");\n\nfunction assertNeverValueShape(shape: never): never {\n  throw new Error(`Unhandled value shape: ${String(shape)}`);\n}\n\n// ---------------------------------------------------------------------------\n// State lowering\n// ---------------------------------------------------------------------------\n\nfunction isPlainObject(value: unknown): value is Record<string, unknown> {\n  if (value === null || typeof value !== \"object\") return false;\n  // Expression proxies are opaque values (despite a null prototype) — they\n  // must not be treated as cloneable plain objects.\n  if (isExpression(value)) return false;\n  const proto = Object.getPrototypeOf(value);\n  return proto === Object.prototype || proto === null;\n}\n\n/**\n * Recursively rewrite a raw state object into its ARM wire shape. Keys\n * not present in `shape.byJsName` pass through unchanged. Multi-\n * segment ARM paths (from `@flattenProperty`) re-nest objects; nested\n * models, arrays-of-models and records-of-models recurse via\n * `target`. Empty ARM paths fall back to the JS property name.\n *\n * Collisions where two JS-side keys map to overlapping ARM paths merge\n * when both sides are compatible objects; non-object / object collisions\n * throw.\n */\nexport function lowerState(\n  state: Record<string, unknown>,\n  shape: ModelShape,\n  visited: WeakSet<object> = new WeakSet(),\n): Record<string, unknown> {\n  if (visited.has(state)) {\n    throw new Error(\"Cycle detected while lowering ARM state.\");\n  }\n  visited.add(state);\n  try {\n    const out: Record<string, unknown> = Object.create(null);\n    // Select the variant once, from the state we're about to lower —\n    // every key below is looked up against that one concrete shape.\n    const flat = resolveModelShape(shape, state, \"js\");\n\n    for (const [jsKey, rawValue] of Object.entries(state)) {\n      const propShape = flat?.byJsName[jsKey];\n      const path = propShape?.armPath.length ? propShape.armPath : [jsKey];\n      const loweredValue = lowerValue(rawValue, propShape?.value, visited, path);\n\n      if (!propShape) {\n        // Passthrough: key not in shape (e.g. CDK-internal, or emitter\n        // didn't include it).\n        assignPath(out, [jsKey], loweredValue);\n        continue;\n      }\n\n      assignPath(out, path, loweredValue);\n    }\n\n    return out;\n  } finally {\n    visited.delete(state);\n  }\n}\n\nfunction lowerValue(\n  value: unknown,\n  shape: ValueShape | undefined,\n  visited: WeakSet<object>,\n  path: readonly string[],\n): unknown {\n  if (value === null || value === undefined) return value;\n  if (isExpression(value) || isExpressionNode(value)) return value;\n\n  if (!shape) {\n    return value;\n  }\n\n  if (isTerminalValueShape(shape)) {\n    if (\"encoding\" in shape && shape.encoding) {\n      return encodeWireValue(value, shape.encoding, path);\n    }\n    return value;\n  }\n\n  switch (shape.kind) {\n    case \"deferred\":\n      if (!isPlainObject(value)) return value;\n      // `lowerState` resolves the variant itself, per property, using\n      // `value` as the discriminator source.\n      return lowerState(value, shape.value(), visited);\n    case \"array\":\n      if (!Array.isArray(value)) return value;\n      return value.map((item, index) =>\n        lowerValue(item, shape.element, visited, [...path, String(index)]),\n      );\n    case \"record\": {\n      if (!isPlainObject(value)) return value;\n      const out: Record<string, unknown> = Object.create(null);\n      for (const [k, v] of Object.entries(value)) {\n        defineOwn(out, k, lowerValue(v, shape.value, visited, [...path, k]));\n      }\n      return out;\n    }\n    case \"tuple\":\n      if (!Array.isArray(value)) return value;\n      return value.map((item, index) =>\n        lowerValue(item, shape.values[index], visited, [...path, String(index)]),\n      );\n    default:\n      return assertNeverValueShape(shape);\n  }\n}\n\n/**\n * Write `value` into `target` at the given ARM path, deep-merging with\n * existing object values. Throws on non-object/object or\n * object/non-object collisions.\n */\nfunction assignPath(\n  target: Record<string, unknown>,\n  path: readonly string[],\n  value: unknown,\n): void {\n  if (path.length === 0) return;\n\n  let cursor = target;\n  for (let i = 0; i < path.length - 1; i++) {\n    const seg = path[i]!;\n    const existing = Object.prototype.hasOwnProperty.call(cursor, seg) ? cursor[seg] : undefined;\n    if (existing === undefined) {\n      const next: Record<string, unknown> = Object.create(null);\n      defineOwn(cursor, seg, next);\n      cursor = next;\n    } else if (isPlainObject(existing)) {\n      cursor = existing;\n    } else {\n      throw new Error(\n        `ARM path collision at \"${path.slice(0, i + 1).join(\".\")}\": expected object, got ${typeof existing}.`,\n      );\n    }\n  }\n\n  const leafKey = path[path.length - 1]!;\n  const existingLeaf = Object.prototype.hasOwnProperty.call(cursor, leafKey)\n    ? cursor[leafKey]\n    : undefined;\n  if (existingLeaf === undefined) {\n    defineOwn(cursor, leafKey, value);\n    return;\n  }\n\n  if (isPlainObject(existingLeaf) && isPlainObject(value)) {\n    defineOwn(\n      cursor,\n      leafKey,\n      deepMerge(existingLeaf as Record<string, unknown>, value as Record<string, unknown>, path),\n    );\n    return;\n  }\n\n  throw new Error(\n    `ARM path collision at \"${path.join(\".\")}\": cannot merge ${typeof existingLeaf} with ${typeof value}.`,\n  );\n}\n\nfunction deepMerge(\n  a: Record<string, unknown>,\n  b: Record<string, unknown>,\n  prefix: readonly string[],\n): Record<string, unknown> {\n  const out: Record<string, unknown> = Object.create(null);\n  for (const [key, value] of Object.entries(a)) defineOwn(out, key, value);\n  for (const [k, v] of Object.entries(b)) {\n    const existing = Object.prototype.hasOwnProperty.call(out, k) ? out[k] : undefined;\n    if (existing === undefined) {\n      defineOwn(out, k, v);\n      continue;\n    }\n    if (isPlainObject(existing) && isPlainObject(v)) {\n      defineOwn(\n        out,\n        k,\n        deepMerge(existing as Record<string, unknown>, v as Record<string, unknown>, [\n          ...prefix,\n          k,\n        ]),\n      );\n      continue;\n    }\n    throw new Error(\n      `ARM path collision at \"${[...prefix, k].join(\".\")}\": cannot merge ${typeof existing} with ${typeof v}.`,\n    );\n  }\n  return out;\n}\n\nfunction defineOwn(target: Record<string, unknown>, key: string, value: unknown): void {\n  Object.defineProperty(target, key, {\n    value,\n    enumerable: true,\n    configurable: true,\n    writable: true,\n  });\n}\n\n// ---------------------------------------------------------------------------\n// State raising (inverse of lowerState)\n// ---------------------------------------------------------------------------\n\n/**\n * Inverse of `lowerState`: walks a wire-shape state object and lifts\n * values at each property entry's `armPath` back onto the flat\n * `jsName` key. Recurses into nested model / array / record values via\n * `target`. Empty ARM paths fall back to the JS property name.\n *\n * ARM-shape keys that consumed a nested object entirely (single-segment\n * paths carrying a model `target`) pop that segment from the source\n * so leftovers at intermediate nodes don't silently leak into the\n * output. For multi-segment paths (`@flattenProperty`), only the leaf\n * is extracted; intermediate shared objects may survive as their own\n * top-level entries if the shape also declares a jsName for them.\n *\n * Keys present in the state but not consumed by any property entry\n * pass through unchanged (preserving the \"unknown key\" escape hatch\n * documented in `lowerState`).\n */\nexport function raiseState(\n  state: Record<string, unknown>,\n  shape: ModelShape,\n  visited: WeakSet<object> = new WeakSet(),\n): Record<string, unknown> {\n  if (visited.has(state)) {\n    throw new Error(\"Cycle detected while raising ARM state.\");\n  }\n  visited.add(state);\n  try {\n    // Wire-shaped input, so the variant is selected against ARM keys.\n    const flat = resolveModelShape(shape, state, \"arm\");\n    if (!flat) return structuredCloneLike(state, new WeakSet());\n\n    // Clone into a mutable working copy so we can prune consumed paths.\n    const working: Record<string, unknown> = structuredCloneLike(state, new WeakSet());\n    const out: Record<string, unknown> = Object.create(null);\n    const consumedTopLevel = new Set<string>();\n\n    for (const [jsName, propShape] of Object.entries(flat.byJsName)) {\n      const path = propShape.armPath.length > 0 ? propShape.armPath : [jsName];\n      const extracted = extractPath(working, path);\n      if (extracted === MISSING) continue;\n\n      const raised = raiseValue(extracted, propShape.value, visited, path);\n      defineOwn(out, jsName, raised);\n\n      consumedTopLevel.add(path[0]!);\n    }\n\n    // Passthrough: anything left in `working` that wasn't consumed by a\n    // shape-driven extraction and doesn't collide with an already-\n    // placed jsName.\n    for (const [k, v] of Object.entries(working)) {\n      if (consumedTopLevel.has(k)) {\n        // Top-level segment was touched by at least one armPath. If\n        // residue remains (e.g. sibling properties the shape didn't\n        // cover), surface it under the original ARM key so it's not\n        // silently dropped.\n        if (isPlainObject(v) && Object.keys(v).length === 0) continue;\n        if (v === undefined) continue;\n      }\n      if (Object.prototype.hasOwnProperty.call(out, k)) continue;\n      defineOwn(out, k, v);\n    }\n\n    return out;\n  } finally {\n    visited.delete(state);\n  }\n}\n\nfunction raiseValue(\n  value: unknown,\n  shape: ValueShape | undefined,\n  visited: WeakSet<object>,\n  path: readonly string[],\n): unknown {\n  if (value === null || value === undefined) return value;\n  if (isExpression(value) || isExpressionNode(value)) return value;\n  if (!shape) return value;\n\n  if (isTerminalValueShape(shape)) {\n    if (\"encoding\" in shape && shape.encoding) {\n      return decodeWireValue(value, shape.encoding, path);\n    }\n    return value;\n  }\n\n  switch (shape.kind) {\n    case \"deferred\":\n      if (!isPlainObject(value)) return value;\n      // `raiseState` selects the variant itself, against ARM keys.\n      return raiseState(value, shape.value(), visited);\n    case \"array\":\n      if (!Array.isArray(value)) return value;\n      return value.map((item, index) =>\n        raiseValue(item, shape.element, visited, [...path, String(index)]),\n      );\n    case \"record\": {\n      if (!isPlainObject(value)) return value;\n      const out: Record<string, unknown> = Object.create(null);\n      for (const [k, v] of Object.entries(value)) {\n        defineOwn(out, k, raiseValue(v, shape.value, visited, [...path, k]));\n      }\n      return out;\n    }\n    case \"tuple\":\n      if (!Array.isArray(value)) return value;\n      return value.map((item, index) =>\n        raiseValue(item, shape.values[index], visited, [...path, String(index)]),\n      );\n    default:\n      return assertNeverValueShape(shape);\n  }\n}\n\n/**\n * Walk `obj` along `path`, returning the leaf value and pruning it\n * from the tree. Empty intermediate objects are left in place (caller\n * decides how to treat residue).\n *\n * Returns `MISSING` when any segment is absent or not a plain object.\n */\nfunction extractPath(obj: Record<string, unknown>, path: readonly string[]): unknown {\n  if (path.length === 0) return obj;\n\n  let cursor: Record<string, unknown> = obj;\n  for (let i = 0; i < path.length - 1; i++) {\n    const seg = path[i]!;\n    const next = Object.prototype.hasOwnProperty.call(cursor, seg) ? cursor[seg] : undefined;\n    if (!isPlainObject(next)) return MISSING;\n    cursor = next;\n  }\n\n  const leafKey = path[path.length - 1]!;\n  if (!Object.prototype.hasOwnProperty.call(cursor, leafKey)) return MISSING;\n  const value = cursor[leafKey];\n  delete cursor[leafKey];\n  return value;\n}\n\n/**\n * Shallow-clone recursively enough to avoid mutating caller state.\n * We only copy plain objects; arrays and other values are shared\n * (raiseValue handles arrays via `.map` so mutation is contained).\n */\nfunction structuredCloneLike(\n  value: Record<string, unknown>,\n  seen: WeakSet<object>,\n): Record<string, unknown> {\n  if (seen.has(value)) {\n    // Preserve the cycle for downstream detection in raiseState.\n    return value;\n  }\n  seen.add(value);\n  const out: Record<string, unknown> = Object.create(null);\n  for (const [k, v] of Object.entries(value)) {\n    defineOwn(\n      out,\n      k,\n      isExpression(v) || isExpressionNode(v)\n        ? v\n        : isPlainObject(v)\n          ? structuredCloneLike(v, seen)\n          : v,\n    );\n  }\n  return out;\n}\n"]}

package/dist/browser/serialization/json/pluralize-config.d.ts

@@ -0,0 +1,3 @@
+import pluralizeLib from "pluralize";
+export default pluralizeLib;
+//# sourceMappingURL=pluralize-config.d.ts.map

package/dist/browser/serialization/json/pluralize-config.d.ts.map

@@ -0,0 +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"}

package/dist/browser/serialization/json/pluralize-config.js

@@ -0,0 +1,7 @@
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+import pluralizeLib from "pluralize";
+pluralizeLib.addUncountableRule("redis");
+pluralizeLib.addSingularRule(/(cache)s$/i, "$1");
+export default pluralizeLib;
+//# sourceMappingURL=pluralize-config.js.map

package/dist/browser/serialization/json/pluralize-config.js.map

@@ -0,0 +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","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport pluralizeLib from \"pluralize\";\n\npluralizeLib.addUncountableRule(\"redis\");\npluralizeLib.addSingularRule(/(cache)s$/i, \"$1\");\n\nexport default pluralizeLib;\n"]}

package/dist/browser/serialization/json/serialize.d.ts

@@ -0,0 +1,12 @@
+import type { Stack } from "../../constructs/stack.js";
+import type { SerializationDocument } from "../contract/index.js";
+/**
+ * Serializes a stack or a nonempty array of stacks into a JSON-compatible
+ * {@link SerializationDocument} with one `infras` entry per stack.
+ *
+ * The document preserves declarations and symbolic expressions for rendering
+ * or restoration. Pass `JSON.stringify(serialize(stack))` to {@link deserialize}
+ * to reconstruct the authored stack; this does not deploy any resources.
+ */
+export declare function serialize(input: Stack | readonly Stack[]): SerializationDocument;
+//# sourceMappingURL=serialize.d.ts.map

package/dist/browser/serialization/json/serialize.d.ts.map

@@ -0,0 +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;AAgBvD,OAAO,KAAK,EAQV,qBAAqB,EAEtB,MAAM,sBAAsB,CAAC;AA4b9B;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,SAAS,KAAK,EAAE,GAAG,qBAAqB,CAahF"}