aontu 0.52.1 → 0.54.0

package/dist/subsume.js

@@ -0,0 +1,573 @@
+"use strict";
+/* Copyright (c) 2025 Richard Rodger, MIT License */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.effectiveDefault = effectiveDefault;
+exports.subsumeNode = subsumeNode;
+exports.subsume = subsume;
+const aontu_1 = require("./aontu");
+const vet_1 = require("./vet");
+const hcanon_1 = require("./hcanon");
+const ConstraintVal_1 = require("./val/ConstraintVal");
+const ScalarKindVal_1 = require("./val/ScalarKindVal");
+const PathVal_1 = require("./val/PathVal");
+const PrefVal_1 = require("./val/PrefVal");
+const DEFAULT_GENERAL_URL = 'general';
+const DEFAULT_SPECIFIC_URL = 'specific';
+function pathText(path) {
+    return '$' + (0 < path.length ? '.' + path.join('.') : '');
+}
+// Every recorded operand is a real evaluated Val or the sited topLike
+// stand-in, so no null guards: a Val's site is always an object, and a
+// value parsed without a usable frame (a disjunct, say) already carries
+// the -1 coordinates in it.
+function siteOf(v, role, url) {
+    return {
+        file: url,
+        row: v.site.row,
+        col: v.site.col,
+        len: v.site.len,
+        role: role,
+        src: v.site.src,
+        value: v.canon,
+    };
+}
+// One finding: general and specific sites (general first — it is the
+// contract being weakened or broken), canons as expected/actual.
+function record(state, code, path, g, s, message) {
+    state.findings.push({
+        code,
+        class: 'compat',
+        severity: 'error',
+        path: pathText(path),
+        message,
+        sites: [
+            siteOf(g, 'general', state.generalUrl),
+            siteOf(s, 'specific', state.specificUrl),
+        ],
+        expected: g.canon,
+        actual: s.canon,
+    });
+}
+// The admission view of a value under a profile: a BARE preference
+// admits what its superior admits (the engine's own PrefVal.superpeg
+// semantics, and the docs' "a bare preference is gated by kind"); the
+// default itself is compared separately, by the `defaults` and `gen`
+// profiles.
+function admission(v) {
+    return true === v?.isPref ? v.superpeg : v;
+}
+// A PREFERRED BRANCH CONTRIBUTES EXACTLY ITS OWN VALUE (ADR-004). The
+// admission gate made that the engine's rule -- `*'auto'|'literal'|'data'`
+// admits those three strings and nothing else -- and the subsumption
+// walk kept comparing a pref MEMBER by its kind superior, the
+// pre-ADR-004 reading. So a disjunction with a default did not subsume
+// ITSELF: every member of the specific side widened to `string`, which
+// no general member admits, and the walk answered the distribution
+// case. `aontu_policy: hide({compat: *backward|forward|full|none})` --
+// the verbatim idiom from reference-api.md -- failed self-subsumption
+// under --profile gen (use-cases/BUGS.md §29).
+//
+// Only for a member of a disjunction: a bare `*x` standing alone is
+// still gated by kind, which is the rule above and the documented one.
+function memberAdmission(v) {
+    return true === v?.isPref ? (0, PrefVal_1.prefInnerPeg)(v) : v;
+}
+// The effective default of a value, or undefined when it has none, or
+// 'indeterminate' when equal-rank preferences disagree (which the
+// engine itself refuses only at generation).
+// Exported (with subsumeNode) for the default-validity lint in
+// ts/src/vet.ts (G3 phase 5): the lint asks exactly this walk's two
+// questions — what is the effective default, and does a member admit
+// it.
+function effectiveDefault(v) {
+    // EVERY pref layer is unwrapped (prefInnerPeg), not just one: a
+    // ranked default's effective value is the innermost peg — `**member`
+    // generates "member" exactly as `*member` does (the rank-uniform
+    // meet, ADR-004). The one-layer unwrap left a rank-2 default wearing
+    // a `*`-wrapper no plain alternative subsumes, which is the
+    // pref_not_instance lint's ranked false positive of
+    // use-cases/BUGS.md §4 (`**member|member|admin|owner` warned while
+    // generating a value its own branch admits).
+    if (true === v?.isPref) {
+        return (0, PrefVal_1.prefInnerPeg)(v);
+    }
+    if (true === v?.isDisjunct && Array.isArray(v.peg)) {
+        const prefs = v.peg.filter((m) => true === m?.isPref);
+        if (0 === prefs.length) {
+            return undefined;
+        }
+        // Generation picks the LOWEST rank (`a:**1|*2` generates 2 —
+        // test/spec/edge.tsv), so the effective default does too.
+        const minRank = Math.min(...prefs.map((p) => p.rank));
+        const top = prefs.filter((p) => p.rank === minRank);
+        const first = (0, PrefVal_1.prefInnerPeg)(top[0]);
+        for (const p of top.slice(1)) {
+            if (!first.same?.((0, PrefVal_1.prefInnerPeg)(p))) {
+                return 'indeterminate';
+            }
+        }
+        return first;
+    }
+    return undefined;
+}
+// Is this evaluated value concrete enough to serve as a witness — a
+// value that certainly IS an instance of the specific side?
+function isConcrete(v) {
+    if (true === v?.isScalar) {
+        return true;
+    }
+    if ((true === v?.isMap || true === v?.isList) && null != v.peg) {
+        const children = Array.isArray(v.peg) ? v.peg : Object.values(v.peg);
+        return children.every((c) => isConcrete(c));
+    }
+    return false;
+}
+// Unresolved residue makes the relation undecidable at this node:
+// references, variables, unreduced conjuncts and functions have no
+// admitted set to compare.
+function unresolved(v) {
+    return true === v?.isRef || true === v?.isVar ||
+        true === v?.isConjunct || true === v?.isExpect ||
+        (true === v?.isFunc && true !== v?.isConstraint);
+}
+// Exported for the defensive-arm unit test (ADR-002,
+// ts/test/coverage3.test.ts): the no-rule fold at the walk's tail is
+// unreachable through subsume() today — the ladder is total for every
+// evaluated former — and the walk is otherwise private.
+function subsumeNode(state, path, g0, s0) {
+    const g = admission(g0);
+    const s = admission(s0);
+    // Marks change the OUTPUT shape, not the admitted set: only the `gen`
+    // profile reports them, and only when they differ on corresponding
+    // nodes.
+    if ('gen' === state.profile && true !== state.distributing &&
+        (!!g?.mark?.type !== !!s?.mark?.type ||
+            !!g?.mark?.hide !== !!s?.mark?.hide)) {
+        record(state, 'compat_marks_changed', path, g, s, 'marks differ: general ' + JSON.stringify(g?.mark) +
+            ', specific ' + JSON.stringify(s?.mark));
+        return 'no';
+    }
+    // TOP admits everything. There is no nil rule: an error-free
+    // evaluated document carries no nil (failing disjunct members are
+    // discarded, every other nil collects an error, and subsume() answers
+    // `error` for a source that does not stand alone), so a nil handed to
+    // the walk by a future caller falls to the no-rule fold below —
+    // `undecided`, the safe direction.
+    if (true === g?.isTop) {
+        return 'yes';
+    }
+    if (unresolved(g) || unresolved(s)) {
+        // REFLEXIVITY IS A LAW, not a rule the ladder gets to skip. Every
+        // value admits itself, residue included: the set admitted by
+        // `integer & min(0)` is exactly the set admitted by
+        // `integer & min(0)`. Without this, a constraint inside a spread
+        // template made a contract non-SELF-subsumable -- expected and
+        // actual byte-identical, verdict `undecided` -- so `breaking` on
+        // the documented close-per-entry idiom hard-failed reflexivity and
+        // had to run --allow-undecided, which then masks the genuine
+        // undecideds it exists to surface (use-cases/BUGS.md §28).
+        //
+        // Identity is the HASH FORM, not the canon: canon drops closedness
+        // and the marks, so `close({a:1})` and `{a:1}` share a canon while
+        // admitting different sets. Computed only on this branch, where
+        // the answer would otherwise be undecided, so the hot path is
+        // untouched.
+        if ((0, hcanon_1.hcanon)(g) === (0, hcanon_1.hcanon)(s)) {
+            return 'yes';
+        }
+        record(state, 'sub_unresolved', path, g, s, 'unresolved residue: the admitted set is not comparable');
+        return 'undecided';
+    }
+    // Disjunctions. General side first: a specific member must be
+    // subsumed by SOME general member; member-wise failure is not proof
+    // (the distribution case), so a concrete failing member becomes the
+    // witness and anything else is honestly undecided.
+    if (true === s?.isDisjunct) {
+        let out = 'yes';
+        for (const raw of s.peg) {
+            const member = memberAdmission(raw);
+            const trial = trialSubsume(state, path, g, member);
+            if ('yes' !== trial) {
+                if (isConcrete(admission(member))) {
+                    record(state, 'compat_narrowed', path, g, member, 'a specific alternative is not admitted by the general value');
+                    return 'no';
+                }
+                record(state, 'sub_disjunct_distribution', path, g, member, 'a specific alternative is not admitted member-wise, and no' +
+                    ' concrete counterexample settles the distribution case');
+                out = 'undecided';
+            }
+        }
+        return out;
+    }
+    if (true === g?.isDisjunct) {
+        for (const raw of g.peg) {
+            if ('yes' === trialSubsume(state, path, memberAdmission(raw), s)) {
+                return 'yes';
+            }
+        }
+        if (isConcrete(s)) {
+            record(state, 'compat_narrowed', path, g, s, 'no general alternative admits the specific value');
+            return 'no';
+        }
+        record(state, 'sub_disjunct_distribution', path, g, s, 'no general alternative admits the specific value member-wise,' +
+            ' and no concrete counterexample settles the distribution case');
+        return 'undecided';
+    }
+    // Scalar kinds: a kind subsumes its scalars, narrower kinds, and the
+    // constraint residuals of its domain.
+    if (true === g?.isScalarKind) {
+        if (true === s?.isScalarKind) {
+            if (g.peg === s.peg || (0, ScalarKindVal_1.kindSubsumes)(g.peg, s.peg)) {
+                return 'yes';
+            }
+            record(state, 'compat_narrowed', path, g, s, 'the general kind does not admit the specific kind');
+            return 'no';
+        }
+        if (true === s?.isScalar) {
+            const leaf = s.superior?.();
+            if (true === leaf?.isScalarKind &&
+                (g.peg === leaf.peg || (0, ScalarKindVal_1.kindSubsumes)(g.peg, leaf.peg))) {
+                return 'yes';
+            }
+            record(state, 'compat_narrowed', path, g, s, 'the general kind does not admit the specific scalar');
+            return 'no';
+        }
+        if (true === s?.isConstraint) {
+            // A kind covers a residual of its own domain: `number` admits any
+            // numeric residual (the supertype admits every leaf a bound can
+            // pin), a numeric LEAF kind admits only a residual pinned to that
+            // leaf, and `string` admits any pattern residual. A residual with
+            // no domain (sizing-only) admits containers no kind covers.
+            const dom = s.domain;
+            const skind = s.kind;
+            if ('number' === dom &&
+                (Number === g.peg ||
+                    (null != skind && (0, ScalarKindVal_1.kindSubsumes)(g.peg, skind)))) {
+                return 'yes';
+            }
+            if ('string' === dom && String === g.peg) {
+                return 'yes';
+            }
+            record(state, 'compat_narrowed', path, g, s, 'the general kind does not cover the specific residual');
+            return 'no';
+        }
+        record(state, 'compat_narrowed', path, g, s, 'the general kind admits no such value');
+        return 'no';
+    }
+    // Container kinds (docs/design/PATHS.0.md): `map()` subsumes every
+    // map and itself, `list()` every list. The unit literals (`{}`,
+    // `[]`) already subsume through the container rules; only the kind
+    // former needs an arm.
+    if (true === g?.isContainerKind) {
+        const ga = g;
+        const sa = s;
+        if ((true === ga.isMapKind && (true === sa?.isMap || true === sa?.isMapKind))
+            || (true === ga.isListKind && (true === sa?.isList || true === sa?.isListKind))) {
+            return 'yes';
+        }
+        record(state, 'compat_narrowed', path, g, s, 'the general container kind admits no such value');
+        return 'no';
+    }
+    // Constraint residuals.
+    if (true === g?.isConstraint) {
+        if (true === s?.isConstraint) {
+            const r = (0, ConstraintVal_1.constraintSubsumesConstraint)(g, s);
+            if (true === r) {
+                return 'yes';
+            }
+            if ('undecided' === r) {
+                record(state, 'sub_evaluate_only', path, g, s, 'an evaluate-only check (must) makes the admitted set opaque');
+                return 'undecided';
+            }
+            record(state, 'compat_narrowed', path, g, s, 'the general residual does not contain the specific residual');
+            return 'no';
+        }
+        if (true === s?.isScalar) {
+            const r = (0, ConstraintVal_1.constraintAdmitsScalar)(g, s);
+            if (true === r) {
+                return 'yes';
+            }
+            if ('undecided' === r) {
+                record(state, 'sub_evaluate_only', path, g, s, 'an evaluate-only check (must) makes the admitted set opaque');
+                return 'undecided';
+            }
+            record(state, 'compat_narrowed', path, g, s, 'the general residual does not admit the specific scalar');
+            return 'no';
+        }
+        record(state, 'compat_narrowed', path, g, s, 'the general residual constrains a domain the specific value is not in');
+        return 'no';
+    }
+    // Concrete scalars subsume only themselves (identity compares kind
+    // as well as value) -- except paths, whose meet is the prefix rule
+    // (ADR-016): a prefix admits every extension of itself, so it
+    // subsumes one, exactly as the meet answers the longer.
+    if (true === g?.isScalar) {
+        if (true === g.isPath && true === s?.isPath &&
+            (0, PathVal_1.prefixMeet)(g.peg, s.peg) === s.peg) {
+            return 'yes';
+        }
+        if (true === s?.isScalar && true === g.same?.(s)) {
+            return 'yes';
+        }
+        record(state, 'compat_narrowed', path, g, s, 'a concrete value subsumes only itself');
+        return 'no';
+    }
+    // Maps.
+    if (true === g?.isMap) {
+        if (true !== s?.isMap) {
+            record(state, 'compat_narrowed', path, g, s, 'the general value is a map and the specific value is not');
+            return 'no';
+        }
+        return subsumeBag(state, path, g, s, Object.keys(g.peg), Object.keys(s.peg), (v, k) => v.peg[k]);
+    }
+    // Lists: element-wise by position; the same required/optional shape
+    // as maps, with positions as keys.
+    if (true === g?.isList) {
+        if (true !== s?.isList) {
+            record(state, 'compat_narrowed', path, g, s, 'the general value is a list and the specific value is not');
+            return 'no';
+        }
+        const gk = g.peg.map((_, i) => '' + i);
+        const sk = s.peg.map((_, i) => '' + i);
+        return subsumeBag(state, path, g, s, gk, sk, (v, k) => v.peg[Number(k)]);
+    }
+    // THE LADDER IS NOT TOTAL, and the formers that fall past it are the
+    // ones the evaluator MEANS to leave standing: a recursion, a
+    // relation and its graph atom, a `refer()` target constraint. None
+    // of them describes a set of values a structural walk can compare,
+    // so `undecided` is the honest answer for two DIFFERENT ones.
+    //
+    // For two IDENTICAL ones it is not. REFLEXIVITY IS A LAW -- every
+    // value admits itself -- and identity is the HASH FORM, the same
+    // rule the unresolved branch above applies and for the same reason:
+    // it costs nothing, because it runs only where the answer would
+    // otherwise be `undecided`. Without it a document that declares a
+    // relation, shares a template by reference or alias, or recurses did
+    // not subsume ITSELF, so `breaking` on the idiom the language exists
+    // for hard-failed and had to run --allow-undecided, which masks the
+    // genuine undecideds it exists to surface (use-cases/BUGS.md 64,
+    // and 28 before it).
+    //
+    // A NIL is the exception, and the reason the law is spelled here
+    // rather than in `unresolved`: a nil is not a value, so it admits
+    // nothing, itself included.
+    if (true !== g?.isNil && true !== s?.isNil && (0, hcanon_1.hcanon)(g) === (0, hcanon_1.hcanon)(s)) {
+        return 'yes';
+    }
+    record(state, 'sub_unresolved', path, g, s, 'no subsumption rule covers this pair of value formers');
+    return 'undecided';
+}
+// Maps and lists share one shape: required keys of the general side
+// must be required in the specific side and subsume; optional keys
+// compare when present; closedness bounds the specific key set; spread
+// templates govern the specific side's surplus.
+function subsumeBag(state, path, g, s, gKeys, sKeys, child) {
+    let out = 'yes';
+    const worse = (r) => {
+        if ('no' === r || ('undecided' === r && 'no' !== out)) {
+            out = 'no' === r ? 'no' : 'undecided';
+        }
+    };
+    // Always arrays on an evaluated bag (BagVal initialises them).
+    const gOptional = g.optionalKeys;
+    const sOptional = s.optionalKeys;
+    for (const k of gKeys) {
+        const gChild = child(g, k);
+        const has = sKeys.includes(k);
+        const optional = gOptional.includes(k);
+        if (!has) {
+            if (optional) {
+                continue;
+            }
+            record(state, 'compat_required_added', [...path, k], gChild, s, 'the general value requires this key; the specific value admits' +
+                ' instances without it');
+            worse('no');
+            continue;
+        }
+        if (!optional && sOptional.includes(k)) {
+            record(state, 'compat_required_added', [...path, k], gChild, child(s, k), 'the general value requires this key; the specific value makes' +
+                ' it optional, so instances without it are admitted');
+            worse('no');
+            continue;
+        }
+        worse(subsumeNode(state, [...path, k], gChild, child(s, k)));
+    }
+    // Closedness: a closed general bag admits only key sets it declares,
+    // so the specific side must be closed and inside it.
+    if (true === g.closed) {
+        if (true !== s.closed) {
+            record(state, 'compat_narrowed', path, g, s, 'the general value is closed; the open specific value admits' +
+                ' surplus keys');
+            worse('no');
+        }
+        else {
+            for (const k of sKeys) {
+                if (!gKeys.includes(k)) {
+                    record(state, 'compat_narrowed', [...path, k], g, child(s, k), 'the closed general value does not declare this key');
+                    worse('no');
+                }
+            }
+        }
+    }
+    // Spread templates: a path-dependent template's meaning depends on
+    // where it lands, which no structural comparison can decide -- UNLESS
+    // the two templates are the same template. REFLEXIVITY IS A LAW and
+    // identity is the HASH FORM (the same rule the unresolved branch of
+    // subsumeNode applies): two byte-identical templates admit the same
+    // set wherever they land, so a document with a reference- or
+    // alias-valued template subsumes itself, and the comparison either
+    // side of the template is decided on its own merits rather than
+    // dragged to `undecided` (use-cases/BUGS.md 64). Where they are NOT
+    // identical, nothing structural can decide them and the fold stands.
+    const gcj = g.spread?.cj;
+    const scj = s.spread?.cj;
+    if (null != gcj || null != scj) {
+        const sameTemplate = null != gcj && null != scj && (0, hcanon_1.hcanon)(gcj) === (0, hcanon_1.hcanon)(scj);
+        if (!sameTemplate &&
+            (true === gcj?.isPathDependent || true === scj?.isPathDependent)) {
+            record(state, 'sub_path_dependent_spread', path, gcj ?? g, scj ?? s, 'a path-dependent spread template cannot be compared structurally');
+            worse('undecided');
+        }
+        else if (null != gcj) {
+            // The general template governs the specific side's surplus keys
+            // and its template.
+            for (const k of sKeys) {
+                if (!gKeys.includes(k)) {
+                    worse(subsumeNode(state, [...path, k], gcj, child(s, k)));
+                }
+            }
+            worse(subsumeNode(state, [...path, '&'], gcj, scj ?? topLike()));
+        }
+        // A specific-only template narrows the specific side; nothing for
+        // the (unconstrained) general side to refuse.
+    }
+    return out;
+}
+// A stand-in TOP for "the specific side leaves this unconstrained".
+let topVal;
+function topLike() {
+    if (null == topVal) {
+        // A full site, not a partial one: `len` and `src` are as much part
+        // of the shape as row and col, and leaving them undefined dropped
+        // both keys from the emitted report — so this stand-in was the one
+        // site in either port with no `len` at all, and the Go twin (which
+        // has no undefined) disagreed. It occupies no source, so the values
+        // are the "unknown" ones.
+        topVal = {
+            isTop: true, canon: 'top',
+            site: { row: -1, col: -1, len: -1, src: '' },
+        };
+    }
+    return topVal;
+}
+// A trial comparison whose findings are DISCARDED: disjunct
+// member-matching asks many "would this member do?" questions, and only
+// the aggregated outcome is a finding.
+// A DISTRIBUTION TRIAL IS NOT A NODE CORRESPONDENCE. It asks whether
+// one ALTERNATIVE of one side admits one alternative of the other,
+// which is a question about admitted sets; the two values it compares
+// are not the same node of the two documents. The `gen` profile's mark
+// rule is a correspondence question -- did a field that used to be
+// generated become hidden -- and firing it here compared a whole
+// disjunction (carrying its enclosing bag's mark) against a member
+// extracted out of one (which does not), so `hide({c: *a|b})` stopped
+// subsuming ITSELF under --profile gen (use-cases/BUGS.md §29). The
+// enclosing node's marks are compared where they correspond: at that
+// node, by the ordinary walk.
+function trialSubsume(state, path, g, s) {
+    const trial = { ...state, findings: [], distributing: true };
+    return subsumeNode(trial, path, g, s);
+}
+// The defaults comparison (the `defaults` and `gen` profiles): the
+// specific side's effective default must survive into the general side
+// unchanged. Adding a default where none existed is compatible;
+// changing or removing one is not (removal turns previously generable
+// documents incomplete).
+function subsumeDefaults(state, path, g, s) {
+    const sd = effectiveDefault(s);
+    if (undefined === sd) {
+        return 'yes';
+    }
+    const gd = effectiveDefault(g);
+    if ('indeterminate' === sd || 'indeterminate' === gd) {
+        record(state, 'sub_default_indeterminate', path, g, s, 'equal-rank preferences disagree, so the effective default is' +
+            ' not a single value');
+        return 'undecided';
+    }
+    if (undefined === gd || true !== gd.same?.(sd)) {
+        record(state, 'compat_default_changed', path, g, s, 'the effective default changed: previously generable documents' +
+            ' materialise differently or become incomplete');
+        return 'no';
+    }
+    return 'yes';
+}
+// Walk both trees for default agreement wherever the specific side has
+// one: at the node itself and inside every corresponding bag child.
+function subsumeDefaultsWalk(state, path, g, s) {
+    let out = subsumeDefaults(state, path, g, s);
+    const gm = true === g?.isMap ? g.peg : undefined;
+    const sm = true === s?.isMap ? s.peg : undefined;
+    if (null != gm && null != sm) {
+        for (const k of Object.keys(sm)) {
+            if (null != gm[k]) {
+                const r = subsumeDefaultsWalk(state, [...path, k], gm[k], sm[k]);
+                if ('no' === r || ('undecided' === r && 'no' !== out)) {
+                    out = 'no' === r ? 'no' : 'undecided';
+                }
+            }
+        }
+    }
+    return out;
+}
+/**
+ * Does `generalSrc` subsume `specificSrc` — is every instance the
+ * specific admits admitted by the general too?
+ *
+ * Both sources are evaluated fresh (single-use trees make this
+ * mandatory), and the recursion runs on the finished values. The
+ * verdict is three-valued plus `error` (a source that does not stand up
+ * on its own, mirroring vet's schema-error verdict); findings reuse
+ * G2's object with class `compat`.
+ */
+function subsume(generalSrc, specificSrc, opts) {
+    const options = opts ?? {};
+    const profile = options.profile ?? 'defaults';
+    const state = {
+        profile,
+        findings: [],
+        generalUrl: options.generalUrl ?? DEFAULT_GENERAL_URL,
+        specificUrl: options.specificUrl ?? DEFAULT_SPECIFIC_URL,
+    };
+    const load = (src, path) => {
+        const aontu = new aontu_1.Aontu(null == options.trust ? undefined : { trust: options.trust });
+        const ctx = aontu.ctx({ collect: true });
+        const v = aontu.unify(src, null == path ? undefined : { path }, ctx);
+        if (0 < ctx.err.length || true === v?.isNil) {
+            return undefined;
+        }
+        return v;
+    };
+    let g = load(generalSrc, options.generalPath);
+    let s = load(specificSrc, options.specificPath);
+    if (null == g || null == s) {
+        return { verdict: 'error', findings: [] };
+    }
+    if (null != options.at) {
+        g = (0, vet_1.anchorAt)(g, options.at);
+        s = (0, vet_1.anchorAt)(s, options.at);
+        if (null == g || null == s) {
+            return { verdict: 'error', findings: [] };
+        }
+    }
+    let out = subsumeNode(state, [], g, s);
+    if ('values' !== profile) {
+        const d = subsumeDefaultsWalk(state, [], g, s);
+        if ('no' === d || ('undecided' === d && 'no' !== out)) {
+            out = 'no' === d ? 'no' : 'undecided';
+        }
+    }
+    const verdict = 'no' === out ? 'does_not_subsume' :
+        'undecided' === out ? 'undecided' : 'subsumes';
+    return { verdict, findings: state.findings };
+}
+//# sourceMappingURL=subsume.js.map

package/dist/subsume.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subsume.js","sourceRoot":"","sources":["../src/subsume.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;;;AAyBpD,mCAA+B;AAC/B,+BAAgC;AAChC,qCAAiC;AAEjC,uDAG4B;AAC5B,uDAAkD;AAClD,2CAA0C;AAC1C,2CAA4C;AA8B5C,MAAM,mBAAmB,GAAG,SAAS,CAAA;AACrC,MAAM,oBAAoB,GAAG,UAAU,CAAA;AAmBvC,SAAS,QAAQ,CAAC,IAAc;IAC9B,OAAO,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;AAC5D,CAAC;AAGD,sEAAsE;AACtE,uEAAuE;AACvE,wEAAwE;AACxE,4BAA4B;AAC5B,SAAS,MAAM,CAAC,CAAM,EAAE,IAAY,EAAE,GAAW;IAC/C,OAAO;QACL,IAAI,EAAE,GAAG;QACT,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG;QACf,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG;QACf,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG;QACf,IAAI,EAAE,IAAW;QACjB,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG;QACf,KAAK,EAAE,CAAC,CAAC,KAAK;KACf,CAAA;AACH,CAAC;AAGD,qEAAqE;AACrE,iEAAiE;AACjE,SAAS,MAAM,CACb,KAAe,EAAE,IAAY,EAAE,IAAc,EAC7C,CAAM,EAAE,CAAM,EAAE,OAAe;IAE/B,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;QAClB,IAAI;QACJ,KAAK,EAAE,QAAQ;QACf,QAAQ,EAAE,OAAO;QACjB,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC;QACpB,OAAO;QACP,KAAK,EAAE;YACL,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,UAAU,CAAC;YACtC,MAAM,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,CAAC,WAAW,CAAC;SACzC;QACD,QAAQ,EAAE,CAAC,CAAC,KAAK;QACjB,MAAM,EAAE,CAAC,CAAC,KAAK;KAChB,CAAC,CAAA;AACJ,CAAC;AAGD,mEAAmE;AACnE,qEAAqE;AACrE,sEAAsE;AACtE,qEAAqE;AACrE,YAAY;AACZ,SAAS,SAAS,CAAC,CAAM;IACvB,OAAO,IAAI,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;AAC5C,CAAC;AAGD,sEAAsE;AACtE,2EAA2E;AAC3E,qEAAqE;AACrE,8DAA8D;AAC9D,uEAAuE;AACvE,uEAAuE;AACvE,mEAAmE;AACnE,uEAAuE;AACvE,sEAAsE;AACtE,+CAA+C;AAC/C,EAAE;AACF,oEAAoE;AACpE,uEAAuE;AACvE,SAAS,eAAe,CAAC,CAAM;IAC7B,OAAO,IAAI,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAA,sBAAY,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACjD,CAAC;AAGD,sEAAsE;AACtE,kEAAkE;AAClE,6CAA6C;AAC7C,+DAA+D;AAC/D,oEAAoE;AACpE,qEAAqE;AACrE,MAAM;AACN,0BAAiC,CAAM;IACrC,gEAAgE;IAChE,qEAAqE;IACrE,iEAAiE;IACjE,qEAAqE;IACrE,4DAA4D;IAC5D,oDAAoD;IACpD,mEAAmE;IACnE,6CAA6C;IAC7C,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QACvB,OAAO,IAAA,sBAAY,EAAC,CAAC,CAAC,CAAA;IACxB,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,EAAE,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACnD,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,MAAM,CAAC,CAAA;QAC1D,IAAI,CAAC,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;YACvB,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,6DAA6D;QAC7D,0DAA0D;QAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;QAC1D,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAA;QACxD,MAAM,KAAK,GAAQ,IAAA,sBAAY,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACvC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7B,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAA,sBAAY,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnC,OAAO,eAAe,CAAA;YACxB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC;AAGD,oEAAoE;AACpE,4DAA4D;AAC5D,SAAS,UAAU,CAAC,CAAM;IACxB,IAAI,IAAI,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC;QACzB,OAAO,IAAI,CAAA;IACb,CAAC;IACD,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE,KAAK,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;QAC/D,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACpE,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;IAClD,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAGD,kEAAkE;AAClE,mEAAmE;AACnE,2BAA2B;AAC3B,SAAS,UAAU,CAAC,CAAM;IACxB,OAAO,IAAI,KAAK,CAAC,EAAE,KAAK,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK;QAC3C,IAAI,KAAK,CAAC,EAAE,UAAU,IAAI,IAAI,KAAK,CAAC,EAAE,QAAQ;QAC9C,CAAC,IAAI,KAAK,CAAC,EAAE,MAAM,IAAI,IAAI,KAAK,CAAC,EAAE,YAAY,CAAC,CAAA;AACpD,CAAC;AAGD,qDAAqD;AACrD,qEAAqE;AACrE,sEAAsE;AACtE,wDAAwD;AACxD,qBACE,KAAe,EAAE,IAAc,EAAE,EAAO,EAAE,EAAO;IAEjD,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,CAAA;IACvB,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,CAAA;IAEvB,sEAAsE;IACtE,mEAAmE;IACnE,SAAS;IACT,IAAI,KAAK,KAAK,KAAK,CAAC,OAAO,IAAI,IAAI,KAAK,KAAK,CAAC,YAAY;QACxD,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI;YAClC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,CAAC,KAAK,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAC9C,wBAAwB,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC;YAClD,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAA;QAC1C,OAAO,IAAI,CAAA;IACb,CAAC;IAED,6DAA6D;IAC7D,kEAAkE;IAClE,sEAAsE;IACtE,sEAAsE;IACtE,gEAAgE;IAChE,mCAAmC;IACnC,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;QACtB,OAAO,KAAK,CAAA;IACd,CAAC;IAED,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;QACnC,kEAAkE;QAClE,6DAA6D;QAC7D,oDAAoD;QACpD,iEAAiE;QACjE,+DAA+D;QAC/D,iEAAiE;QACjE,mEAAmE;QACnE,6DAA6D;QAC7D,2DAA2D;QAC3D,EAAE;QACF,mEAAmE;QACnE,mEAAmE;QACnE,gEAAgE;QAChE,8DAA8D;QAC9D,aAAa;QACb,IAAI,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,IAAA,eAAM,EAAC,CAAC,CAAC,EAAE,CAAC;YAC5B,OAAO,KAAK,CAAA;QACd,CAAC;QACD,MAAM,CAAC,KAAK,EAAE,gBAAgB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACxC,wDAAwD,CAAC,CAAA;QAC3D,OAAO,WAAW,CAAA;IACpB,CAAC;IAED,8DAA8D;IAC9D,oEAAoE;IACpE,oEAAoE;IACpE,mDAAmD;IACnD,IAAI,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;QAC3B,IAAI,GAAG,GAAQ,KAAK,CAAA;QACpB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,GAAY,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,CAAA;YACnC,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,CAAA;YAClD,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;gBACpB,IAAI,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;oBAClC,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAC9C,6DAA6D,CAAC,CAAA;oBAChE,OAAO,IAAI,CAAA;gBACb,CAAC;gBACD,MAAM,CAAC,KAAK,EAAE,2BAA2B,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EACxD,4DAA4D;oBAC5D,wDAAwD,CAAC,CAAA;gBAC3D,GAAG,GAAG,WAAW,CAAA;YACnB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;QAC3B,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,GAAY,EAAE,CAAC;YACjC,IAAI,KAAK,KAAK,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACjE,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC;QACD,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;YAClB,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACzC,kDAAkD,CAAC,CAAA;YACrD,OAAO,IAAI,CAAA;QACb,CAAC;QACD,MAAM,CAAC,KAAK,EAAE,2BAA2B,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACnD,+DAA+D;YAC/D,+DAA+D,CAAC,CAAA;QAClE,OAAO,WAAW,CAAA;IACpB,CAAC;IAED,qEAAqE;IACrE,sCAAsC;IACtC,IAAI,IAAI,KAAK,CAAC,EAAE,YAAY,EAAE,CAAC;QAC7B,IAAI,IAAI,KAAK,CAAC,EAAE,YAAY,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,IAAA,4BAAY,EAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBAClD,OAAO,KAAK,CAAA;YACd,CAAC;YACD,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACzC,mDAAmD,CAAC,CAAA;YACtD,OAAO,IAAI,CAAA;QACb,CAAC;QACD,IAAI,IAAI,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAA;YAC3B,IAAI,IAAI,KAAK,IAAI,EAAE,YAAY;gBAC7B,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,IAAI,IAAA,4BAAY,EAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACxD,OAAO,KAAK,CAAA;YACd,CAAC;YACD,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACzC,qDAAqD,CAAC,CAAA;YACxD,OAAO,IAAI,CAAA;QACb,CAAC;QACD,IAAI,IAAI,KAAK,CAAC,EAAE,YAAY,EAAE,CAAC;YAC7B,kEAAkE;YAClE,gEAAgE;YAChE,kEAAkE;YAClE,kEAAkE;YAClE,4DAA4D;YAC5D,MAAM,GAAG,GAAI,CAAS,CAAC,MAAM,CAAA;YAC7B,MAAM,KAAK,GAAI,CAAS,CAAC,IAAI,CAAA;YAC7B,IAAI,QAAQ,KAAK,GAAG;gBAClB,CAAC,MAAM,KAAK,CAAC,CAAC,GAAG;oBACf,CAAC,IAAI,IAAI,KAAK,IAAI,IAAA,4BAAY,EAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnD,OAAO,KAAK,CAAA;YACd,CAAC;YACD,IAAI,QAAQ,KAAK,GAAG,IAAI,MAAM,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;gBACzC,OAAO,KAAK,CAAA;YACd,CAAC;YACD,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACzC,uDAAuD,CAAC,CAAA;YAC1D,OAAO,IAAI,CAAA;QACb,CAAC;QACD,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACzC,uCAAuC,CAAC,CAAA;QAC1C,OAAO,IAAI,CAAA;IACb,CAAC;IAED,mEAAmE;IACnE,gEAAgE;IAChE,mEAAmE;IACnE,uBAAuB;IACvB,IAAI,IAAI,KAAM,CAAS,EAAE,eAAe,EAAE,CAAC;QACzC,MAAM,EAAE,GAAQ,CAAC,CAAA;QACjB,MAAM,EAAE,GAAQ,CAAC,CAAA;QACjB,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,SAAS,IAAI,CAAC,IAAI,KAAK,EAAE,EAAE,KAAK,IAAI,IAAI,KAAK,EAAE,EAAE,SAAS,CAAC,CAAC;eACxE,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,IAAI,CAAC,IAAI,KAAK,EAAE,EAAE,MAAM,IAAI,IAAI,KAAK,EAAE,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC;YAClF,OAAO,KAAK,CAAA;QACd,CAAC;QACD,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACzC,iDAAiD,CAAC,CAAA;QACpD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,wBAAwB;IACxB,IAAI,IAAI,KAAK,CAAC,EAAE,YAAY,EAAE,CAAC;QAC7B,IAAI,IAAI,KAAK,CAAC,EAAE,YAAY,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,IAAA,4CAA4B,EAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAC5C,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;gBACf,OAAO,KAAK,CAAA;YACd,CAAC;YACD,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;gBACtB,MAAM,CAAC,KAAK,EAAE,mBAAmB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAC3C,6DAA6D,CAAC,CAAA;gBAChE,OAAO,WAAW,CAAA;YACpB,CAAC;YACD,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACzC,6DAA6D,CAAC,CAAA;YAChE,OAAO,IAAI,CAAA;QACb,CAAC;QACD,IAAI,IAAI,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,IAAA,sCAAsB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACtC,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;gBACf,OAAO,KAAK,CAAA;YACd,CAAC;YACD,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;gBACtB,MAAM,CAAC,KAAK,EAAE,mBAAmB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAC3C,6DAA6D,CAAC,CAAA;gBAChE,OAAO,WAAW,CAAA;YACpB,CAAC;YACD,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACzC,yDAAyD,CAAC,CAAA;YAC5D,OAAO,IAAI,CAAA;QACb,CAAC;QACD,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACzC,uEAAuE,CAAC,CAAA;QAC1E,OAAO,IAAI,CAAA;IACb,CAAC;IAED,mEAAmE;IACnE,mEAAmE;IACnE,8DAA8D;IAC9D,wDAAwD;IACxD,IAAI,IAAI,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC;QACzB,IAAI,IAAI,KAAK,CAAC,CAAC,MAAM,IAAI,IAAI,KAAM,CAAS,EAAE,MAAM;YAClD,IAAA,oBAAU,EAAC,CAAC,CAAC,GAAG,EAAG,CAAS,CAAC,GAAG,CAAC,KAAM,CAAS,CAAC,GAAG,EAAE,CAAC;YACvD,OAAO,KAAK,CAAA;QACd,CAAC;QACD,IAAI,IAAI,KAAK,CAAC,EAAE,QAAQ,IAAI,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACjD,OAAO,KAAK,CAAA;QACd,CAAC;QACD,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACzC,uCAAuC,CAAC,CAAA;QAC1C,OAAO,IAAI,CAAA;IACb,CAAC;IAED,QAAQ;IACR,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;QACtB,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;YACtB,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACzC,0DAA0D,CAAC,CAAA;YAC7D,OAAO,IAAI,CAAA;QACb,CAAC;QACD,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EACrD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAM,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IACxD,CAAC;IAED,oEAAoE;IACpE,mCAAmC;IACnC,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QACvB,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;YACvB,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACzC,2DAA2D,CAAC,CAAA;YAC9D,OAAO,IAAI,CAAA;QACb,CAAC;QACD,MAAM,EAAE,GAAI,CAAC,CAAC,GAAa,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,CAAS,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;QAC9D,MAAM,EAAE,GAAI,CAAC,CAAC,GAAa,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,CAAS,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;QAC9D,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EACzC,CAAC,CAAM,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5C,CAAC;IAED,qEAAqE;IACrE,6DAA6D;IAC7D,mEAAmE;IACnE,mEAAmE;IACnE,8DAA8D;IAC9D,EAAE;IACF,kEAAkE;IAClE,iEAAiE;IACjE,oEAAoE;IACpE,gEAAgE;IAChE,kEAAkE;IAClE,qEAAqE;IACrE,qEAAqE;IACrE,oEAAoE;IACpE,iEAAiE;IACjE,qBAAqB;IACrB,EAAE;IACF,iEAAiE;IACjE,kEAAkE;IAClE,4BAA4B;IAC5B,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,IAAI,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,IAAA,eAAM,EAAC,CAAC,CAAC,EAAE,CAAC;QACtE,OAAO,KAAK,CAAA;IACd,CAAC;IACD,MAAM,CAAC,KAAK,EAAE,gBAAgB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACxC,uDAAuD,CAAC,CAAA;IAC1D,OAAO,WAAW,CAAA;AACpB,CAAC;AAGD,oEAAoE;AACpE,mEAAmE;AACnE,uEAAuE;AACvE,gDAAgD;AAChD,SAAS,UAAU,CACjB,KAAe,EAAE,IAAc,EAAE,CAAM,EAAE,CAAM,EAC/C,KAAe,EAAE,KAAe,EAChC,KAAiC;IAEjC,IAAI,GAAG,GAAQ,KAAK,CAAA;IACpB,MAAM,KAAK,GAAG,CAAC,CAAM,EAAE,EAAE;QACvB,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,WAAW,KAAK,CAAC,IAAI,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACtD,GAAG,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAA;QACvC,CAAC;IACH,CAAC,CAAA;IAED,+DAA+D;IAC/D,MAAM,SAAS,GAAa,CAAC,CAAC,YAAY,CAAA;IAC1C,MAAM,SAAS,GAAa,CAAC,CAAC,YAAY,CAAA;IAE1C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC1B,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA;QAC7B,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA;QACtC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,IAAI,QAAQ,EAAE,CAAC;gBACb,SAAQ;YACV,CAAC;YACD,MAAM,CAAC,KAAK,EAAE,uBAAuB,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAC5D,gEAAgE;gBAChE,uBAAuB,CAAC,CAAA;YAC1B,KAAK,CAAC,IAAI,CAAC,CAAA;YACX,SAAQ;QACV,CAAC;QACD,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACvC,MAAM,CAAC,KAAK,EAAE,uBAAuB,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,EACzD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EACX,+DAA+D;gBAC/D,oDAAoD,CAAC,CAAA;YACvD,KAAK,CAAC,IAAI,CAAC,CAAA;YACX,SAAQ;QACV,CAAC;QACD,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IAC9D,CAAC;IAED,qEAAqE;IACrE,qDAAqD;IACrD,IAAI,IAAI,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QACtB,IAAI,IAAI,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YACtB,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACzC,6DAA6D;gBAC7D,eAAe,CAAC,CAAA;YAClB,KAAK,CAAC,IAAI,CAAC,CAAA;QACb,CAAC;aACI,CAAC;YACJ,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvB,MAAM,CAAC,KAAK,EAAE,iBAAiB,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAC3D,oDAAoD,CAAC,CAAA;oBACvD,KAAK,CAAC,IAAI,CAAC,CAAA;gBACb,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,mEAAmE;IACnE,sEAAsE;IACtE,oEAAoE;IACpE,oEAAoE;IACpE,oEAAoE;IACpE,6DAA6D;IAC7D,mEAAmE;IACnE,gEAAgE;IAChE,oEAAoE;IACpE,qEAAqE;IACrE,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAA;IACxB,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAA;IACxB,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;QAC/B,MAAM,YAAY,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,IAAA,eAAM,EAAC,GAAG,CAAC,CAAA;QAC9E,IAAI,CAAC,YAAY;YACf,CAAC,IAAI,KAAK,GAAG,EAAE,eAAe,IAAI,IAAI,KAAK,GAAG,EAAE,eAAe,CAAC,EAAE,CAAC;YACnE,MAAM,CAAC,KAAK,EAAE,2BAA2B,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EACjE,kEAAkE,CAAC,CAAA;YACrE,KAAK,CAAC,WAAW,CAAC,CAAA;QACpB,CAAC;aACI,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;YACrB,gEAAgE;YAChE,oBAAoB;YACpB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvB,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;gBAC3D,CAAC;YACH,CAAC;YACD,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,OAAO,EAAE,CAAC,CAAC,CAAA;QAClE,CAAC;QACD,kEAAkE;QAClE,8CAA8C;IAChD,CAAC;IAED,OAAO,GAAG,CAAA;AACZ,CAAC;AAGD,oEAAoE;AACpE,IAAI,MAAW,CAAA;AACf,SAAS,OAAO;IACd,IAAI,IAAI,IAAI,MAAM,EAAE,CAAC;QACnB,mEAAmE;QACnE,kEAAkE;QAClE,mEAAmE;QACnE,mEAAmE;QACnE,oEAAoE;QACpE,0BAA0B;QAC1B,MAAM,GAAG;YACP,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK;YACzB,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE;SAC7C,CAAA;IACH,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAGD,4DAA4D;AAC5D,wEAAwE;AACxE,uCAAuC;AACvC,qEAAqE;AACrE,mEAAmE;AACnE,sEAAsE;AACtE,uEAAuE;AACvE,mEAAmE;AACnE,iEAAiE;AACjE,mEAAmE;AACnE,sEAAsE;AACtE,oEAAoE;AACpE,qEAAqE;AACrE,8BAA8B;AAC9B,SAAS,YAAY,CACnB,KAAe,EAAE,IAAc,EAAE,CAAM,EAAE,CAAM;IAC/C,MAAM,KAAK,GAAa,EAAE,GAAG,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,CAAA;IACtE,OAAO,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;AACvC,CAAC;AAGD,mEAAmE;AACnE,uEAAuE;AACvE,gEAAgE;AAChE,sEAAsE;AACtE,yBAAyB;AACzB,SAAS,eAAe,CACtB,KAAe,EAAE,IAAc,EAAE,CAAM,EAAE,CAAM;IAC/C,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAA;IAC9B,IAAI,SAAS,KAAK,EAAE,EAAE,CAAC;QACrB,OAAO,KAAK,CAAA;IACd,CAAC;IACD,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAA;IAC9B,IAAI,eAAe,KAAK,EAAE,IAAI,eAAe,KAAK,EAAE,EAAE,CAAC;QACrD,MAAM,CAAC,KAAK,EAAE,2BAA2B,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EACnD,8DAA8D;YAC9D,qBAAqB,CAAC,CAAA;QACxB,OAAO,WAAW,CAAA;IACpB,CAAC;IACD,IAAI,SAAS,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QAC/C,MAAM,CAAC,KAAK,EAAE,wBAAwB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAChD,+DAA+D;YAC/D,+CAA+C,CAAC,CAAA;QAClD,OAAO,IAAI,CAAA;IACb,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAGD,uEAAuE;AACvE,oEAAoE;AACpE,SAAS,mBAAmB,CAC1B,KAAe,EAAE,IAAc,EAAE,CAAM,EAAE,CAAM;IAC/C,IAAI,GAAG,GAAQ,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IAEjD,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAA;IAChD,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAA;IAChD,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAChC,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClB,MAAM,CAAC,GAAG,mBAAmB,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;gBAChE,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,WAAW,KAAK,CAAC,IAAI,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;oBACtD,GAAG,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAA;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAGD;;;;;;;;;GASG;AACH,iBACE,UAAkB,EAAE,WAAmB,EAAE,IAAqB;IAE9D,MAAM,OAAO,GAAG,IAAI,IAAI,EAAE,CAAA;IAC1B,MAAM,OAAO,GAAmB,OAAO,CAAC,OAAO,IAAI,UAAU,CAAA;IAC7D,MAAM,KAAK,GAAa;QACtB,OAAO;QACP,QAAQ,EAAE,EAAE;QACZ,UAAU,EAAE,OAAO,CAAC,UAAU,IAAI,mBAAmB;QACrD,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,oBAAoB;KACzD,CAAA;IAED,MAAM,IAAI,GAAG,CAAC,GAAW,EAAE,IAAa,EAAO,EAAE;QAC/C,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;QAC/D,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;QACxC,MAAM,CAAC,GAAQ,KAAK,CAAC,KAAK,CACxB,GAAG,EAAE,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,GAAG,CAAC,CAAA;QAChD,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;YAC5C,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,OAAO,CAAC,CAAA;IACV,CAAC,CAAA;IAED,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,WAAW,CAAC,CAAA;IAC7C,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,YAAY,CAAC,CAAA;IAC/C,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;IAC3C,CAAC;IAED,IAAI,IAAI,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC;QACvB,CAAC,GAAG,IAAA,cAAQ,EAAC,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC,CAAA;QAC3B,CAAC,GAAG,IAAA,cAAQ,EAAC,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC,CAAA;QAC3B,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;YAC3B,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;QAC3C,CAAC;IACH,CAAC;IAED,IAAI,GAAG,GAAQ,WAAW,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IAC3C,IAAI,QAAQ,KAAK,OAAO,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,mBAAmB,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QAC9C,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,WAAW,KAAK,CAAC,IAAI,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACtD,GAAG,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAA;QACvC,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GACX,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC;QACjC,WAAW,KAAK,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAA;IAClD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAA;AAC9C,CAAC"}

package/dist/trim.d.ts

@@ -0,0 +1,19 @@
+import type { VetFinding } from './vet';
+import type { TrustOptions } from './type';
+export type TrimVerdict = 'clean' | 'redundant' | 'error';
+export type TrimReport = {
+    verdict: TrimVerdict;
+    redundant: string[];
+    errors?: VetFinding[];
+};
+export type TrimOptions = {
+    path?: string;
+    trust?: TrustOptions;
+};
+export declare function candidates(v: any, path: string[], out: string[][]): void;
+export declare function deleteAt(root: any, path: string[]): boolean;
+export declare function evalCanon(src: string, opts: TrimOptions, delPath?: string[], sink?: {
+    ctx?: any;
+    failed?: any;
+}): string | undefined;
+export declare function trimCheck(src: string, opts?: TrimOptions): TrimReport;