npm - @descent-vtt/spec-graph - Versions diffs - 0.5.0 → 0.6.0 - Mend

@descent-vtt/spec-graph 0.5.0 → 0.6.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (30) hide show

package/dist/diff.js ADDED Viewed

@@ -0,0 +1,404 @@
+/**
+ * What changed between two states of the graph, read from two JSON exports.
+ *
+ * Two files in, one report out, and no git underneath: CI already has both
+ * checkouts, and the pipeline stays a pure function of text. See ADR-0020.
+ *
+ * The rule the whole module follows is that a change is reported only against a
+ * name that means the same thing in both exports. A document's id does. An
+ * item's numbered id does not - it is an ordinal within a section, so one
+ * inserted question renumbers every question after it - and keying on it
+ * reports a question as reopened when nobody touched it. So an obligation is
+ * paired only by a declared id, or by its document, section and title when
+ * nothing else shares them; anything unpaired is said to have appeared or
+ * disappeared, and never to have changed.
+ */
+/** Refused input: not JSON, not an export, or a version this cannot read. */
+export class DiffInputError extends Error {
+    constructor(message) {
+        super(message);
+        this.name = 'DiffInputError';
+    }
+}
+/* -------------------------------------------------------------------------- */
+/* Reading an export                                                          */
+/* -------------------------------------------------------------------------- */
+function isRecord(value) {
+    return typeof value === 'object' && value !== null && !Array.isArray(value);
+}
+function text(value) {
+    return typeof value === 'string' ? value : null;
+}
+/**
+ * Reads one export.
+ *
+ * Checked as far as the comparison reads it and no further: a field this does
+ * not use is not a reason to refuse a file, and a later export that adds fields
+ * is still version 1.
+ */
+export function parseGraphExport(raw, source) {
+    let parsed;
+    try {
+        parsed = JSON.parse(raw);
+    }
+    catch {
+        throw new DiffInputError(`${source} is not JSON; make it with \`spec-graph graph --graph-format json\``);
+    }
+    if (!isRecord(parsed) || !Array.isArray(parsed['nodes']) || !Array.isArray(parsed['edges'])) {
+        throw new DiffInputError(`${source} is not a graph export; make it with \`spec-graph graph --graph-format json\``);
+    }
+    if (parsed['version'] !== 1) {
+        throw new DiffInputError(`${source} is export version ${JSON.stringify(parsed['version'])}, and this reads version 1`);
+    }
+    const generator = isRecord(parsed['generator']) ? parsed['generator'] : null;
+    const name = generator ? text(generator['name']) : null;
+    const version = generator ? text(generator['version']) : null;
+    const documents = [];
+    const items = [];
+    parsed['nodes'].forEach((node, index) => {
+        const id = isRecord(node) ? text(node['id']) : null;
+        if (!isRecord(node) || id === null)
+            throw new DiffInputError(`${source}: node ${index} has no id`);
+        if (node['kind'] === 'document') {
+            documents.push({
+                id,
+                title: text(node['title']) ?? '',
+                path: text(node['path']) ?? '',
+                phase: text(node['phase']) ?? 'unknown',
+                status: text(node['status']),
+            });
+        }
+        else if (node['kind'] === 'item') {
+            const section = Array.isArray(node['section']) ? node['section'].filter((part) => typeof part === 'string') : [];
+            items.push({
+                id,
+                title: text(node['title']) ?? '',
+                document: text(node['document']) ?? '',
+                section,
+                openness: text(node['openness']) ?? 'unknown',
+                declared: typeof node['declared'] === 'boolean' ? node['declared'] : null,
+            });
+        }
+        else {
+            throw new DiffInputError(`${source}: node ${id} is neither a document nor an item`);
+        }
+    });
+    const edges = parsed['edges'].map((edge, index) => {
+        const kind = isRecord(edge) ? text(edge['kind']) : null;
+        const from = isRecord(edge) ? text(edge['from']) : null;
+        const to = isRecord(edge) ? text(edge['to']) : null;
+        if (kind === null || from === null || to === null)
+            throw new DiffInputError(`${source}: edge ${index} is missing its kind or ends`);
+        return { kind, from, to };
+    });
+    return { generator: name !== null && version !== null ? { name, version } : null, documents, items, edges };
+}
+/* -------------------------------------------------------------------------- */
+/* Comparing                                                                  */
+/* -------------------------------------------------------------------------- */
+// Code-unit order, not locale order: the same input sorts the same way on every
+// machine, which is what keeps a report byte-identical.
+function byText(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+/** Compares two exports. Pure, and deterministic in everything it returns. */
+export function diffExports(before, after) {
+    return {
+        generators: { before: before.generator, after: after.generator },
+        documents: compareDocuments(before, after),
+        relations: compareRelations(before, after),
+        obligations: compareObligations(before, after),
+    };
+}
+function compareDocuments(before, after) {
+    const was = new Map(before.documents.map((document) => [document.id, document]));
+    const now = new Map(after.documents.map((document) => [document.id, document]));
+    const changed = [];
+    for (const [id, next] of now) {
+        const previous = was.get(id);
+        if (previous === undefined)
+            continue;
+        // The id is the decision's name, so the same id at a new path is the same
+        // decision moved, never one removed and another added (ADR-0009).
+        const change = {
+            id,
+            ...(previous.path !== next.path && { path: [previous.path, next.path] }),
+            ...(previous.title !== next.title && { title: [previous.title, next.title] }),
+            ...(previous.phase !== next.phase && { phase: [previous.phase, next.phase] }),
+            ...(previous.status !== next.status && { status: [previous.status, next.status] }),
+        };
+        if (Object.keys(change).length > 1)
+            changed.push(change);
+    }
+    const ids = (documents) => [...documents].sort((a, b) => byText(a.id, b.id));
+    return {
+        added: ids([...now.values()].filter((document) => !was.has(document.id))),
+        removed: ids([...was.values()].filter((document) => !now.has(document.id))),
+        changed: changed.sort((a, b) => byText(a.id, b.id)),
+    };
+}
+/**
+ * The relations between documents, projected the way `--documents-only`
+ * projects a graph: an item's edges lifted onto its document, and a relation
+ * that ends where it began dropped - which is also what becomes of a document
+ * containing its own items, so containment survives only between documents.
+ * Where a relation was declared is not part of it - moving a supersession from
+ * a sentence into front matter changes nothing a reader relies on.
+ */
+function relationsOf(graph) {
+    // A document, or a target nothing in the export defines, stands for itself.
+    const owners = new Map(graph.items.map((item) => [item.id, item.document]));
+    const out = new Map();
+    for (const edge of graph.edges) {
+        const from = owners.get(edge.from) ?? edge.from;
+        const to = owners.get(edge.to) ?? edge.to;
+        if (from === to)
+            continue;
+        // Tab-joined: kinds and ids cannot contain one.
+        out.set(`${edge.kind}\t${from}\t${to}`, { kind: edge.kind, from, to });
+    }
+    return out;
+}
+function compareRelations(before, after) {
+    const was = relationsOf(before);
+    const now = relationsOf(after);
+    const sorted = (entries) => entries.sort(([a], [b]) => byText(a, b)).map(([, relation]) => relation);
+    return {
+        added: sorted([...now].filter(([key]) => !was.has(key))),
+        removed: sorted([...was].filter(([key]) => !now.has(key))),
+    };
+}
+/**
+ * Obligations by where they sit and then by title, heading by heading, so a
+ * section's own questions come before those of the sections under it.
+ */
+function byPlace(a, b) {
+    const left = [a.document, ...a.section];
+    const right = [b.document, ...b.section];
+    for (let at = 0; at < left.length && at < right.length; at++) {
+        const order = byText(left[at], right[at]);
+        if (order !== 0)
+            return order;
+    }
+    return left.length - right.length || byText(a.title, b.title);
+}
+/**
+ * The headings an item sits under, below its document's own. A section path
+ * starts at the document's heading, which is its title, so without this a
+ * retitled document would lose track of every question in it.
+ */
+function headingsIn(graph) {
+    const titles = new Map(graph.documents.map((document) => [document.id, document.title]));
+    return (item) => (item.section[0] === titles.get(item.document) ? item.section.slice(1) : item.section);
+}
+function compareObligations(before, after) {
+    const headingsBefore = headingsIn(before);
+    const headingsAfter = headingsIn(after);
+    const pairs = [];
+    const paired = new Set();
+    // A declared id names the same item in both states however it was reworded or
+    // moved - provided it names one item on each side. An export without the flag
+    // cannot say which ids were declared, so none of its ids are trusted.
+    const declaredIn = (items) => {
+        const out = new Map();
+        for (const item of items) {
+            if (item.declared !== true)
+                continue;
+            out.set(item.id, out.has(item.id) ? null : item);
+        }
+        return out;
+    };
+    const declaredBefore = declaredIn(before.items);
+    const declaredAfter = declaredIn(after.items);
+    for (const [id, item] of declaredBefore) {
+        const match = declaredAfter.get(id);
+        if (item === null || match === null || match === undefined)
+            continue;
+        pairs.push([item, match]);
+        paired.add(item);
+        paired.add(match);
+    }
+    // Otherwise the same document, headings and title, and only when nothing else
+    // on either side shares them: two identical titles in one section cannot be
+    // told apart, so neither is paired. Joined as JSON so that no two different
+    // triples can produce the same key.
+    const group = (items, headings) => {
+        const out = new Map();
+        for (const item of items) {
+            if (paired.has(item))
+                continue;
+            const key = JSON.stringify([item.document, headings(item), item.title]);
+            out.set(key, [...(out.get(key) ?? []), item]);
+        }
+        return out;
+    };
+    const was = group(before.items, headingsBefore);
+    const now = group(after.items, headingsAfter);
+    for (const [key, previous] of was) {
+        const next = now.get(key);
+        if (previous.length !== 1 || next?.length !== 1)
+            continue;
+        const [a, b] = [previous[0], next[0]];
+        pairs.push([a, b]);
+        paired.add(a);
+        paired.add(b);
+    }
+    const refIn = (headings) => (item) => ({
+        document: item.document,
+        section: item.section,
+        place: headings(item).join(' > '),
+        title: item.title,
+    });
+    const wasRef = refIn(headingsBefore);
+    const nowRef = refIn(headingsAfter);
+    return {
+        transitions: pairs
+            .filter(([a, b]) => a.openness !== b.openness)
+            .map(([a, b]) => ({ ...nowRef(b), openness: [a.openness, b.openness] }))
+            .sort(byPlace),
+        appeared: after.items.filter((item) => !paired.has(item)).map((item) => ({ ...nowRef(item), openness: item.openness })).sort(byPlace),
+        disappeared: before.items.filter((item) => !paired.has(item)).map((item) => ({ ...wasRef(item), openness: item.openness })).sort(byPlace),
+    };
+}
+/* -------------------------------------------------------------------------- */
+/* Reporting                                                                  */
+/* -------------------------------------------------------------------------- */
+function generatorName(generator) {
+    return generator === null ? 'an unknown version' : `${generator.name} ${generator.version}`;
+}
+/**
+ * The warning a diff carries when its two exports may disagree for a reason
+ * that is not the repository. `null` when both name the same generator.
+ */
+export function generatorWarning(diff) {
+    const { before, after } = diff.generators;
+    if (before !== null && after !== null && before.name === after.name && before.version === after.version)
+        return null;
+    return `the exports were made by ${generatorName(before)} and ${generatorName(after)}; a change in extraction between versions reads as a change in the repository`;
+}
+function changeCount(diff) {
+    return {
+        documents: diff.documents.added.length + diff.documents.removed.length + diff.documents.changed.length,
+        relations: diff.relations.added.length + diff.relations.removed.length,
+        obligations: diff.obligations.transitions.length + diff.obligations.appeared.length + diff.obligations.disappeared.length,
+    };
+}
+function plural(n, word) {
+    return `${n} ${n === 1 ? word : `${word}s`}`;
+}
+/** One sentence for the whole diff, which is what a pull-request reader sees first. */
+export function diffVerdict(diff) {
+    const count = changeCount(diff);
+    const parts = [
+        count.documents > 0 ? plural(count.documents, 'document') : null,
+        count.relations > 0 ? plural(count.relations, 'relation') : null,
+        count.obligations > 0 ? plural(count.obligations, 'obligation') : null,
+    ].filter((part) => part !== null);
+    if (parts.length === 0)
+        return 'No relational change.';
+    const listed = parts.length === 1 ? parts[0] : `${parts.slice(0, -1).join(', ')} and ${parts[parts.length - 1]}`;
+    return `${listed} changed.`;
+}
+function where(ref) {
+    return ref.place === '' ? ref.document : `${ref.document} > ${ref.place}`;
+}
+function transitionWord([from, to]) {
+    return to === 'closed' ? 'resolved' : from === 'closed' ? 'reopened' : to === 'partial' ? 'narrowed' : 'widened';
+}
+function describeChange(change) {
+    const parts = [];
+    if (change.path)
+        parts.push(`moved from ${change.path[0]} to ${change.path[1]}`);
+    if (change.phase)
+        parts.push(`${change.phase[0]} -> ${change.phase[1]}`);
+    if (change.status)
+        parts.push(`status ${change.status[0] ?? 'none'} -> ${change.status[1] ?? 'none'}`);
+    if (change.title)
+        parts.push(`retitled "${change.title[1]}"`);
+    return parts.join('; ');
+}
+/** The report for a terminal. */
+export function formatDiffText(diff) {
+    const lines = [];
+    const warning = generatorWarning(diff);
+    if (warning !== null)
+        lines.push(`warning: ${warning}`, '');
+    lines.push(diffVerdict(diff));
+    const { documents, relations, obligations } = diff;
+    if (documents.added.length + documents.removed.length + documents.changed.length > 0) {
+        lines.push('', 'Documents');
+        for (const document of documents.added)
+            lines.push(`  + ${document.id}  ${document.title} (${document.phase})`);
+        for (const document of documents.removed)
+            lines.push(`  - ${document.id}  ${document.title}`);
+        for (const change of documents.changed)
+            lines.push(`  ~ ${change.id}  ${describeChange(change)}`);
+    }
+    if (relations.added.length + relations.removed.length > 0) {
+        lines.push('', 'Relations');
+        for (const relation of relations.added)
+            lines.push(`  + ${relation.from} -${relation.kind}-> ${relation.to}`);
+        for (const relation of relations.removed)
+            lines.push(`  - ${relation.from} -${relation.kind}-> ${relation.to}`);
+    }
+    if (obligations.transitions.length + obligations.appeared.length + obligations.disappeared.length > 0) {
+        lines.push('', 'Obligations');
+        // Padded to the longest word, so the places line up.
+        const word = (text) => text.padEnd('disappeared'.length);
+        for (const transition of obligations.transitions) {
+            lines.push(`  ${word(transitionWord(transition.openness))}  ${where(transition)}: "${transition.title}" (${transition.openness[0]} -> ${transition.openness[1]})`);
+        }
+        for (const item of obligations.appeared)
+            lines.push(`  ${word('appeared')}  ${where(item)}: "${item.title}" (${item.openness})`);
+        for (const item of obligations.disappeared)
+            lines.push(`  disappeared  ${where(item)}: "${item.title}" (was ${item.openness})`);
+    }
+    return `${lines.join('\n')}\n`;
+}
+/** The report for a bot: the diff itself, with the verdict and warning beside it. */
+export function formatDiffJson(diff) {
+    return `${JSON.stringify({ version: 1, verdict: diffVerdict(diff), warning: generatorWarning(diff), ...diff }, null, 2)}\n`;
+}
+// A table cell: a pipe would end the cell, and a newline would end the row.
+function cell(value) {
+    return value.replace(/[|]/g, '&#124;').replace(/\s+/g, ' ');
+}
+/** The report for a job summary or a pull-request comment. */
+export function formatDiffMarkdown(diff) {
+    const lines = ['### spec-graph diff', '', diffVerdict(diff), ''];
+    const warning = generatorWarning(diff);
+    if (warning !== null)
+        lines.push(`> **Warning:** ${cell(warning)}.`, '');
+    const { documents, relations, obligations } = diff;
+    if (documents.added.length + documents.removed.length + documents.changed.length > 0) {
+        lines.push('| | Document | Change |', '| --- | --- | --- |');
+        for (const document of documents.added)
+            lines.push(`| added | \`${cell(document.id)}\` | ${cell(document.title)} - ${cell(document.phase)} |`);
+        for (const document of documents.removed)
+            lines.push(`| removed | \`${cell(document.id)}\` | ${cell(document.title)} |`);
+        for (const change of documents.changed)
+            lines.push(`| changed | \`${cell(change.id)}\` | ${cell(describeChange(change))} |`);
+        lines.push('');
+    }
+    if (relations.added.length + relations.removed.length > 0) {
+        lines.push('| | From | Relation | To |', '| --- | --- | --- | --- |');
+        for (const relation of relations.added)
+            lines.push(`| added | \`${cell(relation.from)}\` | ${cell(relation.kind)} | \`${cell(relation.to)}\` |`);
+        for (const relation of relations.removed)
+            lines.push(`| removed | \`${cell(relation.from)}\` | ${cell(relation.kind)} | \`${cell(relation.to)}\` |`);
+        lines.push('');
+    }
+    if (obligations.transitions.length + obligations.appeared.length + obligations.disappeared.length > 0) {
+        lines.push('| | Where | Obligation |', '| --- | --- | --- |');
+        for (const transition of obligations.transitions) {
+            lines.push(`| ${transitionWord(transition.openness)} | ${cell(where(transition))} | ${cell(transition.title)} (${transition.openness[0]} -> ${transition.openness[1]}) |`);
+        }
+        for (const item of obligations.appeared)
+            lines.push(`| appeared | ${cell(where(item))} | ${cell(item.title)} (${item.openness}) |`);
+        for (const item of obligations.disappeared)
+            lines.push(`| disappeared | ${cell(where(item))} | ${cell(item.title)} (was ${item.openness}) |`);
+        lines.push('');
+    }
+    return `${lines.join('\n').trimEnd()}\n`;
+}
+//# sourceMappingURL=diff.js.map

package/dist/diff.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"diff.js","sourceRoot":"","sources":["../src/diff.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,6EAA6E;AAC7E,MAAM,OAAO,cAAe,SAAQ,KAAK;IACvC,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,gBAAgB,CAAC;IAC/B,CAAC;CACF;AAoFD,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,SAAS,QAAQ,CAAC,KAAc;IAC9B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9E,CAAC;AAED,SAAS,IAAI,CAAC,KAAc;IAC1B,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAClD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAW,EAAE,MAAc;IAC1D,IAAI,MAAe,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,cAAc,CAAC,GAAG,MAAM,qEAAqE,CAAC,CAAC;IAC3G,CAAC;IACD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC;QAC5F,MAAM,IAAI,cAAc,CAAC,GAAG,MAAM,+EAA+E,CAAC,CAAC;IACrH,CAAC;IACD,IAAI,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,cAAc,CAAC,GAAG,MAAM,sBAAsB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,4BAA4B,CAAC,CAAC;IACzH,CAAC;IAED,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7E,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACxD,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAE9D,MAAM,SAAS,GAAuB,EAAE,CAAC;IACzC,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,IAAa,EAAE,KAAK,EAAE,EAAE;QAC/C,MAAM,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACpD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI;YAAE,MAAM,IAAI,cAAc,CAAC,GAAG,MAAM,UAAU,KAAK,YAAY,CAAC,CAAC;QACnG,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,UAAU,EAAE,CAAC;YAChC,SAAS,CAAC,IAAI,CAAC;gBACb,EAAE;gBACF,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE;gBAChC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE;gBAC9B,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,SAAS;gBACvC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aAC7B,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,MAAM,EAAE,CAAC;YACnC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAkB,EAAE,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACjI,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE;gBACF,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE;gBAChC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,EAAE;gBACtC,OAAO;gBACP,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,SAAS;gBAC7C,QAAQ,EAAE,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI;aAC1E,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,cAAc,CAAC,GAAG,MAAM,UAAU,EAAE,oCAAoC,CAAC,CAAC;QACtF,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,KAAK,GAAuB,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,IAAa,EAAE,KAAK,EAAE,EAAE;QAC7E,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACxD,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACxD,MAAM,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACpD,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI;YAAE,MAAM,IAAI,cAAc,CAAC,GAAG,MAAM,UAAU,KAAK,8BAA8B,CAAC,CAAC;QACpI,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,SAAS,EAAE,IAAI,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC9G,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,gFAAgF;AAChF,wDAAwD;AACxD,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS;IAClC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,WAAW,CAAC,MAAmB,EAAE,KAAkB;IACjE,OAAO;QACL,UAAU,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,SAAS,EAAE;QAChE,SAAS,EAAE,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC;QAC1C,SAAS,EAAE,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC;QAC1C,WAAW,EAAE,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC;KAC/C,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAmB,EAAE,KAAkB;IAC/D,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IAChF,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,QAAQ,KAAK,SAAS;YAAE,SAAS;QACrC,0EAA0E;QAC1E,kEAAkE;QAClE,MAAM,MAAM,GAAmB;YAC7B,EAAE;YACF,GAAG,CAAC,QAAQ,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,EAAE,IAAI,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAU,EAAE,CAAC;YACjF,GAAG,CAAC,QAAQ,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAU,EAAE,CAAC;YACtF,GAAG,CAAC,QAAQ,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAU,EAAE,CAAC;YACtF,GAAG,CAAC,QAAQ,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,EAAE,MAAM,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAU,EAAE,CAAC;SAC5F,CAAC;QACF,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3D,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,SAAqC,EAAE,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzG,OAAO;QACL,KAAK,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QACzE,OAAO,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3E,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;KACpD,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,WAAW,CAAC,KAAkB;IACrC,4EAA4E;IAC5E,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,GAAG,GAAG,IAAI,GAAG,EAA4B,CAAC;IAChD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;QAChD,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;QAC1C,IAAI,IAAI,KAAK,EAAE;YAAE,SAAS;QAC1B,gDAAgD;QAChD,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,KAAK,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IACzE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAmB,EAAE,KAAkB;IAC/D,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAChC,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,MAAM,GAAG,CAAC,OAAqC,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC;IACnI,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,OAAO,EAAE,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;KAC3D,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,OAAO,CAAC,CAAgB,EAAE,CAAgB;IACjD,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;IACzC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,IAAI,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;QAC7D,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAW,EAAE,KAAK,CAAC,EAAE,CAAW,CAAC,CAAC;QAC9D,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;IAChC,CAAC;IACD,OAAO,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AAChE,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,KAAkB;IACpC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACzF,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAC1G,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAmB,EAAE,KAAkB;IACjE,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,aAAa,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,KAAK,GAAmC,EAAE,CAAC;IACjD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgB,CAAC;IAEvC,8EAA8E;IAC9E,8EAA8E;IAC9E,sEAAsE;IACtE,MAAM,UAAU,GAAG,CAAC,KAA8B,EAAE,EAAE;QACpD,MAAM,GAAG,GAAG,IAAI,GAAG,EAA+B,CAAC;QACnD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI;gBAAE,SAAS;YACrC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IACF,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAChD,MAAM,aAAa,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC9C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,cAAc,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QACrE,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACpB,CAAC;IAED,8EAA8E;IAC9E,4EAA4E;IAC5E,4EAA4E;IAC5E,oCAAoC;IACpC,MAAM,KAAK,GAAG,CAAC,KAA8B,EAAE,QAAmD,EAAE,EAAE;QACpG,MAAM,GAAG,GAAG,IAAI,GAAG,EAA0B,CAAC;QAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACxE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IACF,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;IAChD,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;IAC9C,KAAK,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,EAAE,MAAM,KAAK,CAAC;YAAE,SAAS;QAC1D,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAiB,EAAE,IAAI,CAAC,CAAC,CAAiB,CAAC,CAAC;QACtE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,QAAmD,EAAE,EAAE,CAAC,CAAC,IAAkB,EAAiB,EAAE,CAAC,CAAC;QAC7G,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;QACjC,KAAK,EAAE,IAAI,CAAC,KAAK;KAClB,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC;IACpC,OAAO;QACL,WAAW,EAAE,KAAK;aACf,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,CAAC;aAC7C,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAU,EAAE,CAAC,CAAC;aAChF,IAAI,CAAC,OAAO,CAAC;QAChB,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QACrI,WAAW,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;KAC1I,CAAC;AACJ,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,gFAAgF;AAEhF,SAAS,aAAa,CAAC,SAA2B;IAChD,OAAO,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC;AAC9F,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAe;IAC9C,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC;IAC1C,IAAI,MAAM,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,MAAM,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IACrH,OAAO,4BAA4B,aAAa,CAAC,MAAM,CAAC,QAAQ,aAAa,CAAC,KAAK,CAAC,+EAA+E,CAAC;AACtK,CAAC;AAED,SAAS,WAAW,CAAC,IAAe;IAClC,OAAO;QACL,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,MAAM;QACtG,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,MAAM;QACtE,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,MAAM;KAC1H,CAAC;AACJ,CAAC;AAED,SAAS,MAAM,CAAC,CAAS,EAAE,IAAY;IACrC,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;AAC/C,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,WAAW,CAAC,IAAe;IACzC,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,KAAK,GAAG;QACZ,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI;QAChE,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI;QAChE,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI;KACvE,CAAC,MAAM,CAAC,CAAC,IAAI,EAAkB,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IAClD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,uBAAuB,CAAC;IACvD,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAE,KAAK,CAAC,CAAC,CAAY,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAW,EAAE,CAAC;IACvI,OAAO,GAAG,MAAM,WAAW,CAAC;AAC9B,CAAC;AAED,SAAS,KAAK,CAAC,GAAkB;IAC/B,OAAO,GAAG,CAAC,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,MAAM,GAAG,CAAC,KAAK,EAAE,CAAC;AAC5E,CAAC;AAED,SAAS,cAAc,CAAC,CAAC,IAAI,EAAE,EAAE,CAA4B;IAC3D,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC;AACnH,CAAC;AAED,SAAS,cAAc,CAAC,MAAsB;IAC5C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,MAAM,CAAC,IAAI;QAAE,KAAK,CAAC,IAAI,CAAC,cAAc,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACjF,IAAI,MAAM,CAAC,KAAK;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACzE,IAAI,MAAM,CAAC,MAAM;QAAE,KAAK,CAAC,IAAI,CAAC,UAAU,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC;IACvG,IAAI,MAAM,CAAC,KAAK;QAAE,KAAK,CAAC,IAAI,CAAC,aAAa,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC9D,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,iCAAiC;AACjC,MAAM,UAAU,cAAc,CAAC,IAAe;IAC5C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,OAAO,KAAK,IAAI;QAAE,KAAK,CAAC,IAAI,CAAC,YAAY,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5D,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;IAE9B,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC;IACnD,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrF,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;QAC5B,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,KAAK;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,QAAQ,CAAC,EAAE,KAAK,QAAQ,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC;QAChH,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,QAAQ,CAAC,EAAE,KAAK,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;QAC9F,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,MAAM,CAAC,EAAE,KAAK,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACpG,CAAC;IACD,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1D,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;QAC5B,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,KAAK;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,MAAM,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9G,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,MAAM,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;IAClH,CAAC;IACD,IAAI,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,WAAW,CAAC,QAAQ,CAAC,MAAM,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtG,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;QAC9B,qDAAqD;QACrD,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QACjE,KAAK,MAAM,UAAU,IAAI,WAAW,CAAC,WAAW,EAAE,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,KAAK,KAAK,CAAC,UAAU,CAAC,MAAM,UAAU,CAAC,KAAK,MAAM,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACrK,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,UAAU,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QACjI,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,WAAW;YAAE,KAAK,CAAC,IAAI,CAAC,kBAAkB,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,KAAK,UAAU,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IAClI,CAAC;IACD,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AACjC,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,cAAc,CAAC,IAAe;IAC5C,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,gBAAgB,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC;AAC9H,CAAC;AAED,4EAA4E;AAC5E,SAAS,IAAI,CAAC,KAAa;IACzB,OAAO,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC9D,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,kBAAkB,CAAC,IAAe;IAChD,MAAM,KAAK,GAAa,CAAC,qBAAqB,EAAE,EAAE,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;IAC3E,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,OAAO,KAAK,IAAI;QAAE,KAAK,CAAC,IAAI,CAAC,kBAAkB,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAEzE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC;IACnD,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrF,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,qBAAqB,CAAC,CAAC;QAC7D,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,KAAK;YAAE,KAAK,CAAC,IAAI,CAAC,eAAe,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/I,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,iBAAiB,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACzH,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,iBAAiB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,QAAQ,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;QAC7H,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IACD,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1D,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,2BAA2B,CAAC,CAAC;QACtE,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,KAAK;YAAE,KAAK,CAAC,IAAI,CAAC,eAAe,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;QACjJ,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,iBAAiB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;QACrJ,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IACD,IAAI,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,WAAW,CAAC,QAAQ,CAAC,MAAM,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtG,KAAK,CAAC,IAAI,CAAC,0BAA0B,EAAE,qBAAqB,CAAC,CAAC;QAC9D,KAAK,MAAM,UAAU,IAAI,WAAW,CAAC,WAAW,EAAE,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC,KAAK,cAAc,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7K,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC;QACpI,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,WAAW;YAAE,KAAK,CAAC,IAAI,CAAC,mBAAmB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC;QAC9I,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC;AAC3C,CAAC","sourcesContent":["/**\n * What changed between two states of the graph, read from two JSON exports.\n *\n * Two files in, one report out, and no git underneath: CI already has both\n * checkouts, and the pipeline stays a pure function of text. See ADR-0020.\n *\n * The rule the whole module follows is that a change is reported only against a\n * name that means the same thing in both exports. A document's id does. An\n * item's numbered id does not - it is an ordinal within a section, so one\n * inserted question renumbers every question after it - and keying on it\n * reports a question as reopened when nobody touched it. So an obligation is\n * paired only by a declared id, or by its document, section and title when\n * nothing else shares them; anything unpaired is said to have appeared or\n * disappeared, and never to have changed.\n */\n\n/** Refused input: not JSON, not an export, or a version this cannot read. */\nexport class DiffInputError extends Error {\n constructor(message: string) {\n super(message);\n this.name = 'DiffInputError';\n }\n}\n\nexport interface Generator {\n readonly name: string;\n readonly version: string;\n}\n\nexport interface ExportedDocument {\n readonly id: string;\n readonly title: string;\n readonly path: string;\n readonly phase: string;\n readonly status: string | null;\n}\n\nexport interface ExportedItem {\n readonly id: string;\n readonly title: string;\n readonly document: string;\n readonly section: readonly string[];\n readonly openness: string;\n /** `null` when the export predates the flag, so its ids cannot be trusted. */\n readonly declared: boolean | null;\n}\n\nexport interface ExportedRelation {\n readonly kind: string;\n readonly from: string;\n readonly to: string;\n}\n\n/** One side of a diff: a `--graph-format json` export, read and checked. */\nexport interface GraphExport {\n readonly generator: Generator | null;\n readonly documents: readonly ExportedDocument[];\n readonly items: readonly ExportedItem[];\n readonly edges: readonly ExportedRelation[];\n}\n\nexport interface DocumentChange {\n readonly id: string;\n readonly path?: readonly [string, string] | undefined;\n readonly title?: readonly [string, string] | undefined;\n readonly phase?: readonly [string, string] | undefined;\n readonly status?: readonly [string | null, string | null] | undefined;\n}\n\nexport interface ObligationRef {\n readonly document: string;\n readonly section: readonly string[];\n /**\n * The section path as a reader wants it: without the document's own title\n * heading, which every item under it shares and the id already names. Items\n * are matched on the same headings, kept as a list so that no heading holding\n * \" > \" can pass for two.\n */\n readonly place: string;\n readonly title: string;\n}\n\n/** An item with no pair: its state on the one side it exists on, and no more. */\nexport interface UnpairedObligation extends ObligationRef {\n readonly openness: string;\n}\n\nexport interface Transition extends ObligationRef {\n readonly openness: readonly [string, string];\n}\n\nexport interface GraphDiff {\n readonly generators: { readonly before: Generator | null; readonly after: Generator | null };\n readonly documents: {\n readonly added: readonly ExportedDocument[];\n readonly removed: readonly ExportedDocument[];\n readonly changed: readonly DocumentChange[];\n };\n readonly relations: { readonly added: readonly ExportedRelation[]; readonly removed: readonly ExportedRelation[] };\n readonly obligations: {\n readonly transitions: readonly Transition[];\n readonly appeared: readonly UnpairedObligation[];\n readonly disappeared: readonly UnpairedObligation[];\n };\n}\n\n/* -------------------------------------------------------------------------- */\n/* Reading an export */\n/* -------------------------------------------------------------------------- */\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n return typeof value === 'object' && value !== null && !Array.isArray(value);\n}\n\nfunction text(value: unknown): string | null {\n return typeof value === 'string' ? value : null;\n}\n\n/**\n * Reads one export.\n *\n * Checked as far as the comparison reads it and no further: a field this does\n * not use is not a reason to refuse a file, and a later export that adds fields\n * is still version 1.\n */\nexport function parseGraphExport(raw: string, source: string): GraphExport {\n let parsed: unknown;\n try {\n parsed = JSON.parse(raw);\n } catch {\n throw new DiffInputError(`${source} is not JSON; make it with \\`spec-graph graph --graph-format json\\``);\n }\n if (!isRecord(parsed) || !Array.isArray(parsed['nodes']) || !Array.isArray(parsed['edges'])) {\n throw new DiffInputError(`${source} is not a graph export; make it with \\`spec-graph graph --graph-format json\\``);\n }\n if (parsed['version'] !== 1) {\n throw new DiffInputError(`${source} is export version ${JSON.stringify(parsed['version'])}, and this reads version 1`);\n }\n\n const generator = isRecord(parsed['generator']) ? parsed['generator'] : null;\n const name = generator ? text(generator['name']) : null;\n const version = generator ? text(generator['version']) : null;\n\n const documents: ExportedDocument[] = [];\n const items: ExportedItem[] = [];\n parsed['nodes'].forEach((node: unknown, index) => {\n const id = isRecord(node) ? text(node['id']) : null;\n if (!isRecord(node) || id === null) throw new DiffInputError(`${source}: node ${index} has no id`);\n if (node['kind'] === 'document') {\n documents.push({\n id,\n title: text(node['title']) ?? '',\n path: text(node['path']) ?? '',\n phase: text(node['phase']) ?? 'unknown',\n status: text(node['status']),\n });\n } else if (node['kind'] === 'item') {\n const section = Array.isArray(node['section']) ? node['section'].filter((part): part is string => typeof part === 'string') : [];\n items.push({\n id,\n title: text(node['title']) ?? '',\n document: text(node['document']) ?? '',\n section,\n openness: text(node['openness']) ?? 'unknown',\n declared: typeof node['declared'] === 'boolean' ? node['declared'] : null,\n });\n } else {\n throw new DiffInputError(`${source}: node ${id} is neither a document nor an item`);\n }\n });\n\n const edges: ExportedRelation[] = parsed['edges'].map((edge: unknown, index) => {\n const kind = isRecord(edge) ? text(edge['kind']) : null;\n const from = isRecord(edge) ? text(edge['from']) : null;\n const to = isRecord(edge) ? text(edge['to']) : null;\n if (kind === null || from === null || to === null) throw new DiffInputError(`${source}: edge ${index} is missing its kind or ends`);\n return { kind, from, to };\n });\n\n return { generator: name !== null && version !== null ? { name, version } : null, documents, items, edges };\n}\n\n/* -------------------------------------------------------------------------- */\n/* Comparing */\n/* -------------------------------------------------------------------------- */\n\n// Code-unit order, not locale order: the same input sorts the same way on every\n// machine, which is what keeps a report byte-identical.\nfunction byText(a: string, b: string): number {\n return a < b ? -1 : a > b ? 1 : 0;\n}\n\n/** Compares two exports. Pure, and deterministic in everything it returns. */\nexport function diffExports(before: GraphExport, after: GraphExport): GraphDiff {\n return {\n generators: { before: before.generator, after: after.generator },\n documents: compareDocuments(before, after),\n relations: compareRelations(before, after),\n obligations: compareObligations(before, after),\n };\n}\n\nfunction compareDocuments(before: GraphExport, after: GraphExport): GraphDiff['documents'] {\n const was = new Map(before.documents.map((document) => [document.id, document]));\n const now = new Map(after.documents.map((document) => [document.id, document]));\n const changed: DocumentChange[] = [];\n for (const [id, next] of now) {\n const previous = was.get(id);\n if (previous === undefined) continue;\n // The id is the decision's name, so the same id at a new path is the same\n // decision moved, never one removed and another added (ADR-0009).\n const change: DocumentChange = {\n id,\n ...(previous.path !== next.path && { path: [previous.path, next.path] as const }),\n ...(previous.title !== next.title && { title: [previous.title, next.title] as const }),\n ...(previous.phase !== next.phase && { phase: [previous.phase, next.phase] as const }),\n ...(previous.status !== next.status && { status: [previous.status, next.status] as const }),\n };\n if (Object.keys(change).length > 1) changed.push(change);\n }\n const ids = (documents: Iterable<ExportedDocument>) => [...documents].sort((a, b) => byText(a.id, b.id));\n return {\n added: ids([...now.values()].filter((document) => !was.has(document.id))),\n removed: ids([...was.values()].filter((document) => !now.has(document.id))),\n changed: changed.sort((a, b) => byText(a.id, b.id)),\n };\n}\n\n/**\n * The relations between documents, projected the way `--documents-only`\n * projects a graph: an item's edges lifted onto its document, and a relation\n * that ends where it began dropped - which is also what becomes of a document\n * containing its own items, so containment survives only between documents.\n * Where a relation was declared is not part of it - moving a supersession from\n * a sentence into front matter changes nothing a reader relies on.\n */\nfunction relationsOf(graph: GraphExport): Map<string, ExportedRelation> {\n // A document, or a target nothing in the export defines, stands for itself.\n const owners = new Map(graph.items.map((item) => [item.id, item.document]));\n const out = new Map<string, ExportedRelation>();\n for (const edge of graph.edges) {\n const from = owners.get(edge.from) ?? edge.from;\n const to = owners.get(edge.to) ?? edge.to;\n if (from === to) continue;\n // Tab-joined: kinds and ids cannot contain one.\n out.set(`${edge.kind}\\t${from}\\t${to}`, { kind: edge.kind, from, to });\n }\n return out;\n}\n\nfunction compareRelations(before: GraphExport, after: GraphExport): GraphDiff['relations'] {\n const was = relationsOf(before);\n const now = relationsOf(after);\n const sorted = (entries: [string, ExportedRelation][]) => entries.sort(([a], [b]) => byText(a, b)).map(([, relation]) => relation);\n return {\n added: sorted([...now].filter(([key]) => !was.has(key))),\n removed: sorted([...was].filter(([key]) => !now.has(key))),\n };\n}\n\n/**\n * Obligations by where they sit and then by title, heading by heading, so a\n * section's own questions come before those of the sections under it.\n */\nfunction byPlace(a: ObligationRef, b: ObligationRef): number {\n const left = [a.document, ...a.section];\n const right = [b.document, ...b.section];\n for (let at = 0; at < left.length && at < right.length; at++) {\n const order = byText(left[at] as string, right[at] as string);\n if (order !== 0) return order;\n }\n return left.length - right.length || byText(a.title, b.title);\n}\n\n/**\n * The headings an item sits under, below its document's own. A section path\n * starts at the document's heading, which is its title, so without this a\n * retitled document would lose track of every question in it.\n */\nfunction headingsIn(graph: GraphExport): (item: ExportedItem) => readonly string[] {\n const titles = new Map(graph.documents.map((document) => [document.id, document.title]));\n return (item) => (item.section[0] === titles.get(item.document) ? item.section.slice(1) : item.section);\n}\n\nfunction compareObligations(before: GraphExport, after: GraphExport): GraphDiff['obligations'] {\n const headingsBefore = headingsIn(before);\n const headingsAfter = headingsIn(after);\n const pairs: [ExportedItem, ExportedItem][] = [];\n const paired = new Set<ExportedItem>();\n\n // A declared id names the same item in both states however it was reworded or\n // moved - provided it names one item on each side. An export without the flag\n // cannot say which ids were declared, so none of its ids are trusted.\n const declaredIn = (items: readonly ExportedItem[]) => {\n const out = new Map<string, ExportedItem | null>();\n for (const item of items) {\n if (item.declared !== true) continue;\n out.set(item.id, out.has(item.id) ? null : item);\n }\n return out;\n };\n const declaredBefore = declaredIn(before.items);\n const declaredAfter = declaredIn(after.items);\n for (const [id, item] of declaredBefore) {\n const match = declaredAfter.get(id);\n if (item === null || match === null || match === undefined) continue;\n pairs.push([item, match]);\n paired.add(item);\n paired.add(match);\n }\n\n // Otherwise the same document, headings and title, and only when nothing else\n // on either side shares them: two identical titles in one section cannot be\n // told apart, so neither is paired. Joined as JSON so that no two different\n // triples can produce the same key.\n const group = (items: readonly ExportedItem[], headings: (item: ExportedItem) => readonly string[]) => {\n const out = new Map<string, ExportedItem[]>();\n for (const item of items) {\n if (paired.has(item)) continue;\n const key = JSON.stringify([item.document, headings(item), item.title]);\n out.set(key, [...(out.get(key) ?? []), item]);\n }\n return out;\n };\n const was = group(before.items, headingsBefore);\n const now = group(after.items, headingsAfter);\n for (const [key, previous] of was) {\n const next = now.get(key);\n if (previous.length !== 1 || next?.length !== 1) continue;\n const [a, b] = [previous[0] as ExportedItem, next[0] as ExportedItem];\n pairs.push([a, b]);\n paired.add(a);\n paired.add(b);\n }\n\n const refIn = (headings: (item: ExportedItem) => readonly string[]) => (item: ExportedItem): ObligationRef => ({\n document: item.document,\n section: item.section,\n place: headings(item).join(' > '),\n title: item.title,\n });\n const wasRef = refIn(headingsBefore);\n const nowRef = refIn(headingsAfter);\n return {\n transitions: pairs\n .filter(([a, b]) => a.openness !== b.openness)\n .map(([a, b]) => ({ ...nowRef(b), openness: [a.openness, b.openness] as const }))\n .sort(byPlace),\n appeared: after.items.filter((item) => !paired.has(item)).map((item) => ({ ...nowRef(item), openness: item.openness })).sort(byPlace),\n disappeared: before.items.filter((item) => !paired.has(item)).map((item) => ({ ...wasRef(item), openness: item.openness })).sort(byPlace),\n };\n}\n\n/* -------------------------------------------------------------------------- */\n/* Reporting */\n/* -------------------------------------------------------------------------- */\n\nfunction generatorName(generator: Generator | null): string {\n return generator === null ? 'an unknown version' : `${generator.name} ${generator.version}`;\n}\n\n/**\n * The warning a diff carries when its two exports may disagree for a reason\n * that is not the repository. `null` when both name the same generator.\n */\nexport function generatorWarning(diff: GraphDiff): string | null {\n const { before, after } = diff.generators;\n if (before !== null && after !== null && before.name === after.name && before.version === after.version) return null;\n return `the exports were made by ${generatorName(before)} and ${generatorName(after)}; a change in extraction between versions reads as a change in the repository`;\n}\n\nfunction changeCount(diff: GraphDiff): { documents: number; relations: number; obligations: number } {\n return {\n documents: diff.documents.added.length + diff.documents.removed.length + diff.documents.changed.length,\n relations: diff.relations.added.length + diff.relations.removed.length,\n obligations: diff.obligations.transitions.length + diff.obligations.appeared.length + diff.obligations.disappeared.length,\n };\n}\n\nfunction plural(n: number, word: string): string {\n return `${n} ${n === 1 ? word : `${word}s`}`;\n}\n\n/** One sentence for the whole diff, which is what a pull-request reader sees first. */\nexport function diffVerdict(diff: GraphDiff): string {\n const count = changeCount(diff);\n const parts = [\n count.documents > 0 ? plural(count.documents, 'document') : null,\n count.relations > 0 ? plural(count.relations, 'relation') : null,\n count.obligations > 0 ? plural(count.obligations, 'obligation') : null,\n ].filter((part): part is string => part !== null);\n if (parts.length === 0) return 'No relational change.';\n const listed = parts.length === 1 ? (parts[0] as string) : `${parts.slice(0, -1).join(', ')} and ${parts[parts.length - 1] as string}`;\n return `${listed} changed.`;\n}\n\nfunction where(ref: ObligationRef): string {\n return ref.place === '' ? ref.document : `${ref.document} > ${ref.place}`;\n}\n\nfunction transitionWord([from, to]: readonly [string, string]): string {\n return to === 'closed' ? 'resolved' : from === 'closed' ? 'reopened' : to === 'partial' ? 'narrowed' : 'widened';\n}\n\nfunction describeChange(change: DocumentChange): string {\n const parts: string[] = [];\n if (change.path) parts.push(`moved from ${change.path[0]} to ${change.path[1]}`);\n if (change.phase) parts.push(`${change.phase[0]} -> ${change.phase[1]}`);\n if (change.status) parts.push(`status ${change.status[0] ?? 'none'} -> ${change.status[1] ?? 'none'}`);\n if (change.title) parts.push(`retitled \"${change.title[1]}\"`);\n return parts.join('; ');\n}\n\n/** The report for a terminal. */\nexport function formatDiffText(diff: GraphDiff): string {\n const lines: string[] = [];\n const warning = generatorWarning(diff);\n if (warning !== null) lines.push(`warning: ${warning}`, '');\n lines.push(diffVerdict(diff));\n\n const { documents, relations, obligations } = diff;\n if (documents.added.length + documents.removed.length + documents.changed.length > 0) {\n lines.push('', 'Documents');\n for (const document of documents.added) lines.push(` + ${document.id} ${document.title} (${document.phase})`);\n for (const document of documents.removed) lines.push(` - ${document.id} ${document.title}`);\n for (const change of documents.changed) lines.push(` ~ ${change.id} ${describeChange(change)}`);\n }\n if (relations.added.length + relations.removed.length > 0) {\n lines.push('', 'Relations');\n for (const relation of relations.added) lines.push(` + ${relation.from} -${relation.kind}-> ${relation.to}`);\n for (const relation of relations.removed) lines.push(` - ${relation.from} -${relation.kind}-> ${relation.to}`);\n }\n if (obligations.transitions.length + obligations.appeared.length + obligations.disappeared.length > 0) {\n lines.push('', 'Obligations');\n // Padded to the longest word, so the places line up.\n const word = (text: string) => text.padEnd('disappeared'.length);\n for (const transition of obligations.transitions) {\n lines.push(` ${word(transitionWord(transition.openness))} ${where(transition)}: \"${transition.title}\" (${transition.openness[0]} -> ${transition.openness[1]})`);\n }\n for (const item of obligations.appeared) lines.push(` ${word('appeared')} ${where(item)}: \"${item.title}\" (${item.openness})`);\n for (const item of obligations.disappeared) lines.push(` disappeared ${where(item)}: \"${item.title}\" (was ${item.openness})`);\n }\n return `${lines.join('\\n')}\\n`;\n}\n\n/** The report for a bot: the diff itself, with the verdict and warning beside it. */\nexport function formatDiffJson(diff: GraphDiff): string {\n return `${JSON.stringify({ version: 1, verdict: diffVerdict(diff), warning: generatorWarning(diff), ...diff }, null, 2)}\\n`;\n}\n\n// A table cell: a pipe would end the cell, and a newline would end the row.\nfunction cell(value: string): string {\n return value.replace(/[|]/g, '|').replace(/\\s+/g, ' ');\n}\n\n/** The report for a job summary or a pull-request comment. */\nexport function formatDiffMarkdown(diff: GraphDiff): string {\n const lines: string[] = ['### spec-graph diff', '', diffVerdict(diff), ''];\n const warning = generatorWarning(diff);\n if (warning !== null) lines.push(`> **Warning:** ${cell(warning)}.`, '');\n\n const { documents, relations, obligations } = diff;\n if (documents.added.length + documents.removed.length + documents.changed.length > 0) {\n lines.push('| | Document | Change |', '| --- | --- | --- |');\n for (const document of documents.added) lines.push(`| added | \\`${cell(document.id)}\\` | ${cell(document.title)} - ${cell(document.phase)} |`);\n for (const document of documents.removed) lines.push(`| removed | \\`${cell(document.id)}\\` | ${cell(document.title)} |`);\n for (const change of documents.changed) lines.push(`| changed | \\`${cell(change.id)}\\` | ${cell(describeChange(change))} |`);\n lines.push('');\n }\n if (relations.added.length + relations.removed.length > 0) {\n lines.push('| | From | Relation | To |', '| --- | --- | --- | --- |');\n for (const relation of relations.added) lines.push(`| added | \\`${cell(relation.from)}\\` | ${cell(relation.kind)} | \\`${cell(relation.to)}\\` |`);\n for (const relation of relations.removed) lines.push(`| removed | \\`${cell(relation.from)}\\` | ${cell(relation.kind)} | \\`${cell(relation.to)}\\` |`);\n lines.push('');\n }\n if (obligations.transitions.length + obligations.appeared.length + obligations.disappeared.length > 0) {\n lines.push('| | Where | Obligation |', '| --- | --- | --- |');\n for (const transition of obligations.transitions) {\n lines.push(`| ${transitionWord(transition.openness)} | ${cell(where(transition))} | ${cell(transition.title)} (${transition.openness[0]} -> ${transition.openness[1]}) |`);\n }\n for (const item of obligations.appeared) lines.push(`| appeared | ${cell(where(item))} | ${cell(item.title)} (${item.openness}) |`);\n for (const item of obligations.disappeared) lines.push(`| disappeared | ${cell(where(item))} | ${cell(item.title)} (was ${item.openness}) |`);\n lines.push('');\n }\n return `${lines.join('\\n').trimEnd()}\\n`;\n}\n"]}

package/dist/directives.d.ts CHANGED Viewed

@@ -17,7 +17,7 @@
  * A directive always wins over anything inferred, and says so in the report, so
  * an override is visible rather than mysterious.
  */
-import type { HtmlComment } from './markdown.js';
+import type { HtmlComment, ListItem, ScannedDocument } from './markdown.js';
 export type DirectiveName = 'spec-node' | 'spec-item' | 'spec-edge' | 'spec-ignore' | 'spec-history';
 export interface Attribute {
     readonly value: string;
@@ -47,6 +47,9 @@ export declare function attrList(directive: Directive, name: string): string[];
  * A `@spec-item` directive may sit on the line above the item, on the same
  * line, or inside the item body. All three read naturally in the source, so all
  * three are accepted, with the closest preceding directive winning.
+ *
+ * It answers for one region with no view of the others, so a directive in reach
+ * of two items is found for both. Extraction uses `bindItemDirectives`.
  */
 export declare function directiveFor(directives: readonly Directive[], name: DirectiveName, region: {
     start: number;
@@ -54,3 +57,17 @@ export declare function directiveFor(directives: readonly Directive[], name: Dir
 },
 /** How far above the region a directive may sit and still apply. */
 lookBehind: number): Directive | null;
+/**
+ * Pairs each `@spec-item` directive with the one list item it annotates.
+ *
+ * A directive is written for one item, so it binds to one: the item directly
+ * below it, with nothing but blank lines and other comments between, or else
+ * the item it is written in, the innermost where items nest. An item that
+ * several bind to takes the last one written.
+ *
+ * A directive alone on its line is in an item only when indented further than
+ * that item's marker, which is how CommonMark reads it. Indented under an item,
+ * it annotates that item and not the sibling below; flush between two items, it
+ * annotates the second.
+ */
+export declare function bindItemDirectives(scanned: ScannedDocument, directives: readonly Directive[]): Map<ListItem, Directive>;

package/dist/directives.js CHANGED Viewed

@@ -105,6 +105,9 @@ export function attrList(directive, name) {
  * A `@spec-item` directive may sit on the line above the item, on the same
  * line, or inside the item body. All three read naturally in the source, so all
  * three are accepted, with the closest preceding directive winning.
+ *
+ * It answers for one region with no view of the others, so a directive in reach
+ * of two items is found for both. Extraction uses `bindItemDirectives`.
  */
 export function directiveFor(directives, name, region,
 /** How far above the region a directive may sit and still apply. */
@@ -122,4 +125,80 @@ lookBehind) {
     }
     return best;
 }
+/**
+ * Pairs each `@spec-item` directive with the one list item it annotates.
+ *
+ * A directive is written for one item, so it binds to one: the item directly
+ * below it, with nothing but blank lines and other comments between, or else
+ * the item it is written in, the innermost where items nest. An item that
+ * several bind to takes the last one written.
+ *
+ * A directive alone on its line is in an item only when indented further than
+ * that item's marker, which is how CommonMark reads it. Indented under an item,
+ * it annotates that item and not the sibling below; flush between two items, it
+ * annotates the second.
+ */
+export function bindItemDirectives(scanned, directives) {
+    const bound = new Map();
+    const wanted = directives.filter((directive) => directive.name === 'spec-item');
+    // Most documents carry none. Sparing them the pass over their lines changes
+    // how long this takes and nothing else.
+    if (wanted.length === 0)
+        return bound;
+    const { lines, listItems, masked } = scanned;
+    // The indentation of each line holding nothing but whitespace and comments.
+    // Code is masked too, so a fence has to be told apart by its flag.
+    const quiet = new Map();
+    // For every other line, where the run of quiet lines directly above it began,
+    // when there was one.
+    const quietFrom = new Map();
+    let run;
+    for (const line of lines) {
+        if (!line.code && masked.slice(line.contentStart, line.end).trim() === '') {
+            quiet.set(line.line, line.indent);
+            run ??= line.start;
+            continue;
+        }
+        quietFrom.set(line.line, run);
+        run = undefined;
+    }
+    // The items whose text the cursor is in, outermost first. Items nest, so one
+    // that has ended is always on top. An item ends at the end of a line, the next
+    // thing starts on a later one, and no two things start together, so `<` and
+    // `<=` read alike in every comparison of offsets below.
+    const open = [];
+    const close = (offset) => {
+        while (open.length > 0 && open[open.length - 1].end <= offset)
+            open.pop();
+    };
+    let next = 0;
+    for (const directive of wanted) {
+        while (next < listItems.length && listItems[next].start < directive.start) {
+            const item = listItems[next];
+            close(item.start);
+            open.push(item);
+            next += 1;
+        }
+        close(directive.start);
+        // Sharing its line with text, a directive is in whatever that text is in.
+        const indent = quiet.get(directive.line) ?? Infinity;
+        // No deeper than the scanner already went to find where these items end.
+        let depth = open.length - 1;
+        while (depth >= 0 && open[depth].indent >= indent)
+            depth -= 1;
+        const holder = open[depth];
+        const below = listItems[next];
+        const directlyAbove = below !== undefined && (quietFrom.get(below.line) ?? Infinity) <= directive.start;
+        if (directlyAbove && (holder === undefined || below.start < holder.end)) {
+            bound.set(below, directive);
+            continue;
+        }
+        // Flush under an item and above no other, it continues the item as any
+        // unindented line does.
+        const written = holder ?? open[open.length - 1];
+        if (written !== undefined)
+            bound.set(written, directive);
+    }
+    return bound;
+}
 //# sourceMappingURL=directives.js.map