aontu 0.52.1 → 0.54.0

package/dist/val/ReferFuncVal.js

@@ -0,0 +1,604 @@
+"use strict";
+/* Copyright (c) 2025 Richard Rodger, MIT License */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RelVal = exports.RelFuncVal = exports.ReferVal = exports.ReferFuncVal = void 0;
+exports.addressPath = addressPath;
+exports.findAt = findAt;
+const type_1 = require("../type");
+const err_1 = require("../err");
+const FuncBaseVal_1 = require("./FuncBaseVal");
+const PathVal_1 = require("./PathVal");
+const FeatureVal_1 = require("./FeatureVal");
+const ConjunctVal_1 = require("./ConjunctVal");
+const unify_1 = require("../unify");
+const top_1 = require("./top");
+const utility_1 = require("../utility");
+// A RELATION PREDICATE is still a declared D-1 name
+// (docs/design/RELATIONS.0.md §3.2). Entity names are gone with
+// ADR-014; predicate names are not -- a relation is a vocabulary term,
+// not an address.
+const PREDICATE_NAME = /^[_a-zA-Z][-_a-zA-Z0-9]*$/;
+// The tree path an address resolves to from `at` -- the position of
+// the link itself -- or undefined when a relative address climbs off
+// the top of the tree.
+function addressPath(addr, at) {
+    if (addr.absolute) {
+        return addr.parts;
+    }
+    // The SIBLING scope: drop the link's own key, then take the parent
+    // steps. A link at `$.a.b.dep` spelling `.other` means `$.a.b.other`.
+    const cut = at.length - 1 - addr.up;
+    if (cut < 0) {
+        return undefined;
+    }
+    return at.slice(0, cut).map(String).concat(addr.parts);
+}
+// The node a tree path names, with the parent and key that hold it so
+// a type flow can be written back. Pending is not failure: the target
+// may be introduced by a later conjunct, include or spread, so `refer`
+// residuates exactly as a forward reference does.
+function findAt(root, path) {
+    if (null == root || 0 === path.length) {
+        return undefined;
+    }
+    let parent = undefined;
+    let key = undefined;
+    let val = root;
+    for (const seg of path) {
+        if (true !== val?.isMap && true !== val?.isList) {
+            return undefined;
+        }
+        const next = val.peg[seg];
+        if (null == next) {
+            return undefined;
+        }
+        parent = val;
+        key = seg;
+        val = next;
+    }
+    return { parent, key, val };
+}
+// concreteFlow is `t` as it enters the target: a copy with the
+// type/hide marks cleared at every depth. The clone matters as much as
+// the clearing — `t` is shared by every position that refers to the
+// same thing, and clearing in place would unmark the schema itself.
+function concreteFlow(ctx, t) {
+    let marked = false;
+    (0, utility_1.walk)(t, (_key, v) => {
+        marked = marked || v.mark.type || v.mark.hide;
+        return v;
+    });
+    // An unmarked flow type is passed THROUGH: cloning one anyway would
+    // move the site an error names, and a conflict has to point at what
+    // the author wrote.
+    if (!marked) {
+        return t;
+    }
+    const out = t.clone(ctx);
+    (0, utility_1.walk)(out, (_key, v) => {
+        v.mark.type = false;
+        v.mark.hide = false;
+        return v;
+    });
+    return out;
+}
+// ReferVal is what `refer(t)` RESOLVES to: the residual constraint,
+// carrying the type to flow and — once it has met a string — the
+// address to flow it into. A separate value from the function for the
+// reason every residual is: the function is written once and the
+// constraint is met many times, and only the constraint has state
+// worth carrying.
+class ReferVal extends FeatureVal_1.FeatureVal {
+    constructor(spec, ctx) {
+        super(spec, ctx);
+        this.isRefer = true;
+        this.isGenable = true;
+        // AFTER the plain values (base 99999), BEFORE the sizing atoms
+        // (LATE_CJO): sibling path values fold together first under the
+        // prefix rule, and the residual then meets ONE merged address --
+        // without this, `refer() & path($.a) & path($.a.b)` settled on the
+        // first path and the second met the finished link too late.
+        this.cjo = 120000;
+        // The codes this residual refuses with: refer() keeps its own,
+        // rel()-minted residuals carry rel_address/rel_unresolved.
+        this.addrcode = 'refer_address';
+        this.unresolvedcode = 'refer_unresolved';
+        this.tval = spec.tval ?? (0, top_1.top)();
+        this.addr = spec.addr;
+        this.addrsrc = spec.addrsrc;
+        this.held = spec.held;
+        this.dc = 0;
+    }
+    // The residual's own state — the type to flow, the address it has
+    // met, the constraints it holds — TRAVELS with the clone. A spread
+    // template holds the FUNCTION, so a template never needs this; a
+    // REFERENCE to a value that already contains a resolved link does
+    // (`z: {u: refer() & "$.a"}` then `s: $.z`). Without it the
+    // clone came back as a bare `refer()` — the address silently
+    // dropped, and the copied link resolving to nothing.
+    //
+    // No path-dependence hook, though: a residual is minted at its
+    // destination, so `key()` inside a template resolves there already.
+    clone(ctx, spec) {
+        const out = super.clone(ctx, spec);
+        out.tval = this.tval;
+        out.addr = this.addr;
+        out.addrsrc = this.addrsrc;
+        out.held = this.held;
+        out.relkey = this.relkey;
+        out.addrcode = this.addrcode;
+        out.unresolvedcode = this.unresolvedcode;
+        return out;
+    }
+    unify(peer, ctx) {
+        const p = peer;
+        // Another `refer` at the same position: one constraint, both
+        // types. `refer(A) & refer(B)` is a target that must be both.
+        if (true === p?.isRefer) {
+            return this.with(ctx, {
+                tval: (0, unify_1.unite)(ctx, this.tval, p.tval, 'refer-t'),
+                addr: this.addr ?? p.addr,
+                addrsrc: this.addrsrc ?? p.addrsrc,
+                held: null == this.held ? p.held
+                    : null == p.held ? this.held
+                        : (0, unify_1.unite)(ctx, this.held, p.held, 'refer-held'),
+            }, this);
+        }
+        if (null == peer || true === p.isTop) {
+            return this.settle(ctx, this);
+        }
+        if (true === p.isNil) {
+            return peer;
+        }
+        // A PATH VALUE is the ADDRESS, when there is not one yet. Only a
+        // path value can be one (PATHS.0.md, amended): a bare string is
+        // never a path -- `path("...")` is the one string conversion, and
+        // it happens at the call, not here. The peg is pre-validated by
+        // the capture, so no parse can fail.
+        if (undefined === this.addr && true === p.isPath) {
+            const addr = (0, PathVal_1.parseAddress)(p.peg);
+            return this.with(ctx, { addr, addrsrc: p.peg }, peer);
+        }
+        // A SECOND path peer refines the address by the prefix rule: the
+        // longer of the two when one opens the other, exactly as two path
+        // values meet on their own. Two incomparable addresses are the
+        // same conflict two unequal scalars are.
+        if (undefined !== this.addr && true === p.isPath) {
+            const merged = (0, PathVal_1.prefixMeet)(this.addrsrc, p.peg);
+            if (undefined === merged) {
+                return (0, err_1.makeNilErr)(ctx, 'scalar_value', this, peer);
+            }
+            return this.with(ctx, { addr: (0, PathVal_1.parseAddress)(merged), addrsrc: merged }, peer);
+        }
+        // A value that can never BE a path cannot be the address, and no
+        // later pass can repair it — so this arm refuses rather than
+        // defers. A bare STRING is in it now (PATHS.0.md, amended):
+        // `path("...")` is the one conversion, at the call. A KIND or a
+        // constraint is not in it: `string`, `re("^svc_")` and the like
+        // are perfectly good constraints on an address, and are held
+        // below until there is one to apply them to.
+        if ((true === p.isScalar && true !== p.isPath)
+            || true === p.isMap || true === p.isList) {
+            return (0, err_1.makeNilErr)(ctx, this.addrcode, this, peer, 'refer');
+        }
+        // HELD: everything else waits for the address. Carried on the
+        // residual rather than parked in a conjunct, because a conjunct
+        // rebuilt every pass grows a level every pass; the held constraint
+        // meets the link the moment the address resolves, so
+        // `refer() & re("a") & re("b") & path($.z)` still applies both and
+        // `refer() & string & path($.z)` still passes.
+        return this.with(ctx, {
+            held: null == this.held ? peer : (0, unify_1.unite)(ctx, this.held, peer, 'refer-held'),
+        }, this);
+    }
+    // with is the residual reshaped: every arm above answers a NEW
+    // ReferVal rather than mutating this one, because a spread template's
+    // residual is shared by every child it is applied to.
+    with(ctx, spec, site) {
+        const out = new ReferVal({}, ctx);
+        out.tval = spec.tval ?? this.tval;
+        out.addr = spec.addr ?? this.addr;
+        out.addrsrc = spec.addrsrc ?? this.addrsrc;
+        out.held = spec.held ?? this.held;
+        out.relkey = this.relkey;
+        out.addrcode = this.addrcode;
+        out.unresolvedcode = this.unresolvedcode;
+        (0, utility_1.propagateMarks)(this, out);
+        out.site = site.site;
+        out.path = this.path;
+        return out.settle(ctx, site);
+    }
+    // settle answers the address if the evaluation can, and stays
+    // pending if it cannot YET. `site` is the value whose position the
+    // resolved string should take.
+    settle(ctx, site) {
+        if (undefined === this.addr) {
+            // NOT DONE, unlike `string` or `min(1)`. A refer without an
+            // address has not done its work — it exists to check one — and
+            // the pass loop must keep offering it the chance. The cost is
+            // that a SCHEMA mentioning a link never resolves either, so
+            // `type({from: refer($.std.Port)})` is not expressible today;
+            // G4 phase 4 records why, and what it would take.
+            this.dc = 0;
+            return this;
+        }
+        // The address is a TREE PATH, resolved from the link's own
+        // position for a relative one. A climb off the top of the tree can
+        // never be repaired by a later pass, so it refuses at once.
+        const target = addressPath(this.addr, this.path);
+        if (undefined === target) {
+            return (0, err_1.makeNilErr)(ctx, this.unresolvedcode, this, undefined, 'refer', { addr: this.addrsrc });
+        }
+        const found = findAt(ctx?.root, target);
+        if (undefined === found) {
+            // PENDING, not failed — until the last pass. The target may be
+            // introduced by a later conjunct, include or spread, so `refer`
+            // residuates as a forward reference does; but within ONE
+            // evaluation the document-set is fixed, so existence IS
+            // decidable, and the final pass is where it is decided. A
+            // pending refer keeps the tree not-done, so the pass loop always
+            // reaches that pass when there is one to decide.
+            if (ctx.cc + 1 >= ctx.budget.passes) {
+                return (0, err_1.makeNilErr)(ctx, this.unresolvedcode, this, undefined, 'refer', { addr: this.addrsrc });
+            }
+            this.dc = 0;
+            return this;
+        }
+        // THE FLOW. `t` is unified into the target and written back at the
+        // target's own position — one position, because the tree is the
+        // namespace and a path names exactly one node.
+        //
+        // RE-ENTRANT ONLY ONCE PER TARGET (use-cases/BUGS.md §19). Uniting
+        // the target drives the target's OWN subtree, and if the target
+        // links back — `a` typed-refers `b`, `b` typed-refers `a`, the
+        // shape every inverse pair has — that drives this target again,
+        // and the two flow into each other until the depth budget or the
+        // host stack ends it. `unify_cycle` on a model whose meet plainly
+        // converges: `{k:1}` meeting `{k:1}` is a fixpoint, and the
+        // evaluator never got far enough to notice.
+        //
+        // The guard is the set of paths a flow is currently inside, on the
+        // context. A flow that would re-enter one has its MEET skipped:
+        // the outer flow it is nested in is already uniting that node, and
+        // re-entering is what runs the host stack out.
+        //
+        // ITS RECORD IS STILL WRITTEN. The skip used to take the record
+        // with it, on the reasoning that "the same information arrives by
+        // the same channel one frame up" -- true of the outer flow's TYPE,
+        // and false of a nested flow carrying a DIFFERENT one. The outer
+        // flow delivers only its own type, the residual is consumed into a
+        // settled link in the same breath, and nothing re-offers it: the
+        // nested type was lost for good, and which of two flows was the
+        // nested one depended on which link the evaluator happened to
+        // reach first. A layering rule declared on one field and reached
+        // through another module's mirror therefore held in one
+        // declaration order and not in the other (BUGS.md 69).
+        //
+        // Recording it DEFERS the meet to `applyFlows`, which runs at the
+        // top of the tree with no flow in flight and so cannot re-enter
+        // anything -- the channel this record already exists to be.
+        const guard = target.join('.');
+        // Seeded on the unify root (ts/src/unify.ts): a `??=` here would
+        // make a fresh set on whichever descended context asked first.
+        const flowing = ctx._referflow ?? new Set();
+        if (!this.tval.isTop) {
+            // The flowed type is CONCRETE at the target: a schema flowing
+            // into a value must not make the value a schema. Same reasoning
+            // as a reference's clone clearing marks — `refer($.std.Service)`
+            // says the target IS a Service, not that it is the definition
+            // of one — and without it the target silently stopped
+            // generating.
+            const flow = concreteFlow(ctx, this.tval);
+            // THE RECORD, keyed by the target's path, replayed onto every
+            // later pass by applyFlows in ts/src/unify.ts. A pass rebuilds
+            // subtrees, so the write below does not survive one when the
+            // link sits inside its own target or two nodes link at each
+            // other; the record is what makes the flow reach the result
+            // rather than the tree it was computed from.
+            const flows = ctx.referflows ??
+                new Map();
+            const key = target.join('\x00');
+            const prev = flows.get(key);
+            flows.set(key, null == prev ? flow : (0, unify_1.unite)(ctx, prev, flow, 'refer-flow-record'));
+            if (!flowing.has(guard)) {
+                flowing.add(guard);
+                try {
+                    const merged = (0, unify_1.unite)(ctx, found.val, flow, 'refer-flow');
+                    if (true === merged.isNil) {
+                        return merged;
+                    }
+                    // The write into THIS pass's view, so the rest of the pass
+                    // sees it. findAt refuses the empty path, so a resolved
+                    // target always has a parent holding it.
+                    //
+                    // NOT FROM INSIDE A TRIAL. A disjunction member is a
+                    // HYPOTHESIS, and writing its flow into the live tree
+                    // asserts the member's type on another node before the
+                    // member is known to survive. The `unite` above still runs:
+                    // its nil is how a member legitimately fails. Only the
+                    // COMMIT waits, and the surviving member's flow reaches the
+                    // tree on the next pass, from the record DisjunctVal stages
+                    // and merges for survivors alone.
+                    if (true !== ctx._trialMode) {
+                        found.parent.peg[found.key] = merged;
+                    }
+                }
+                finally {
+                    flowing.delete(guard);
+                }
+            }
+        }
+        // The value IS the address, as a PATH VALUE (ADR-016): a link,
+        // not an embedding -- and re-stating or refining the address
+        // still meets it, which a string link could not do under the
+        // strict rules.
+        const out = new PathVal_1.PathVal({ peg: this.addrsrc }, ctx);
+        out.dc = type_1.DONE;
+        // STAMPED as a link (G4 phase 3): the value is the address string,
+        // so without this nothing downstream could tell a checked link from
+        // a literal that happens to look like one. The edge set is exactly
+        // the set of these stamps. A rel()-minted link also carries its
+        // PREDICATE (the rel field's key), so the graph reports a declared
+        // relation rather than inferring one from the path.
+        //
+        // The stamp is the RESOLVED path, not the written one: a relative
+        // address means a different node from each position it is written
+        // at, and an edge set whose far ends were spellings rather than
+        // nodes could not be traversed. The VALUE stays what the author
+        // wrote --- the link is what it says, the edge is where it goes.
+        out.link = '$.' + target.join('.');
+        if (undefined !== this.relkey) {
+            out.relkey = this.relkey;
+        }
+        (0, utility_1.propagateMarks)(this, out);
+        out.site = site.site;
+        out.path = this.path;
+        return null == this.held ? out : (0, unify_1.unite)(ctx, out, this.held, 'refer-held');
+    }
+    get canon() {
+        const t = this.tval.isTop ? '' : this.tval.canon;
+        const call = 'refer(' + t + ')' +
+            (null == this.held ? '' : '&' + this.held.canon);
+        // The address renders as the path call: a bare string address no
+        // longer reparses (PATHS.0.md, amended), and canon must.
+        return undefined === this.addrsrc
+            ? call : call + '&path(' + this.addrsrc + ')';
+    }
+}
+exports.ReferVal = ReferVal;
+// RelVal is what `rel(t?)` RESOLVES to (RELATIONS.0.md §3.2): the
+// relation constraint, sited on the FIELD the way the sizing atoms sit
+// on containers. Its value may be one address, a LIST of addresses, or
+// a MAP whose string leaves are addresses -- the container shapes are
+// rewritten leaf by leaf through the refer machinery, so pending
+// resolution, type flow and link stamping are the one battle-tested
+// path, and the data side stays plain strings. The PREDICATE of every
+// edge produced is the key the rel() sits on -- declared once, in the
+// schema, never inferred from the path.
+class RelVal extends FeatureVal_1.FeatureVal {
+    constructor(spec, ctx) {
+        super(spec, ctx);
+        this.isRel = true;
+        this.isGenable = true;
+        this.cjo = 45000;
+        this.tval = spec.tval ?? (0, top_1.top)();
+        this.held = spec.held;
+        // DONE while unmet, deliberately -- the property refer() lacks and
+        // G4 phase 4 records the cost of: a type() body holding a rel()
+        // must SETTLE, or the schema idiom (`dependsOn?: rel($.T)` inside
+        // a vocabulary) leaves the type unresolved and every reference to
+        // it deferring forever. An unmet rel is its own settled residual,
+        // like `min(1)`; the meet re-activates it whenever a value
+        // arrives, because map merges build the conjunct regardless.
+        this.dc = type_1.DONE;
+    }
+    clone(ctx, spec) {
+        const out = super.clone(ctx, spec);
+        out.tval = this.tval;
+        out.held = this.held;
+        return out;
+    }
+    // The predicate: the last segment of the field path the constraint
+    // is being APPLIED at -- when that segment is a D-1 NAME. A relation
+    // predicate is a declared name (RELATIONS.0.md §3.2), so a list
+    // index or a key outside the name grammar produces unlabelled
+    // links, and the graph falls back to its old inference. The D-1
+    // test is also what keeps the two ports' edges identical: a list
+    // index is a number here and a string in Go.
+    //
+    // THE PATH COMES FROM THE CONTEXT, not from `this.path`. The val's
+    // own path records where this constraint was CLONED FROM, and the
+    // two part company the moment a second document merges into an
+    // entity: the field's constraint is then driven at the ENTITY, and
+    // `this.path` names the entity while the context names the field.
+    // The predicate became the entity's own key, every link under it
+    // minted an edge starting one level too high, and `inverse(n)`
+    // reported a mirror that was written as missing.
+    fieldkey(ctx) {
+        const path = ctx.path;
+        const seg = path[path.length - 1];
+        return 'string' === typeof seg && PREDICATE_NAME.test(seg) ? seg : undefined;
+    }
+    // One leaf's residual: the refer machinery carrying rel's codes,
+    // predicate and type. The predicate is passed IN, because the field
+    // it names is decided where the rewrite starts and must not be
+    // re-read on the way down (see `rewriteUnder`).
+    leafRefer(ctx, relkey) {
+        const rv = new ReferVal({ tval: this.tval }, ctx);
+        rv.addrcode = 'rel_address';
+        rv.unresolvedcode = 'rel_unresolved';
+        rv.relkey = relkey;
+        rv.site = this.site;
+        rv.path = this.path;
+        return rv;
+    }
+    // The container, every string leaf wrapped as a link. Nested
+    // containers descend; a leaf already STAMPED as a link is left
+    // alone, which is what makes a second application (a template
+    // re-applied, a later pass) a no-op.
+    rewrite(ctx, container) {
+        return this.rewriteUnder(ctx, container, this.fieldkey(ctx));
+    }
+    // The rewrite proper, carrying the predicate decided at the field.
+    // It is decided ONCE, at the top: a map-valued relation
+    // (`dependsOn: {primary: [...]}`) descends through the inner label
+    // and must still report `dependsOn`, which is the whole reason a
+    // link carries a declared predicate rather than letting the graph
+    // infer one from its position.
+    rewriteUnder(ctx, container, relkey) {
+        const out = container.clone(ctx);
+        const peg = out.peg;
+        const keys = Array.isArray(peg)
+            ? peg.map((_v, i) => i) : Object.keys(peg);
+        let pending = false;
+        let nested = false;
+        for (const k of keys) {
+            // Children here are always Vals: the parse builds Vals, elision
+            // builds a NilVal, and clone preserved whatever the container
+            // held.
+            const child = peg[k];
+            if (true === child.isMap || true === child.isList) {
+                nested = true;
+                const sub = this.rewriteUnder(ctx.descend('' + k), child, relkey);
+                peg[k] = sub;
+                pending = pending || true !== sub.done;
+            }
+            else if (undefined === child.link) {
+                let leaf = (0, unify_1.unite)(ctx.descend('' + k), this.leafRefer(ctx, relkey), child, 'rel-leaf');
+                // The held constraints apply PER LEAF: a re() on the relation
+                // constrains every address, never the container that holds
+                // them (found by the service catalog, whose re("^svc_") met
+                // the whole list and refused it).
+                if (null != this.held) {
+                    leaf = (0, unify_1.unite)(ctx.descend('' + k), leaf, this.held, 'rel-held');
+                }
+                peg[k] = leaf;
+                pending = pending || true !== leaf.done;
+            }
+        }
+        // The rewrite holds its PENDING leaves open (an address whose
+        // entity a later statement declares), so the pass loop keeps
+        // driving the container until every link settles. A rewrite that
+        // minted NOTHING pending -- every leaf already linked or settled
+        // in place -- keeps the clone's doneness: re-applying a template
+        // over a settled value must converge in the same pass, or the
+        // enclosing bags reopen forever (the service catalog, where the
+        // entity merge drops the spread stamp each pass).
+        if (pending) {
+            out.dc = 0;
+        }
+        // Elements that arrive AFTER this rewrite -- another statement of
+        // the list, a patch position of the entity -- must convert too, so
+        // the rewrite installs its own leaf constraint as the container's
+        // ELEMENT SPREAD, exactly the machinery the old per-element
+        // `[&: refer()]` idiom used. Only on a FLAT address container (a
+        // labelled map's sub-containers get their own spread from the
+        // recursion above; a leaf template meeting a map child would
+        // refuse it), and only where no spread already stands: a schema's
+        // own template is not this rewrite's to clobber.
+        if (!nested && null == out.spread.cj) {
+            let tmpl = this.leafRefer(ctx, relkey);
+            if (null != this.held) {
+                tmpl = new ConjunctVal_1.ConjunctVal({ peg: [tmpl, this.held] }, ctx);
+            }
+            ;
+            out.spread.cj = tmpl;
+        }
+        return out;
+    }
+    unify(peer, ctx) {
+        const p = peer;
+        // Two rel() at one field: one relation, both types.
+        if (true === p?.isRel) {
+            const out = new RelVal({}, ctx);
+            out.tval = (0, unify_1.unite)(ctx, this.tval, p.tval, 'rel-t');
+            out.held = null == this.held ? p.held
+                : null == p.held ? this.held
+                    : (0, unify_1.unite)(ctx, this.held, p.held, 'rel-held');
+            (0, utility_1.propagateMarks)(this, out);
+            out.site = this.site;
+            out.path = this.path;
+            return out;
+        }
+        // No null/top/nil arms: unite's dispatch ladder absorbs those
+        // peers before any Val's own unify is consulted (a null or top
+        // peer returns this side; a nil peer returns the nil), and unite
+        // is the only entrance -- the container hand-offs pass the
+        // container itself.
+        // ONE ADDRESS: the scalar-valued field, refer's own shape. A path
+        // value only -- a bare string is never an address (PATHS.0.md,
+        // amended); the scalar arm below refuses it.
+        if (true === p.isPath) {
+            const out = (0, unify_1.unite)(ctx, this.leafRefer(ctx, this.fieldkey(ctx)), peer, 'rel-scalar');
+            return null == this.held ? out
+                : (0, unify_1.unite)(ctx, out, this.held, 'rel-held');
+        }
+        // A SET OF LINKS: list or map, rewritten leaf by leaf; the held
+        // constraints ride into each leaf inside the rewrite.
+        if (true === p.isMap || true === p.isList) {
+            return this.rewrite(ctx, peer);
+        }
+        // A scalar that can never be an address.
+        if (true === p.isScalar) {
+            return (0, err_1.makeNilErr)(ctx, 'rel_address', this, peer, 'refer');
+        }
+        // Everything else -- a reference still resolving, a kind, a
+        // container constraint -- waits for the value, as refer's held
+        // does.
+        const out = new RelVal({}, ctx);
+        out.tval = this.tval;
+        out.held = null == this.held ? peer
+            : (0, unify_1.unite)(ctx, this.held, peer, 'rel-held');
+        (0, utility_1.propagateMarks)(this, out);
+        out.site = this.site;
+        out.path = this.path;
+        return out;
+    }
+    get canon() {
+        const t = this.tval.isTop ? '' : this.tval.canon;
+        return 'rel(' + t + ')' +
+            (null == this.held ? '' : '&' + this.held.canon);
+    }
+}
+exports.RelVal = RelVal;
+class RelFuncVal extends FuncBaseVal_1.FuncBaseVal {
+    constructor(spec, ctx) {
+        super(spec, ctx);
+        this.isRelFunc = true;
+    }
+    make(_ctx, spec) {
+        return new RelFuncVal(spec);
+    }
+    funcname() {
+        return 'rel';
+    }
+    resolve(ctx, args) {
+        const out = new RelVal({}, ctx);
+        out.tval = 0 < args.length ? args[0] : (0, top_1.top)();
+        out.site = this.site;
+        out.path = this.path;
+        return out;
+    }
+}
+exports.RelFuncVal = RelFuncVal;
+class ReferFuncVal extends FuncBaseVal_1.FuncBaseVal {
+    constructor(spec, ctx) {
+        super(spec, ctx);
+        this.isReferFunc = true;
+    }
+    make(_ctx, spec) {
+        return new ReferFuncVal(spec);
+    }
+    funcname() {
+        return 'refer';
+    }
+    resolve(ctx, args) {
+        const out = new ReferVal({}, ctx);
+        out.tval = 0 < args.length ? args[0] : (0, top_1.top)();
+        out.site = this.site;
+        out.path = this.path;
+        return out;
+    }
+} /* node:coverage ignore next 10 */
+exports.ReferFuncVal = ReferFuncVal;
+//# sourceMappingURL=ReferFuncVal.js.map

package/dist/val/ReferFuncVal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReferFuncVal.js","sourceRoot":"","sources":["../../src/val/ReferFuncVal.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;;;AA2BpD,kCAEgB;AAMhB,gCAAmC;AAEnC,+CAA2C;AAC3C,uCAKkB;AAClB,6CAAyC;AACzC,+CAA2C;AAC3C,oCAAgC;AAChC,+BAA2B;AAC3B,wCAAiD;AAGjD,oDAAoD;AACpD,gEAAgE;AAChE,uEAAuE;AACvE,kBAAkB;AAClB,MAAM,cAAc,GAAG,2BAA2B,CAAA;AAGlD,oEAAoE;AACpE,qEAAqE;AACrE,uBAAuB;AACvB,qBACE,IAAa,EAAE,EAAuB;IAEtC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IACD,mEAAmE;IACnE,sEAAsE;IACtE,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAA;IACnC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;QACZ,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;AACxD,CAAC;AAGD,sEAAsE;AACtE,sEAAsE;AACtE,uEAAuE;AACvE,kDAAkD;AAClD,gBACE,IAAqB,EAAE,IAAc;IAErC,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;QACtC,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,IAAI,MAAM,GAAQ,SAAS,CAAA;IAC3B,IAAI,GAAG,GAAuB,SAAS,CAAA;IACvC,IAAI,GAAG,GAAQ,IAAI,CAAA;IACnB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,IAAI,KAAK,GAAG,EAAE,KAAK,IAAI,IAAI,KAAK,GAAG,EAAE,MAAM,EAAE,CAAC;YAChD,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACzB,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACjB,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,MAAM,GAAG,GAAG,CAAA;QACZ,GAAG,GAAG,GAAG,CAAA;QACT,GAAG,GAAG,IAAI,CAAA;IACZ,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;AAC7B,CAAC;AAGD,+DAA+D;AAC/D,uEAAuE;AACvE,oEAAoE;AACpE,oEAAoE;AACpE,SAAS,YAAY,CAAC,GAAiB,EAAE,CAAM;IAC7C,IAAI,MAAM,GAAG,KAAK,CAAA;IAClB,IAAA,cAAI,EAAC,CAAC,EAAE,CAAC,IAAiC,EAAE,CAAM,EAAE,EAAE;QACpD,MAAM,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;QAC7C,OAAO,CAAC,CAAA;IACV,CAAC,CAAC,CAAA;IACF,oEAAoE;IACpE,oEAAoE;IACpE,oBAAoB;IACpB,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,CAAC,CAAA;IACV,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IACxB,IAAA,cAAI,EAAC,GAAG,EAAE,CAAC,IAAiC,EAAE,CAAM,EAAE,EAAE;QACtD,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAA;QACnB,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAA;QACnB,OAAO,CAAC,CAAA;IACV,CAAC,CAAC,CAAA;IACF,OAAO,GAAG,CAAA;AACZ,CAAC;AAGD,oEAAoE;AACpE,iEAAiE;AACjE,sEAAsE;AACtE,iEAAiE;AACjE,kEAAkE;AAClE,kBAAkB;AAClB,MAAM,QAAS,SAAQ,uBAAU;IA8B/B,YAAY,IAAa,EAAE,GAAkB;QAC3C,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QA9BlB,YAAO,GAAG,IAAI,CAAA;QACd,cAAS,GAAG,IAAI,CAAA;QAChB,+DAA+D;QAC/D,gEAAgE;QAChE,iEAAiE;QACjE,mEAAmE;QACnE,4DAA4D;QAC5D,QAAG,GAAG,MAAM,CAAA;QAiBZ,+DAA+D;QAC/D,2DAA2D;QAC3D,aAAQ,GAAW,eAAe,CAAA;QAClC,mBAAc,GAAW,kBAAkB,CAAA;QAIzC,IAAI,CAAC,IAAI,GAAI,IAAY,CAAC,IAAI,IAAI,IAAA,SAAG,GAAE,CAAA;QACvC,IAAI,CAAC,IAAI,GAAI,IAAY,CAAC,IAAI,CAAA;QAC9B,IAAI,CAAC,OAAO,GAAI,IAAY,CAAC,OAAO,CAAA;QACpC,IAAI,CAAC,IAAI,GAAI,IAAY,CAAC,IAAI,CAAA;QAC9B,IAAI,CAAC,EAAE,GAAG,CAAC,CAAA;IACb,CAAC;IAED,kEAAkE;IAClE,mEAAmE;IACnE,iEAAiE;IACjE,kEAAkE;IAClE,4DAA4D;IAC5D,6DAA6D;IAC7D,qDAAqD;IACrD,EAAE;IACF,+DAA+D;IAC/D,oEAAoE;IACpE,KAAK,CAAC,GAAiB,EAAE,IAAc;QACrC,MAAM,GAAG,GAAQ,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QACvC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAA;QAC1B,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QACxB,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC5B,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAA;QACxC,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,KAAK,CAAC,IAAS,EAAE,GAAiB;QAChC,MAAM,CAAC,GAAQ,IAAI,CAAA;QAEnB,6DAA6D;QAC7D,8DAA8D;QAC9D,IAAI,IAAI,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;gBACpB,IAAI,EAAE,IAAA,aAAK,EAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC;gBAC9C,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI;gBACzB,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO;gBAClC,IAAI,EAAE,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;oBAC9B,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI;wBAC1B,CAAC,CAAC,IAAA,aAAK,EAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,YAAY,CAAC;aAClD,EAAE,IAAI,CAAC,CAAA;QACV,CAAC;QAED,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;YACrC,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QAC/B,CAAC;QAED,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;YACrB,OAAO,IAAI,CAAA;QACb,CAAC;QAED,iEAAiE;QACjE,gEAAgE;QAChE,kEAAkE;QAClE,gEAAgE;QAChE,qCAAqC;QACrC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YACjD,MAAM,IAAI,GAAG,IAAA,sBAAY,EAAC,CAAC,CAAC,GAAG,CAAY,CAAA;YAC3C,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,CAAA;QACvD,CAAC;QAED,iEAAiE;QACjE,kEAAkE;QAClE,+DAA+D;QAC/D,yCAAyC;QACzC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,IAAA,oBAAU,EAAC,IAAI,CAAC,OAAiB,EAAE,CAAC,CAAC,GAAG,CAAC,CAAA;YACxD,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;gBACzB,OAAO,IAAA,gBAAU,EAAC,GAAG,EAAE,cAAc,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;YACpD,CAAC;YACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAClB,EAAE,IAAI,EAAE,IAAA,sBAAY,EAAC,MAAM,CAAY,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,CAAC,CAAA;QACrE,CAAC;QAED,iEAAiE;QACjE,6DAA6D;QAC7D,4DAA4D;QAC5D,gEAAgE;QAChE,gEAAgE;QAChE,6DAA6D;QAC7D,6CAA6C;QAC7C,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,QAAQ,IAAI,IAAI,KAAK,CAAC,CAAC,MAAM,CAAC;eACzC,IAAI,KAAK,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YAC3C,OAAO,IAAA,gBAAU,EAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QAC5D,CAAC;QAED,8DAA8D;QAC9D,gEAAgE;QAChE,mEAAmE;QACnE,qDAAqD;QACrD,mEAAmE;QACnE,+CAA+C;QAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;YACpB,IAAI,EAAE,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAA,aAAK,EAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,YAAY,CAAC;SAC3E,EAAE,IAAI,CAAC,CAAA;IACV,CAAC;IAED,+DAA+D;IAC/D,sEAAsE;IACtE,sDAAsD;IACtD,IAAI,CAAC,GAAiB,EAAE,IAAS,EAAE,IAAS;QAC1C,MAAM,GAAG,GAAG,IAAI,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;QACjC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAA;QACjC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAA;QACjC,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAA;QAC1C,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAA;QACjC,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QACxB,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC5B,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAA;QACxC,IAAA,wBAAc,EAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QACzB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,OAAO,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;IAC9B,CAAC;IAED,8DAA8D;IAC9D,mEAAmE;IACnE,+BAA+B;IAC/B,MAAM,CAAC,GAAiB,EAAE,IAAS;QACjC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,4DAA4D;YAC5D,+DAA+D;YAC/D,8DAA8D;YAC9D,4DAA4D;YAC5D,8DAA8D;YAC9D,kDAAkD;YAClD,IAAI,CAAC,EAAE,GAAG,CAAC,CAAA;YACX,OAAO,IAAI,CAAA;QACb,CAAC;QACD,2DAA2D;QAC3D,mEAAmE;QACnE,4DAA4D;QAC5D,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QAChD,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACzB,OAAO,IAAA,gBAAU,EAAC,GAAG,EAAE,IAAI,CAAC,cAAc,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAClE,EAAE,IAAI,EAAE,IAAI,CAAC,OAAiB,EAAE,CAAC,CAAA;QACrC,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;QACvC,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;YACxB,+DAA+D;YAC/D,gEAAgE;YAChE,yDAAyD;YACzD,wDAAwD;YACxD,0DAA0D;YAC1D,iEAAiE;YACjE,iDAAiD;YACjD,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;gBACpC,OAAO,IAAA,gBAAU,EAAC,GAAG,EAAE,IAAI,CAAC,cAAc,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAClE,EAAE,IAAI,EAAE,IAAI,CAAC,OAAiB,EAAE,CAAC,CAAA;YACrC,CAAC;YACD,IAAI,CAAC,EAAE,GAAG,CAAC,CAAA;YACX,OAAO,IAAI,CAAA;QACb,CAAC;QAED,mEAAmE;QACnE,gEAAgE;QAChE,+CAA+C;QAC/C,EAAE;QACF,mEAAmE;QACnE,gEAAgE;QAChE,+DAA+D;QAC/D,gEAAgE;QAChE,iEAAiE;QACjE,kEAAkE;QAClE,4DAA4D;QAC5D,4CAA4C;QAC5C,EAAE;QACF,mEAAmE;QACnE,gEAAgE;QAChE,mEAAmE;QACnE,+CAA+C;QAC/C,EAAE;QACF,gEAAgE;QAChE,kEAAkE;QAClE,mEAAmE;QACnE,iEAAiE;QACjE,mEAAmE;QACnE,iEAAiE;QACjE,gEAAgE;QAChE,8DAA8D;QAC9D,iEAAiE;QACjE,wDAAwD;QACxD,uDAAuD;QACvD,EAAE;QACF,kEAAkE;QAClE,gEAAgE;QAChE,4DAA4D;QAC5D,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAC9B,iEAAiE;QACjE,+DAA+D;QAC/D,MAAM,OAAO,GAAiB,GAAW,CAAC,UAAU,IAAI,IAAI,GAAG,EAAU,CAAA;QACzE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACrB,8DAA8D;YAC9D,gEAAgE;YAChE,iEAAiE;YACjE,8DAA8D;YAC9D,sDAAsD;YACtD,cAAc;YACd,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;YAEzC,8DAA8D;YAC9D,+DAA+D;YAC/D,6DAA6D;YAC7D,4DAA4D;YAC5D,4DAA4D;YAC5D,6CAA6C;YAC7C,MAAM,KAAK,GAAsB,GAAW,CAAC,UAAU;gBACrD,IAAI,GAAG,EAAe,CAAA;YACxB,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAA,aAAK,EAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EACxD,mBAAmB,CAAC,CAAC,CAAA;YAEvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;gBAClB,IAAI,CAAC;oBACH,MAAM,MAAM,GAAG,IAAA,aAAK,EAAC,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,YAAY,CAAC,CAAA;oBACxD,IAAI,IAAI,KAAM,MAAc,CAAC,KAAK,EAAE,CAAC;wBACnC,OAAO,MAAM,CAAA;oBACf,CAAC;oBACD,2DAA2D;oBAC3D,wDAAwD;oBACxD,yCAAyC;oBACzC,EAAE;oBACF,qDAAqD;oBACrD,sDAAsD;oBACtD,uDAAuD;oBACvD,4DAA4D;oBAC5D,uDAAuD;oBACvD,4DAA4D;oBAC5D,4DAA4D;oBAC5D,kCAAkC;oBAClC,IAAI,IAAI,KAAM,GAAW,CAAC,UAAU,EAAE,CAAC;wBACrC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAa,CAAC,GAAG,MAAM,CAAA;oBAChD,CAAC;gBACH,CAAC;wBACO,CAAC;oBACP,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QAED,+DAA+D;QAC/D,6DAA6D;QAC7D,6DAA6D;QAC7D,gBAAgB;QAChB,MAAM,GAAG,GAAQ,IAAI,iBAAO,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,OAAiB,EAAE,EAAE,GAAG,CAAC,CAAA;QAClE,GAAG,CAAC,EAAE,GAAG,WAAI,CAAA;QACb,mEAAmE;QACnE,oEAAoE;QACpE,mEAAmE;QACnE,gEAAgE;QAChE,mEAAmE;QACnE,oDAAoD;QACpD,EAAE;QACF,kEAAkE;QAClE,kEAAkE;QAClE,gEAAgE;QAChE,gEAAgE;QAChE,iEAAiE;QACjE,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAClC,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9B,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QAC1B,CAAC;QACD,IAAA,wBAAc,EAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QACzB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,OAAO,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAA,aAAK,EAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAA;IAC3E,CAAC;IAED,IAAI,KAAK;QACP,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAA;QAChD,MAAM,IAAI,GAAG,QAAQ,GAAG,CAAC,GAAG,GAAG;YAC7B,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAClD,iEAAiE;QACjE,yDAAyD;QACzD,OAAO,SAAS,KAAK,IAAI,CAAC,OAAO;YAC/B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,QAAQ,GAAG,IAAI,CAAC,OAAO,GAAG,GAAG,CAAA;IACjD,CAAC;CACF;QAqRC,QAAQ;AAlRV,kEAAkE;AAClE,uEAAuE;AACvE,uEAAuE;AACvE,sEAAsE;AACtE,iEAAiE;AACjE,oEAAoE;AACpE,sEAAsE;AACtE,sEAAsE;AACtE,wCAAwC;AACxC,MAAM,MAAO,SAAQ,uBAAU;IAY7B,YAAY,IAAa,EAAE,GAAkB;QAC3C,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAZlB,UAAK,GAAG,IAAI,CAAA;QACZ,cAAS,GAAG,IAAI,CAAA;QAChB,QAAG,GAAG,KAAK,CAAA;QAWT,IAAI,CAAC,IAAI,GAAI,IAAY,CAAC,IAAI,IAAI,IAAA,SAAG,GAAE,CAAA;QACvC,IAAI,CAAC,IAAI,GAAI,IAAY,CAAC,IAAI,CAAA;QAC9B,mEAAmE;QACnE,gEAAgE;QAChE,kEAAkE;QAClE,kEAAkE;QAClE,kEAAkE;QAClE,2DAA2D;QAC3D,6DAA6D;QAC7D,IAAI,CAAC,EAAE,GAAG,WAAI,CAAA;IAChB,CAAC;IAED,KAAK,CAAC,GAAiB,EAAE,IAAc;QACrC,MAAM,GAAG,GAAQ,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QACvC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,mEAAmE;IACnE,qEAAqE;IACrE,gEAAgE;IAChE,8DAA8D;IAC9D,gEAAgE;IAChE,iEAAiE;IACjE,6CAA6C;IAC7C,EAAE;IACF,mEAAmE;IACnE,kEAAkE;IAClE,+DAA+D;IAC/D,mEAAmE;IACnE,kEAAkE;IAClE,iEAAiE;IACjE,+DAA+D;IAC/D,iDAAiD;IACjD,QAAQ,CAAC,GAAiB;QACxB,MAAM,IAAI,GAAW,GAAW,CAAC,IAAI,CAAA;QACrC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QACjC,OAAO,QAAQ,KAAK,OAAO,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAA;IAC9E,CAAC;IAED,iEAAiE;IACjE,oEAAoE;IACpE,+DAA+D;IAC/D,gDAAgD;IAChD,SAAS,CAAC,GAAiB,EAAE,MAA0B;QACrD,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAS,EAAE,GAAG,CAAC,CAAA;QACxD,EAAE,CAAC,QAAQ,GAAG,aAAa,CAAA;QAC3B,EAAE,CAAC,cAAc,GAAG,gBAAgB,CAAA;QACpC,EAAE,CAAC,MAAM,GAAG,MAAM,CAAA;QAClB,EAAE,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACnB,EAAE,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACnB,OAAO,EAAE,CAAA;IACX,CAAC;IAED,6DAA6D;IAC7D,+DAA+D;IAC/D,8DAA8D;IAC9D,qCAAqC;IACrC,OAAO,CAAC,GAAiB,EAAE,SAAc;QACvC,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAA;IAC9D,CAAC;IAED,mEAAmE;IACnE,wDAAwD;IACxD,mEAAmE;IACnE,iEAAiE;IACjE,kEAAkE;IAClE,+BAA+B;IAC/B,YAAY,CACV,GAAiB,EAAE,SAAc,EAAE,MAA0B;QAE7D,MAAM,GAAG,GAAQ,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QACrC,MAAM,GAAG,GAAQ,GAAG,CAAC,GAAG,CAAA;QACxB,MAAM,IAAI,GAAU,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;YACpC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAO,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACzD,IAAI,OAAO,GAAG,KAAK,CAAA;QACnB,IAAI,MAAM,GAAG,KAAK,CAAA;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,gEAAgE;YAChE,8DAA8D;YAC9D,QAAQ;YACR,MAAM,KAAK,GAAQ,GAAG,CAAC,CAAC,CAAC,CAAA;YACzB,IAAI,IAAI,KAAK,KAAK,CAAC,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;gBAClD,MAAM,GAAG,IAAI,CAAA;gBACb,MAAM,GAAG,GAAQ,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAA;gBACtE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;gBACZ,OAAO,GAAG,OAAO,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,CAAA;YACxC,CAAC;iBACI,IAAI,SAAS,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;gBAClC,IAAI,IAAI,GAAG,IAAA,aAAK,EAAC,GAAG,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,MAAM,CAAC,EAC/D,KAAK,EAAE,UAAU,CAAC,CAAA;gBACpB,8DAA8D;gBAC9D,2DAA2D;gBAC3D,4DAA4D;gBAC5D,kCAAkC;gBAClC,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACtB,IAAI,GAAG,IAAA,aAAK,EAAC,GAAG,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;gBAChE,CAAC;gBACD,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;gBACb,OAAO,GAAG,OAAO,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,CAAA;YACzC,CAAC;QACH,CAAC;QACD,8DAA8D;QAC9D,6DAA6D;QAC7D,iEAAiE;QACjE,iEAAiE;QACjE,iEAAiE;QACjE,8DAA8D;QAC9D,gEAAgE;QAChE,kDAAkD;QAClD,IAAI,OAAO,EAAE,CAAC;YACZ,GAAG,CAAC,EAAE,GAAG,CAAC,CAAA;QACZ,CAAC;QACD,kEAAkE;QAClE,mEAAmE;QACnE,kEAAkE;QAClE,4DAA4D;QAC5D,iEAAiE;QACjE,8DAA8D;QAC9D,6DAA6D;QAC7D,kEAAkE;QAClE,iDAAiD;QACjD,IAAI,CAAC,MAAM,IAAI,IAAI,IAAK,GAAW,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAI,IAAI,GAAQ,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;YAC3C,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACtB,IAAI,GAAG,IAAI,yBAAW,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;YACzD,CAAC;YACD,CAAC;YAAE,GAAW,CAAC,MAAM,CAAC,EAAE,GAAG,IAAI,CAAA;QACjC,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,KAAK,CAAC,IAAS,EAAE,GAAiB;QAChC,MAAM,CAAC,GAAQ,IAAI,CAAA;QAEnB,oDAAoD;QACpD,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;YACtB,MAAM,GAAG,GAAQ,IAAI,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;YACpC,GAAG,CAAC,IAAI,GAAG,IAAA,aAAK,EAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;YACjD,GAAG,CAAC,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;gBACnC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI;oBAC1B,CAAC,CAAC,IAAA,aAAK,EAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;YAC/C,IAAA,wBAAc,EAAC,IAAI,EAAE,GAAG,CAAC,CAAA;YACzB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;YACpB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;YACpB,OAAO,GAAG,CAAA;QACZ,CAAC;QAED,8DAA8D;QAC9D,+DAA+D;QAC/D,iEAAiE;QACjE,2DAA2D;QAC3D,oBAAoB;QAEpB,kEAAkE;QAClE,+DAA+D;QAC/D,6CAA6C;QAC7C,IAAI,IAAI,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,IAAA,aAAK,EAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAClE,YAAY,CAAC,CAAA;YACf,OAAO,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG;gBAC5B,CAAC,CAAC,IAAA,aAAK,EAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;QAC5C,CAAC;QAED,gEAAgE;QAChE,sDAAsD;QACtD,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YAC1C,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QAChC,CAAC;QAED,yCAAyC;QACzC,IAAI,IAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;YACxB,OAAO,IAAA,gBAAU,EAAC,GAAG,EAAE,aAAa,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QAC5D,CAAC;QAED,4DAA4D;QAC5D,+DAA+D;QAC/D,QAAQ;QACR,MAAM,GAAG,GAAQ,IAAI,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;QACpC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,GAAG,CAAC,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;YACjC,CAAC,CAAC,IAAA,aAAK,EAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,CAAA;QAC3C,IAAA,wBAAc,EAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QACzB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,IAAI,KAAK;QACP,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAA;QAChD,OAAO,MAAM,GAAG,CAAC,GAAG,GAAG;YACrB,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACpD,CAAC;CACF;QA2DC,MAAM;AAxDR,MAAM,UAAW,SAAQ,yBAAW;IAGlC,YAAY,IAAa,EAAE,GAAkB;QAC3C,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAHlB,cAAS,GAAG,IAAI,CAAA;IAIhB,CAAC;IAED,IAAI,CAAC,IAAkB,EAAE,IAAa;QACpC,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,CAAA;IAC7B,CAAC;IAED,QAAQ;QACN,OAAO,KAAK,CAAA;IACd,CAAC;IAED,OAAO,CAAC,GAAiB,EAAE,IAAW;QACpC,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;QAC/B,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,SAAG,GAAE,CAAA;QAC5C,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,OAAO,GAAG,CAAA;IACZ,CAAC;CACF;QAiCC,UAAU;AA9BZ,MAAM,YAAa,SAAQ,yBAAW;IAGpC,YAAY,IAAa,EAAE,GAAkB;QAC3C,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAHlB,gBAAW,GAAG,IAAI,CAAA;IAIlB,CAAC;IAED,IAAI,CAAC,IAAkB,EAAE,IAAa;QACpC,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,CAAA;IAC/B,CAAC;IAED,QAAQ;QACN,OAAO,OAAO,CAAA;IAChB,CAAC;IAED,OAAO,CAAC,GAAiB,EAAE,IAAW;QACpC,MAAM,GAAG,GAAG,IAAI,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;QACjC,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,SAAG,GAAE,CAAA;QAC5C,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,OAAO,GAAG,CAAA;IACZ,CAAC;CACF,CAAC,kCAAkC;QAMlC,YAAY"}

package/dist/val/ScalarKindVal.d.ts

@@ -11,10 +11,11 @@ declare class BigDecimal {
 }
 declare class Null {
 }
+declare class Path {
+}
 declare function kindParent(kind: any): any;
-declare function kindFamily(kind: any): any;
 declare function kindSubsumes(sup: any, sub: any): boolean;
-type ScalarConstructor = StringConstructor | NumberConstructor | BooleanConstructor | (typeof Integer) | (typeof Float) | (typeof BigInteger) | (typeof BigDecimal) | (typeof Null) | (typeof Integer.constructor);
+type ScalarConstructor = StringConstructor | NumberConstructor | BooleanConstructor | (typeof Integer) | (typeof Float) | (typeof BigInteger) | (typeof BigDecimal) | (typeof Null) | (typeof Path) | (typeof Integer.constructor);
 declare class ScalarKindVal extends FeatureVal {
     isScalarKind: boolean;
     constructor(spec: ValSpec, ctx?: AontuContext);
@@ -23,4 +24,4 @@ declare class ScalarKindVal extends FeatureVal {
     superior(): Val;
     same(peer: any): boolean;
 }
-export { BigDecimal, BigInteger, Float, Integer, Null, ScalarConstructor, ScalarKindVal, kindFamily, kindParent, kindSubsumes, };
+export { BigDecimal, BigInteger, Float, Integer, Null, Path, ScalarConstructor, ScalarKindVal, kindParent, kindSubsumes, };