aontu 0.52.1 → 0.54.0

package/dist/query.js

@@ -0,0 +1,294 @@
+"use strict";
+/* Copyright (c) 2025 Richard Rodger, MIT License */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.nearestKey = nearestKey;
+exports.pathParts = pathParts;
+exports.projectFor = projectFor;
+exports.evalFailure = evalFailure;
+exports.noPathFinding = noPathFinding;
+exports.get = get;
+exports.why = why;
+// THE QUERY SURFACE (G7 phase 1,
+// docs/capability-review/g7-machine-access.md): select one node of an
+// evaluated document by path and render it — the slice an agent asks
+// for, instead of the whole file as one JSON blob.
+//
+// Evaluation is still GLOBAL. Unification has no partial mode to sell:
+// the whole document is evaluated and then one node is selected. What
+// `get` buys is the SIZE OF THE ANSWER, not the cost of producing it.
+//
+// The three projections are lattice ABSTRACTIONS, and each is defined
+// so that the view it prints is a valid Aontu document that SUBSUMES
+// the truth — generalisation, never distortion:
+//
+//   - `types` replaces every concrete leaf with its own kind, using
+//     the lattice's own superior() rather than a table of this file's
+//     opinions: {"replicas":3} becomes {"replicas":integer}.
+//   - `depth n` keeps structure to depth n and renders every elided
+//     subtree as `top` — "no further information at this tier".
+//   - `keys` is `depth 1` degenerated to a listing.
+//
+// That property is not a promise here: every projection row of
+// test/spec/query.tsv asserts subsume(view, truth) == 'subsumes' in
+// both runners, which G3 made mechanically checkable.
+//
+// Projections are NOT canonical form and are never fed to G6's hash,
+// which is why they are named views rather than spellings of --canon.
+const aontu_1 = require("./aontu");
+const exactjson_1 = require("./exactjson");
+const vet_1 = require("./vet");
+const keyorder_1 = require("./keyorder");
+const provenance_1 = require("./provenance");
+const TOP = 'top';
+// The nearest key at the parent of a path that named nothing, by a
+// plain edit distance over the sibling names — the "did you mean"
+// half of the no_path contract. Undefined when nothing is close
+// enough to be worth suggesting.
+function nearestKey(want, have) {
+    let best;
+    let bestd = Infinity;
+    for (const k of have) {
+        const d = editDistance(want, k);
+        if (d < bestd) {
+            bestd = d;
+            best = k;
+        }
+    }
+    // Half the name may differ, no more: past that the suggestion is
+    // noise, and a wrong suggestion costs more than none.
+    return bestd <= Math.max(1, Math.floor(want.length / 2)) ? best : undefined;
+}
+function editDistance(a, b) {
+    const prev = [];
+    for (let j = 0; j <= b.length; j++) {
+        prev[j] = j;
+    }
+    for (let i = 1; i <= a.length; i++) {
+        let diag = prev[0];
+        prev[0] = i;
+        for (let j = 1; j <= b.length; j++) {
+            const tmp = prev[j];
+            prev[j] = Math.min(prev[j] + 1, prev[j - 1] + 1, diag + (a[i - 1] === b[j - 1] ? 0 : 1));
+            diag = tmp;
+        }
+    }
+    return prev[b.length];
+}
+// The path split anchorAt walks: `$` and empty segments dropped, so
+// `$`, `$.` and `` all name the root.
+function pathParts(path) {
+    const trimmed = path.startsWith('$') ? path.slice(1) : path;
+    return trimmed.split('.').filter((p) => '' !== p);
+}
+// The queried path, normalised the way anchorAt reads it — so a
+// finding names `$.a.b` whether the caller wrote that, `a.b` or
+// `$.a.b.` — and `$` for the root.
+function pathText(path) {
+    const parts = pathParts(path);
+    return '$' + (0 < parts.length ? '.' + parts.join('.') : '');
+}
+// The projection walk, exported for the direct unit tests (ADR-002,
+// ts/test/coverage3.test.ts): a junction member that is itself a
+// junction of more than one term keeps its parens, and no SOURCE
+// reaches that arm because norm flattens junctions at unification.
+function projectFor(v, view, depth) {
+    return project(v, view, depth);
+}
+// The canon-shaped views. One walk, two knobs: `types` generalises
+// each leaf through the lattice, `depth` elides below its level. Bags
+// recurse (their canon getters would render children through plain
+// canon, which neither knob can reach); everything else is a leaf.
+function project(v, view, depth) {
+    if (depth <= 0) {
+        return TOP;
+    }
+    if (true === v?.isMap) {
+        const keys = Object.keys(v.peg).sort(keyorder_1.cmpCodePoint);
+        return '{' +
+            (v.spread.cj ? '&:' + project(v.spread.cj, view, depth - 1) +
+                (0 < keys.length ? ',' : '') : '') +
+            keys.map((k) => JSON.stringify(k) +
+                (v.optionalKeys.includes(k) ? '?' : '') +
+                ':' +
+                project(v.peg[k], view, depth - 1)).join(',') +
+            '}';
+    }
+    if (true === v?.isList) {
+        const keys = Object.keys(v.peg);
+        return '[' +
+            (v.spread.cj ? '&:' + project(v.spread.cj, view, depth - 1) +
+                (0 < keys.length ? ',' : '') : '') +
+            keys.map((k) => project(v.peg[k], view, depth - 1)).join(',') +
+            ']';
+    }
+    // Junctions and prefs are TRANSPARENT: not a structural tier (so
+    // they do not spend a level of depth) but not a leaf either (so
+    // `*8080|integer` generalises to `*integer|integer` rather than
+    // collapsing to `top` and throwing the alternatives away).
+    if (true === v?.isPref) {
+        return '*' + project(v.peg, view, depth);
+    }
+    if (true === v?.isConjunct || true === v?.isDisjunct) {
+        return v.peg.map((m) => true === m?.isJunction && 1 < m.peg.length
+            ? '(' + project(m, view, depth) + ')'
+            : project(m, view, depth))
+            .join(true === v.isConjunct ? '&' : '|');
+    }
+    // A LEAF. Under `types` a CONCRETE scalar lifts to its own kind —
+    // superior() is the lattice's answer, so the view subsumes the truth
+    // by construction and not by this file's good intentions. Everything
+    // else is already an abstraction (a kind marker, a constraint, an
+    // unresolved reference) and is left alone: lifting `integer` to
+    // `number` would generalise a shape view that was already a shape.
+    return 'types' === view && true === v?.isScalar ? v.superior().canon : v.canon;
+}
+// The `keys` listing: the node's own key names (or list indices), one
+// per line, code-point ordered as canon orders them. A leaf has none,
+// which is an empty answer rather than an error — "nothing below
+// here" is a true statement about a scalar.
+function keyList(v) {
+    if (true === v?.isMap) {
+        return Object.keys(v.peg).sort(keyorder_1.cmpCodePoint).join('\n');
+    }
+    if (true === v?.isList) {
+        return Object.keys(v.peg).join('\n');
+    }
+    return '';
+}
+function finding(code, path, message, note) {
+    return {
+        code,
+        class: 'reference',
+        severity: 'error',
+        path,
+        message,
+        sites: [],
+        ...(null == note ? {} : { note }),
+    };
+}
+// A document that does not stand up has no node to select. The
+// engine's own first error IS the report: the query surface adds
+// nothing to a diagnosis the evaluator already made. The path is the
+// DOCUMENT — what failed is the whole thing standing up, not the node
+// the caller asked about, which may never have existed.
+function evalFailure(ctx) {
+    // ctx.err is never empty at a call site: every failure that reaches
+    // one collected an error first — a parse that did not stand up, a
+    // root that came back nil. Not coalesced, on the vet siteOf
+    // precedent: an impossible state should fail loudly rather than be
+    // quietly papered over with a made-up code.
+    const err = ctx.err[0];
+    return finding(err.why, '$', err.msg);
+}
+// The refusal for a path that names nothing, shared by `get` and
+// `why`: WHICH segment failed, and what was there instead — the "did
+// you mean" the no_path contract promises. Walking again is cheap (the
+// tree is in hand) and is the only way to name the parent.
+function noPathFinding(root, path) {
+    const parts = pathParts(path);
+    let at = root;
+    let want = '';
+    for (const part of parts) {
+        const next = (0, vet_1.anchorAt)(at, part);
+        if (null == next) {
+            want = part;
+            break;
+        }
+        at = next;
+    }
+    const have = true === at?.isMap
+        ? Object.keys(at.peg).sort(keyorder_1.cmpCodePoint)
+        : (true === at?.isList ? Object.keys(at.peg) : []);
+    const near = nearestKey(want, have);
+    return finding('no_path', pathText(path), `The path ${path} names nothing in this document.`, null == near ? undefined : `did you mean ${near}?`);
+}
+// Evaluate the document, select the node at `path`, and render it.
+function get(src, path, opts) {
+    const options = opts ?? {};
+    const view = options.view ?? 'json';
+    const aontu = new aontu_1.Aontu(null == options.trust ? undefined : { trust: options.trust });
+    const ctx = aontu.ctx({ collect: true });
+    const parseOpts = null == options.path ? undefined : { path: options.path };
+    const root = aontu.unify(src, parseOpts, ctx);
+    if (0 < ctx.err.length || null == root || true === root.isNil) {
+        return { ok: false, out: '', findings: [evalFailure(ctx)] };
+    }
+    const node = (0, vet_1.anchorAt)(root, path);
+    if (null == node) {
+        return { ok: false, out: '', findings: [noPathFinding(root, path)] };
+    }
+    if ('json' === view) {
+        // GENERATION CAN FAIL WHERE UNIFICATION DID NOT: `k: integer` is a
+        // perfectly good unified document and not a concrete value, so the
+        // json view of it is an error, exactly as `aontu file.aon` on the
+        // same document is. Under `collect` the failure lands on the
+        // context rather than throwing, so it has to be read back — the Go
+        // port's Gen returns it as an error and the two must agree.
+        const before = ctx.err.length;
+        const gen = node.gen(ctx);
+        if (before < ctx.err.length) {
+            const err = ctx.err[before];
+            return {
+                ok: false,
+                out: '',
+                findings: [finding(err?.why ?? 'no_gen', pathText(path), err?.msg ?? 'The value at this path is not concrete.')],
+            };
+        }
+        return { ok: true, out: (0, exactjson_1.exactJSON)(gen, 2), findings: [] };
+    }
+    if ('keys' === view) {
+        return { ok: true, out: keyList(node), findings: [] };
+    }
+    return {
+        ok: true,
+        out: project(node, view, options.depth ?? Infinity),
+        findings: [],
+    };
+}
+// WHY does the value at this path hold? Evaluate with the provenance
+// recorder on, select the node, and answer the ordered contributions
+// that met there — the positive twin of G2's error report.
+//
+// Two evaluations are NOT needed: the recorder rides the one run this
+// call makes. What it costs is site materialisation and one map entry
+// per path met, which an instrumented run pays knowingly.
+function why(src, path, opts) {
+    const options = opts ?? {};
+    const aontu = new aontu_1.Aontu(null == options.trust ? undefined : { trust: options.trust });
+    const prov = new provenance_1.Provenance();
+    const ctx = aontu.ctx({ collect: true, prov });
+    const parseOpts = null == options.path ? undefined : { path: options.path };
+    // Parse and unify SEPARATELY, so the parsed tree can be stamped
+    // before the fixpoint runs: a contribution is a value the author
+    // wrote, and after unification there is no longer any way to tell
+    // one from a value the engine minted on the way.
+    const parsed = aontu.parse(src, parseOpts, ctx);
+    if (0 < ctx.err.length || null == parsed) {
+        return { ok: false, findings: [evalFailure(ctx)] };
+    }
+    prov.writtenFrom(parsed);
+    const root = aontu.unify(parsed, parseOpts, ctx);
+    if (0 < ctx.err.length || null == root || true === root.isNil) {
+        return { ok: false, findings: [evalFailure(ctx)] };
+    }
+    const node = (0, vet_1.anchorAt)(root, path);
+    if (null == node) {
+        return { ok: false, findings: [noPathFinding(root, path)] };
+    }
+    // The value that stands here is a contribution when nothing met
+    // (see Provenance.stands): a generator places a value without a
+    // meet, and "nothing met at this path" is not an answer to "where
+    // did this come from".
+    const parts = pathParts(path);
+    prov.stands(parts, node);
+    return {
+        ok: true,
+        record: {
+            conjuncts: prov.at(parts),
+            path: pathText(path),
+            value: node.canon,
+        },
+        findings: [],
+    };
+}
+//# sourceMappingURL=query.js.map

package/dist/query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.js","sourceRoot":"","sources":["../src/query.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;;;;;;;AAEpD,iCAAiC;AACjC,sEAAsE;AACtE,qEAAqE;AACrE,mDAAmD;AACnD,EAAE;AACF,uEAAuE;AACvE,sEAAsE;AACtE,sEAAsE;AACtE,EAAE;AACF,sEAAsE;AACtE,qEAAqE;AACrE,gDAAgD;AAChD,EAAE;AACF,oEAAoE;AACpE,sEAAsE;AACtE,6DAA6D;AAC7D,oEAAoE;AACpE,gEAAgE;AAChE,oDAAoD;AACpD,EAAE;AACF,+DAA+D;AAC/D,oEAAoE;AACpE,sDAAsD;AACtD,EAAE;AACF,qEAAqE;AACrE,sEAAsE;AAEtE,mCAA+B;AAE/B,2CAAuC;AACvC,+BAAgC;AAEhC,yCAAyC;AACzC,6CAAyC;AAkCzC,MAAM,GAAG,GAAG,KAAK,CAAA;AAGjB,mEAAmE;AACnE,kEAAkE;AAClE,gEAAgE;AAChE,iCAAiC;AACjC,oBACE,IAAY,EAAE,IAAc;IAC5B,IAAI,IAAwB,CAAA;IAC5B,IAAI,KAAK,GAAG,QAAQ,CAAA;IACpB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QAC/B,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC;YACd,KAAK,GAAG,CAAC,CAAA;YACT,IAAI,GAAG,CAAC,CAAA;QACV,CAAC;IACH,CAAC;IACD,iEAAiE;IACjE,sDAAsD;IACtD,OAAO,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAA;AAC7E,CAAC;AAGD,SAAS,YAAY,CAAC,CAAS,EAAE,CAAS;IACxC,MAAM,IAAI,GAAa,EAAE,CAAA;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACb,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;YACnB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAChB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EACX,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EACf,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACzC,IAAI,GAAG,GAAG,CAAA;QACZ,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;AACvB,CAAC;AAGD,oEAAoE;AACpE,sCAAsC;AACtC,mBAA0B,IAAY;IACpC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;IAC3D,OAAO,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAA;AACnD,CAAC;AAGD,gEAAgE;AAChE,gEAAgE;AAChE,mCAAmC;AACnC,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAA;IAC7B,OAAO,GAAG,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;AAC9D,CAAC;AAGD,oEAAoE;AACpE,iEAAiE;AACjE,iEAAiE;AACjE,mEAAmE;AACnE,oBACE,CAAM,EAAE,IAAe,EAAE,KAAa;IACtC,OAAO,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;AAChC,CAAC;AAGD,mEAAmE;AACnE,sEAAsE;AACtE,mEAAmE;AACnE,mEAAmE;AACnE,SAAS,OAAO,CAAC,CAAM,EAAE,IAAe,EAAE,KAAa;IACrD,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QACf,OAAO,GAAG,CAAA;IACZ,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;QAClD,OAAO,GAAG;YACR,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC;gBACzD,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACb,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;gBACjB,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvC,GAAG;gBACH,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;YAC/C,GAAG,CAAA;IACP,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAC/B,OAAO,GAAG;YACR,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC;gBACzD,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;YAC7D,GAAG,CAAA;IACP,CAAC;IACD,iEAAiE;IACjE,gEAAgE;IAChE,gEAAgE;IAChE,2DAA2D;IAC3D,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QACvB,OAAO,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IAC1C,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,EAAE,UAAU,IAAI,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;QACrD,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAC1B,IAAI,KAAK,CAAC,EAAE,UAAU,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM;YACxC,CAAC,CAAC,GAAG,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,GAAG;YACrC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;aAC3B,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IAC5C,CAAC;IAED,kEAAkE;IAClE,qEAAqE;IACrE,qEAAqE;IACrE,kEAAkE;IAClE,gEAAgE;IAChE,mEAAmE;IACnE,OAAO,OAAO,KAAK,IAAI,IAAI,IAAI,KAAK,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;AAChF,CAAC;AAGD,sEAAsE;AACtE,sEAAsE;AACtE,iEAAiE;AACjE,4CAA4C;AAC5C,SAAS,OAAO,CAAC,CAAM;IACrB,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;QACtB,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACzD,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QACvB,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACtC,CAAC;IACD,OAAO,EAAE,CAAA;AACX,CAAC;AAGD,SAAS,OAAO,CACd,IAAY,EAAE,IAAY,EAAE,OAAe,EAAE,IAAa;IAC1D,OAAO;QACL,IAAI;QACJ,KAAK,EAAE,WAAW;QAClB,QAAQ,EAAE,OAAO;QACjB,IAAI;QACJ,OAAO;QACP,KAAK,EAAE,EAAE;QACT,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;KAClC,CAAA;AACH,CAAC;AAGD,+DAA+D;AAC/D,iEAAiE;AACjE,qEAAqE;AACrE,sEAAsE;AACtE,wDAAwD;AACxD,qBAA4B,GAAQ;IAClC,oEAAoE;IACpE,kEAAkE;IAClE,4DAA4D;IAC5D,mEAAmE;IACnE,4CAA4C;IAC5C,MAAM,GAAG,GAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAC3B,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAA;AACvC,CAAC;AAGD,iEAAiE;AACjE,qEAAqE;AACrE,uEAAuE;AACvE,2DAA2D;AAC3D,uBAA8B,IAAS,EAAE,IAAY;IACnD,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAA;IAC7B,IAAI,EAAE,GAAQ,IAAI,CAAA;IAClB,IAAI,IAAI,GAAG,EAAE,CAAA;IACb,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAQ,IAAA,cAAQ,EAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QACpC,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACjB,IAAI,GAAG,IAAI,CAAA;YACX,MAAK;QACP,CAAC;QACD,EAAE,GAAG,IAAI,CAAA;IACX,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,KAAK,EAAE,EAAE,KAAK;QAC7B,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC;QACxC,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;IACpD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IACnC,OAAO,OAAO,CACZ,SAAS,EACT,QAAQ,CAAC,IAAI,CAAC,EACd,YAAY,IAAI,kCAAkC,EAClD,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,IAAI,GAAG,CAAC,CAAA;AACvD,CAAC;AAGD,mEAAmE;AACnE,aACE,GAAW,EAAE,IAAY,EAAE,IAAmB;IAC9C,MAAM,OAAO,GAAG,IAAI,IAAI,EAAE,CAAA;IAC1B,MAAM,IAAI,GAAc,OAAO,CAAC,IAAI,IAAI,MAAM,CAAA;IAE9C,MAAM,KAAK,GAAG,IAAI,aAAK,CACrB,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAA;IAC/D,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;IACxC,MAAM,SAAS,GAAG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAA;IAC3E,MAAM,IAAI,GAAQ,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,CAAC,CAAA;IAElD,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9D,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,CAAA;IAC7D,CAAC;IAED,MAAM,IAAI,GAAQ,IAAA,cAAQ,EAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IACtC,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;QACjB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAA;IACtE,CAAC;IAED,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB,mEAAmE;QACnE,mEAAmE;QACnE,kEAAkE;QAClE,6DAA6D;QAC7D,mEAAmE;QACnE,4DAA4D;QAC5D,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAA;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACzB,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAQ,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YAChC,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,GAAG,EAAE,EAAE;gBACP,QAAQ,EAAE,CAAC,OAAO,CAChB,GAAG,EAAE,GAAG,IAAI,QAAQ,EACpB,QAAQ,CAAC,IAAI,CAAC,EACd,GAAG,EAAE,GAAG,IAAI,yCAAyC,CAAC,CAAC;aAC1D,CAAA;QACH,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,IAAA,qBAAS,EAAC,GAAG,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;IAC3D,CAAC;IACD,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;IACvD,CAAC;IACD,OAAO;QACL,EAAE,EAAE,IAAI;QACR,GAAG,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,KAAK,IAAI,QAAQ,CAAC;QACnD,QAAQ,EAAE,EAAE;KACb,CAAA;AACH,CAAC;AAUD,qEAAqE;AACrE,qEAAqE;AACrE,2DAA2D;AAC3D,EAAE;AACF,sEAAsE;AACtE,sEAAsE;AACtE,0DAA0D;AAC1D,aACE,GAAW,EAAE,IAAY,EAAE,IAAmB;IAC9C,MAAM,OAAO,GAAG,IAAI,IAAI,EAAE,CAAA;IAC1B,MAAM,KAAK,GAAG,IAAI,aAAK,CACrB,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAA;IAC/D,MAAM,IAAI,GAAG,IAAI,uBAAU,EAAE,CAAA;IAC7B,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;IAC9C,MAAM,SAAS,GAAG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAA;IAE3E,gEAAgE;IAChE,iEAAiE;IACjE,kEAAkE;IAClE,iDAAiD;IACjD,MAAM,MAAM,GAAQ,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,CAAC,CAAA;IACpD,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,IAAI,MAAM,EAAE,CAAC;QACzC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,CAAA;IACpD,CAAC;IACD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;IAExB,MAAM,IAAI,GAAQ,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,CAAA;IACrD,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9D,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,CAAA;IACpD,CAAC;IAED,MAAM,IAAI,GAAQ,IAAA,cAAQ,EAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IACtC,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;QACjB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAA;IAC7D,CAAC;IAED,gEAAgE;IAChE,gEAAgE;IAChE,kEAAkE;IAClE,uBAAuB;IACvB,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAA;IAC7B,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;IAExB,OAAO;QACL,EAAE,EAAE,IAAI;QACR,MAAM,EAAE;YACN,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC;YACzB,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC;YACpB,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB;QACD,QAAQ,EAAE,EAAE;KACb,CAAA;AACH,CAAC"}

package/dist/reach.d.ts

@@ -0,0 +1,15 @@
+import type { VetFinding } from './vet';
+import type { TrustOptions } from './type';
+export type ReachVerdict = 'reaches' | 'unreachable' | 'error';
+export type ReachReport = {
+    verdict: ReachVerdict;
+    path?: string[];
+    errors?: VetFinding[];
+};
+export type ReachOptions = {
+    path?: string;
+    trust?: TrustOptions;
+    relation?: string;
+};
+export declare function parseNodePath(s: string): string[] | undefined;
+export declare function reachCheck(src: string, from: string, to: string, opts?: ReachOptions): ReachReport;

package/dist/reach.js

@@ -0,0 +1,168 @@
+"use strict";
+/* Copyright (c) 2025 Richard Rodger, MIT License */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.parseNodePath = parseNodePath;
+exports.reachCheck = reachCheck;
+// REACHABILITY OVER THE LINK GRAPH (the review's finding J,
+// use-cases/REVIEW.md): "ship a transitive `reaches(a, b)` check verb".
+//
+// `relations` answers questions about the edge set as a whole --- is it
+// acyclic, does every edge have its inverse, is every far end what the
+// relation says it is. This answers the question that needs the CLOSURE
+// rather than the edges: does anything `a` depends on, at any remove,
+// end up at `b`? That is the shape of every blast-radius question an
+// operator asks ("if the billing database goes, what falls over?") and
+// every containment question a policy asks ("nothing in the public tier
+// may reach the ledger"), and neither can be expressed by looking one
+// edge at a time.
+//
+// It is a VERB and not a constraint, for the same reason acyclicity is
+// (docs/reference-language.md, "Declared relations"): reachability is
+// global and non-monotone. One more edge can make an unreachable pair
+// reachable, so a lattice citizen asserting non-reachability could be
+// true and then false, and the lattice guarantee is that more
+// information never falsifies what has already been observed.
+//
+// TRANSITIVE, NOT REFLEXIVE-TRANSITIVE: `reaches(a, a)` is true only
+// when a path of one or more edges returns to `a`, which is the useful
+// answer (it says the graph has a cycle through `a`) rather than the
+// vacuous one.
+//
+// The Go twin is go/reach.go; what the two ports must agree on --- the
+// verdict and the path --- is test/spec/reach.tsv.
+const aontu_1 = require("./aontu");
+const vet_1 = require("./vet");
+const graph_1 = require("./graph");
+const keyorder_1 = require("./keyorder");
+// The segments a `$.dotted` endpoint spells, or undefined when it is
+// not one. Reachability is between TREE POSITIONS (ADR-014), so an
+// endpoint is a path and nothing else --- the same spelling the report
+// prints back.
+function parseNodePath(s) {
+    if ('$' === s) {
+        return [];
+    }
+    if (!s.startsWith('$.')) {
+        return undefined;
+    }
+    const parts = s.slice(2).split('.');
+    return parts.every((p) => /^[A-Za-z0-9_-]+$/.test(p)) ? parts : undefined;
+}
+// Whether a path names a node of the evaluated tree. An endpoint that
+// exists but has no edges is a perfectly good question with the answer
+// `unreachable`; only one that names NOTHING is an error.
+function nodeAt(root, path) {
+    let node = root;
+    for (const seg of path) {
+        if (true !== node?.isMap && true !== node?.isList) {
+            return false;
+        }
+        node = node.peg[seg];
+        if (null == node) {
+            return false;
+        }
+    }
+    return null != node;
+}
+function endpointFinding(name, known) {
+    return {
+        code: 'refer_unresolved',
+        class: 'reference',
+        severity: 'error',
+        path: '$',
+        // NOT "unreachable". An endpoint that names no node is a question
+        // the document cannot answer, and answering it `no` would report a
+        // typo as a fact about the model --- the fail-open shape this
+        // review exists to retire.
+        message: `${name} names no node in this document.`,
+        sites: [],
+        ...(0 === known.length ? {} : {
+            note: 'nodes with links: ' + known.join(', '),
+        }),
+    };
+}
+// The reachability check for one document.
+function reachCheck(src, from, to, opts) {
+    const options = opts ?? {};
+    const aontu = new aontu_1.Aontu(null == options.trust ? undefined : { trust: options.trust });
+    const ctx = aontu.ctx({ collect: true });
+    const parseOpts = null == options.path ? undefined : { path: options.path };
+    const root = aontu.unify(src, parseOpts, ctx);
+    // A document that does not stand up is not a document with an
+    // unreachable pair: the errors it already has are the answer.
+    if (0 < ctx.err.length || true === root?.isNil) {
+        return {
+            verdict: 'error',
+            errors: [(0, vet_1.failureFinding)(ctx, options.path, root)],
+        };
+    }
+    const graph = (0, graph_1.graphOf)(root);
+    // The nodes the graph actually touches, for the error note: a
+    // document has every path in it, and listing them all would drown the
+    // one fact a mistyped endpoint needs.
+    const linked = [...new Set(graph.edges
+            .flatMap((e) => [e.from, e.to]))].sort(keyorder_1.cmpCodePoint);
+    const missing = [from, to].filter((n) => {
+        const parts = parseNodePath(n);
+        return undefined === parts || !nodeAt(root, parts);
+    });
+    if (0 < missing.length) {
+        return {
+            verdict: 'error',
+            errors: missing.map((n) => endpointFinding(n, linked)),
+        };
+    }
+    // The successor map, restricted to one relation when the caller asked
+    // for one. Sorted, so the path the search finds is the same one in
+    // both ports.
+    const succ = new Map();
+    for (const e of graph.edges) {
+        if (null != options.relation && options.relation !== e.key) {
+            continue;
+        }
+        const list = succ.get(e.from);
+        const dest = e.to;
+        if (undefined === list) {
+            succ.set(e.from, [dest]);
+        }
+        else if (!list.includes(dest)) {
+            list.push(dest);
+        }
+    }
+    for (const list of succ.values()) {
+        list.sort(keyorder_1.cmpCodePoint);
+    }
+    // BREADTH-FIRST, so the path reported is a SHORTEST one --- the
+    // evidence an operator wants is the tightest chain, not whichever the
+    // walk happened to find first --- and, with the successors sorted, a
+    // determined one: among shortest paths, the first in code-point order
+    // at the first step that distinguishes them.
+    const prev = new Map();
+    const seen = new Set();
+    let front = [from];
+    while (0 < front.length) {
+        const next = [];
+        for (const node of front) {
+            for (const dest of succ.get(node) ?? []) {
+                if (dest === to) {
+                    const path = [dest];
+                    let step = node;
+                    while (step !== from) {
+                        path.unshift(step);
+                        step = prev.get(step);
+                    }
+                    path.unshift(from);
+                    return { verdict: 'reaches', path };
+                }
+                if (!seen.has(dest)) {
+                    seen.add(dest);
+                    prev.set(dest, node);
+                    next.push(dest);
+                }
+            }
+        }
+        front = next;
+    }
+    return { verdict: 'unreachable' };
+}
+//# sourceMappingURL=reach.js.map

package/dist/reach.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reach.js","sourceRoot":"","sources":["../src/reach.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;;AAEpD,4DAA4D;AAC5D,wEAAwE;AACxE,EAAE;AACF,wEAAwE;AACxE,uEAAuE;AACvE,wEAAwE;AACxE,sEAAsE;AACtE,qEAAqE;AACrE,uEAAuE;AACvE,wEAAwE;AACxE,sEAAsE;AACtE,kBAAkB;AAClB,EAAE;AACF,uEAAuE;AACvE,sEAAsE;AACtE,sEAAsE;AACtE,sEAAsE;AACtE,8DAA8D;AAC9D,8DAA8D;AAC9D,EAAE;AACF,qEAAqE;AACrE,uEAAuE;AACvE,qEAAqE;AACrE,eAAe;AACf,EAAE;AACF,uEAAuE;AACvE,mDAAmD;AAEnD,mCAA+B;AAC/B,+BAAsC;AAGtC,mCAAiC;AACjC,yCAAyC;AAiCzC,qEAAqE;AACrE,mEAAmE;AACnE,uEAAuE;AACvE,eAAe;AACf,uBAA8B,CAAS;IACrC,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;QACd,OAAO,EAAE,CAAA;IACX,CAAC;IACD,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IACnC,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAA;AAC3E,CAAC;AAGD,sEAAsE;AACtE,uEAAuE;AACvE,0DAA0D;AAC1D,SAAS,MAAM,CAAC,IAAS,EAAE,IAAc;IACvC,IAAI,IAAI,GAAQ,IAAI,CAAA;IACpB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,IAAI,KAAK,IAAI,EAAE,KAAK,IAAI,IAAI,KAAK,IAAI,EAAE,MAAM,EAAE,CAAC;YAClD,OAAO,KAAK,CAAA;QACd,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACpB,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACjB,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IACD,OAAO,IAAI,IAAI,IAAI,CAAA;AACrB,CAAC;AAGD,SAAS,eAAe,CAAC,IAAY,EAAE,KAAe;IACpD,OAAO;QACL,IAAI,EAAE,kBAAkB;QACxB,KAAK,EAAE,WAAW;QAClB,QAAQ,EAAE,OAAO;QACjB,IAAI,EAAE,GAAG;QACT,kEAAkE;QAClE,mEAAmE;QACnE,8DAA8D;QAC9D,2BAA2B;QAC3B,OAAO,EAAE,GAAG,IAAI,kCAAkC;QAClD,KAAK,EAAE,EAAE;QACT,GAAG,CAAC,CAAC,KAAK,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,IAAI,EAAE,oBAAoB,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;SAC9C,CAAC;KACH,CAAA;AACH,CAAC;AAGD,2CAA2C;AAC3C,oBACE,GAAW,EAAE,IAAY,EAAE,EAAU,EAAE,IAAmB;IAE1D,MAAM,OAAO,GAAG,IAAI,IAAI,EAAE,CAAA;IAC1B,MAAM,KAAK,GAAG,IAAI,aAAK,CACrB,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAA;IAC/D,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;IACxC,MAAM,SAAS,GAAG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAA;IAC3E,MAAM,IAAI,GAAQ,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,CAAC,CAAA;IAElD,8DAA8D;IAC9D,8DAA8D;IAC9D,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,CAAC;QAC/C,OAAO;YACL,OAAO,EAAE,OAAO;YAChB,MAAM,EAAE,CAAC,IAAA,oBAAc,EAAC,GAAG,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SAClD,CAAA;IACH,CAAC;IAED,MAAM,KAAK,GAAG,IAAA,eAAO,EAAC,IAAI,CAAC,CAAA;IAC3B,8DAA8D;IAC9D,sEAAsE;IACtE,sCAAsC;IACtC,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK;aACnC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;IACtD,MAAM,OAAO,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACtC,MAAM,KAAK,GAAG,aAAa,CAAC,CAAC,CAAC,CAAA;QAC9B,OAAO,SAAS,KAAK,KAAK,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IACpD,CAAC,CAAC,CAAA;IACF,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QACvB,OAAO;YACL,OAAO,EAAE,OAAO;YAChB,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SACvD,CAAA;IACH,CAAC;IAED,sEAAsE;IACtE,mEAAmE;IACnE,cAAc;IACd,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAA;IACxC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,IAAI,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,QAAQ,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;YAC3D,SAAQ;QACV,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAC7B,MAAM,IAAI,GAAG,CAAC,CAAC,EAAE,CAAA;QACjB,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAA;QAC1B,CAAC;aACI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACjB,CAAC;IACH,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;IACzB,CAAC;IAED,gEAAgE;IAChE,sEAAsE;IACtE,qEAAqE;IACrE,sEAAsE;IACtE,6CAA6C;IAC7C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;IACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,IAAI,KAAK,GAAa,CAAC,IAAI,CAAC,CAAA;IAC5B,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACxB,MAAM,IAAI,GAAa,EAAE,CAAA;QACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBACxC,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;oBAChB,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAA;oBACnB,IAAI,IAAI,GAAG,IAAI,CAAA;oBACf,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;wBACrB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;wBAClB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAW,CAAA;oBACjC,CAAC;oBACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;oBAClB,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,CAAA;gBACrC,CAAC;gBACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACpB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;oBACd,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;oBACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,GAAG,IAAI,CAAA;IACd,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,CAAA;AACnC,CAAC"}

package/dist/relation.d.ts

@@ -0,0 +1,23 @@
+import type { VetFinding } from './vet';
+import type { TrustOptions } from './type';
+import type { Graph } from './graph';
+import type { RelDecl } from './val/GraphAtomVal';
+export type RelationVerdict = 'pass' | 'fail' | 'error';
+export type RelationFinding = {
+    code: string;
+    relation: string;
+    at: string;
+    detail: string[];
+};
+export type RelationReport = {
+    verdict: RelationVerdict;
+    findings: RelationFinding[];
+    errors?: VetFinding[];
+};
+export type RelationOptions = {
+    path?: string;
+    trust?: TrustOptions;
+};
+export declare function relationFindings(decls: Map<string, RelDecl>, graph: Graph): RelationFinding[];
+export declare function relationErrors(ctx: any, root: any): void;
+export declare function relationCheck(src: string, opts?: RelationOptions): RelationReport;