aontu 0.53.0 → 0.55.0

package/dist/relation.js

@@ -1,11 +1,14 @@
 "use strict";
 /* Copyright (c) 2025 Richard Rodger, MIT License */
 Object.defineProperty(exports, "__esModule", { value: true });
+exports.relationFindings = relationFindings;
+exports.relationErrors = relationErrors;
 exports.relationCheck = relationCheck;
-// RELATION GRAPH CHECKS (G4 phase 5,
-// docs/capability-review/g4-identity-relations.md): acyclicity and
-// inverse consistency over the edge set, checked AFTER unification and
-// never by it.
+// RELATION GRAPH VERDICTS (RELATIONS.0.md §3.3, replacing the G4
+// phase 5 magic-key pass): acyclicity and inverse consistency over
+// the edge set, DECLARED by the graph atoms -- `acyclic()` and
+// `inverse(name)` conjoined at the field whose key is the predicate
+// -- and decided AFTER unification, never by it.
 //
 // Why not in the lattice. Both properties are GLOBAL and NON-MONOTONE:
 // an acyclic graph becomes cyclic when one more edge unifies in, and an
@@ -13,134 +16,23 @@ exports.relationCheck = relationCheck;
 // The lattice guarantee is that more information never falsifies what
 // has been observed, so a constraint that could be true and then false
 // is not a constraint the lattice may hold. These are facts about the
-// finished model, and the verb that reports facts about a finished
-// model is where they belong.
+// finished model, so the atoms only REGISTER during unification
+// (GraphAtomVal.register, onto ctx._reldecls), and the verdict lands
+// at GENERATION -- the sizing atoms' model -- where no more
+// information can arrive. The `relations` verb reports the same
+// verdict from the same declarations: one decision, two surfaces.
 //
-// A relation is DECLARED as data, under the `relations` key of the
-// document root, which is the `std/system` vocabulary's convention:
-//
-//   relations: dependsOn: $.std.Relation & {
-//     target: $.std.Service, inverse: dependedOnBy, acyclic: true
-//   }
-//
-// Nothing in the engine knows the name `relations`; this pass does,
-// and says so.
+// The old declaration channel -- a `relations:` key at the document
+// root, read by name -- is GONE, discharging ADR-010's grandfather
+// clause: the engine no longer knows any spellable key. The target
+// half of the old declaration is `rel(t)`'s flow at the site, which
+// checks by unifying rather than by a report-layer probe.
 const aontu_1 = require("./aontu");
 const vet_1 = require("./vet");
 const graph_1 = require("./graph");
 const keyorder_1 = require("./keyorder");
-const unify_1 = require("./unify");
-// The entity an address names — everything before the first dot. An
-// edge into `svc/auth.ports.http` is an edge to `svc/auth`: a relation
-// holds between ENTITIES, and the path inside one says which part of it
-// the link reaches.
-function entityOf(addr) {
-    const dot = addr.indexOf('.');
-    return dot < 0 ? addr : addr.slice(0, dot);
-}
-// The node an address names, or undefined. The entity's own position
-// comes from the graph (a merged entity sits at every position that
-// declared it, and they hold the same value, so the FIRST in the
-// graph's sorted list is as good as any and is the same one in both
-// ports); the rest of the address walks into it, exactly as the
-// address's own grammar says.
-// NO GUARD ON THE LOOKUP OR THE WALK. An edge exists only because
-// `refer()` RESOLVED its full address, so `find` cannot miss and no
-// segment can fall off: an address that does not walk is
-// `refer_unresolved` at unification and the document never reaches the
-// graph (probed for a missing key, a scalar mid-path and an
-// out-of-range index, in both ports). An unreachable `if` is a branch
-// arm the ADR-002 gate counts and no marker suppresses, so the Go twin
-// keeps its guards — where a nil would PANIC rather than propagate,
-// and where the marker mechanism can carry them — and this one relies
-// on optional chaining instead.
-function addressed(root, graph, addr) {
-    const dot = addr.indexOf('.');
-    const name = dot < 0 ? addr : addr.slice(0, dot);
-    const entry = graph.entities.find((e) => e.id === name);
-    const segs = entry.paths[0].slice(2).split('.')
-        .concat(dot < 0 ? [] : addr.slice(dot + 1).split('.'));
-    let node = root;
-    for (const seg of segs) {
-        node = node?.peg?.[seg];
-    }
-    return node;
-}
-// Does the far end satisfy the declared target? A TEST, never a flow:
-// the check reports on a finished model and writing into it would be
-// generation, which `relations` does not do (the same rule that keeps
-// it from writing an author's inverse for them). So both sides are
-// CLONED into a throwaway context and the meet is taken there; what
-// the document holds is untouched either way.
-//
-// `refer(t)` is the other half of this and does flow, at the site. The
-// two agree on what "satisfies" means -- a meet that is not a nil --
-// which is what lets a relation declare once what every site would
-// otherwise repeat.
-// `root` is the DOCUMENT, not the node: a target lifted out of the
-// model (`target: $.std.Service`) can still hold a reference that
-// resolves against the document, and a probe rooted at the far end
-// answers `no_path` for it -- which the worked example in
-// test/spec/relation.tsv caught the moment this check existed.
-function meets(aontu, root, node, target) {
-    const ctx = aontu.ctx({ collect: true });
-    ctx.root = root;
-    const out = (0, unify_1.unite)(ctx, node.clone(ctx), target.clone(ctx), 'relation-target');
-    if (true === out?.isNil) {
-        return out.why;
-    }
-    if (0 < ctx.err.length) {
-        return ctx.err[0].why;
-    }
-    // A MEET THAT LEAVES A HOLE IS NOT SATISFACTION. `target:
-    // {kind: service, port: integer}` against a far end with no `port`
-    // does not CONFLICT -- the meet simply carries `integer` into a key
-    // that had none -- and a check that stopped at "no conflict" would
-    // pass a far end that is missing half of what the relation demands.
-    //
-    // What `refer(t)` does at the site is the yardstick: it flows `t` in,
-    // and the document then fails to generate, because `integer` is not a
-    // value. So the same question is asked here -- can the far end still
-    // generate once the target is met? -- and the answer is compared with
-    // the far end ALONE, so a node that was already incomplete for its
-    // own reasons is not blamed on the relation that points at it.
-    // The REASON reported is the engine's own -- the code `refer(t)` at
-    // the site would have raised -- rather than a name invented here.
-    const probe = (v) => {
-        const gctx = aontu.ctx({ collect: true });
-        gctx.root = root;
-        v.gen(gctx);
-        return 0 === gctx.err.length ? undefined : gctx.err[0].why;
-    };
-    const alone = probe(node.clone(aontu.ctx({ collect: true })));
-    const met = probe(out);
-    return undefined === alone && undefined !== met ? met : undefined;
-}
-function declaredRelations(root) {
-    const rels = root?.peg?.relations;
-    if (true !== rels?.isMap) {
-        return [];
-    }
-    const out = [];
-    for (const name of Object.keys(rels.peg).sort(keyorder_1.cmpCodePoint)) {
-        const r = rels.peg[name];
-        if (true !== r?.isMap) {
-            continue;
-        }
-        const inv = r.peg.inverse;
-        const acy = r.peg.acyclic;
-        const tgt = r.peg.target;
-        out.push({
-            name,
-            inverse: true === inv?.isScalar && 'string' === typeof inv.peg
-                ? inv.peg : undefined,
-            acyclic: true === acy?.isScalar && true === acy.peg,
-            target: true === tgt?.isVal && true !== tgt.isTop ? tgt : undefined,
-        });
-    }
-    return out;
-}
-// The first cycle reachable from `start`, as the entities it runs
+const err_1 = require("./err");
+// The first cycle reachable from `start`, as the node paths it runs
 // through, or undefined. Depth-first with the path as the stack, and
 // the successors visited in sorted order, so the cycle a report names
 // is the same one in both ports.
@@ -169,38 +61,16 @@ function findCycle(start, succ, done) {
     };
     return walk(start);
 }
-// The relation checks for one document.
-function relationCheck(src, 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 a bad
-    // graph: the errors it already has are the answer, and blaming its
-    // relations on top would be noise.
-    if (0 < ctx.err.length || true === root?.isNil) {
-        return {
-            verdict: 'error',
-            findings: [],
-            errors: [(0, vet_1.failureFinding)(ctx, options.path, root)],
-        };
-    }
-    const declared = declaredRelations(root);
-    if (0 === declared.length) {
-        return { verdict: 'pass', findings: [] };
-    }
-    const graph = (0, graph_1.graphOf)(root);
-    const edges = graph.edges;
+// The verdict itself, pure over what the evaluation produced: the
+// registered declarations and the edge set. Shared by the generation
+// hook (relationErrors) and the `relations` verb, so the two surfaces
+// cannot disagree.
+function relationFindings(decls, graph) {
     const findings = [];
     // The edge set, indexed the two ways the checks read it.
     const byRelation = new Map();
     const pairs = new Set();
-    for (const e of edges) {
-        if ('' === e.from) {
-            // An edge outside every entity has no source to be a relation OF.
-            continue;
-        }
+    for (const e of graph.edges) {
         const list = byRelation.get(e.key);
         if (undefined === list) {
             byRelation.set(e.key, [e]);
@@ -208,15 +78,20 @@ function relationCheck(src, opts) {
         else {
             list.push(e);
         }
-        pairs.add(e.key + ' ' + e.from + ' ' + entityOf(e.to));
+        pairs.add(e.key + ' ' + e.from + ' ' + e.to);
     }
-    for (const rel of declared) {
-        const mine = byRelation.get(rel.name) ?? [];
-        if (rel.acyclic) {
+    // Predicates in sorted order, so the findings arrive the same way
+    // in both ports (the registry is insertion-ordered here, random in
+    // Go).
+    const names = [...decls.keys()].sort(keyorder_1.cmpCodePoint);
+    for (const name of names) {
+        const decl = decls.get(name);
+        const mine = byRelation.get(name) ?? [];
+        if (true === decl.acyclic) {
             const succ = new Map();
             for (const e of mine) {
                 const list = succ.get(e.from);
-                const to = entityOf(e.to);
+                const to = e.to;
                 if (undefined === list) {
                     succ.set(e.from, [to]);
                 }
@@ -240,7 +115,7 @@ function relationCheck(src, opts) {
                     const at = mine.find((e) => e.from === cycle[0]);
                     findings.push({
                         code: 'relation_cycle',
-                        relation: rel.name,
+                        relation: name,
                         at: at.at,
                         detail: cycle,
                     });
@@ -248,55 +123,105 @@ function relationCheck(src, opts) {
                 }
             }
         }
-        // TARGET: the far end IS what the relation says it is (the review's
-        // finding J). The declaration used to be inert -- `target` was read
-        // by nothing, on the reasoning that `refer(t)` already flows the
-        // type in at the site. It does, and that is exactly why the
-        // declaration was worth nothing: the site has to REPEAT it, and the
-        // idiom that avoids repeating it (`refer($.std.Service)`) tripped
-        // the fixpoint until §19 was fixed, so every real model wrote bare
-        // `refer()` and a typed-endpoint declaration checked nothing.
-        //
-        // Reported per EDGE, not per entity: an entity reached by two
-        // relations must satisfy both, and the report points at the link
-        // that made the demand.
-        if (undefined !== rel.target) {
-            for (const e of mine) {
-                // No guard on the node either, and for the same reason
-                // `addressed` needs none: an unresolved link is a nil in the
-                // tree, so this document would not have reached the graph.
-                const why = meets(aontu, root, addressed(root, graph, e.to), rel.target);
-                if (undefined !== why) {
-                    findings.push({
-                        code: 'relation_target_unmet',
-                        relation: rel.name,
-                        at: e.at,
-                        detail: [e.from, e.to, why],
-                    });
-                }
-            }
-        }
-        if (undefined !== rel.inverse) {
+        const inverses = [...decl.inverses].sort(keyorder_1.cmpCodePoint);
+        for (const inv of inverses) {
             for (const e of mine) {
-                const to = entityOf(e.to);
-                if (!pairs.has(rel.inverse + ' ' + to + ' ' + e.from)) {
+                const to = e.to;
+                if (!pairs.has(inv + ' ' + to + ' ' + e.from)) {
                     findings.push({
                         code: 'relation_inverse_missing',
-                        relation: rel.name,
+                        relation: name,
                         at: e.at,
-                        detail: [e.from, to, rel.inverse],
+                        detail: [e.from, to, inv],
                     });
                 }
             }
         }
     }
     // SORTED, because a report is read by a machine that diffs it: by the
-    // position the offending edge is written at, then by code. No third
-    // key: one edge sits under one key and one key is one relation, so
-    // two findings can share (at, code) only by being the same finding.
-    // The sort is STABLE, and the relations were iterated in sorted
-    // order, so what order remains is fixed anyway.
-    findings.sort((a, b) => (0, keyorder_1.cmpCodePoint)(a.at, b.at) || (0, keyorder_1.cmpCodePoint)(a.code, b.code));
+    // position the offending edge is written at, then by code, then by
+    // the detail (two inverse declarations on one predicate can flag one
+    // edge twice). The sort is STABLE and the predicates were iterated
+    // in sorted order, so what order remains is fixed anyway.
+    findings.sort((a, b) => (0, keyorder_1.cmpCodePoint)(a.at, b.at) || (0, keyorder_1.cmpCodePoint)(a.code, b.code)
+        || (0, keyorder_1.cmpCodePoint)(a.detail.join(' '), b.detail.join(' ')));
+    return findings;
+}
+// The generation hook (Aontu.generate, between unification success
+// and value generation): each finding becomes a LOCATED evaluation
+// error at the offending edge, exactly as an unmet sizing atom
+// refuses at generation. Findings name node paths and positions the
+// document spelled, so the walk to the site cannot miss.
+function relationErrors(ctx, root) {
+    const decls = ctx._reldecls;
+    if (0 === decls.size) {
+        return;
+    }
+    const findings = relationFindings(decls, (0, graph_1.graphOf)(root));
+    for (const f of findings) {
+        let node = root;
+        for (const seg of f.at.slice(2).split('.')) {
+            // Graph atoms hold the field's value -- possibly nested, one
+            // atom carrying another -- and the path steps through them
+            // exactly as the graph walk does.
+            while (true === node?.isGraphAtom) {
+                node = node.held;
+            }
+            node = node?.peg?.[seg];
+        }
+        // No unwrap AFTER the walk: a finding's `at` names an edge
+        // element, and an edge's element is a string -- an atom-wrapped
+        // element mints no edge in the first place (the graph visit
+        // descends atoms only at field values), so the walk cannot end on
+        // an atom.
+        ctx.adderr((0, err_1.makeNilErr)(ctx, f.code, node, undefined, 'relate', {
+            relation: f.relation,
+            detail: f.detail.join(' -> '),
+        }));
+    }
+}
+// The relation checks for one document: evaluate, then report the
+// same verdict generation enforces.
+function relationCheck(src, 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 a bad
+    // graph: the errors it already has are the answer, and blaming its
+    // relations on top would be noise.
+    if (0 < ctx.err.length || true === root?.isNil) {
+        return {
+            verdict: 'error',
+            findings: [],
+            errors: [(0, vet_1.failureFinding)(ctx, options.path, root)],
+        };
+    }
+    const decls = ctx._reldecls;
+    if (0 === decls.size) {
+        return { verdict: 'pass', findings: [] };
+    }
+    // NOR IS A DOCUMENT THAT CANNOT BE GENERATED. Unification can
+    // succeed over a tree that still holds an unsettled disjunction --
+    // more than one alternative admitted, which `disjunct_no_gen`
+    // refuses at generation -- and the graph walk cannot read inside
+    // one: the links in every alternative are invisible, so a mirror
+    // the document plainly writes is missing from the edge set and
+    // `inverse(n)` calls it missing. Generation is therefore asked
+    // FIRST, on a collecting context of its own, and what it says is
+    // the answer. Generation is what the atoms' verdict lands at, so
+    // this is the same order the engine itself now runs in.
+    const gctx = ctx.clone({ err: [], collect: true });
+    root.gen(gctx);
+    if (0 < gctx.err.length) {
+        return {
+            verdict: 'error',
+            findings: [],
+            errors: [(0, vet_1.failureFinding)(gctx, options.path, root)],
+        };
+    }
+    const findings = relationFindings(decls, (0, graph_1.graphOf)(root));
     return {
         verdict: 0 === findings.length ? 'pass' : 'fail',
         findings,

package/dist/relation.js.map

@@ -1 +1 @@
-{"version":3,"file":"relation.js","sourceRoot":"","sources":["../src/relation.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;AAEpD,qCAAqC;AACrC,mEAAmE;AACnE,uEAAuE;AACvE,eAAe;AACf,EAAE;AACF,uEAAuE;AACvE,wEAAwE;AACxE,wEAAwE;AACxE,sEAAsE;AACtE,uEAAuE;AACvE,sEAAsE;AACtE,mEAAmE;AACnE,8BAA8B;AAC9B,EAAE;AACF,mEAAmE;AACnE,oEAAoE;AACpE,EAAE;AACF,6CAA6C;AAC7C,kEAAkE;AAClE,MAAM;AACN,EAAE;AACF,oEAAoE;AACpE,eAAe;AAEf,mCAA+B;AAC/B,+BAAsC;AAGtC,mCAAiC;AAEjC,yCAAyC;AACzC,mCAA+B;AAsD/B,oEAAoE;AACpE,uEAAuE;AACvE,wEAAwE;AACxE,oBAAoB;AACpB,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAC7B,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;AAC5C,CAAC;AAGD,qEAAqE;AACrE,oEAAoE;AACpE,iEAAiE;AACjE,oEAAoE;AACpE,gEAAgE;AAChE,8BAA8B;AAC9B,kEAAkE;AAClE,oEAAoE;AACpE,yDAAyD;AACzD,uEAAuE;AACvE,4DAA4D;AAC5D,sEAAsE;AACtE,uEAAuE;AACvE,oEAAoE;AACpE,sEAAsE;AACtE,gCAAgC;AAChC,SAAS,SAAS,CAChB,IAAS,EAAE,KAAY,EAAE,IAAY;IAErC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAC7B,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;IAChD,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAgB,CAAA;IACtE,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;SAC5C,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;IACxD,IAAI,IAAI,GAAQ,IAAI,CAAA;IACpB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAA;IACzB,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAGD,sEAAsE;AACtE,qEAAqE;AACrE,sEAAsE;AACtE,mEAAmE;AACnE,oEAAoE;AACpE,8CAA8C;AAC9C,EAAE;AACF,uEAAuE;AACvE,qEAAqE;AACrE,mEAAmE;AACnE,oBAAoB;AACpB,mEAAmE;AACnE,kEAAkE;AAClE,mEAAmE;AACnE,0DAA0D;AAC1D,+DAA+D;AAC/D,SAAS,KAAK,CACZ,KAAU,EAAE,IAAS,EAAE,IAAS,EAAE,MAAW;IAE7C,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;IACxC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAA;IACf,MAAM,GAAG,GAAQ,IAAA,aAAK,EAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,iBAAiB,CAAC,CAAA;IAClF,IAAI,IAAI,KAAK,GAAG,EAAE,KAAK,EAAE,CAAC;QACxB,OAAO,GAAG,CAAC,GAAa,CAAA;IAC1B,CAAC;IACD,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;QACvB,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAa,CAAA;IACjC,CAAC;IAED,0DAA0D;IAC1D,mEAAmE;IACnE,oEAAoE;IACpE,mEAAmE;IACnE,oEAAoE;IACpE,EAAE;IACF,sEAAsE;IACtE,sEAAsE;IACtE,qEAAqE;IACrE,sEAAsE;IACtE,mEAAmE;IACnE,+DAA+D;IAC/D,oEAAoE;IACpE,kEAAkE;IAClE,MAAM,KAAK,GAAG,CAAC,CAAM,EAAsB,EAAE;QAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;QACzC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACX,OAAO,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAc,CAAA;IACxE,CAAC,CAAA;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;IAC7D,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAA;IACtB,OAAO,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAA;AACnE,CAAC;AAGD,SAAS,iBAAiB,CAAC,IAAS;IAClC,MAAM,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,SAAS,CAAA;IACjC,IAAI,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,CAAC;QACzB,OAAO,EAAE,CAAA;IACX,CAAC;IACD,MAAM,GAAG,GAAe,EAAE,CAAA;IAC1B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,EAAE,CAAC;QAC5D,MAAM,CAAC,GAAQ,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC7B,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;YACtB,SAAQ;QACV,CAAC;QACD,MAAM,GAAG,GAAQ,CAAC,CAAC,GAAG,CAAC,OAAO,CAAA;QAC9B,MAAM,GAAG,GAAQ,CAAC,CAAC,GAAG,CAAC,OAAO,CAAA;QAC9B,MAAM,GAAG,GAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,CAAA;QAC7B,GAAG,CAAC,IAAI,CAAC;YACP,IAAI;YACJ,OAAO,EAAE,IAAI,KAAK,GAAG,EAAE,QAAQ,IAAI,QAAQ,KAAK,OAAO,GAAG,CAAC,GAAG;gBAC5D,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS;YACvB,OAAO,EAAE,IAAI,KAAK,GAAG,EAAE,QAAQ,IAAI,IAAI,KAAK,GAAG,CAAC,GAAG;YACnD,MAAM,EAAE,IAAI,KAAK,GAAG,EAAE,KAAK,IAAI,IAAI,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS;SACpE,CAAC,CAAA;IACJ,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAGD,kEAAkE;AAClE,qEAAqE;AACrE,sEAAsE;AACtE,iCAAiC;AACjC,SAAS,SAAS,CAChB,KAAa,EACb,IAA2B,EAC3B,IAAiB;IAEjB,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IAEjC,MAAM,IAAI,GAAG,CAAC,IAAY,EAAwB,EAAE;QAClD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;QACpD,CAAC;QACD,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACd,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAChB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACjB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;YACxB,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;gBACxB,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC;QACD,KAAK,CAAC,GAAG,EAAE,CAAA;QACX,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACpB,OAAO,SAAS,CAAA;IAClB,CAAC,CAAA;IAED,OAAO,IAAI,CAAC,KAAK,CAAC,CAAA;AACpB,CAAC;AAGD,wCAAwC;AACxC,uBACE,GAAW,EAAE,IAAsB;IACnC,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,iEAAiE;IACjE,mEAAmE;IACnE,mCAAmC;IACnC,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,CAAC;QAC/C,OAAO;YACL,OAAO,EAAE,OAAO;YAChB,QAAQ,EAAE,EAAE;YACZ,MAAM,EAAE,CAAC,IAAA,oBAAc,EAAC,GAAG,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SAClD,CAAA;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAA;IACxC,IAAI,CAAC,KAAK,QAAQ,CAAC,MAAM,EAAE,CAAC;QAC1B,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;IAC1C,CAAC;IAED,MAAM,KAAK,GAAG,IAAA,eAAO,EAAC,IAAI,CAAC,CAAA;IAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;IACzB,MAAM,QAAQ,GAAsB,EAAE,CAAA;IAEtC,yDAAyD;IACzD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;YAClB,kEAAkE;YAClE,SAAQ;QACV,CAAC;QACD,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAClC,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACvB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QAC5B,CAAC;aACI,CAAC;YACJ,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACd,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACxD,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAA;QAE3C,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAChB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAA;YACxC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;gBAC7B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;gBACzB,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;oBACvB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;gBACxB,CAAC;qBACI,CAAC;oBACJ,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACf,CAAC;YACH,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBACjC,IAAI,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;YACzB,CAAC;YAED,4DAA4D;YAC5D,kEAAkE;YAClE,0BAA0B;YAC1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;YAC9B,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;YACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;gBACzC,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;oBACxB,8DAA8D;oBAC9D,2DAA2D;oBAC3D,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAS,CAAA;oBACxD,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,gBAAgB;wBACtB,QAAQ,EAAE,GAAG,CAAC,IAAI;wBAClB,EAAE,EAAE,EAAE,CAAC,EAAE;wBACT,MAAM,EAAE,KAAK;qBACd,CAAC,CAAA;oBACF,MAAK;gBACP,CAAC;YACH,CAAC;QACH,CAAC;QAED,oEAAoE;QACpE,oEAAoE;QACpE,iEAAiE;QACjE,4DAA4D;QAC5D,oEAAoE;QACpE,kEAAkE;QAClE,mEAAmE;QACnE,8DAA8D;QAC9D,EAAE;QACF,8DAA8D;QAC9D,iEAAiE;QACjE,wBAAwB;QACxB,IAAI,SAAS,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,uDAAuD;gBACvD,6DAA6D;gBAC7D,2DAA2D;gBAC3D,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EACzD,GAAG,CAAC,MAAM,CAAC,CAAA;gBACb,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;oBACtB,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,uBAAuB;wBAC7B,QAAQ,EAAE,GAAG,CAAC,IAAI;wBAClB,EAAE,EAAE,CAAC,CAAC,EAAE;wBACR,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC;qBAC5B,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,SAAS,KAAK,GAAG,CAAC,OAAO,EAAE,CAAC;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;gBACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;oBACtD,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,0BAA0B;wBAChC,QAAQ,EAAE,GAAG,CAAC,IAAI;wBAClB,EAAE,EAAE,CAAC,CAAC,EAAE;wBACR,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC,OAAO,CAAC;qBAClC,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,sEAAsE;IACtE,oEAAoE;IACpE,mEAAmE;IACnE,oEAAoE;IACpE,gEAAgE;IAChE,gDAAgD;IAChD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACrB,IAAA,uBAAY,EAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,IAAA,uBAAY,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;IAE3D,OAAO;QACL,OAAO,EAAE,CAAC,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM;QAChD,QAAQ;KACT,CAAA;AACH,CAAC"}
+{"version":3,"file":"relation.js","sourceRoot":"","sources":["../src/relation.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;;;AAEpD,iEAAiE;AACjE,mEAAmE;AACnE,+DAA+D;AAC/D,oEAAoE;AACpE,iDAAiD;AACjD,EAAE;AACF,uEAAuE;AACvE,wEAAwE;AACxE,wEAAwE;AACxE,sEAAsE;AACtE,uEAAuE;AACvE,sEAAsE;AACtE,gEAAgE;AAChE,qEAAqE;AACrE,4DAA4D;AAC5D,gEAAgE;AAChE,kEAAkE;AAClE,EAAE;AACF,oEAAoE;AACpE,mEAAmE;AACnE,mEAAmE;AACnE,oEAAoE;AACpE,0DAA0D;AAE1D,mCAA+B;AAC/B,+BAAsC;AAGtC,mCAAiC;AAEjC,yCAAyC;AACzC,+BAAkC;AA0ClC,oEAAoE;AACpE,qEAAqE;AACrE,sEAAsE;AACtE,iCAAiC;AACjC,SAAS,SAAS,CAChB,KAAa,EACb,IAA2B,EAC3B,IAAiB;IAEjB,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IAEjC,MAAM,IAAI,GAAG,CAAC,IAAY,EAAwB,EAAE;QAClD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;QACpD,CAAC;QACD,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACd,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAChB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACjB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;YACxB,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;gBACxB,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC;QACD,KAAK,CAAC,GAAG,EAAE,CAAA;QACX,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACpB,OAAO,SAAS,CAAA;IAClB,CAAC,CAAA;IAED,OAAO,IAAI,CAAC,KAAK,CAAC,CAAA;AACpB,CAAC;AAGD,kEAAkE;AAClE,qEAAqE;AACrE,sEAAsE;AACtE,mBAAmB;AACnB,0BACE,KAA2B,EAAE,KAAY;IAEzC,MAAM,QAAQ,GAAsB,EAAE,CAAA;IAEtC,yDAAyD;IACzD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAClC,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACvB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QAC5B,CAAC;aACI,CAAC;YACJ,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACd,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAA;IAC9C,CAAC;IAED,kEAAkE;IAClE,mEAAmE;IACnE,OAAO;IACP,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;IAClD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAY,CAAA;QACvC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAA;QAEvC,IAAI,IAAI,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAA;YACxC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;gBAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAA;gBACf,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;oBACvB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;gBACxB,CAAC;qBACI,CAAC;oBACJ,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACf,CAAC;YACH,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBACjC,IAAI,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;YACzB,CAAC;YAED,4DAA4D;YAC5D,kEAAkE;YAClE,0BAA0B;YAC1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;YAC9B,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;YACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;gBACzC,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;oBACxB,8DAA8D;oBAC9D,2DAA2D;oBAC3D,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAS,CAAA;oBACxD,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,gBAAgB;wBACtB,QAAQ,EAAE,IAAI;wBACd,EAAE,EAAE,EAAE,CAAC,EAAE;wBACT,MAAM,EAAE,KAAK;qBACd,CAAC,CAAA;oBACF,MAAK;gBACP,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;QACtD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAA;gBACf,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC9C,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,0BAA0B;wBAChC,QAAQ,EAAE,IAAI;wBACd,EAAE,EAAE,CAAC,CAAC,EAAE;wBACR,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC;qBAC1B,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,sEAAsE;IACtE,mEAAmE;IACnE,qEAAqE;IACrE,mEAAmE;IACnE,0DAA0D;IAC1D,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACrB,IAAA,uBAAY,EAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,IAAA,uBAAY,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC;WACrD,IAAA,uBAAY,EAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAE1D,OAAO,QAAQ,CAAA;AACjB,CAAC;AAGD,mEAAmE;AACnE,mEAAmE;AACnE,+DAA+D;AAC/D,oEAAoE;AACpE,yDAAyD;AACzD,wBAA+B,GAAQ,EAAE,IAAS;IAChD,MAAM,KAAK,GAAyB,GAAG,CAAC,SAAS,CAAA;IACjD,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;QACrB,OAAM;IACR,CAAC;IACD,MAAM,QAAQ,GAAG,gBAAgB,CAAC,KAAK,EAAE,IAAA,eAAO,EAAC,IAAI,CAAC,CAAC,CAAA;IACvD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,IAAI,GAAQ,IAAI,CAAA;QACpB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3C,6DAA6D;YAC7D,2DAA2D;YAC3D,kCAAkC;YAClC,OAAO,IAAI,KAAK,IAAI,EAAE,WAAW,EAAE,CAAC;gBAClC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;YAClB,CAAC;YACD,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAA;QACzB,CAAC;QACD,2DAA2D;QAC3D,gEAAgE;QAChE,4DAA4D;QAC5D,kEAAkE;QAClE,WAAW;QACX,GAAG,CAAC,MAAM,CAAC,IAAA,gBAAU,EAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE;YAC5D,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;SAC9B,CAAC,CAAC,CAAA;IACL,CAAC;AACH,CAAC;AAGD,kEAAkE;AAClE,oCAAoC;AACpC,uBACE,GAAW,EAAE,IAAsB;IACnC,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,iEAAiE;IACjE,mEAAmE;IACnE,mCAAmC;IACnC,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,CAAC;QAC/C,OAAO;YACL,OAAO,EAAE,OAAO;YAChB,QAAQ,EAAE,EAAE;YACZ,MAAM,EAAE,CAAC,IAAA,oBAAc,EAAC,GAAG,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SAClD,CAAA;IACH,CAAC;IAED,MAAM,KAAK,GAA0B,GAAW,CAAC,SAAS,CAAA;IAC1D,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;QACrB,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;IAC1C,CAAC;IAED,8DAA8D;IAC9D,mEAAmE;IACnE,8DAA8D;IAC9D,iEAAiE;IACjE,iEAAiE;IACjE,+DAA+D;IAC/D,+DAA+D;IAC/D,iEAAiE;IACjE,iEAAiE;IACjE,wDAAwD;IACxD,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;IAClD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACd,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;QACxB,OAAO;YACL,OAAO,EAAE,OAAO;YAChB,QAAQ,EAAE,EAAE;YACZ,MAAM,EAAE,CAAC,IAAA,oBAAc,EAAC,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACnD,CAAA;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,gBAAgB,CAAC,KAAK,EAAE,IAAA,eAAO,EAAC,IAAI,CAAC,CAAC,CAAA;IACvD,OAAO;QACL,OAAO,EAAE,CAAC,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM;QAChD,QAAQ;KACT,CAAA;AACH,CAAC"}

package/dist/sig.d.ts

@@ -0,0 +1,25 @@
+type ArgMode = 'value' | 'capture' | 'template' | 'trial' | 'projector' | 'text';
+type GroupSig = {
+    mode: ArgMode;
+    type: string;
+};
+type ArgSig = {
+    name: string;
+    mode: ArgMode;
+    type: string;
+    opt?: boolean;
+    rest?: boolean;
+    group?: GroupSig[];
+};
+type FuncSig = {
+    name: string;
+    args: ArgSig[];
+    out: string;
+};
+declare function parseSigLine(line: string): FuncSig;
+declare function renderSigArg(a: ArgSig): string;
+declare function renderSig(sig: FuncSig): string;
+declare function parseSigText(text: string): Record<string, FuncSig>;
+export type { ArgMode, ArgSig, GroupSig, FuncSig, };
+declare const funcSig: Record<string, FuncSig>;
+export { funcSig, parseSigLine, parseSigText, renderSig, renderSigArg, };