@intentius/chant 0.124.13 → 0.124.15

package/dist/codegen/surface-snapshot.js

@@ -0,0 +1,537 @@
+/**
+ * Lexicon API surface snapshot and diff.
+ *
+ * Extracts a stable, serializable representation of a lexicon's public API
+ * surface from the generated lexicon JSON. Diffs a fresh snapshot against a
+ * committed baseline and classifies each change as additive or breaking.
+ *
+ * The surface is derived from the lexicon registry JSON that every lexicon's
+ * `generate` step writes to `src/generated/<name>.json`. Resource and
+ * property-type names, together with their structural metadata (attrs, props,
+ * kind), form the baseline. The generated .d.ts is not used for diffing
+ * because: (a) it is not self-describing without parsing TypeScript, and
+ * (b) the registry JSON already encodes everything a consumer needs.
+ */
+// ── Extraction ───────────────────────────────────────────────────────
+/**
+ * Extract a surface snapshot from the lexicon JSON and the generated index.d.ts.
+ *
+ * The lexicon JSON contains the resource/property registry (names, kinds,
+ * attrs, createOnly, tagging). The .d.ts provides per-prop names and their
+ * required flags for resource constructor shapes.
+ *
+ * @param lexiconJSON   Contents of `src/generated/<name>.json`
+ * @param typesDTS      Contents of `src/generated/index.d.ts`
+ */
+export function extractSurface(lexiconJSON, typesDTS) {
+    const registry = JSON.parse(lexiconJSON);
+    // Build prop map from .d.ts
+    const propsMap = extractPropsFromDts(typesDTS);
+    const entries = {};
+    for (const [name, raw] of Object.entries(registry)) {
+        const kind = raw.kind ?? "property";
+        const resourceType = raw.resourceType ?? "";
+        const entry = { kind, resourceType };
+        if (kind === "resource") {
+            const attrs = raw.attrs ? Object.keys(raw.attrs).sort() : [];
+            if (attrs.length > 0)
+                entry.attrs = attrs;
+            // Props from .d.ts
+            const props = propsMap.get(name);
+            if (props && props.length > 0)
+                entry.props = props;
+            const createOnly = raw.createOnly ? [...raw.createOnly].sort() : [];
+            if (createOnly.length > 0)
+                entry.createOnly = createOnly;
+            if (raw.tagging?.taggable !== undefined) {
+                entry.taggable = raw.tagging.taggable;
+            }
+        }
+        entries[name] = entry;
+    }
+    // Sort keys for stable output
+    const sorted = {};
+    for (const key of Object.keys(entries).sort()) {
+        sorted[key] = entries[key];
+    }
+    return {
+        schemaVersion: 1,
+        generatedAt: new Date().toISOString(),
+        entries: sorted,
+    };
+}
+/**
+ * Lightweight extractor: pull constructor prop names and required flags
+ * from a `.d.ts` string.
+ *
+ * Handles the pattern generated by writeConstructor:
+ * ```
+ * export declare class Bucket {
+ *   constructor(props: {
+ *     BucketName?: string;
+ *     Tags: Bucket_Tag[];
+ *   }, attributes?: CFResourceAttributes);
+ * }
+ * ```
+ *
+ * Returns a Map<className, ["PropName:required", ...]>
+ * where each entry is sorted alphabetically.
+ */
+export function extractPropsFromDts(dts) {
+    const map = new Map();
+    const lines = dts.split("\n");
+    let className = null;
+    let inConstructorProps = false;
+    let braceDepth = 0;
+    const currentProps = [];
+    // Track class-body brace depth separately
+    let classBraceDepth = 0;
+    for (const line of lines) {
+        const trimmed = line.trim();
+        // Start of a class
+        const classMatch = /^export declare class (\w+)/.exec(trimmed);
+        if (classMatch) {
+            className = classMatch[1];
+            inConstructorProps = false;
+            braceDepth = 0;
+            classBraceDepth = 1; // opening { is on this line
+            currentProps.length = 0;
+            continue;
+        }
+        if (!className)
+            continue;
+        // Track class-body braces when not in constructor props
+        if (!inConstructorProps) {
+            // End of class block (classBraceDepth back to 0)
+            let delta = 0;
+            for (const ch of trimmed) {
+                if (ch === "{")
+                    delta++;
+                if (ch === "}")
+                    delta--;
+            }
+            classBraceDepth += delta;
+            if (classBraceDepth <= 0) {
+                // Leaving class body — record and reset
+                if (currentProps.length > 0) {
+                    map.set(className, [...currentProps].sort());
+                    currentProps.length = 0;
+                }
+                className = null;
+                classBraceDepth = 0;
+                continue;
+            }
+            // Constructor start
+            if (trimmed.startsWith("constructor(props: {")) {
+                inConstructorProps = true;
+                braceDepth = 1;
+                currentProps.length = 0;
+                continue;
+            }
+            // Constructor with empty props object on one line (no sub-braces needed)
+            // constructor(props: Record<string, unknown>) — skip
+            continue;
+        }
+        // Inside constructor props block
+        // Track brace depth
+        let delta = 0;
+        for (const ch of trimmed) {
+            if (ch === "{")
+                delta++;
+            if (ch === "}")
+                delta--;
+        }
+        braceDepth += delta;
+        // End of constructor props block
+        if (braceDepth <= 0) {
+            inConstructorProps = false;
+            braceDepth = 0;
+            // Record the props collected so far
+            if (!map.has(className) && currentProps.length > 0) {
+                map.set(className, [...currentProps].sort());
+                currentProps.length = 0;
+            }
+            continue;
+        }
+        // Skip comments
+        if (trimmed.startsWith("/**") || trimmed.startsWith("*") || trimmed.startsWith("//"))
+            continue;
+        // Match a prop: `PropName?: type;` or `PropName: type;`
+        // Prop names may be quoted for non-identifier keys
+        const propMatch = /^(?:"([^"]+)"|(\w+))(\??):/.exec(trimmed);
+        if (propMatch) {
+            const propName = propMatch[1] ?? propMatch[2];
+            const optional = propMatch[3] === "?";
+            // Encode as "name:required" — "true" means required
+            currentProps.push(`${propName}:${!optional}`);
+        }
+    }
+    return map;
+}
+// ── Diff ─────────────────────────────────────────────────────────────
+/**
+ * Diff a fresh snapshot against a committed baseline.
+ *
+ * Classification rules:
+ * - Added entry → additive
+ * - Removed entry → breaking
+ * - Changed entry:
+ *   - resourceType changed → breaking
+ *   - kind changed → breaking
+ *   - prop removed → breaking
+ *   - prop now required (was optional) → breaking
+ *   - attr removed → breaking
+ *   - createOnly changed → breaking (changes immutability contract)
+ *   - taggable: false→undefined or true→false → breaking
+ *   - prop added (optional) → additive
+ *   - prop now optional (was required) → additive
+ *   - attr added → additive
+ *   - taggable: false→true or undefined→true → additive
+ */
+export function diffSurface(baseline, fresh) {
+    const changed = [];
+    let added = [];
+    let removed = [];
+    const baseNames = new Set(Object.keys(baseline.entries));
+    const freshNames = new Set(Object.keys(fresh.entries));
+    // Added
+    for (const name of freshNames) {
+        if (!baseNames.has(name)) {
+            added.push({ name, entry: fresh.entries[name] });
+        }
+    }
+    // Removed
+    for (const name of baseNames) {
+        if (!freshNames.has(name)) {
+            removed.push({ name, entry: baseline.entries[name] });
+        }
+    }
+    // Renamed (#1460): a removal and an addition that carry the same
+    // resourceType and kind are one entry under a new TS name. Pair them
+    // before classifying so the report shows what upstream actually did.
+    const renamed = [];
+    const paired = pairRenames(removed, added);
+    for (const { from, to } of paired) {
+        const entry = { from: from.name, to: to.name, entry: to.entry };
+        const changes = diffEntries(from.entry, to.entry);
+        if (changes)
+            entry.changes = changes;
+        renamed.push(entry);
+    }
+    if (paired.length > 0) {
+        const fromNames = new Set(paired.map((p) => p.from.name));
+        const toNames = new Set(paired.map((p) => p.to.name));
+        removed = removed.filter((r) => !fromNames.has(r.name));
+        added = added.filter((a) => !toNames.has(a.name));
+    }
+    renamed.sort((a, b) => a.from.localeCompare(b.from));
+    // Changed
+    for (const name of baseNames) {
+        if (!freshNames.has(name))
+            continue;
+        const changes = diffEntries(baseline.entries[name], fresh.entries[name]);
+        if (changes)
+            changed.push({ name, ...changes });
+    }
+    // Severity
+    let severity = "none";
+    if (added.length > 0) {
+        severity = "additive";
+    }
+    // Additive-only changes in the changed[] set
+    const hasAdditiveChanges = changed.some(isAdditiveChange);
+    if (hasAdditiveChanges && severity === "none") {
+        severity = "additive";
+    }
+    // A rename is still breaking for the consumer: the old import no longer
+    // resolves, whether the entry is a resource or a property type. It is
+    // reported separately so the reader can tell a rename from a deletion.
+    const hasBreaking = removed.length > 0 ||
+        renamed.length > 0 ||
+        changed.some(isBreakingChange);
+    if (hasBreaking)
+        severity = "breaking";
+    return { added, changed, removed, renamed, severity };
+}
+/**
+ * Diff two entries that are (or are taken to be) the same thing. Returns
+ * `null` when nothing differs.
+ */
+function diffEntries(before, after) {
+    const change = {};
+    let hasChange = false;
+    if (before.resourceType !== after.resourceType) {
+        change.resourceTypeChanged = { before: before.resourceType, after: after.resourceType };
+        hasChange = true;
+    }
+    if (before.kind !== after.kind) {
+        change.kindChanged = { before: before.kind, after: after.kind };
+        hasChange = true;
+    }
+    // Props diff (only meaningful for resource entries)
+    const beforeProps = new Map((before.props ?? []).map((p) => {
+        const [nm, req] = splitProp(p);
+        return [nm, req === "true"];
+    }));
+    const afterProps = new Map((after.props ?? []).map((p) => {
+        const [nm, req] = splitProp(p);
+        return [nm, req === "true"];
+    }));
+    const removedProps = [...beforeProps.keys()].filter((k) => !afterProps.has(k));
+    const addedProps = [...afterProps.keys()].filter((k) => !beforeProps.has(k));
+    const nowRequired = [...beforeProps.keys()].filter((k) => afterProps.has(k) && !beforeProps.get(k) && afterProps.get(k));
+    const nowOptional = [...beforeProps.keys()].filter((k) => afterProps.has(k) && beforeProps.get(k) && !afterProps.get(k));
+    if (removedProps.length > 0) {
+        change.removedProps = removedProps.sort();
+        hasChange = true;
+    }
+    if (addedProps.length > 0) {
+        change.addedProps = addedProps.sort();
+        hasChange = true;
+    }
+    if (nowRequired.length > 0) {
+        change.nowRequired = nowRequired.sort();
+        hasChange = true;
+    }
+    if (nowOptional.length > 0) {
+        change.nowOptional = nowOptional.sort();
+        hasChange = true;
+    }
+    // Attrs diff
+    const beforeAttrs = new Set(before.attrs ?? []);
+    const afterAttrs = new Set(after.attrs ?? []);
+    const removedAttrs = [...beforeAttrs].filter((a) => !afterAttrs.has(a));
+    const addedAttrs = [...afterAttrs].filter((a) => !beforeAttrs.has(a));
+    if (removedAttrs.length > 0) {
+        change.removedAttrs = removedAttrs.sort();
+        hasChange = true;
+    }
+    if (addedAttrs.length > 0) {
+        change.addedAttrs = addedAttrs.sort();
+        hasChange = true;
+    }
+    // createOnly diff
+    const beforeCO = JSON.stringify((before.createOnly ?? []).sort());
+    const afterCO = JSON.stringify((after.createOnly ?? []).sort());
+    if (beforeCO !== afterCO) {
+        change.createOnlyChanged = {
+            before: before.createOnly ?? [],
+            after: after.createOnly ?? [],
+        };
+        hasChange = true;
+    }
+    // taggable diff
+    if (before.taggable !== after.taggable) {
+        change.taggableChanged = { before: before.taggable, after: after.taggable };
+        hasChange = true;
+    }
+    return hasChange ? change : null;
+}
+function isAdditiveChange(c) {
+    return ((c.addedProps?.length ?? 0) > 0 ||
+        (c.nowOptional?.length ?? 0) > 0 ||
+        (c.addedAttrs?.length ?? 0) > 0 ||
+        // gaining tagging is additive
+        (c.taggableChanged !== undefined && c.taggableChanged.after === true && c.taggableChanged.before !== true));
+}
+function isBreakingChange(c) {
+    return (c.resourceTypeChanged !== undefined ||
+        c.kindChanged !== undefined ||
+        (c.removedProps?.length ?? 0) > 0 ||
+        (c.nowRequired?.length ?? 0) > 0 ||
+        (c.removedAttrs?.length ?? 0) > 0 ||
+        c.createOnlyChanged !== undefined ||
+        // losing taggable is breaking
+        (c.taggableChanged !== undefined && c.taggableChanged.before === true && c.taggableChanged.after !== true));
+}
+/**
+ * Pair removed and added entries that share a kind and resourceType.
+ *
+ * One removal and one addition under a resourceType pair directly. When a
+ * resourceType has several of each (property types of one renamed parent
+ * resource, for instance), pairs are chosen greedily by name similarity and
+ * whatever is left over stays a plain removal or addition. Entries with an
+ * empty resourceType are never paired; there is nothing to key them on.
+ */
+function pairRenames(removed, added) {
+    const key = (e) => `${e.kind} ${e.resourceType}`;
+    const addedByKey = new Map();
+    for (const a of added) {
+        if (!a.entry.resourceType)
+            continue;
+        const k = key(a.entry);
+        const bucket = addedByKey.get(k);
+        if (bucket)
+            bucket.push(a);
+        else
+            addedByKey.set(k, [a]);
+    }
+    const removedByKey = new Map();
+    for (const r of removed) {
+        if (!r.entry.resourceType)
+            continue;
+        const k = key(r.entry);
+        if (!addedByKey.has(k))
+            continue;
+        const bucket = removedByKey.get(k);
+        if (bucket)
+            bucket.push(r);
+        else
+            removedByKey.set(k, [r]);
+    }
+    const pairs = [];
+    for (const [k, olds] of removedByKey) {
+        const news = addedByKey.get(k) ?? [];
+        if (olds.length === 1 && news.length === 1) {
+            pairs.push({ from: olds[0], to: news[0] });
+            continue;
+        }
+        // Ambiguous: rank every (old, new) combination by similarity and take
+        // the best remaining pair until one side runs out.
+        const candidates = [];
+        for (const from of olds) {
+            for (const to of news) {
+                candidates.push({ from, to, score: nameSimilarity(from.name, to.name) });
+            }
+        }
+        candidates.sort((a, b) => b.score - a.score ||
+            a.from.name.localeCompare(b.from.name) ||
+            a.to.name.localeCompare(b.to.name));
+        const usedOld = new Set();
+        const usedNew = new Set();
+        for (const cand of candidates) {
+            if (usedOld.has(cand.from.name) || usedNew.has(cand.to.name))
+                continue;
+            usedOld.add(cand.from.name);
+            usedNew.add(cand.to.name);
+            pairs.push({ from: cand.from, to: cand.to });
+            if (usedOld.size === olds.length || usedNew.size === news.length)
+                break;
+        }
+    }
+    return pairs;
+}
+/**
+ * Dice similarity over character bigrams, in [0, 1]. Enough to tell
+ * `Space` apart from `Space_Tag` when pairing the property types of a
+ * renamed parent; nothing heavier is needed.
+ */
+function nameSimilarity(a, b) {
+    if (a === b)
+        return 1;
+    if (a.length < 2 || b.length < 2)
+        return 0;
+    const bigrams = (s) => {
+        const m = new Map();
+        for (let i = 0; i < s.length - 1; i++) {
+            const bg = s.slice(i, i + 2);
+            m.set(bg, (m.get(bg) ?? 0) + 1);
+        }
+        return m;
+    };
+    const ba = bigrams(a);
+    const bb = bigrams(b);
+    let overlap = 0;
+    for (const [bg, n] of ba) {
+        const m = bb.get(bg);
+        if (m)
+            overlap += Math.min(n, m);
+    }
+    return (2 * overlap) / (a.length - 1 + b.length - 1);
+}
+// ── Serialization ────────────────────────────────────────────────────
+/**
+ * Serialize a snapshot to stable JSON. Suitable for writing to
+ * `surface.snapshot.json` at the lexicon root.
+ */
+export function serializeSnapshot(snapshot) {
+    return JSON.stringify(snapshot, null, 2) + "\n";
+}
+/**
+ * Parse a snapshot from JSON.
+ */
+export function parseSnapshot(json) {
+    return JSON.parse(json);
+}
+// ── Human-readable output ────────────────────────────────────────────
+/**
+ * Render a surface delta as human-readable text.
+ */
+export function formatDelta(delta) {
+    const lines = [];
+    if (delta.added.length > 0) {
+        lines.push(`Added (${delta.added.length}):`);
+        for (const e of delta.added) {
+            lines.push(`  + ${e.name} [${e.entry.kind}] (${e.entry.resourceType})`);
+        }
+    }
+    if (delta.removed.length > 0) {
+        lines.push(`Removed (${delta.removed.length}):`);
+        for (const e of delta.removed) {
+            lines.push(`  - ${e.name} [${e.entry.kind}] (${e.entry.resourceType})`);
+        }
+    }
+    if (delta.renamed.length > 0) {
+        lines.push(`Renamed (${delta.renamed.length}):`);
+        for (const r of delta.renamed) {
+            lines.push(`  ~ ${r.from} -> ${r.to} [${r.entry.kind}] (${r.entry.resourceType})`);
+            if (r.changes)
+                lines.push(...formatChanges(r.changes));
+        }
+    }
+    if (delta.changed.length > 0) {
+        lines.push(`Changed (${delta.changed.length}):`);
+        for (const c of delta.changed) {
+            lines.push(`  ~ ${c.name}`);
+            lines.push(...formatChanges(c));
+        }
+    }
+    if (lines.length === 0) {
+        lines.push("No surface changes.");
+    }
+    lines.push("");
+    lines.push(`Severity: ${delta.severity}`);
+    return lines.join("\n");
+}
+/** Indented detail lines for one entry's structural changes. */
+function formatChanges(c) {
+    const lines = [];
+    if (c.resourceTypeChanged) {
+        lines.push(`      resourceType: ${c.resourceTypeChanged.before} -> ${c.resourceTypeChanged.after}`);
+    }
+    if (c.kindChanged) {
+        lines.push(`      kind: ${c.kindChanged.before} -> ${c.kindChanged.after}`);
+    }
+    if (c.removedProps?.length) {
+        lines.push(`      removed props: ${c.removedProps.join(", ")}`);
+    }
+    if (c.nowRequired?.length) {
+        lines.push(`      now required: ${c.nowRequired.join(", ")}`);
+    }
+    if (c.addedProps?.length) {
+        lines.push(`      added props: ${c.addedProps.join(", ")}`);
+    }
+    if (c.nowOptional?.length) {
+        lines.push(`      now optional: ${c.nowOptional.join(", ")}`);
+    }
+    if (c.removedAttrs?.length) {
+        lines.push(`      removed attrs: ${c.removedAttrs.join(", ")}`);
+    }
+    if (c.addedAttrs?.length) {
+        lines.push(`      added attrs: ${c.addedAttrs.join(", ")}`);
+    }
+    if (c.createOnlyChanged) {
+        const before = c.createOnlyChanged.before.join(", ") || "(none)";
+        const after = c.createOnlyChanged.after.join(", ") || "(none)";
+        lines.push(`      createOnly: [${before}] -> [${after}]`);
+    }
+    if (c.taggableChanged) {
+        lines.push(`      taggable: ${c.taggableChanged.before ?? "(unset)"} -> ${c.taggableChanged.after ?? "(unset)"}`);
+    }
+    return lines;
+}
+// ── Helpers ──────────────────────────────────────────────────────────
+function splitProp(encoded) {
+    const idx = encoded.lastIndexOf(":");
+    return [encoded.slice(0, idx), encoded.slice(idx + 1)];
+}