@coldtea/pr-lens-schema 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Ohans Emmanuel
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,150 @@
+# @coldtea/pr-lens-schema
+
+The PR Lens contract. Extraction produces these documents, the renderer consumes them, and every other surface — CLI, GitHub Action, agent skill, hosted app — passes them around. If a document validates here, it is safe to render.
+
+MIT © Ohans Emmanuel.
+
+```bash
+pnpm add @coldtea/pr-lens-schema
+```
+
+```ts
+import { parseGraphDoc, safeParseGraphDoc } from "@coldtea/pr-lens-schema";
+
+const graph = parseGraphDoc(json);          // throws PrLensSchemaError
+const result = safeParseGraphDoc(json);     // { ok: true, value } | { ok: false, error }
+```
+
+## The four documents
+
+| Document | Purpose | Parser |
+| --- | --- | --- |
+| `GraphDoc` | Lanes, nodes, edges, flows, stats and the drill-down tree for one pull request — or for a stored baseline map | `parseGraphDoc` |
+| `PatchDoc` | Ordered operations that move a stored graph forward as pull requests merge | `parsePatchDoc` |
+| `Config` | What a repository commits as `.github/pr-lens.yml` | `parseConfig` |
+| `RenderManifest` | The SVGs a render produced, and where they live | `parseRenderManifest` |
+
+Every document carries a `schemaVersion`, config included: a repository's corrections have to keep their meaning as the contract moves.
+
+## Views and the render they imply
+
+A render is one asset per view per theme, so the size of a drill-down tree and the size of a render manifest are one rule, not two numbers:
+
+```ts
+MAX_VIEWS * THEMES.length === MAX_RENDER_ASSETS; // 128 * 2 === 256
+```
+
+Each array in the view tree is capped, but its depth is not, so the total is bounded by `graphIntegrityIssues`: a document carrying more views than a manifest could describe is rejected here rather than at the renderer, which would otherwise be left holding a document it was told was fine. Import `MAX_VIEWS`, `MAX_RENDER_ASSETS` and `THEMES` rather than restating any of them — raise the budget or add a theme and the other end moves with it.
+
+The cap is the worst case, every theme rendered, not what a particular render would emit. A single-theme render could describe twice as many views, but then whether a document is renderable would depend on how it was asked to be rendered — and **if it parses, it renders** is the promise this package exists to make.
+
+## Two lenses
+
+`architecture` shows blast radius against the existing system. `data-flow` animates an ordered pipeline. There is deliberately no security lens and no findings field: PR Lens is the comprehension layer, and a document that carries findings is rejected rather than quietly stripped. The `Lens` enum is additive — a future contract version may add lenses, so treat one you do not recognise as a view to skip, not as a failure.
+
+## Deltas
+
+Every node, edge and flow step declares how it relates to the base commit: `added`, `modified`, `removed` or `unchanged`. `unchanged` elements are the context a reviewer needs to judge blast radius, so they belong in the document rather than being filtered out.
+
+## What validation covers
+
+Parsing runs three things in one pass, and reports every problem it finds rather than only the first:
+
+1. **Structure** — types, lengths, enums, no unknown keys, and file paths that can actually become a diff permalink (repository-relative, POSIX, no `..` segment).
+2. **Contract version** — below `1.0.0` an exact `major.minor` match; from `1.0.0` on, the same major and a minor no newer than this package's.
+3. **Referential integrity** — every node sits in a declared lane, every edge joins declared nodes, every flow step runs between declared participants, every drill-down view and layout hint names elements that exist, and a document carrying flows declares the `data-flow` lens.
+4. **That a render could describe the document** — see below.
+
+A document nested deeper than the stack can walk is reported as a document too deep to read, not thrown: `safeParse*` returns a result whatever it is handed.
+
+Failures arrive as a `PrLensSchemaError` with a machine-readable `code` (`INVALID_DOCUMENT`, `BROKEN_REFERENCE`, `DUPLICATE_ID`, `UNSUPPORTED_SCHEMA_VERSION`, `PATCH_CONFLICT`, `NOT_A_SNAPSHOT`) and an `issues` array carrying a path and message each.
+
+## Evolving a stored graph
+
+`applyPatchDoc(graph, patch)` is the executable definition of the patch operations:
+
+```ts
+import { applyPatchDoc, parseGraphDoc, parsePatchDoc } from "@coldtea/pr-lens-schema";
+
+const result = applyPatchDoc(parseGraphDoc(baseline), parsePatchDoc(patch));
+```
+
+- A patch names the map it targets and the commits it carries it between — `graphId`, `fromSha` and `toSha` are all required, they are full 40-character commit names, and they must differ. Abbreviations are fine for something a human reads but not for deciding whether two records mean the same commit, and a patch that does not move the map is a patch that can be replayed.
+- The target is checked before anything is applied: a patch aimed at another map, or written against a commit the map has already moved past, is a `PATCH_CONFLICT` rather than a merge.
+- A stored map is a snapshot rather than a diff: it has an id, it records the single commit it reflects in full on both `base` and `head`, and nothing in it is annotated as a change. `graphSnapshotIssues` is that rule, exported for anything that stores a map, and `applyPatchDoc` runs it on the way in and on the way out — so a patch can neither leave an annotation behind nor launder a map that already carries one. Failures are `NOT_A_SNAPSHOT` and name the offender, down to the step of a flow.
+- The target rules are re-checked inside `applyPatchDoc` rather than trusted from parsing, because a zod refinement does not survive into the inferred type: a `PatchDoc` a caller assembled itself is held to the same rules as one that came from `parsePatchDoc`.
+- Operations apply in array order, and the first conflict stops the batch — a later operation was written against the state an earlier one was supposed to produce.
+- `add_*` refuses an id that is taken; `update_*` and `remove_*` refuse an id that is absent; `update_*` writes only the fields it names.
+- Removing a node takes its edges and flow steps with it, and drops a flow left with fewer than two participants or no steps. Removed ids are pruned out of the drill-down tree and the layout hints, and a view whose selection loses its last element is dropped rather than widened.
+- Removing a lane that still holds nodes is a conflict, not a cascade: move its nodes first.
+- `remove_*` deletes an element from the stored graph. That is a different statement from `delta: "removed"`, which says an element still exists but is being deleted by the change under review.
+- A successful result is always a document that would pass `parseGraphDoc`: the candidate is validated as a whole before it is returned.
+
+The input document is never mutated. `applyPatch(graph, ops)` is the same thing without the target check, for callers that already know which document they hold.
+
+A stored map describes a system rather than a change, so everything in it is `unchanged` and its `base` equals its `head`; the deltas belong to pull-request documents.
+
+## Repository config
+
+```yaml
+# .github/pr-lens.yml
+schemaVersion: 0.1.0
+lenses: [architecture, data-flow]
+branding: true
+map:
+  rename:
+    - match: functions/src/broadcast/sendBroadcastBulk.ts
+      to: Broadcast sender
+  exclude:
+    - "**/*.test.ts"
+  lane:
+    - match: packages/broadcast-lib/**
+      lane: functions
+  group:
+    - match: id:build-bulk-payload
+      group: broadcast-lib
+```
+
+A `match` beginning with `id:` addresses one node exactly; anything else is a path glob matched against a node's file paths, so a correction survives the model renaming the node between runs. Corrections are an overlay applied over fresh inference on every run — inference never writes back into this file.
+
+## JSON Schema
+
+`json-schema/*.json` (draft 2020-12) is generated from the zod schemas and published with the package, for producers that do not run TypeScript and for editors validating `.github/pr-lens.yml`:
+
+```jsonc
+{ "$ref": "node_modules/@coldtea/pr-lens-schema/json-schema/graph-doc.schema.json" }
+```
+
+They describe **what an author may write**: a field with a default is one you may leave out. Rules are carried across wherever JSON Schema can state them — the supported contract versions, the repository-relative path rule, `endLine` requiring `startLine`, an asset needing a `url` or a `path`, a `selection` view having to select something.
+
+Exactly five rules cannot be stated in JSON Schema and stay the parser's job, each of them a comparison the shape alone cannot make:
+
+1. referential integrity between elements,
+2. a line range that ends before it starts,
+3. the agreement between a self message's endpoints,
+4. a patch whose two commits are the same,
+5. more views than a render manifest could describe.
+
+The tests run a table of documents through both representations and assert the same verdict, accept and reject alike — including a case per divergence above, so they stay deliberate and cannot quietly grow a fifth.
+
+## Goldens
+
+`examples/` holds the reference documents, also importable pre-parsed:
+
+```ts
+import { postmarkRefactorGraph } from "@coldtea/pr-lens-schema/examples";
+```
+
+They tell one story — a real refactor that moved broadcast sending from one Postmark request per recipient to batches of 500:
+
+- **`postmark-refactor.graph.json`** is the canonical document: the pull request itself, across three lanes, exercising all four delta states, a hero edge, a seven-step data flow with returns and a repeated batch step, and a nested drill-down tree. Downstream renderer goldens are measured against it.
+- **`broadcast-baseline.graph.json`** is the stored map of that subsystem as `main` stood before the change, and **`broadcast-baseline.patch.json`** carries it to the merged state — the transition `applyPatchDoc` performs.
+- **`postmark-refactor.render-manifest.json`** is what rendering the pull-request document produces, **`pr-lens.config.json`** a repository's corrections, and **`minimal.graph.json`** the smallest document that validates.
+
+## Versioning
+
+`SCHEMA_VERSION` is the contract version, and it is not the package version's twin by accident — they move together. While the contract is below `1.0.0`, a minor bump may break: parsers accept only their exact `major.minor`. From `1.0.0` on, minor releases only add optional fields or widen an enum, and a parser accepts any minor at or below its own.
+
+---
+
+Part of [PR Lens](https://prlens.dev) — review what actually matters.

package/dist/apply.d.ts

@@ -0,0 +1,42 @@
+import { type Parsed } from "./errors.js";
+import type { GraphDoc } from "./graph.js";
+import { type PatchDoc, type PatchOp } from "./patch.js";
+/**
+ * Applies patch operations to a stored graph — the way a baseline map moves
+ * forward as pull requests merge, instead of being re-extracted wholesale.
+ *
+ * Operations apply in order and the first conflict stops the batch: a later
+ * operation in the same patch was written against the state the earlier one
+ * was supposed to produce.
+ *
+ * A successful result is a fully valid graph document: per-operation checks
+ * catch the common mistakes with a message naming the operation, and the
+ * candidate is validated as a whole before it is handed back, so no patch can
+ * quietly leave a document the renderer would choke on.
+ */
+export declare const applyPatch: (graph: GraphDoc, ops: readonly PatchOp[]) => Parsed<GraphDoc>;
+/**
+ * Applies a patch document, honouring the target it declares.
+ *
+ * `applyPatch` takes bare operations and trusts the caller to have picked the
+ * right document; this checks first. A baseline map is long-lived and patched
+ * repeatedly, so applying a patch to the wrong map, or to one that has moved
+ * on since the patch was written, has to fail loudly rather than merge.
+ *
+ * A stored map is a snapshot, not a diff: everything in it is `unchanged`,
+ * and `base` and `head` both name the single commit it reflects. So both
+ * advance to the patch's `toSha` — leaving `base` behind would claim the
+ * elements this patch just added had been there, unchanged, all along. The
+ * commit the map came from stays recorded on the patch itself.
+ *
+ * That snapshot rule is checked rather than assumed, on the way in as well as
+ * on the way out: a patch is free to carry `added` or `modified` elements, and
+ * neither a patch that leaves them in the map nor one that quietly launders a
+ * map that already carries them is allowed through.
+ *
+ * The target rules are re-checked here rather than trusted from parsing. A
+ * zod refinement does not survive into the inferred type, so a caller holding
+ * a `PatchDoc` it assembled itself would otherwise skip them.
+ */
+export declare const applyPatchDoc: (graph: GraphDoc, patch: PatchDoc) => Parsed<GraphDoc>;
+//# sourceMappingURL=apply.d.ts.map

package/dist/apply.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"apply.d.ts","sourceRoot":"","sources":["../src/apply.ts"],"names":[],"mappings":"AAAA,OAAO,EAAmC,KAAK,MAAM,EAAoB,MAAM,aAAa,CAAC;AAE7F,OAAO,KAAK,EAAQ,QAAQ,EAAyB,MAAM,YAAY,CAAC;AAExE,OAAO,EAA8B,KAAK,QAAQ,EAAE,KAAK,OAAO,EAAE,MAAM,YAAY,CAAC;AAuHrF;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,UAAU,UAAW,QAAQ,OAAO,SAAS,OAAO,EAAE,KAAG,MAAM,CAAC,QAAQ,CA8KpF,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,aAAa,UAAW,QAAQ,SAAS,QAAQ,KAAG,MAAM,CAAC,QAAQ,CA+D/E,CAAC"}

package/dist/apply.js

@@ -0,0 +1,315 @@
+import { formatIssues, PrLensSchemaError } from "./errors.js";
+import { safeParseGraphDoc } from "./validate.js";
+import { graphSnapshotIssues } from "./integrity.js";
+import { targetDescribesATransition } from "./patch.js";
+import { assertNever } from "./utils.js";
+const conflict = (path, message) => ({
+    code: "PATCH_CONFLICT",
+    path,
+    message,
+});
+const brokenReference = (path, message) => ({
+    code: "BROKEN_REFERENCE",
+    path,
+    message,
+});
+const indexOfId = (items, id) => items.findIndex((item) => item.id === id);
+const nothingRemoved = {
+    lanes: new Set(),
+    nodes: new Set(),
+    edges: new Set(),
+    flows: new Set(),
+};
+/**
+ * A view whose selection loses its last element no longer has a subject, so
+ * it goes rather than being left to render as an empty section.
+ */
+const pruneViews = (views, removed) => views.flatMap((view) => {
+    const children = pruneViews(view.children, removed);
+    switch (view.scope.kind) {
+        case "all":
+            return [{ ...view, children }];
+        case "selection": {
+            const scope = {
+                kind: "selection",
+                lanes: view.scope.lanes.filter((id) => !removed.lanes.has(id)),
+                nodes: view.scope.nodes.filter((id) => !removed.nodes.has(id)),
+                edges: view.scope.edges.filter((id) => !removed.edges.has(id)),
+                flows: view.scope.flows.filter((id) => !removed.flows.has(id)),
+            };
+            const selected = scope.lanes.length + scope.nodes.length + scope.edges.length + scope.flows.length;
+            return selected === 0 ? [] : [{ ...view, scope, children }];
+        }
+        default:
+            return assertNever(view.scope, "Unhandled view scope");
+    }
+});
+/** Layout hints name elements, so they strand the same way view scopes do. */
+const pruneLayout = (layout, removed) => {
+    if (layout === undefined)
+        return undefined;
+    const rank = layout.rank
+        ? Object.fromEntries(Object.entries(layout.rank).filter(([nodeId]) => !removed.nodes.has(nodeId)))
+        : undefined;
+    return {
+        ...layout,
+        laneOrder: layout.laneOrder.filter((id) => !removed.lanes.has(id)),
+        ...(rank ? { rank } : {}),
+    };
+};
+/**
+ * Deleting a node would strand every edge and flow step that touched it, so
+ * those go with it. A flow left with fewer than two participants, or with no
+ * steps, no longer describes a pipeline and is dropped whole.
+ */
+const cascadeNodeRemoval = (working, nodeId) => {
+    const strandedEdges = working.edges.filter((edge) => edge.from === nodeId || edge.to === nodeId);
+    working.edges = working.edges.filter((edge) => edge.from !== nodeId && edge.to !== nodeId);
+    const droppedFlows = [];
+    working.flows = working.flows.flatMap((flow) => {
+        const participants = flow.participants.filter((participant) => participant.node !== nodeId);
+        if (participants.length === flow.participants.length)
+            return [flow];
+        const messages = flow.messages.filter((message) => message.from !== nodeId && message.to !== nodeId);
+        if (participants.length < 2 || messages.length === 0) {
+            droppedFlows.push(flow.id);
+            return [];
+        }
+        return [{ ...flow, participants, messages }];
+    });
+    return {
+        ...nothingRemoved,
+        nodes: new Set([nodeId]),
+        edges: new Set(strandedEdges.map((edge) => edge.id)),
+        flows: new Set(droppedFlows),
+    };
+};
+/**
+ * Applies patch operations to a stored graph — the way a baseline map moves
+ * forward as pull requests merge, instead of being re-extracted wholesale.
+ *
+ * Operations apply in order and the first conflict stops the batch: a later
+ * operation in the same patch was written against the state the earlier one
+ * was supposed to produce.
+ *
+ * A successful result is a fully valid graph document: per-operation checks
+ * catch the common mistakes with a message naming the operation, and the
+ * candidate is validated as a whole before it is handed back, so no patch can
+ * quietly leave a document the renderer would choke on.
+ */
+export const applyPatch = (graph, ops) => {
+    const working = {
+        lanes: [...graph.lanes],
+        nodes: [...graph.nodes],
+        edges: [...graph.edges],
+        flows: [...graph.flows],
+        stats: graph.stats,
+    };
+    let views = graph.views;
+    let layout = graph.layout;
+    const prune = (removed) => {
+        views = pruneViews(views, removed);
+        layout = pruneLayout(layout, removed);
+    };
+    for (const [index, op] of ops.entries()) {
+        const at = `ops[${index}]`;
+        const reject = (issue) => ({
+            ok: false,
+            error: new PrLensSchemaError(issue.code, `${at}: ${issue.message}`, [issue]),
+        });
+        switch (op.op) {
+            case "add_lane": {
+                if (indexOfId(working.lanes, op.lane.id) !== -1)
+                    return reject(conflict(`${at}.lane.id`, `lane '${op.lane.id}' already exists`));
+                working.lanes.push(op.lane);
+                break;
+            }
+            case "update_lane": {
+                const position = indexOfId(working.lanes, op.id);
+                const lane = working.lanes[position];
+                if (lane === undefined)
+                    return reject(conflict(`${at}.id`, `unknown lane '${op.id}'`));
+                working.lanes[position] = { ...lane, ...op.patch };
+                break;
+            }
+            case "remove_lane": {
+                const position = indexOfId(working.lanes, op.id);
+                if (position === -1)
+                    return reject(conflict(`${at}.id`, `unknown lane '${op.id}'`));
+                const occupant = working.nodes.find((node) => node.lane === op.id);
+                if (occupant !== undefined)
+                    return reject(conflict(`${at}.id`, `lane '${op.id}' still holds node '${occupant.id}'; move or remove its nodes first`));
+                working.lanes.splice(position, 1);
+                prune({ ...nothingRemoved, lanes: new Set([op.id]) });
+                break;
+            }
+            case "add_node": {
+                if (indexOfId(working.nodes, op.node.id) !== -1)
+                    return reject(conflict(`${at}.node.id`, `node '${op.node.id}' already exists`));
+                if (indexOfId(working.lanes, op.node.lane) === -1)
+                    return reject(brokenReference(`${at}.node.lane`, `unknown lane '${op.node.lane}'`));
+                working.nodes.push(op.node);
+                break;
+            }
+            case "update_node": {
+                const position = indexOfId(working.nodes, op.id);
+                const node = working.nodes[position];
+                if (node === undefined)
+                    return reject(conflict(`${at}.id`, `unknown node '${op.id}'`));
+                if (op.patch.lane !== undefined && indexOfId(working.lanes, op.patch.lane) === -1)
+                    return reject(brokenReference(`${at}.patch.lane`, `unknown lane '${op.patch.lane}'`));
+                working.nodes[position] = { ...node, ...op.patch };
+                break;
+            }
+            case "remove_node": {
+                const position = indexOfId(working.nodes, op.id);
+                if (position === -1)
+                    return reject(conflict(`${at}.id`, `unknown node '${op.id}'`));
+                working.nodes.splice(position, 1);
+                prune(cascadeNodeRemoval(working, op.id));
+                break;
+            }
+            case "add_edge": {
+                if (indexOfId(working.edges, op.edge.id) !== -1)
+                    return reject(conflict(`${at}.edge.id`, `edge '${op.edge.id}' already exists`));
+                for (const [field, id] of [
+                    ["from", op.edge.from],
+                    ["to", op.edge.to],
+                ]) {
+                    if (indexOfId(working.nodes, id) === -1)
+                        return reject(brokenReference(`${at}.edge.${field}`, `unknown node '${id}'`));
+                }
+                working.edges.push(op.edge);
+                break;
+            }
+            case "update_edge": {
+                const position = indexOfId(working.edges, op.id);
+                const edge = working.edges[position];
+                if (edge === undefined)
+                    return reject(conflict(`${at}.id`, `unknown edge '${op.id}'`));
+                for (const [field, id] of [
+                    ["from", op.patch.from],
+                    ["to", op.patch.to],
+                ]) {
+                    if (id !== undefined && indexOfId(working.nodes, id) === -1)
+                        return reject(brokenReference(`${at}.patch.${field}`, `unknown node '${id}'`));
+                }
+                working.edges[position] = { ...edge, ...op.patch };
+                break;
+            }
+            case "remove_edge": {
+                const position = indexOfId(working.edges, op.id);
+                if (position === -1)
+                    return reject(conflict(`${at}.id`, `unknown edge '${op.id}'`));
+                working.edges.splice(position, 1);
+                prune({ ...nothingRemoved, edges: new Set([op.id]) });
+                break;
+            }
+            case "add_flow": {
+                if (indexOfId(working.flows, op.flow.id) !== -1)
+                    return reject(conflict(`${at}.flow.id`, `flow '${op.flow.id}' already exists`));
+                for (const [participantIndex, participant] of op.flow.participants.entries()) {
+                    if (indexOfId(working.nodes, participant.node) === -1)
+                        return reject(brokenReference(`${at}.flow.participants[${participantIndex}].node`, `unknown node '${participant.node}'`));
+                }
+                working.flows.push(op.flow);
+                break;
+            }
+            case "update_flow": {
+                const position = indexOfId(working.flows, op.id);
+                const flow = working.flows[position];
+                if (flow === undefined)
+                    return reject(conflict(`${at}.id`, `unknown flow '${op.id}'`));
+                for (const [participantIndex, participant] of (op.patch.participants ?? []).entries()) {
+                    if (indexOfId(working.nodes, participant.node) === -1)
+                        return reject(brokenReference(`${at}.patch.participants[${participantIndex}].node`, `unknown node '${participant.node}'`));
+                }
+                working.flows[position] = { ...flow, ...op.patch };
+                break;
+            }
+            case "remove_flow": {
+                const position = indexOfId(working.flows, op.id);
+                if (position === -1)
+                    return reject(conflict(`${at}.id`, `unknown flow '${op.id}'`));
+                working.flows.splice(position, 1);
+                prune({ ...nothingRemoved, flows: new Set([op.id]) });
+                break;
+            }
+            case "set_stats": {
+                working.stats = op.stats;
+                break;
+            }
+            default:
+                return assertNever(op, "Unhandled patch operation");
+        }
+    }
+    return safeParseGraphDoc({
+        ...graph,
+        lanes: working.lanes,
+        nodes: working.nodes,
+        edges: working.edges,
+        flows: working.flows,
+        stats: working.stats,
+        views,
+        layout,
+    });
+};
+/**
+ * Applies a patch document, honouring the target it declares.
+ *
+ * `applyPatch` takes bare operations and trusts the caller to have picked the
+ * right document; this checks first. A baseline map is long-lived and patched
+ * repeatedly, so applying a patch to the wrong map, or to one that has moved
+ * on since the patch was written, has to fail loudly rather than merge.
+ *
+ * A stored map is a snapshot, not a diff: everything in it is `unchanged`,
+ * and `base` and `head` both name the single commit it reflects. So both
+ * advance to the patch's `toSha` — leaving `base` behind would claim the
+ * elements this patch just added had been there, unchanged, all along. The
+ * commit the map came from stays recorded on the patch itself.
+ *
+ * That snapshot rule is checked rather than assumed, on the way in as well as
+ * on the way out: a patch is free to carry `added` or `modified` elements, and
+ * neither a patch that leaves them in the map nor one that quietly launders a
+ * map that already carries them is allowed through.
+ *
+ * The target rules are re-checked here rather than trusted from parsing. A
+ * zod refinement does not survive into the inferred type, so a caller holding
+ * a `PatchDoc` it assembled itself would otherwise skip them.
+ */
+export const applyPatchDoc = (graph, patch) => {
+    const { graphId, fromSha, toSha } = patch.target;
+    const reject = (code, message, issue) => ({
+        ok: false,
+        error: new PrLensSchemaError(code, message, [issue]),
+    });
+    const rejectIssues = (code, message, issues) => ({
+        ok: false,
+        error: new PrLensSchemaError(code, `${message}:\n${formatIssues(issues)}`, issues),
+    });
+    if (!targetDescribesATransition(patch.target))
+        return reject("PATCH_CONFLICT", `patch moves the map from ${fromSha} to the same commit, so it describes no transition`, { code: "PATCH_CONFLICT", path: "target.toSha", message: "no transition" });
+    const contamination = graphSnapshotIssues(graph);
+    if (contamination.length > 0)
+        return rejectIssues("NOT_A_SNAPSHOT", "the graph being patched is not a stored map", contamination);
+    if (graph.id !== graphId)
+        return reject("PATCH_CONFLICT", `patch targets graph '${graphId}' but was applied to '${graph.id ?? "an unidentified graph"}'`, { code: "PATCH_CONFLICT", path: "target.graphId", message: "wrong graph" });
+    if (graph.provenance.head.sha !== fromSha)
+        return reject("PATCH_CONFLICT", `patch expects the graph at ${fromSha} but it reflects ${graph.provenance.head.sha}`, { code: "PATCH_CONFLICT", path: "target.fromSha", message: "stale baseline" });
+    const applied = applyPatch(graph, patch.ops);
+    if (!applied.ok)
+        return applied;
+    const snapshot = {
+        ...applied.value,
+        provenance: {
+            ...applied.value.provenance,
+            base: { ...applied.value.provenance.base, sha: toSha },
+            head: { ...applied.value.provenance.head, sha: toSha },
+        },
+    };
+    const issues = graphSnapshotIssues(snapshot);
+    if (issues.length > 0)
+        return rejectIssues("NOT_A_SNAPSHOT", "patch leaves a map that is not a stored map", issues);
+    return { ok: true, value: snapshot };
+};
+//# sourceMappingURL=apply.js.map

package/dist/apply.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"apply.js","sourceRoot":"","sources":["../src/apply.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,iBAAiB,EAAiC,MAAM,aAAa,CAAC;AAC7F,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAElD,OAAO,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AACrD,OAAO,EAAE,0BAA0B,EAA+B,MAAM,YAAY,CAAC;AACrF,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAUzC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,OAAe,EAAe,EAAE,CAAC,CAAC;IAChE,IAAI,EAAE,gBAAgB;IACtB,IAAI;IACJ,OAAO;CACR,CAAC,CAAC;AAEH,MAAM,eAAe,GAAG,CAAC,IAAY,EAAE,OAAe,EAAe,EAAE,CAAC,CAAC;IACvE,IAAI,EAAE,kBAAkB;IACxB,IAAI;IACJ,OAAO;CACR,CAAC,CAAC;AAEH,MAAM,SAAS,GAAG,CAAC,KAAgC,EAAE,EAAU,EAAU,EAAE,CACzE,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;AAS5C,MAAM,cAAc,GAAe;IACjC,KAAK,EAAE,IAAI,GAAG,EAAE;IAChB,KAAK,EAAE,IAAI,GAAG,EAAE;IAChB,KAAK,EAAE,IAAI,GAAG,EAAE;IAChB,KAAK,EAAE,IAAI,GAAG,EAAE;CACjB,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,GAAG,CAAC,KAAsB,EAAE,OAAmB,EAAU,EAAE,CACzE,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;IACrB,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAEpD,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACxB,KAAK,KAAK;YACR,OAAO,CAAC,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QACjC,KAAK,WAAW,EAAE,CAAC;YACjB,MAAM,KAAK,GAAG;gBACZ,IAAI,EAAE,WAAW;gBACjB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC9D,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC9D,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC9D,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aACtD,CAAC;YAEX,MAAM,QAAQ,GACZ,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;YACpF,OAAO,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD;YACE,OAAO,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,sBAAsB,CAAC,CAAC;IAC3D,CAAC;AACH,CAAC,CAAC,CAAC;AAEL,8EAA8E;AAC9E,MAAM,WAAW,GAAG,CAAC,MAA0B,EAAE,OAAmB,EAAsB,EAAE;IAC1F,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAE3C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI;QACtB,CAAC,CAAC,MAAM,CAAC,WAAW,CAChB,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAC7E;QACH,CAAC,CAAC,SAAS,CAAC;IAEd,OAAO;QACL,GAAG,MAAM;QACT,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC1B,CAAC;AACJ,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,kBAAkB,GAAG,CAAC,OAAoB,EAAE,MAAc,EAAc,EAAE;IAC9E,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IACjG,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IAE3F,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAC7C,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;QAC5F,IAAI,YAAY,CAAC,MAAM,KAAK,IAAI,CAAC,YAAY,CAAC,MAAM;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC;QAEpE,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CACnC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,KAAK,MAAM,IAAI,OAAO,CAAC,EAAE,KAAK,MAAM,CAC9D,CAAC;QACF,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrD,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC3B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,OAAO,CAAC,EAAE,GAAG,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,GAAG,cAAc;QACjB,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QACxB,KAAK,EAAE,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpD,KAAK,EAAE,IAAI,GAAG,CAAC,YAAY,CAAC;KAC7B,CAAC;AACJ,CAAC,CAAC;AAEF;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAe,EAAE,GAAuB,EAAoB,EAAE;IACvF,MAAM,OAAO,GAAgB;QAC3B,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QACvB,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QACvB,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QACvB,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QACvB,KAAK,EAAE,KAAK,CAAC,KAAK;KACnB,CAAC;IACF,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IACxB,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE1B,MAAM,KAAK,GAAG,CAAC,OAAmB,EAAQ,EAAE;QAC1C,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACnC,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACxC,CAAC,CAAC;IAEF,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC;QACxC,MAAM,EAAE,GAAG,OAAO,KAAK,GAAG,CAAC;QAC3B,MAAM,MAAM,GAAG,CAAC,KAAkB,EAAoB,EAAE,CAAC,CAAC;YACxD,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,IAAI,iBAAiB,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;SAC7E,CAAC,CAAC;QAEH,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACd,KAAK,UAAU,EAAE,CAAC;gBAChB,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;oBAC7C,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;gBAClF,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBAC5B,MAAM;YACR,CAAC;YACD,KAAK,aAAa,EAAE,CAAC;gBACnB,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjD,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACrC,IAAI,IAAI,KAAK,SAAS;oBAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACvF,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;gBACnD,MAAM;YACR,CAAC;YACD,KAAK,aAAa,EAAE,CAAC;gBACnB,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjD,IAAI,QAAQ,KAAK,CAAC,CAAC;oBAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBAEpF,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;gBACnE,IAAI,QAAQ,KAAK,SAAS;oBACxB,OAAO,MAAM,CACX,QAAQ,CACN,GAAG,EAAE,KAAK,EACV,SAAS,EAAE,CAAC,EAAE,uBAAuB,QAAQ,CAAC,EAAE,mCAAmC,CACpF,CACF,CAAC;gBAEJ,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;gBAClC,KAAK,CAAC,EAAE,GAAG,cAAc,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBACtD,MAAM;YACR,CAAC;YAED,KAAK,UAAU,EAAE,CAAC;gBAChB,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;oBAC7C,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;gBAClF,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC/C,OAAO,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,YAAY,EAAE,iBAAiB,EAAE,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACtF,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBAC5B,MAAM;YACR,CAAC;YACD,KAAK,aAAa,EAAE,CAAC;gBACnB,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjD,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACrC,IAAI,IAAI,KAAK,SAAS;oBAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACvF,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC/E,OAAO,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,aAAa,EAAE,iBAAiB,EAAE,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACxF,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;gBACnD,MAAM;YACR,CAAC;YACD,KAAK,aAAa,EAAE,CAAC;gBACnB,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjD,IAAI,QAAQ,KAAK,CAAC,CAAC;oBAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACpF,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;gBAClC,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC1C,MAAM;YACR,CAAC;YAED,KAAK,UAAU,EAAE,CAAC;gBAChB,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;oBAC7C,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;gBAClF,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI;oBACxB,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;oBACtB,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;iBACV,EAAE,CAAC;oBACX,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;wBACrC,OAAO,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,SAAS,KAAK,EAAE,EAAE,iBAAiB,EAAE,GAAG,CAAC,CAAC,CAAC;gBAClF,CAAC;gBACD,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBAC5B,MAAM;YACR,CAAC;YACD,KAAK,aAAa,EAAE,CAAC;gBACnB,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjD,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACrC,IAAI,IAAI,KAAK,SAAS;oBAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACvF,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI;oBACxB,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;oBACvB,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;iBACX,EAAE,CAAC;oBACX,IAAI,EAAE,KAAK,SAAS,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;wBACzD,OAAO,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,UAAU,KAAK,EAAE,EAAE,iBAAiB,EAAE,GAAG,CAAC,CAAC,CAAC;gBACnF,CAAC;gBACD,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;gBACnD,MAAM;YACR,CAAC;YACD,KAAK,aAAa,EAAE,CAAC;gBACnB,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjD,IAAI,QAAQ,KAAK,CAAC,CAAC;oBAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACpF,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;gBAClC,KAAK,CAAC,EAAE,GAAG,cAAc,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBACtD,MAAM;YACR,CAAC;YAED,KAAK,UAAU,EAAE,CAAC;gBAChB,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;oBAC7C,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;gBAClF,KAAK,MAAM,CAAC,gBAAgB,EAAE,WAAW,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;oBAC7E,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBACnD,OAAO,MAAM,CACX,eAAe,CACb,GAAG,EAAE,sBAAsB,gBAAgB,QAAQ,EACnD,iBAAiB,WAAW,CAAC,IAAI,GAAG,CACrC,CACF,CAAC;gBACN,CAAC;gBACD,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBAC5B,MAAM;YACR,CAAC;YACD,KAAK,aAAa,EAAE,CAAC;gBACnB,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjD,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACrC,IAAI,IAAI,KAAK,SAAS;oBAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACvF,KAAK,MAAM,CAAC,gBAAgB,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;oBACtF,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBACnD,OAAO,MAAM,CACX,eAAe,CACb,GAAG,EAAE,uBAAuB,gBAAgB,QAAQ,EACpD,iBAAiB,WAAW,CAAC,IAAI,GAAG,CACrC,CACF,CAAC;gBACN,CAAC;gBACD,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;gBACnD,MAAM;YACR,CAAC;YACD,KAAK,aAAa,EAAE,CAAC;gBACnB,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjD,IAAI,QAAQ,KAAK,CAAC,CAAC;oBAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACpF,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;gBAClC,KAAK,CAAC,EAAE,GAAG,cAAc,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBACtD,MAAM;YACR,CAAC;YAED,KAAK,WAAW,EAAE,CAAC;gBACjB,OAAO,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;gBACzB,MAAM;YACR,CAAC;YAED;gBACE,OAAO,WAAW,CAAC,EAAE,EAAE,2BAA2B,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAED,OAAO,iBAAiB,CAAC;QACvB,GAAG,KAAK;QACR,KAAK,EAAE,OAAO,CAAC,KAAK;QACpB,KAAK,EAAE,OAAO,CAAC,KAAK;QACpB,KAAK,EAAE,OAAO,CAAC,KAAK;QACpB,KAAK,EAAE,OAAO,CAAC,KAAK;QACpB,KAAK,EAAE,OAAO,CAAC,KAAK;QACpB,KAAK;QACL,MAAM;KACP,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAe,EAAE,KAAe,EAAoB,EAAE;IAClF,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;IAEjD,MAAM,MAAM,GAAG,CACb,IAAyB,EACzB,OAAe,EACf,KAAkB,EACA,EAAE,CAAC,CAAC;QACtB,EAAE,EAAE,KAAK;QACT,KAAK,EAAE,IAAI,iBAAiB,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC;KACrD,CAAC,CAAC;IAEH,MAAM,YAAY,GAAG,CACnB,IAAyB,EACzB,OAAe,EACf,MAAqB,EACH,EAAE,CAAC,CAAC;QACtB,EAAE,EAAE,KAAK;QACT,KAAK,EAAE,IAAI,iBAAiB,CAAC,IAAI,EAAE,GAAG,OAAO,MAAM,YAAY,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC;KACnF,CAAC,CAAC;IAEH,IAAI,CAAC,0BAA0B,CAAC,KAAK,CAAC,MAAM,CAAC;QAC3C,OAAO,MAAM,CACX,gBAAgB,EAChB,4BAA4B,OAAO,oDAAoD,EACvF,EAAE,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,eAAe,EAAE,CAC3E,CAAC;IAEJ,MAAM,aAAa,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;IACjD,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC;QAC1B,OAAO,YAAY,CAAC,gBAAgB,EAAE,6CAA6C,EAAE,aAAa,CAAC,CAAC;IAEtG,IAAI,KAAK,CAAC,EAAE,KAAK,OAAO;QACtB,OAAO,MAAM,CACX,gBAAgB,EAChB,wBAAwB,OAAO,yBAAyB,KAAK,CAAC,EAAE,IAAI,uBAAuB,GAAG,EAC9F,EAAE,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE,gBAAgB,EAAE,OAAO,EAAE,aAAa,EAAE,CAC3E,CAAC;IAEJ,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,KAAK,OAAO;QACvC,OAAO,MAAM,CACX,gBAAgB,EAChB,8BAA8B,OAAO,oBAAoB,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,EACpF,EAAE,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE,gBAAgB,EAAE,OAAO,EAAE,gBAAgB,EAAE,CAC9E,CAAC;IAEJ,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7C,IAAI,CAAC,OAAO,CAAC,EAAE;QAAE,OAAO,OAAO,CAAC;IAEhC,MAAM,QAAQ,GAAa;QACzB,GAAG,OAAO,CAAC,KAAK;QAChB,UAAU,EAAE;YACV,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU;YAC3B,IAAI,EAAE,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE;YACtD,IAAI,EAAE,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE;SACvD;KACF,CAAC;IAEF,MAAM,MAAM,GAAG,mBAAmB,CAAC,QAAQ,CAAC,CAAC;IAC7C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QACnB,OAAO,YAAY,CAAC,gBAAgB,EAAE,6CAA6C,EAAE,MAAM,CAAC,CAAC;IAE/F,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AACvC,CAAC,CAAC"}

package/dist/config.d.ts

@@ -0,0 +1,58 @@
+import { z } from "zod";
+/**
+ * Which inferred elements a correction applies to.
+ *
+ * `id:<node-id>` addresses one node exactly. Anything else is a path glob
+ * matched against the node's file paths, so a correction survives the model
+ * renaming the node between runs.
+ */
+export declare const Selector: z.ZodString;
+export type Selector = z.infer<typeof Selector>;
+/**
+ * Human corrections to the inferred map. They are an overlay: inference never
+ * writes back here, and every run re-applies the overlay on top of fresh
+ * inference, so a correction keeps holding as the code moves.
+ */
+export declare const MapCorrections: z.ZodObject<{
+    rename: z.ZodDefault<z.ZodArray<z.ZodObject<{
+        match: z.ZodString;
+        to: z.ZodString;
+    }, z.core.$strict>>>;
+    exclude: z.ZodDefault<z.ZodArray<z.ZodString>>;
+    lane: z.ZodDefault<z.ZodArray<z.ZodObject<{
+        match: z.ZodString;
+        lane: z.ZodString;
+    }, z.core.$strict>>>;
+    group: z.ZodDefault<z.ZodArray<z.ZodObject<{
+        match: z.ZodString;
+        group: z.ZodString;
+    }, z.core.$strict>>>;
+}, z.core.$strict>;
+export type MapCorrections = z.infer<typeof MapCorrections>;
+/** The `.github/pr-lens.yml` a repository may commit. Every field is optional. */
+export declare const Config: z.ZodObject<{
+    schemaVersion: z.ZodString;
+    lenses: z.ZodDefault<z.ZodArray<z.ZodEnum<{
+        architecture: "architecture";
+        "data-flow": "data-flow";
+    }>>>;
+    map: z.ZodDefault<z.ZodObject<{
+        rename: z.ZodDefault<z.ZodArray<z.ZodObject<{
+            match: z.ZodString;
+            to: z.ZodString;
+        }, z.core.$strict>>>;
+        exclude: z.ZodDefault<z.ZodArray<z.ZodString>>;
+        lane: z.ZodDefault<z.ZodArray<z.ZodObject<{
+            match: z.ZodString;
+            lane: z.ZodString;
+        }, z.core.$strict>>>;
+        group: z.ZodDefault<z.ZodArray<z.ZodObject<{
+            match: z.ZodString;
+            group: z.ZodString;
+        }, z.core.$strict>>>;
+    }, z.core.$strict>>;
+    branding: z.ZodDefault<z.ZodBoolean>;
+}, z.core.$strict>;
+export type Config = z.infer<typeof Config>;
+export type ConfigInput = z.input<typeof Config>;
+//# sourceMappingURL=config.d.ts.map

package/dist/config.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"config.d.ts","sourceRoot":"","sources":["../src/config.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB;;;;;;GAMG;AACH,eAAO,MAAM,QAAQ,aAIsE,CAAC;AAC5F,MAAM,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,QAAQ,CAAC,CAAC;AAEhD;;;;GAIG;AACH,eAAO,MAAM,cAAc;;;;;;;;;;;;;;kBAuBwC,CAAC;AACpE,MAAM,MAAM,cAAc,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,cAAc,CAAC,CAAC;AAE5D,kFAAkF;AAClF,eAAO,MAAM,MAAM;;;;;;;;;;;;;;;;;;;;;;kBAiBiC,CAAC;AACrD,MAAM,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,MAAM,CAAC,CAAC;AAC5C,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,MAAM,CAAC,CAAC"}