@azure/provisioning-core 1.0.0-beta.1 → 1.0.0-beta.2

package/dist/esm/naming/naming-policy.js

@@ -1,36 +1,45 @@
 // Copyright (c) Microsoft Corporation.
 // Licensed under the MIT License.
+import { RegExpParser } from "@eslint-community/regexpp";
+import { isExpression, unwrapExpression } from "../expression/expressions.js";
 import { concat, subscription, toLower, uniqueString } from "../fn.js";
-import { MOST_RESTRICTIVE } from "./naming-rules.js";
+import { DEFAULT_NAMING_RULES } from "./naming-rules.js";
+import { assertValidResourceName } from "./name-validation.js";
 /**
  * Default workload-based naming policy.
  *
  * Generates names by composing the resource type abbreviation, workload,
  * environment, region, label, and an ordinal suffix for repeated types.
  * Global-scope resources get a `uniqueString(subscription().subscriptionId)`
- * suffix to ensure uniqueness.
+ * suffix to reduce name collisions; Azure name availability is not checked.
  */
 export class DefaultNamingPolicy {
     #options;
     #ordinals = new Map();
+    #names = new Map();
     constructor(options) {
         this.#options = options;
     }
     generateName(context) {
-        const ordinal = this.#ordinals.get(context.type) ?? 0;
-        this.#ordinals.set(context.type, ordinal + 1);
         const rules = context.rules;
-        const sep = rules.validCharacters.hyphens ? "-" : "";
+        const nameSegments = context.nameSegments ?? rules.nameSegments ?? 1;
+        if (!Number.isSafeInteger(nameSegments) || nameSegments < 1) {
+            throw new Error("Resource naming segment count must be a positive safe integer.");
+        }
+        if (nameSegments > 1) {
+            throw new Error(`Resource '${context.type}' requires an explicit ${nameSegments}-segment name including its undeclared ancestors.`);
+        }
+        const ordinal = this.#ordinals.get(context.type) ?? 0;
+        const alphabet = getNamingAlphabet(rules);
+        const sep = rules.separator ?? (alphabet.includes("-") ? "-" : "");
+        if ([...sep].some((character) => !alphabet.includes(character))) {
+            throw new Error(`Cannot generate a compliant name for '${context.type}': separator '${sep}' is incompatible with its naming rules.`);
+        }
         const sanitize = (segment) => {
-            let value = segment;
-            if (!rules.validCharacters.hyphens)
-                value = value.replace(/-/gu, "");
-            if (!rules.validCharacters.underscores)
-                value = value.replace(/_/gu, "");
-            if (!rules.validCharacters.periods)
-                value = value.replace(/\./gu, "");
-            value = value.replace(/[^A-Za-z0-9._-]/gu, "");
-            return rules.validCharacters.uppercase ? value : value.toLowerCase();
+            return [...segment]
+                .map((character) => (alphabet.includes(character) ? character : character.toLowerCase()))
+                .filter((character) => alphabet.includes(character))
+                .join("");
         };
         const segments = [];
         if (rules.abbreviation) {
@@ -47,23 +56,61 @@ export class DefaultNamingPolicy {
             segments.push(sanitize(context.label));
         }
         const ordinalSuffix = ordinal > 0 ? String(ordinal + 1) : "";
-        const base = segments.filter(Boolean).join(sep);
+        let base = segments.filter(Boolean).join(sep);
+        const startingAlphabet = getNamingAlphabet(rules, "start");
+        const endingAlphabet = getNamingAlphabet(rules, "end");
+        const padding = startingAlphabet[0];
+        if (padding === undefined || endingAlphabet.length === 0) {
+            throw new Error(`Cannot generate a compliant name for '${context.type}': no supported generation alphabet. Provide an explicit name.`);
+        }
+        if (base.length > 0 && !startingAlphabet.includes(base[0])) {
+            base = padding + base;
+        }
+        // This is a convention budget when TypeSpec supplies no maximum, not a
+        // constraint imposed on explicit names.
+        const maxLength = rules.maxLength ?? Math.max(24, rules.minLength ?? 0);
+        const minLength = rules.minLength ?? 1;
         const truncateWithOrdinal = (available) => {
             const ordinalPrefix = ordinalSuffix ? sep : "";
-            const baseLimit = Math.max(0, available - ordinalPrefix.length - ordinalSuffix.length);
+            const baseLimit = available - ordinalPrefix.length - ordinalSuffix.length;
+            if (baseLimit < 1) {
+                throw new Error(`Cannot generate a compliant name for '${context.type}': maximum length ${maxLength} cannot accommodate the required suffixes. Provide an explicit name.`);
+            }
             return `${base.slice(0, baseLimit)}${ordinalPrefix}${ordinalSuffix}`;
         };
+        let name;
         if (rules.scope === "global") {
             // Bicep uniqueString() always returns 13 characters. Reserve that suffix
             // and the ordinal before truncating so repeated resources stay unique.
             const uniqueSuffixLength = 13;
-            const prefix = truncateWithOrdinal(rules.maxLength - sep.length - uniqueSuffixLength);
-            const full = concat(prefix + sep, uniqueString(subscription().subscriptionId));
-            return rules.validCharacters.uppercase ? full : toLower(full);
+            const prefixBudget = maxLength - sep.length - uniqueSuffixLength;
+            base = base.padEnd(Math.max(1, minLength - sep.length - uniqueSuffixLength), padding);
+            let prefix = truncateWithOrdinal(prefixBudget);
+            if (sep && prefix.endsWith(sep)) {
+                prefix = prefix.slice(0, -sep.length).padEnd(1, padding);
+            }
+            prefix = prefix.padEnd(Math.max(1, minLength - sep.length - uniqueSuffixLength), padding);
+            name = concat(prefix + sep, uniqueString(subscription().subscriptionId));
+            if (!alphabet.includes("A"))
+                name = toLower(name);
+        }
+        else {
+            base = base.padEnd(minLength, padding);
+            let truncated = truncateWithOrdinal(maxLength);
+            if (!endingAlphabet.includes(truncated.at(-1))) {
+                truncated = truncated.slice(0, -1) + endingAlphabet[0];
+            }
+            name = truncated;
         }
-        // Non-global scope: no uniqueString needed, plain string is fine
-        const truncated = truncateWithOrdinal(rules.maxLength);
-        return rules.validCharacters.uppercase ? truncated : truncated.toLowerCase();
+        const key = JSON.stringify(name, (_key, value) => isExpression(value) ? unwrapExpression(value) : value);
+        const names = this.#names.get(context.type) ?? new Set();
+        if (names.has(key)) {
+            throw new Error(`Cannot generate a distinct name for '${context.type}' within its naming rules. Provide an explicit name.`);
+        }
+        names.add(key);
+        this.#names.set(context.type, names);
+        this.#ordinals.set(context.type, ordinal + 1);
+        return name;
     }
 }
 /**
@@ -79,19 +126,105 @@ export const namingRequiredPolicy = {
     },
 };
 /**
- * Resolves the Azure resource name for a resource instance.
- *
- * - If `name` is explicitly provided (string or expression), it is used
- *   as-is — the naming policy does not transform it.
- * - Otherwise, the active naming policy generates a name.
+ * Generates and validates a name at the resource construction boundary.
+ * Explicit constructor names are validated before declaration registration.
  */
-export function resolveResourceName(policy, name, type, namingRules) {
-    if (name !== undefined) {
-        return name;
-    }
-    return policy.generateName({
+export function generateResourceName(policy, type, namingRules, nameSegments) {
+    const rules = namingRules ?? DEFAULT_NAMING_RULES;
+    const generated = policy.generateName({
         type,
-        rules: namingRules ?? MOST_RESTRICTIVE,
+        rules,
+        nameSegments: nameSegments ?? rules.nameSegments,
+    });
+    assertValidResourceName(generated, type, rules, {
+        generated: true,
     });
+    return generated;
+}
+const NAME_ALPHABET = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789-._";
+const patternParser = new RegExpParser();
+/**
+ * Selects generation tokens from a parsed regex AST. Shapes outside the
+ * workload-based convention remain usable for literal-name validation.
+ */
+function getPatternTokens(regex) {
+    const pattern = patternParser.parsePattern(regex);
+    if (pattern.alternatives.length !== 1)
+        return undefined;
+    const elements = pattern.alternatives[0].elements;
+    const start = elements[0];
+    const end = elements.at(-1);
+    if (start?.type !== "Assertion" || start.kind !== "start")
+        return undefined;
+    const anchored = end?.type === "Assertion" && end.kind === "end";
+    const body = elements.slice(1, anchored ? -1 : undefined);
+    const [head, tail] = body;
+    // Prefer the separator-free sublanguage of repeated hyphen-separated classes.
+    if (body.length === 2 &&
+        head?.type === "Quantifier" &&
+        head.min === 1 &&
+        head.max === Infinity &&
+        head.element.type === "CharacterClass" &&
+        tail?.type === "Quantifier" &&
+        tail.min === 0 &&
+        tail.max === Infinity &&
+        (tail.element.type === "Group" || tail.element.type === "CapturingGroup") &&
+        tail.element.alternatives.length === 1) {
+        const repeated = tail.element.alternatives[0].elements;
+        const [separator, part] = repeated;
+        if (repeated.length === 2 &&
+            separator?.type === "Character" &&
+            separator.value === 45 &&
+            part?.type === "Quantifier" &&
+            part.min === 1 &&
+            part.max === Infinity &&
+            part.element.raw === head.element.raw) {
+            return [
+                { characters: new RegExp(`^(?:${head.element.raw})$`), min: 1 },
+                ...(anchored ? [] : [{ characters: /^.$/, min: 0 }]),
+            ];
+        }
+    }
+    if (!anchored)
+        return undefined;
+    const tokens = [];
+    for (const element of body) {
+        if (element.type === "Quantifier" && element.max === 0)
+            continue;
+        const atom = element.type === "Quantifier" ? element.element : element;
+        if (atom.type !== "Character" &&
+            atom.type !== "CharacterClass" &&
+            atom.type !== "CharacterSet") {
+            return undefined;
+        }
+        tokens.push({
+            characters: new RegExp(`^(?:${atom.raw})$`),
+            min: element.type === "Quantifier" ? element.min : 1,
+        });
+        if (tokens.length > 128)
+            return undefined;
+    }
+    return tokens;
+}
+/**
+ * Selects candidate characters for sanitization, padding, and boundary repair.
+ * Candidates are not a validity guarantee; the complete name is still checked.
+ */
+function getNamingAlphabet(rules, boundary) {
+    const alphabet = rules.pattern !== undefined
+        ? NAME_ALPHABET
+        : "abcdefghijklmnopqrstuvwxyz0123456789" + (rules.separator ?? "");
+    if (rules.pattern === undefined || rules.pattern.regex === "") {
+        return alphabet;
+    }
+    const tokens = getPatternTokens(rules.pattern.regex);
+    if (tokens === undefined)
+        return alphabet.replace(/[A-Z._-]/g, "");
+    const ordered = boundary === "end" ? [...tokens].reverse() : tokens;
+    const firstRequired = ordered.findIndex((token) => token.min > 0);
+    const candidates = boundary === undefined || firstRequired < 0 ? ordered : ordered.slice(0, firstRequired + 1);
+    return [...alphabet]
+        .filter((character) => candidates.some((token) => token.characters.test(character)))
+        .join("");
 }
 //# sourceMappingURL=naming-policy.js.map

package/dist/esm/naming/naming-policy.js.map

@@ -1 +1 @@
-{"version":3,"file":"naming-policy.js","sourceRoot":"","sources":["../../../src/naming/naming-policy.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAGlC,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AACvE,OAAO,EAAE,gBAAgB,EAA4B,MAAM,mBAAmB,CAAC;AA8B/E;;;;;;;GAOG;AACH,MAAM,OAAO,mBAAmB;IACrB,QAAQ,CAAsB;IAC9B,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE/C,YAAY,OAA4B;QACtC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC1B,CAAC;IAED,YAAY,CAAC,OAAsB;QACjC,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;QAE9C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAErD,MAAM,QAAQ,GAAG,CAAC,OAAe,EAAU,EAAE;YAC3C,IAAI,KAAK,GAAG,OAAO,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,OAAO;gBAAE,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACrE,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,WAAW;gBAAE,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACzE,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,OAAO;gBAAE,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACtE,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC;YAC/C,OAAO,KAAK,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QACvE,CAAC,CAAC;QAEF,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACvB,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;QAChD,IAAI,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;YAC9B,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC;QACrD,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAClB,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,MAAM,aAAa,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7D,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEhD,MAAM,mBAAmB,GAAG,CAAC,SAAiB,EAAU,EAAE;YACxD,MAAM,aAAa,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,aAAa,CAAC,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;YACvF,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,aAAa,GAAG,aAAa,EAAE,CAAC;QACvE,CAAC,CAAC;QAEF,IAAI,KAAK,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC7B,yEAAyE;YACzE,uEAAuE;YACvE,MAAM,kBAAkB,GAAG,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,MAAM,GAAG,kBAAkB,CAAC,CAAC;YACtF,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,GAAG,GAAG,EAAE,YAAY,CAAC,YAAY,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC;YAC/E,OAAO,KAAK,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAChE,CAAC;QAED,iEAAiE;QACjE,MAAM,SAAS,GAAG,mBAAmB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACvD,OAAO,KAAK,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC;IAC/E,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAiB;IAChD,YAAY,CAAC,OAAsB;QACjC,MAAM,IAAI,KAAK,CACb,qBAAqB,OAAO,CAAC,IAAI,gCAAgC;YAC/D,0CAA0C,CAC7C,CAAC;IACJ,CAAC;CACF,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAoB,EACpB,IAA2C,EAC3C,IAAY,EACZ,WAA4C;IAE5C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,MAAM,CAAC,YAAY,CAAC;QACzB,IAAI;QACJ,KAAK,EAAE,WAAW,IAAI,gBAAgB;KACvC,CAAC,CAAC;AACL,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport type { ExpressionOrValue } from \"../expression/expressions.js\";\nimport { concat, subscription, toLower, uniqueString } from \"../fn.js\";\nimport { MOST_RESTRICTIVE, type ResourceNamingRules } from \"./naming-rules.js\";\n\nexport interface NamingContext {\n  readonly type: string;\n  readonly rules: ResourceNamingRules;\n  readonly label?: string | undefined;\n}\n\n/**\n * Strategy for generating Azure resource names when a resource is created\n * without an explicit `name`.\n *\n * Implement this interface to provide a custom naming convention. Two\n * built-in implementations are provided:\n *\n * - {@link DefaultNamingPolicy} — workload-based names with abbreviations,\n *   ordinals, and `uniqueString()` for globally-scoped resources.\n * - {@link namingRequiredPolicy} — a singleton that throws if a resource\n *   doesn't provide an explicit `name`.\n */\nexport interface NamingPolicy {\n  generateName(context: NamingContext): ExpressionOrValue<string>;\n}\n\nexport interface NamingPolicyOptions {\n  readonly workload: string;\n  readonly environment?: string | undefined;\n  readonly region?: string | undefined;\n}\n\n/**\n * Default workload-based naming policy.\n *\n * Generates names by composing the resource type abbreviation, workload,\n * environment, region, label, and an ordinal suffix for repeated types.\n * Global-scope resources get a `uniqueString(subscription().subscriptionId)`\n * suffix to ensure uniqueness.\n */\nexport class DefaultNamingPolicy implements NamingPolicy {\n  readonly #options: NamingPolicyOptions;\n  readonly #ordinals = new Map<string, number>();\n\n  constructor(options: NamingPolicyOptions) {\n    this.#options = options;\n  }\n\n  generateName(context: NamingContext): ExpressionOrValue<string> {\n    const ordinal = this.#ordinals.get(context.type) ?? 0;\n    this.#ordinals.set(context.type, ordinal + 1);\n\n    const rules = context.rules;\n    const sep = rules.validCharacters.hyphens ? \"-\" : \"\";\n\n    const sanitize = (segment: string): string => {\n      let value = segment;\n      if (!rules.validCharacters.hyphens) value = value.replace(/-/gu, \"\");\n      if (!rules.validCharacters.underscores) value = value.replace(/_/gu, \"\");\n      if (!rules.validCharacters.periods) value = value.replace(/\\./gu, \"\");\n      value = value.replace(/[^A-Za-z0-9._-]/gu, \"\");\n      return rules.validCharacters.uppercase ? value : value.toLowerCase();\n    };\n\n    const segments: string[] = [];\n    if (rules.abbreviation) {\n      segments.push(sanitize(rules.abbreviation));\n    }\n    segments.push(sanitize(this.#options.workload));\n    if (this.#options.environment) {\n      segments.push(sanitize(this.#options.environment));\n    }\n    if (this.#options.region) {\n      segments.push(sanitize(this.#options.region));\n    }\n    if (context.label) {\n      segments.push(sanitize(context.label));\n    }\n    const ordinalSuffix = ordinal > 0 ? String(ordinal + 1) : \"\";\n    const base = segments.filter(Boolean).join(sep);\n\n    const truncateWithOrdinal = (available: number): string => {\n      const ordinalPrefix = ordinalSuffix ? sep : \"\";\n      const baseLimit = Math.max(0, available - ordinalPrefix.length - ordinalSuffix.length);\n      return `${base.slice(0, baseLimit)}${ordinalPrefix}${ordinalSuffix}`;\n    };\n\n    if (rules.scope === \"global\") {\n      // Bicep uniqueString() always returns 13 characters. Reserve that suffix\n      // and the ordinal before truncating so repeated resources stay unique.\n      const uniqueSuffixLength = 13;\n      const prefix = truncateWithOrdinal(rules.maxLength - sep.length - uniqueSuffixLength);\n      const full = concat(prefix + sep, uniqueString(subscription().subscriptionId));\n      return rules.validCharacters.uppercase ? full : toLower(full);\n    }\n\n    // Non-global scope: no uniqueString needed, plain string is fine\n    const truncated = truncateWithOrdinal(rules.maxLength);\n    return rules.validCharacters.uppercase ? truncated : truncated.toLowerCase();\n  }\n}\n\n/**\n * Naming policy that requires every resource to provide an explicit `name`.\n *\n * Throws an error when asked to generate a name. Use this on a stack to\n * disable auto-naming entirely.\n */\nexport const namingRequiredPolicy: NamingPolicy = {\n  generateName(context: NamingContext): ExpressionOrValue<string> {\n    throw new Error(\n      `Resource of type '${context.type}' requires an explicit 'name' ` +\n        `(the stack uses 'namingRequiredPolicy').`,\n    );\n  },\n};\n\n/**\n * Resolves the Azure resource name for a resource instance.\n *\n * - If `name` is explicitly provided (string or expression), it is used\n *   as-is — the naming policy does not transform it.\n * - Otherwise, the active naming policy generates a name.\n */\nexport function resolveResourceName(\n  policy: NamingPolicy,\n  name: ExpressionOrValue<string> | undefined,\n  type: string,\n  namingRules: ResourceNamingRules | undefined,\n): ExpressionOrValue<string> {\n  if (name !== undefined) {\n    return name;\n  }\n  return policy.generateName({\n    type,\n    rules: namingRules ?? MOST_RESTRICTIVE,\n  });\n}\n"]}
+{"version":3,"file":"naming-policy.js","sourceRoot":"","sources":["../../../src/naming/naming-policy.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAElC,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAC9E,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AACvE,OAAO,EAAE,oBAAoB,EAA4B,MAAM,mBAAmB,CAAC;AACnF,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAiC/D;;;;;;;GAOG;AACH,MAAM,OAAO,mBAAmB;IACrB,QAAQ,CAAsB;IAC9B,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEjD,YAAY,OAA4B;QACtC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC1B,CAAC;IAED,YAAY,CAAC,OAAsB;QACjC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAC5B,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,KAAK,CAAC,YAAY,IAAI,CAAC,CAAC;QACrE,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,YAAY,CAAC,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YAC5D,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC,CAAC;QACpF,CAAC;QACD,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CACb,aAAa,OAAO,CAAC,IAAI,0BAA0B,YAAY,mDAAmD,CACnH,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnE,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,KAAK,CACb,yCAAyC,OAAO,CAAC,IAAI,iBAAiB,GAAG,0CAA0C,CACpH,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAG,CAAC,OAAe,EAAU,EAAE;YAC3C,OAAO,CAAC,GAAG,OAAO,CAAC;iBAChB,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,CAAC;iBACxF,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;iBACnD,IAAI,CAAC,EAAE,CAAC,CAAC;QACd,CAAC,CAAC;QAEF,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACvB,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;QAChD,IAAI,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;YAC9B,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC;QACrD,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAClB,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,MAAM,aAAa,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7D,IAAI,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9C,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC3D,MAAM,cAAc,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACvD,MAAM,OAAO,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,OAAO,KAAK,SAAS,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzD,MAAM,IAAI,KAAK,CACb,yCAAyC,OAAO,CAAC,IAAI,gEAAgE,CACtH,CAAC;QACJ,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;YAC5D,IAAI,GAAG,OAAO,GAAG,IAAI,CAAC;QACxB,CAAC;QACD,uEAAuE;QACvE,wCAAwC;QACxC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC;QACxE,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC;QAEvC,MAAM,mBAAmB,GAAG,CAAC,SAAiB,EAAU,EAAE;YACxD,MAAM,aAAa,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/C,MAAM,SAAS,GAAG,SAAS,GAAG,aAAa,CAAC,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC;YAC1E,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;gBAClB,MAAM,IAAI,KAAK,CACb,yCAAyC,OAAO,CAAC,IAAI,qBAAqB,SAAS,sEAAsE,CAC1J,CAAC;YACJ,CAAC;YACD,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,aAAa,GAAG,aAAa,EAAE,CAAC;QACvE,CAAC,CAAC;QAEF,IAAI,IAA+B,CAAC;QACpC,IAAI,KAAK,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC7B,yEAAyE;YACzE,uEAAuE;YACvE,MAAM,kBAAkB,GAAG,EAAE,CAAC;YAC9B,MAAM,YAAY,GAAG,SAAS,GAAG,GAAG,CAAC,MAAM,GAAG,kBAAkB,CAAC;YACjE,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,GAAG,CAAC,MAAM,GAAG,kBAAkB,CAAC,EAAE,OAAO,CAAC,CAAC;YACtF,IAAI,MAAM,GAAG,mBAAmB,CAAC,YAAY,CAAC,CAAC;YAC/C,IAAI,GAAG,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAChC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC3D,CAAC;YACD,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,GAAG,CAAC,MAAM,GAAG,kBAAkB,CAAC,EAAE,OAAO,CAAC,CAAC;YAC1F,IAAI,GAAG,MAAM,CAAC,MAAM,GAAG,GAAG,EAAE,YAAY,CAAC,YAAY,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC;YACzE,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QACpD,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YACvC,IAAI,SAAS,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC;YAC/C,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;gBAChD,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAE,CAAC;YAC1D,CAAC;YACD,IAAI,GAAG,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,KAAc,EAAE,EAAE,CACxD,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CACtD,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACjE,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CACb,wCAAwC,OAAO,CAAC,IAAI,sDAAsD,CAC3G,CAAC;QACJ,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;QAC9C,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAiB;IAChD,YAAY,CAAC,OAAsB;QACjC,MAAM,IAAI,KAAK,CACb,qBAAqB,OAAO,CAAC,IAAI,gCAAgC;YAC/D,0CAA0C,CAC7C,CAAC;IACJ,CAAC;CACF,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAoB,EACpB,IAAY,EACZ,WAA4C,EAC5C,YAAgC;IAEhC,MAAM,KAAK,GAAG,WAAW,IAAI,oBAAoB,CAAC;IAClD,MAAM,SAAS,GAAG,MAAM,CAAC,YAAY,CAAC;QACpC,IAAI;QACJ,KAAK;QACL,YAAY,EAAE,YAAY,IAAI,KAAK,CAAC,YAAY;KACjD,CAAC,CAAC;IACH,uBAAuB,CAAC,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE;QAC9C,SAAS,EAAE,IAAI;KAChB,CAAC,CAAC;IACH,OAAO,SAAS,CAAC;AACnB,CAAC;AAQD,MAAM,aAAa,GAAG,mEAAmE,CAAC;AAC1F,MAAM,aAAa,GAAG,IAAI,YAAY,EAAE,CAAC;AAEzC;;;GAGG;AACH,SAAS,gBAAgB,CAAC,KAAa;IACrC,MAAM,OAAO,GAAG,aAAa,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,OAAO,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACxD,MAAM,QAAQ,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC;IACnD,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,GAAG,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,KAAK,EAAE,IAAI,KAAK,WAAW,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO,SAAS,CAAC;IAC5E,MAAM,QAAQ,GAAG,GAAG,EAAE,IAAI,KAAK,WAAW,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC;IACjE,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC1D,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC;IAC1B,8EAA8E;IAC9E,IACE,IAAI,CAAC,MAAM,KAAK,CAAC;QACjB,IAAI,EAAE,IAAI,KAAK,YAAY;QAC3B,IAAI,CAAC,GAAG,KAAK,CAAC;QACd,IAAI,CAAC,GAAG,KAAK,QAAQ;QACrB,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,gBAAgB;QACtC,IAAI,EAAE,IAAI,KAAK,YAAY;QAC3B,IAAI,CAAC,GAAG,KAAK,CAAC;QACd,IAAI,CAAC,GAAG,KAAK,QAAQ;QACrB,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,gBAAgB,CAAC;QACzE,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EACtC,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC;QACxD,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC;QACnC,IACE,QAAQ,CAAC,MAAM,KAAK,CAAC;YACrB,SAAS,EAAE,IAAI,KAAK,WAAW;YAC/B,SAAS,CAAC,KAAK,KAAK,EAAE;YACtB,IAAI,EAAE,IAAI,KAAK,YAAY;YAC3B,IAAI,CAAC,GAAG,KAAK,CAAC;YACd,IAAI,CAAC,GAAG,KAAK,QAAQ;YACrB,IAAI,CAAC,OAAO,CAAC,GAAG,KAAK,IAAI,CAAC,OAAO,CAAC,GAAG,EACrC,CAAC;YACD,OAAO;gBACL,EAAE,UAAU,EAAE,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC/D,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;aACrD,CAAC;QACJ,CAAC;IACH,CAAC;IACD,IAAI,CAAC,QAAQ;QAAE,OAAO,SAAS,CAAC;IAChC,MAAM,MAAM,GAAmB,EAAE,CAAC;IAClC,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;QAC3B,IAAI,OAAO,CAAC,IAAI,KAAK,YAAY,IAAI,OAAO,CAAC,GAAG,KAAK,CAAC;YAAE,SAAS;QACjE,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;QACvE,IACE,IAAI,CAAC,IAAI,KAAK,WAAW;YACzB,IAAI,CAAC,IAAI,KAAK,gBAAgB;YAC9B,IAAI,CAAC,IAAI,KAAK,cAAc,EAC5B,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;YACV,UAAU,EAAE,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC;YAC3C,GAAG,EAAE,OAAO,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACrD,CAAC,CAAC;QACH,IAAI,MAAM,CAAC,MAAM,GAAG,GAAG;YAAE,OAAO,SAAS,CAAC;IAC5C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,KAA0B,EAAE,QAA0B;IAC/E,MAAM,QAAQ,GACZ,KAAK,CAAC,OAAO,KAAK,SAAS;QACzB,CAAC,CAAC,aAAa;QACf,CAAC,CAAC,sCAAsC,GAAG,CAAC,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;IACvE,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,KAAK,EAAE,EAAE,CAAC;QAC9D,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACrD,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;IACnE,MAAM,OAAO,GAAG,QAAQ,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;IACpE,MAAM,aAAa,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAClE,MAAM,UAAU,GACd,QAAQ,KAAK,SAAS,IAAI,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC;IAC9F,OAAO,CAAC,GAAG,QAAQ,CAAC;SACjB,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;SACnF,IAAI,CAAC,EAAE,CAAC,CAAC;AACd,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { RegExpParser } from \"@eslint-community/regexpp\";\nimport type { ExpressionOrValue } from \"../expression/expressions.js\";\nimport { isExpression, unwrapExpression } from \"../expression/expressions.js\";\nimport { concat, subscription, toLower, uniqueString } from \"../fn.js\";\nimport { DEFAULT_NAMING_RULES, type ResourceNamingRules } from \"./naming-rules.js\";\nimport { assertValidResourceName } from \"./name-validation.js\";\n\nexport interface NamingContext {\n  readonly type: string;\n  readonly rules: ResourceNamingRules;\n  /** Required name segments relative to the actual declaration parent. */\n  readonly nameSegments?: number | undefined;\n  readonly label?: string | undefined;\n}\n\n/**\n * Strategy for generating Azure resource names when a resource is created\n * without an explicit `name`.\n *\n * Implement this interface to provide a custom naming convention. Two\n * built-in implementations are provided:\n *\n * - {@link DefaultNamingPolicy} — workload-based names with abbreviations,\n *   ordinals, and `uniqueString()` for globally-scoped resources.\n * - {@link namingRequiredPolicy} — a singleton that throws if a resource\n *   doesn't provide an explicit `name`.\n */\nexport interface NamingPolicy {\n  /** Produces a candidate; resource construction validates the returned name. */\n  generateName(context: NamingContext): ExpressionOrValue<string>;\n}\n\nexport interface NamingPolicyOptions {\n  readonly workload: string;\n  readonly environment?: string | undefined;\n  readonly region?: string | undefined;\n}\n\n/**\n * Default workload-based naming policy.\n *\n * Generates names by composing the resource type abbreviation, workload,\n * environment, region, label, and an ordinal suffix for repeated types.\n * Global-scope resources get a `uniqueString(subscription().subscriptionId)`\n * suffix to reduce name collisions; Azure name availability is not checked.\n */\nexport class DefaultNamingPolicy implements NamingPolicy {\n  readonly #options: NamingPolicyOptions;\n  readonly #ordinals = new Map<string, number>();\n  readonly #names = new Map<string, Set<string>>();\n\n  constructor(options: NamingPolicyOptions) {\n    this.#options = options;\n  }\n\n  generateName(context: NamingContext): ExpressionOrValue<string> {\n    const rules = context.rules;\n    const nameSegments = context.nameSegments ?? rules.nameSegments ?? 1;\n    if (!Number.isSafeInteger(nameSegments) || nameSegments < 1) {\n      throw new Error(\"Resource naming segment count must be a positive safe integer.\");\n    }\n    if (nameSegments > 1) {\n      throw new Error(\n        `Resource '${context.type}' requires an explicit ${nameSegments}-segment name including its undeclared ancestors.`,\n      );\n    }\n    const ordinal = this.#ordinals.get(context.type) ?? 0;\n    const alphabet = getNamingAlphabet(rules);\n    const sep = rules.separator ?? (alphabet.includes(\"-\") ? \"-\" : \"\");\n    if ([...sep].some((character) => !alphabet.includes(character))) {\n      throw new Error(\n        `Cannot generate a compliant name for '${context.type}': separator '${sep}' is incompatible with its naming rules.`,\n      );\n    }\n    const sanitize = (segment: string): string => {\n      return [...segment]\n        .map((character) => (alphabet.includes(character) ? character : character.toLowerCase()))\n        .filter((character) => alphabet.includes(character))\n        .join(\"\");\n    };\n\n    const segments: string[] = [];\n    if (rules.abbreviation) {\n      segments.push(sanitize(rules.abbreviation));\n    }\n    segments.push(sanitize(this.#options.workload));\n    if (this.#options.environment) {\n      segments.push(sanitize(this.#options.environment));\n    }\n    if (this.#options.region) {\n      segments.push(sanitize(this.#options.region));\n    }\n    if (context.label) {\n      segments.push(sanitize(context.label));\n    }\n    const ordinalSuffix = ordinal > 0 ? String(ordinal + 1) : \"\";\n    let base = segments.filter(Boolean).join(sep);\n    const startingAlphabet = getNamingAlphabet(rules, \"start\");\n    const endingAlphabet = getNamingAlphabet(rules, \"end\");\n    const padding = startingAlphabet[0];\n    if (padding === undefined || endingAlphabet.length === 0) {\n      throw new Error(\n        `Cannot generate a compliant name for '${context.type}': no supported generation alphabet. Provide an explicit name.`,\n      );\n    }\n    if (base.length > 0 && !startingAlphabet.includes(base[0]!)) {\n      base = padding + base;\n    }\n    // This is a convention budget when TypeSpec supplies no maximum, not a\n    // constraint imposed on explicit names.\n    const maxLength = rules.maxLength ?? Math.max(24, rules.minLength ?? 0);\n    const minLength = rules.minLength ?? 1;\n\n    const truncateWithOrdinal = (available: number): string => {\n      const ordinalPrefix = ordinalSuffix ? sep : \"\";\n      const baseLimit = available - ordinalPrefix.length - ordinalSuffix.length;\n      if (baseLimit < 1) {\n        throw new Error(\n          `Cannot generate a compliant name for '${context.type}': maximum length ${maxLength} cannot accommodate the required suffixes. Provide an explicit name.`,\n        );\n      }\n      return `${base.slice(0, baseLimit)}${ordinalPrefix}${ordinalSuffix}`;\n    };\n\n    let name: ExpressionOrValue<string>;\n    if (rules.scope === \"global\") {\n      // Bicep uniqueString() always returns 13 characters. Reserve that suffix\n      // and the ordinal before truncating so repeated resources stay unique.\n      const uniqueSuffixLength = 13;\n      const prefixBudget = maxLength - sep.length - uniqueSuffixLength;\n      base = base.padEnd(Math.max(1, minLength - sep.length - uniqueSuffixLength), padding);\n      let prefix = truncateWithOrdinal(prefixBudget);\n      if (sep && prefix.endsWith(sep)) {\n        prefix = prefix.slice(0, -sep.length).padEnd(1, padding);\n      }\n      prefix = prefix.padEnd(Math.max(1, minLength - sep.length - uniqueSuffixLength), padding);\n      name = concat(prefix + sep, uniqueString(subscription().subscriptionId));\n      if (!alphabet.includes(\"A\")) name = toLower(name);\n    } else {\n      base = base.padEnd(minLength, padding);\n      let truncated = truncateWithOrdinal(maxLength);\n      if (!endingAlphabet.includes(truncated.at(-1)!)) {\n        truncated = truncated.slice(0, -1) + endingAlphabet[0]!;\n      }\n      name = truncated;\n    }\n\n    const key = JSON.stringify(name, (_key, value: unknown) =>\n      isExpression(value) ? unwrapExpression(value) : value,\n    );\n    const names = this.#names.get(context.type) ?? new Set<string>();\n    if (names.has(key)) {\n      throw new Error(\n        `Cannot generate a distinct name for '${context.type}' within its naming rules. Provide an explicit name.`,\n      );\n    }\n    names.add(key);\n    this.#names.set(context.type, names);\n    this.#ordinals.set(context.type, ordinal + 1);\n    return name;\n  }\n}\n\n/**\n * Naming policy that requires every resource to provide an explicit `name`.\n *\n * Throws an error when asked to generate a name. Use this on a stack to\n * disable auto-naming entirely.\n */\nexport const namingRequiredPolicy: NamingPolicy = {\n  generateName(context: NamingContext): ExpressionOrValue<string> {\n    throw new Error(\n      `Resource of type '${context.type}' requires an explicit 'name' ` +\n        `(the stack uses 'namingRequiredPolicy').`,\n    );\n  },\n};\n\n/**\n * Generates and validates a name at the resource construction boundary.\n * Explicit constructor names are validated before declaration registration.\n */\nexport function generateResourceName(\n  policy: NamingPolicy,\n  type: string,\n  namingRules: ResourceNamingRules | undefined,\n  nameSegments: number | undefined,\n): ExpressionOrValue<string> {\n  const rules = namingRules ?? DEFAULT_NAMING_RULES;\n  const generated = policy.generateName({\n    type,\n    rules,\n    nameSegments: nameSegments ?? rules.nameSegments,\n  });\n  assertValidResourceName(generated, type, rules, {\n    generated: true,\n  });\n  return generated;\n}\n\n/** A candidate character atom and its minimum repetition count. */\ninterface PatternToken {\n  readonly characters: RegExp;\n  readonly min: number;\n}\n\nconst NAME_ALPHABET = \"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789-._\";\nconst patternParser = new RegExpParser();\n\n/**\n * Selects generation tokens from a parsed regex AST. Shapes outside the\n * workload-based convention remain usable for literal-name validation.\n */\nfunction getPatternTokens(regex: string): readonly PatternToken[] | undefined {\n  const pattern = patternParser.parsePattern(regex);\n  if (pattern.alternatives.length !== 1) return undefined;\n  const elements = pattern.alternatives[0]!.elements;\n  const start = elements[0];\n  const end = elements.at(-1);\n  if (start?.type !== \"Assertion\" || start.kind !== \"start\") return undefined;\n  const anchored = end?.type === \"Assertion\" && end.kind === \"end\";\n  const body = elements.slice(1, anchored ? -1 : undefined);\n  const [head, tail] = body;\n  // Prefer the separator-free sublanguage of repeated hyphen-separated classes.\n  if (\n    body.length === 2 &&\n    head?.type === \"Quantifier\" &&\n    head.min === 1 &&\n    head.max === Infinity &&\n    head.element.type === \"CharacterClass\" &&\n    tail?.type === \"Quantifier\" &&\n    tail.min === 0 &&\n    tail.max === Infinity &&\n    (tail.element.type === \"Group\" || tail.element.type === \"CapturingGroup\") &&\n    tail.element.alternatives.length === 1\n  ) {\n    const repeated = tail.element.alternatives[0]!.elements;\n    const [separator, part] = repeated;\n    if (\n      repeated.length === 2 &&\n      separator?.type === \"Character\" &&\n      separator.value === 45 &&\n      part?.type === \"Quantifier\" &&\n      part.min === 1 &&\n      part.max === Infinity &&\n      part.element.raw === head.element.raw\n    ) {\n      return [\n        { characters: new RegExp(`^(?:${head.element.raw})$`), min: 1 },\n        ...(anchored ? [] : [{ characters: /^.$/, min: 0 }]),\n      ];\n    }\n  }\n  if (!anchored) return undefined;\n  const tokens: PatternToken[] = [];\n  for (const element of body) {\n    if (element.type === \"Quantifier\" && element.max === 0) continue;\n    const atom = element.type === \"Quantifier\" ? element.element : element;\n    if (\n      atom.type !== \"Character\" &&\n      atom.type !== \"CharacterClass\" &&\n      atom.type !== \"CharacterSet\"\n    ) {\n      return undefined;\n    }\n    tokens.push({\n      characters: new RegExp(`^(?:${atom.raw})$`),\n      min: element.type === \"Quantifier\" ? element.min : 1,\n    });\n    if (tokens.length > 128) return undefined;\n  }\n  return tokens;\n}\n\n/**\n * Selects candidate characters for sanitization, padding, and boundary repair.\n * Candidates are not a validity guarantee; the complete name is still checked.\n */\nfunction getNamingAlphabet(rules: ResourceNamingRules, boundary?: \"start\" | \"end\"): string {\n  const alphabet =\n    rules.pattern !== undefined\n      ? NAME_ALPHABET\n      : \"abcdefghijklmnopqrstuvwxyz0123456789\" + (rules.separator ?? \"\");\n  if (rules.pattern === undefined || rules.pattern.regex === \"\") {\n    return alphabet;\n  }\n  const tokens = getPatternTokens(rules.pattern.regex);\n  if (tokens === undefined) return alphabet.replace(/[A-Z._-]/g, \"\");\n  const ordered = boundary === \"end\" ? [...tokens].reverse() : tokens;\n  const firstRequired = ordered.findIndex((token) => token.min > 0);\n  const candidates =\n    boundary === undefined || firstRequired < 0 ? ordered : ordered.slice(0, firstRequired + 1);\n  return [...alphabet]\n    .filter((character) => candidates.some((token) => token.characters.test(character)))\n    .join(\"\");\n}\n"]}

package/dist/esm/naming/naming-rules.d.ts

@@ -1,15 +1,16 @@
-export interface ResourceNamingValidCharacters {
-    readonly uppercase: boolean;
-    readonly hyphens: boolean;
-    readonly underscores: boolean;
-    readonly periods: boolean;
-}
 export interface ResourceNamingRules {
     readonly abbreviation: string;
-    readonly minLength: number;
-    readonly maxLength: number;
-    readonly validCharacters: ResourceNamingValidCharacters;
-    readonly scope: "global" | "resourceGroup" | "subscription";
+    readonly minLength?: number;
+    readonly maxLength?: number;
+    readonly pattern?: {
+        readonly regex: string;
+        readonly message?: string;
+    };
+    /** Default relative name segments in the generated resource hierarchy. */
+    readonly nameSegments?: number;
+    readonly separator?: string;
+    /** Name uniqueness domain, not deployment scope. */
+    readonly scope: "global" | "resourceGroup" | "subscription" | "parent";
 }
-export declare const MOST_RESTRICTIVE: ResourceNamingRules;
+export declare const DEFAULT_NAMING_RULES: ResourceNamingRules;
 //# sourceMappingURL=naming-rules.d.ts.map

package/dist/esm/naming/naming-rules.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"naming-rules.d.ts","sourceRoot":"","sources":["../../../src/naming/naming-rules.ts"],"names":[],"mappings":"AAGA,MAAM,WAAW,6BAA6B;IAC5C,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;CAC3B;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,eAAe,EAAE,6BAA6B,CAAC;IACxD,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,eAAe,GAAG,cAAc,CAAC;CAC7D;AAED,eAAO,MAAM,gBAAgB,EAAE,mBAW9B,CAAC"}
+{"version":3,"file":"naming-rules.d.ts","sourceRoot":"","sources":["../../../src/naming/naming-rules.ts"],"names":[],"mappings":"AAGA,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,OAAO,CAAC,EAAE;QACjB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;QACvB,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;KAC3B,CAAC;IACF,0EAA0E;IAC1E,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,oDAAoD;IACpD,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,eAAe,GAAG,cAAc,GAAG,QAAQ,CAAC;CACxE;AAED,eAAO,MAAM,oBAAoB,EAAE,mBAIlC,CAAC"}

package/dist/esm/naming/naming-rules.js

@@ -1,15 +1,8 @@
 // Copyright (c) Microsoft Corporation.
 // Licensed under the MIT License.
-export const MOST_RESTRICTIVE = {
+export const DEFAULT_NAMING_RULES = {
     abbreviation: "",
-    minLength: 1,
-    maxLength: 24,
-    validCharacters: {
-        uppercase: false,
-        hyphens: false,
-        underscores: false,
-        periods: false,
-    },
+    separator: "",
     scope: "global",
 };
 //# sourceMappingURL=naming-rules.js.map

package/dist/esm/naming/naming-rules.js.map

@@ -1 +1 @@
-{"version":3,"file":"naming-rules.js","sourceRoot":"","sources":["../../../src/naming/naming-rules.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAiBlC,MAAM,CAAC,MAAM,gBAAgB,GAAwB;IACnD,YAAY,EAAE,EAAE;IAChB,SAAS,EAAE,CAAC;IACZ,SAAS,EAAE,EAAE;IACb,eAAe,EAAE;QACf,SAAS,EAAE,KAAK;QAChB,OAAO,EAAE,KAAK;QACd,WAAW,EAAE,KAAK;QAClB,OAAO,EAAE,KAAK;KACf;IACD,KAAK,EAAE,QAAQ;CAChB,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nexport interface ResourceNamingValidCharacters {\n  readonly uppercase: boolean;\n  readonly hyphens: boolean;\n  readonly underscores: boolean;\n  readonly periods: boolean;\n}\n\nexport interface ResourceNamingRules {\n  readonly abbreviation: string;\n  readonly minLength: number;\n  readonly maxLength: number;\n  readonly validCharacters: ResourceNamingValidCharacters;\n  readonly scope: \"global\" | \"resourceGroup\" | \"subscription\";\n}\n\nexport const MOST_RESTRICTIVE: ResourceNamingRules = {\n  abbreviation: \"\",\n  minLength: 1,\n  maxLength: 24,\n  validCharacters: {\n    uppercase: false,\n    hyphens: false,\n    underscores: false,\n    periods: false,\n  },\n  scope: \"global\",\n};\n"]}
+{"version":3,"file":"naming-rules.js","sourceRoot":"","sources":["../../../src/naming/naming-rules.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAiBlC,MAAM,CAAC,MAAM,oBAAoB,GAAwB;IACvD,YAAY,EAAE,EAAE;IAChB,SAAS,EAAE,EAAE;IACb,KAAK,EAAE,QAAQ;CAChB,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nexport interface ResourceNamingRules {\n  readonly abbreviation: string;\n  readonly minLength?: number;\n  readonly maxLength?: number;\n  readonly pattern?: {\n    readonly regex: string;\n    readonly message?: string;\n  };\n  /** Default relative name segments in the generated resource hierarchy. */\n  readonly nameSegments?: number;\n  readonly separator?: string;\n  /** Name uniqueness domain, not deployment scope. */\n  readonly scope: \"global\" | \"resourceGroup\" | \"subscription\" | \"parent\";\n}\n\nexport const DEFAULT_NAMING_RULES: ResourceNamingRules = {\n  abbreviation: \"\",\n  separator: \"\",\n  scope: \"global\",\n};\n"]}

package/dist/esm/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@azure/provisioning-core",
-  "version": "1.0.0-beta.1",
+  "version": "1.0.0-beta.2",
   "type": "module",
   "exports": {
     "./package.json": "./package.json"

package/dist/{commonjs/serialization/json/lower.d.ts → esm/serialization/arm-object-conversion.d.ts}

@@ -1,15 +1,15 @@
 /**
- * ARM state-shape conversion.
+ * Client/ARM object conversion.
  *
- * lowerState maps JS property names to ARM paths, restores flattened
+ * convertToArmObject 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.
+ * convertFromArmObject 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.
+ * keys. Property-access expression lowering lives in the AST expression builder.
  */
-import { type ModelShape } from "../../shape/shape.js";
+import { type ModelShape } from "../shape/shape.js";
 /**
- * Recursively rewrite a raw state object into its ARM wire shape. Keys
+ * Recursively convert a client 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
@@ -19,9 +19,9 @@ import { type ModelShape } from "../../shape/shape.js";
  * when both sides are compatible objects; non-object / object collisions
  * throw.
  */
-export declare function lowerState(state: Record<string, unknown>, shape: ModelShape, visited?: WeakSet<object>): Record<string, unknown>;
+export declare function convertToArmObject(state: Record<string, unknown>, shape: ModelShape, visited?: WeakSet<object>): Record<string, unknown>;
 /**
- * Inverse of `lowerState`: walks a wire-shape state object and lifts
+ * Inverse of `convertToArmObject`: walks an ARM object and maps
  * 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.
@@ -35,7 +35,7 @@ export declare function lowerState(state: Record<string, unknown>, shape: ModelS
  *
  * Keys present in the state but not consumed by any property entry
  * pass through unchanged (preserving the "unknown key" escape hatch
- * documented in `lowerState`).
+ * documented in `convertToArmObject`).
  */
-export declare function raiseState(state: Record<string, unknown>, shape: ModelShape, visited?: WeakSet<object>): Record<string, unknown>;
-//# sourceMappingURL=lower.d.ts.map
+export declare function convertFromArmObject(state: Record<string, unknown>, shape: ModelShape, visited?: WeakSet<object>): Record<string, unknown>;
+//# sourceMappingURL=arm-object-conversion.d.ts.map

package/dist/esm/serialization/arm-object-conversion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arm-object-conversion.d.ts","sourceRoot":"","sources":["../../../src/serialization/arm-object-conversion.ts"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AAEH,OAAO,EAEL,KAAK,UAAU,EAGhB,MAAM,mBAAmB,CAAC;AAwB3B;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC9B,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE,OAAO,CAAC,MAAM,CAAiB,GACvC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CA8BzB;AAmJD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC9B,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE,OAAO,CAAC,MAAM,CAAiB,GACvC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CA8CzB"}

package/dist/{browser/serialization/json/lower.js → esm/serialization/arm-object-conversion.js}

@@ -1,24 +1,24 @@
 // Copyright (c) Microsoft Corporation.
 // Licensed under the MIT License.
 /**
- * ARM state-shape conversion.
+ * Client/ARM object conversion.
  *
- * lowerState maps JS property names to ARM paths, restores flattened
+ * convertToArmObject 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.
+ * convertFromArmObject 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.
+ * keys. Property-access expression lowering lives in the AST expression builder.
  */
-import { isTerminalValueShape, resolveModelShape, } from "../../shape/shape.js";
-import { isExpression } from "../../expression/expressions.js";
-import { isExpressionNode } from "../../expression/ast-nodes.js";
+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
+// Client object to ARM object
 // ---------------------------------------------------------------------------
 function isPlainObject(value) {
     if (value === null || typeof value !== "object")
@@ -31,7 +31,7 @@ function isPlainObject(value) {
     return proto === Object.prototype || proto === null;
 }
 /**
- * Recursively rewrite a raw state object into its ARM wire shape. Keys
+ * Recursively convert a client 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
@@ -41,7 +41,7 @@ function isPlainObject(value) {
  * when both sides are compatible objects; non-object / object collisions
  * throw.
  */
-export function lowerState(state, shape, visited = new WeakSet()) {
+export function convertToArmObject(state, shape, visited = new WeakSet()) {
     if (visited.has(state)) {
         throw new Error("Cycle detected while lowering ARM state.");
     }
@@ -87,9 +87,9 @@ function lowerValue(value, shape, visited, path) {
         case "deferred":
             if (!isPlainObject(value))
                 return value;
-            // `lowerState` resolves the variant itself, per property, using
+            // `convertToArmObject` resolves the variant itself, per property, using
             // `value` as the discriminator source.
-            return lowerState(value, shape.value(), visited);
+            return convertToArmObject(value, shape.value(), visited);
         case "array":
             if (!Array.isArray(value))
                 return value;
@@ -179,10 +179,10 @@ function defineOwn(target, key, value) {
     });
 }
 // ---------------------------------------------------------------------------
-// State raising (inverse of lowerState)
+// ARM object to client object
 // ---------------------------------------------------------------------------
 /**
- * Inverse of `lowerState`: walks a wire-shape state object and lifts
+ * Inverse of `convertToArmObject`: walks an ARM object and maps
  * 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.
@@ -196,9 +196,9 @@ function defineOwn(target, key, value) {
  *
  * Keys present in the state but not consumed by any property entry
  * pass through unchanged (preserving the "unknown key" escape hatch
- * documented in `lowerState`).
+ * documented in `convertToArmObject`).
  */
-export function raiseState(state, shape, visited = new WeakSet()) {
+export function convertFromArmObject(state, shape, visited = new WeakSet()) {
     if (visited.has(state)) {
         throw new Error("Cycle detected while raising ARM state.");
     }
@@ -262,8 +262,8 @@ function raiseValue(value, shape, visited, path) {
         case "deferred":
             if (!isPlainObject(value))
                 return value;
-            // `raiseState` selects the variant itself, against ARM keys.
-            return raiseState(value, shape.value(), visited);
+            // `convertFromArmObject` selects the variant itself, against ARM keys.
+            return convertFromArmObject(value, shape.value(), visited);
         case "array":
             if (!Array.isArray(value))
                 return value;
@@ -317,7 +317,7 @@ function extractPath(obj, path) {
  */
 function structuredCloneLike(value, seen) {
     if (seen.has(value)) {
-        // Preserve the cycle for downstream detection in raiseState.
+        // Preserve the cycle for downstream detection in convertFromArmObject.
         return value;
     }
     seen.add(value);
@@ -331,4 +331,4 @@ function structuredCloneLike(value, seen) {
     }
     return out;
 }
-//# sourceMappingURL=lower.js.map
+//# sourceMappingURL=arm-object-conversion.js.map

package/dist/esm/serialization/arm-object-conversion.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arm-object-conversion.js","sourceRoot":"","sources":["../../../src/serialization/arm-object-conversion.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAElC;;;;;;;;GAQG;AAEH,OAAO,EACL,oBAAoB,EAGpB,iBAAiB,GAClB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAC9D,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,8BAA8B;AAC9B,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,kBAAkB,CAChC,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,wEAAwE;YACxE,uCAAuC;YACvC,OAAO,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,CAAC;QAC3D,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,8BAA8B;AAC9B,8EAA8E;AAE9E;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,oBAAoB,CAClC,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,uEAAuE;YACvE,OAAO,oBAAoB,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,CAAC;QAC7D,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,uEAAuE;QACvE,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 * Client/ARM object conversion.\n *\n * convertToArmObject maps JS property names to ARM paths, restores flattened\n * nesting, and encodes terminal values using the supplied model shape.\n * convertFromArmObject 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 the AST expression builder.\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// Client object to ARM object\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 convert a client 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 convertToArmObject(\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      // `convertToArmObject` resolves the variant itself, per property, using\n      // `value` as the discriminator source.\n      return convertToArmObject(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// ARM object to client object\n// ---------------------------------------------------------------------------\n\n/**\n * Inverse of `convertToArmObject`: walks an ARM object and maps\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 `convertToArmObject`).\n */\nexport function convertFromArmObject(\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      // `convertFromArmObject` selects the variant itself, against ARM keys.\n      return convertFromArmObject(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 convertFromArmObject.\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/esm/serialization/ast/declaration-builder.d.ts

@@ -0,0 +1,10 @@
+import type { Stack } from "../../constructs/stack.js";
+import type { ResourceDeclaration } from "../../constructs/resource/resource.js";
+import type { InfraNode, OutputDeclarationNode, ParameterDeclarationNode, ResourceDeclarationNode, VariableDeclarationNode } from "./index.js";
+import type { DeclarationSymbolMap } from "../symbol-map.js";
+export declare function buildResourceDeclaration(resource: ResourceDeclaration, symbolMap: DeclarationSymbolMap): [string, ResourceDeclarationNode];
+export declare function buildParameterDeclarations(stack: Stack, symbolMap: DeclarationSymbolMap): Record<string, ParameterDeclarationNode> | undefined;
+export declare function buildVariableDeclarations(stack: Stack, symbolMap: DeclarationSymbolMap): Record<string, VariableDeclarationNode> | undefined;
+export declare function buildOutputDeclarations(stack: Stack, symbolMap: DeclarationSymbolMap): Record<string, OutputDeclarationNode> | undefined;
+export declare function buildStackDeclarations(stack: Stack, resources: readonly ResourceDeclaration[], symbols: DeclarationSymbolMap): Pick<InfraNode, "parameters" | "variables" | "resources" | "outputs">;
+//# sourceMappingURL=declaration-builder.d.ts.map