aontu 0.56.0 → 0.58.0

package/dist/val/EmitFuncVal.js

@@ -0,0 +1,531 @@
+"use strict";
+/* Copyright (c) 2025 Richard Rodger, MIT License */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EmitFuncVal = void 0;
+const unify_1 = require("../unify");
+const err_1 = require("../err");
+const escape_1 = require("../escape");
+const keyorder_1 = require("../keyorder");
+const top_1 = require("./top");
+const ListVal_1 = require("./ListVal");
+const StringVal_1 = require("./StringVal");
+const FuncBaseVal_1 = require("./FuncBaseVal");
+const Val_1 = require("./Val");
+const PlaceVal_1 = require("./PlaceVal");
+const PlusOpVal_1 = require("./PlusOpVal");
+const members_1 = require("./members");
+function isRefusal(x) {
+    return 'string' === typeof x.code;
+}
+// Read the table. A map is one template; a list is many. The shape is
+// checked here rather than at the call, because a table is ordinary
+// data and may be computed.
+function tableTemplates(table) {
+    const t = table;
+    // A NAMED TABLE IS A PLACEHELD `emit`, and its table is the table.
+    // A table written at a document position is DRIVEN there -- a body's
+    // relative references resolve against wherever it sits and miss --
+    // so the position that holds one unevaluated is the one position the
+    // language already never drives: a call's template argument.
+    // `%wire = emit(_, [ … ])` is that position with the selection left
+    // open, and it reads as what it is, an apply-templates waiting for
+    // its nodes: `emit(.listen, %wire)` passes them, `.listen & %wire`
+    // fills the hole, and both are the same dispatch.
+    if (true === t?.isEmitFunc) {
+        return tableTemplates(t.peg[1]);
+    }
+    if (true === t?.isMap) {
+        const one = oneTemplate(t, 0);
+        return isRefusal(one) ? one : [one];
+    }
+    if (true === t?.isList) {
+        const out = [];
+        for (const el of t.peg) {
+            const e = el;
+            if (true !== e?.isMap) {
+                return { code: 'emit_template' };
+            }
+            const one = oneTemplate(e, out.length);
+            if (isRefusal(one)) {
+                return one;
+            }
+            out.push(one);
+        }
+        return out;
+    }
+    return { code: 'emit_table' };
+}
+// One rule. Both keys are required: a template with no pattern would
+// match everything by accident, and one with no body would emit
+// nothing while claiming a node. The two optional keys -- a `replace`
+// map and an `esc` naming the convention its values are escaped by,
+// `none` the one opt-out -- are the template's shape too, and D3's two
+// static checks run here, on the template alone, before any node.
+function oneTemplate(m, idx) {
+    const match = m.peg.match;
+    const body = m.peg.body;
+    if (null == match || null == body) {
+        return { code: 'emit_template' };
+    }
+    if (true !== body.isList) {
+        return { code: 'emit_body' };
+    }
+    const replace = m.peg.replace;
+    if (null != replace && true !== replace.isMap) {
+        return { code: 'emit_template' };
+    }
+    const escv = m.peg.esc;
+    let esc = '';
+    if (null != escv) {
+        const name = textOf(escv);
+        if (undefined === name || ('none' !== name && !(0, escape_1.isEscVariant)(name))) {
+            return { code: 'esc_variant' };
+        }
+        esc = name;
+    }
+    const lits = literalSpots(body.peg);
+    if (null != replace) {
+        const bad = checkReplace(Object.keys(replace.peg), lits);
+        if (undefined !== bad) {
+            return bad;
+        }
+    }
+    return { match, body, replace, esc, lits, idx };
+}
+// The string a value carries, or undefined when it is not a string.
+function textOf(v) {
+    return true === v?.isScalar && 'string' === typeof v.peg ? v.peg : undefined;
+}
+// The literal strings of a body -- a string element, and the strings
+// written directly in a map element's `of` list or `text` -- which are
+// the text the template wrote. A string an expression or a nested
+// dispatch computes is not one: D3's third rule (a spliced result is
+// finished) and its second (a substituted value is never re-scanned)
+// both follow from substituting at these spots and nowhere else.
+function literalSpots(elems) {
+    const out = [];
+    elems.forEach((el, i) => {
+        const s = textOf(el);
+        if (undefined !== s) {
+            out.push({ i, s });
+            return;
+        }
+        if (true !== el?.isMap) {
+            return;
+        }
+        const of = el.peg.of;
+        if (true === of?.isList) {
+            of.peg.forEach((p, j) => {
+                const ps = textOf(p);
+                if (undefined !== ps) {
+                    out.push({ i, of: j, s: ps });
+                }
+            });
+        }
+        const ts = textOf(el.peg.text);
+        if (undefined !== ts) {
+            out.push({ i, text: true, s: ts });
+        }
+    });
+    return out;
+}
+// D3's two static checks, on the template alone and before any node:
+// a key inside another is ambiguous whatever the order
+// (replace_overlap), and a key no literal holds means the template
+// drifted from its map (replace_unused). Keys are visited in code
+// point order, so both ports name the same pair.
+function checkReplace(keys, lits) {
+    const sorted = [...keys].sort(keyorder_1.cmpCodePoint);
+    for (const a of sorted) {
+        for (const b of sorted) {
+            if (a !== b && b.includes(a)) {
+                return { code: 'replace_overlap', details: { key: quoted(a), other: quoted(b) } };
+            }
+        }
+    }
+    for (const k of sorted) {
+        if ('' === k || !lits.some((l) => l.s.includes(k))) {
+            return { code: 'replace_unused', details: { key: quoted(k) } };
+        }
+    }
+    return undefined;
+}
+// D3's first two rules as one scan: at each position the longest key
+// that matches is taken and its value written out whole, and the scan
+// moves past the KEY -- the value is never looked at again, so no
+// value can introduce a key.
+function substitute(text, pairs) {
+    let out = '';
+    let i = 0;
+    while (i < text.length) {
+        const hit = pairs.find((p) => text.startsWith(p[0], i));
+        if (undefined === hit) {
+            out += text[i];
+            i += 1;
+        }
+        else {
+            out += hit[1];
+            i += hit[0].length;
+        }
+    }
+    return out;
+}
+// The instance with the template's literal text at element `i`
+// rewritten through the pairs -- on the fresh instance, where the
+// structure is exactly the template's, and before any binding, so a
+// value written in is never scanned again and a spliced result is
+// never touched.
+function substituted(inst, i, lits, pairs, ctx) {
+    for (const l of lits) {
+        if (l.i !== i) {
+            continue;
+        }
+        const sv = new StringVal_1.StringVal({ peg: substitute(l.s, pairs) }, ctx);
+        if (undefined !== l.of) {
+            inst.peg.of.peg[l.of] = sv;
+        }
+        else if (true === l.text) {
+            inst.peg.text = sv;
+        }
+        else {
+            inst = sv;
+        }
+    }
+    return inst;
+}
+// A key as the message writes it, quoted so an empty key is visible.
+function quoted(s) {
+    return '"' + s + '"';
+}
+function unpref(v) {
+    while (true === v.isPref) {
+        v = v.peg;
+    }
+    return v;
+}
+// Every relative reference in `v` replaced by the field of `node` it
+// names. Answers `v` unchanged when it holds none, so a body with no
+// substitutions is never needlessly rebuilt -- the identity test
+// `fillPlace` already relies on.
+function bindNode(v, node, ctx, fail) {
+    if (true === v?.isRef && true !== v.absolute) {
+        const found = nodeField(v, node);
+        if (undefined === found) {
+            fail.ref = undefined === fail.ref ? v.canon : fail.ref;
+            return v;
+        }
+        const out = found.clone(ctx);
+        // A RELATIVE REFERENCE IS A READ TOO (RENDER.0.md P7), and the one
+        // read no reference resolution sees: the binding answers it here,
+        // from the matched node, rather than letting a path resolve at a
+        // position the body never occupies. Without this a nested rule set
+        // whose selection is `.handlers` reported its nodes at the address
+        // they came to rest, which is in the OUTPUT. A node carries an
+        // address only under an instrumented run, which is what makes the
+        // second test the whole guard.
+        if (null == out.origin && null != node.origin) {
+            ;
+            out.origin = node.origin +
+                v.peg.map((seg) => '.' + seg).join('');
+        }
+        return out;
+    }
+    const peg = v?.peg;
+    const bound = (0, PlaceVal_1.boundArgStart)(v);
+    if (Array.isArray(peg)) {
+        let changed = false;
+        const out = peg.map((c, cI) => {
+            if (true !== c?.isVal || bound <= cI) {
+                return c;
+            }
+            const b = bindNode(c, node, ctx, fail);
+            changed = changed || b !== c;
+            return b;
+        });
+        return changed ? (0, PlaceVal_1.rebuild)(v, out, ctx) : v;
+    }
+    if (true === peg?.isVal) {
+        const b = bindNode(peg, node, ctx, fail);
+        return b === peg ? v : (0, PlaceVal_1.rebuild)(v, b, ctx);
+    }
+    if (null != peg && 'object' === typeof peg) {
+        let changed = false;
+        const out = {};
+        for (const k of Object.keys(peg)) {
+            const c = peg[k];
+            // No isVal guard, for the reason fillPlace gives: a slot holding
+            // something that is not a Val answers itself, because the tests
+            // above -- is it a reference, has it a peg -- are both false for
+            // one.
+            const b = bindNode(c, node, ctx, fail);
+            changed = changed || b !== c;
+            out[k] = b;
+        }
+        return changed ? (0, PlaceVal_1.rebuild)(v, out, ctx) : v;
+    }
+    return v;
+}
+// The field of `node` a reference names, or undefined when it names
+// none. Only a chain of plain NAMES is a field: a parent step has no
+// answer at a node that is an origin rather than a position, and a
+// variable segment is not a name until something resolves it -- both
+// are refused here rather than left to resolve somewhere else, which
+// is the failure mode the binding exists to remove.
+function nodeField(ref, node) {
+    let cur = node;
+    for (const seg of ref.peg) {
+        if ('string' !== typeof seg || '.' === seg) {
+            return undefined;
+        }
+        const peg = cur?.peg;
+        if (true !== cur?.isBag || null == peg) {
+            return undefined;
+        }
+        cur = true === cur.isList ? peg[Number(seg)] : peg[seg];
+        if (true !== cur?.isVal) {
+            return undefined;
+        }
+    }
+    return cur;
+}
+// The address of one matched node: its own read address when it has
+// one, else the SELECTION's read address and the node's key under it
+// -- a selection is read once and walked, so its members carry no read
+// of their own.
+//
+// A COMPUTED SELECTION HAS NO ADDRESS, AND THE TRACE SAYS SO: an empty
+// node. `filter(...)` builds a bag no path in the document names, and
+// the only other thing to report is where the bag came to REST -- a
+// position inside a template instance, which is not in the document,
+// and which the two ports number differently. Publishing that would
+// have made the trace a parity break as well as a fiction. The rule
+// address answers the same way: `<table>#<index>` for a table a
+// reference reached, and `#<index>` alone for one written inline at the
+// call site, which has no address of its own. `#` is in no path, so a
+// rule's address can never be read as one.
+function nodeAddr(sel, key, node) {
+    if (null != node.origin) {
+        return node.origin;
+    }
+    return undefined === sel ? '' : sel + '.' + key;
+}
+// A body element that is itself a list splices, which is what makes a
+// nested emit compose into one flat sequence.
+function splice(v, out) {
+    if (true === v?.isList) {
+        for (const el of v.peg) {
+            splice(el, out);
+        }
+        return;
+    }
+    out.push(v);
+}
+class EmitFuncVal extends FuncBaseVal_1.FuncBaseVal {
+    constructor(spec, ctx) {
+        super(spec, ctx);
+        this.isEmitFunc = true;
+        // THE STAGING RULE (G8 phase 0, see AontuContext.settle). The
+        // selection is not settled merely by being `done` once -- a sibling
+        // conjunct, an include or a spread can still merge nodes into it,
+        // and pieces emitted from the half-merged bag would be missing.
+        this.staged = true;
+    }
+    funcname() {
+        return 'emit';
+    }
+    // NEITHER ARGUMENT IS DRIVEN BY THE BASE. The selection is driven by
+    // hand below; the TABLE is not driven at all, because a body is a
+    // template and driving it would resolve its references at the call
+    // site -- the one position a body is never used at.
+    prepare(_ctx, _args) {
+        return null;
+    }
+    unify(peer, ctx) {
+        // ONE argument is driven: the selection. The table holds bodies,
+        // which are templates (see prepare above).
+        if (!this.stagedReady(peer, ctx, 1)) {
+            return this.residuate(peer, ctx);
+        }
+        return super.unify(peer, ctx);
+    }
+    resolve(ctx, args) {
+        // THE MEMBERS WITH THEIR KEYS, read through the one helper every
+        // fold reads a bag by (./members.ts): source order for a list,
+        // sorted-key order for a map, a hidden child and an unfilled
+        // optional left out. The KEY is what the trace addresses a node by
+        // -- it is the node's key IN THE SELECTION, which is the only
+        // thing a walk of a computed bag knows about where a node sits.
+        const nodes = (0, members_1.bagMembers)(args?.[0], ctx);
+        if (undefined === nodes) {
+            return (0, err_1.makeNilErr)(ctx, 'emit_data', this);
+        }
+        // A NAMED TABLE IS REACHED BY REFERENCE, and the reference -- not
+        // the table -- is what is followed. Followed HERE rather than in
+        // the staged drive, which waits for a SETTLED target: a table is a
+        // template, a template holding a hole never settles, and waiting
+        // for one would mean the dispatch never fires.
+        let table = args?.[1];
+        if (true === table?.isRef) {
+            table = table.unify((0, top_1.top)(), ctx);
+        }
+        const templates = tableTemplates(table);
+        if (isRefusal(templates)) {
+            return this.refuse(ctx, templates);
+        }
+        // THE TRACE'S TWO ADDRESSES (RENDER.0.md D11, P7), computed once
+        // per dispatch and only when the run is instrumented: the table's
+        // own, which every rule of it is numbered under, and the
+        // selection's, which every node of it is keyed under.
+        const rec = undefined !== ctx.reads;
+        const tableAddr = rec ? (table?.origin ?? '') : '';
+        const selAddr = rec ? args?.[0]?.origin : undefined;
+        const peg = [];
+        for (const member of nodes) {
+            const node = member.val;
+            const tmpl = this.dispatch(ctx, node, templates);
+            if ('string' === typeof tmpl) {
+                return (0, err_1.makeNilErr)(ctx, 'emit_none', this, undefined, 'resolve', {
+                    value: node.canon,
+                    tried: tmpl,
+                });
+            }
+            const fail = {};
+            let mark = undefined;
+            if (rec) {
+                // THE NODE KEEPS ITS ADDRESS (P7). A body passes the node on
+                // through `_`, and a nested rule set dispatching over it can
+                // then say where it came from -- otherwise the node arrives as
+                // an element of a list the body wrote, and the only address
+                // left is where that list came to rest.
+                const naddr = nodeAddr(selAddr, member.key, node);
+                if ('' !== naddr && null == node.origin) {
+                    ;
+                    node.origin = naddr;
+                }
+                mark = { node: naddr, rule: tableAddr + '#' + tmpl.idx };
+            }
+            this.instantiate(ctx, node, tmpl, peg, fail, mark);
+            if (undefined !== fail.ref) {
+                return (0, err_1.makeNilErr)(ctx, 'emit_ref', this, undefined, 'resolve', {
+                    ref: fail.ref,
+                    value: node.canon,
+                });
+            }
+            if (undefined !== fail.code) {
+                return this.refuse(ctx, { code: fail.code, details: fail.details });
+            }
+        }
+        // THE PIECES ARE PATHED WHERE THEY LAND, once the splicing has
+        // settled how many there are. A piece keeps no trace of the body
+        // it was written in: the body is a template, and a template's
+        // parse position is the one place it is never used.
+        for (let i = 0; i < peg.length; i++) {
+            (0, Val_1.repathInstance)(peg[i], [...ctx.path, String(i)]);
+        }
+        return new ListVal_1.ListVal({ peg }, ctx);
+    }
+    // The located error for a refusal, with the message's details when
+    // the refusal carries them.
+    refuse(ctx, r) {
+        return undefined === r.details ? (0, err_1.makeNilErr)(ctx, r.code, this)
+            : (0, err_1.makeNilErr)(ctx, r.code, this, undefined, 'resolve', r.details);
+    }
+    // First match wins, in table order, by unifiability -- the same
+    // question `match` and `filter` ask, answered the same way. Returns
+    // the patterns tried when nothing matched, for the located error.
+    dispatch(ctx, node, templates) {
+        const tried = [];
+        for (const tmpl of templates) {
+            tried.push(tmpl.match.canon);
+            // The trial is against CLONES: `unite` refines a bag in place
+            // against a TOP peer, and a pattern that failed must be untouched
+            // for the next node.
+            if (undefined !== (0, FuncBaseVal_1.trialUnify)(ctx, node.clone(ctx), tmpl.match.clone(ctx))) {
+                return tmpl;
+            }
+        }
+        return tried.join(' ');
+    }
+    // The replacement pairs for one node: the template's `replace` map
+    // instantiated at the node -- bound, filled and driven as a body is
+    // -- each value as text by the one number-to-text rule (`plusText`,
+    // the rule `+` and `join` share), escaped by the template's
+    // convention unless that is `none`, and sorted longest key first so
+    // the scan takes the longest match at every position (D3's first
+    // rule). A value that is not text, or has not settled, is
+    // replace_value.
+    replacements(ctx, node, tmpl, fail) {
+        if (undefined === tmpl.replace) {
+            return undefined;
+        }
+        let inst = tmpl.replace.clone(ctx, { dup: true });
+        inst = (0, PlaceVal_1.fillPlace)(bindNode(inst, node, ctx, fail), node, ctx);
+        if (!inst.done) {
+            inst = (0, unify_1.unite)(ctx, inst, (0, top_1.top)(), 'emit');
+        }
+        const pairs = [];
+        for (const key of Object.keys(inst.peg)) {
+            const v = unpref(inst.peg[key]);
+            const text = (0, PlusOpVal_1.plusText)(v);
+            if (undefined === text) {
+                fail.code = 'replace_value';
+                fail.details = { key: quoted(key), value: String(v?.canon) };
+                return undefined;
+            }
+            pairs.push([key, 'none' === tmpl.esc ? text : (0, escape_1.escapeText)(text, tmpl.esc)]);
+        }
+        pairs.sort((a, b) => b[0].length - a[0].length || (0, keyorder_1.cmpCodePoint)(a[0], b[0]));
+        return pairs;
+    }
+    // Instantiate one body at the node and SPLICE its pieces into the
+    // output. A full instance to the leaves (`dup`, ADR-005), because a
+    // bare clone shares the inner structure of any call in the body and
+    // the first node's resolution would answer for every node; the
+    // template's replacements written into the instance's literal text;
+    // then the two bindings, relative references and the hole, both to
+    // the node.
+    instantiate(ctx, node, tmpl, out, fail, mark) {
+        const pairs = this.replacements(ctx, node, tmpl, fail);
+        if (undefined !== fail.code) {
+            return;
+        }
+        const elems = tmpl.body.peg;
+        for (let i = 0; i < elems.length; i++) {
+            const elctx = ctx.descend(String(out.length));
+            let inst = elems[i].clone(elctx, { dup: true });
+            if (undefined !== pairs) {
+                inst = substituted(inst, i, tmpl.lits, pairs, elctx);
+            }
+            let piece = (0, PlaceVal_1.fillPlace)(bindNode(inst, node, elctx, fail), node, elctx);
+            // A NESTED DISPATCH IS DRIVEN HERE, not left for the next pass.
+            // Its selection is bound and the model has settled, so it has
+            // everything it needs -- and it must answer NOW, because what
+            // makes the result flat is splicing its pieces into this one.
+            // Left standing, a nested `emit` resolved a pass later, as a
+            // list INSIDE the list, and the fragment algebra is flat.
+            // Through `unite` rather than by hand: a rule set that walks
+            // into itself for ever is charged to the depth budget and
+            // refused as `unify_cycle`, like any other runaway descent.
+            if (!piece.done) {
+                piece = (0, unify_1.unite)(elctx, piece, (0, top_1.top)(), 'emit');
+            }
+            // THE INNERMOST DISPATCH OWNS THE PIECE (P7). A body element
+            // that is a nested rule set has already stamped what it emitted,
+            // and those pieces are spliced into this result here: the rule
+            // that WROTE a line is the one the trace names, so a stamp is
+            // written only where there is none.
+            const at = out.length;
+            splice(piece, out);
+            if (undefined !== mark) {
+                for (let k = at; k < out.length; k++) {
+                    if (null == out[k].emitted) {
+                        ;
+                        out[k].emitted = mark;
+                    }
+                }
+            }
+        }
+    }
+} /* node:coverage ignore next 6 */
+exports.EmitFuncVal = EmitFuncVal;
+//# sourceMappingURL=EmitFuncVal.js.map

package/dist/val/EmitFuncVal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EmitFuncVal.js","sourceRoot":"","sources":["../../src/val/EmitFuncVal.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;AA6FpD,oCAAgC;AAChC,gCAAmC;AACnC,sCAAoD;AACpD,0CAA0C;AAC1C,+BAA2B;AAC3B,uCAAmC;AACnC,2CAAuC;AACvC,+CAAuD;AACvD,+BAAsC;AAEtC,yCAA8D;AAC9D,2CAAsC;AACtC,uCAAsC;AAkCtC,SAAS,SAAS,CAAC,CAAM;IACvB,OAAO,QAAQ,KAAK,OAAO,CAAC,CAAC,IAAI,CAAA;AACnC,CAAC;AAGD,sEAAsE;AACtE,oEAAoE;AACpE,4BAA4B;AAC5B,SAAS,cAAc,CAAC,KAAsB;IAC5C,MAAM,CAAC,GAAQ,KAAK,CAAA;IAEpB,mEAAmE;IACnE,qEAAqE;IACrE,mEAAmE;IACnE,qEAAqE;IACrE,6DAA6D;IAC7D,oEAAoE;IACpE,mEAAmE;IACnE,mEAAmE;IACnE,kDAAkD;IAClD,IAAI,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;QAC3B,OAAO,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IACjC,CAAC;IAED,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC7B,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACrC,CAAC;IAED,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QACvB,MAAM,GAAG,GAAe,EAAE,CAAA;QAC1B,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,GAAY,EAAE,CAAC;YAChC,MAAM,CAAC,GAAQ,EAAE,CAAA;YACjB,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;gBACtB,OAAO,EAAE,IAAI,EAAE,eAAe,EAAE,CAAA;YAClC,CAAC;YACD,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;YACtC,IAAI,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,OAAO,GAAG,CAAA;YACZ,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACf,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,CAAA;AAC/B,CAAC;AAGD,qEAAqE;AACrE,gEAAgE;AAChE,sEAAsE;AACtE,oEAAoE;AACpE,uEAAuE;AACvE,kEAAkE;AAClE,SAAS,WAAW,CAAC,CAAM,EAAE,GAAW;IACtC,MAAM,KAAK,GAAQ,CAAC,CAAC,GAAG,CAAC,KAAK,CAAA;IAC9B,MAAM,IAAI,GAAQ,CAAC,CAAC,GAAG,CAAC,IAAI,CAAA;IAC5B,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;QAClC,OAAO,EAAE,IAAI,EAAE,eAAe,EAAE,CAAA;IAClC,CAAC;IACD,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;QACzB,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,CAAA;IAC9B,CAAC;IAED,MAAM,OAAO,GAAQ,CAAC,CAAC,GAAG,CAAC,OAAO,CAAA;IAClC,IAAI,IAAI,IAAI,OAAO,IAAI,IAAI,KAAK,OAAO,CAAC,KAAK,EAAE,CAAC;QAC9C,OAAO,EAAE,IAAI,EAAE,eAAe,EAAE,CAAA;IAClC,CAAC;IAED,MAAM,IAAI,GAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAA;IAC3B,IAAI,GAAG,GAAG,EAAE,CAAA;IACZ,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;QACjB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAA;QACzB,IAAI,SAAS,KAAK,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,CAAC,IAAA,qBAAY,EAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YACnE,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,CAAA;QAChC,CAAC;QACD,GAAG,GAAG,IAAI,CAAA;IACZ,CAAC;IAED,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACnC,IAAI,IAAI,IAAI,OAAO,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAA;QACxD,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;YACtB,OAAO,GAAG,CAAA;QACZ,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAA;AACjD,CAAC;AAGD,oEAAoE;AACpE,SAAS,MAAM,CAAC,CAAM;IACpB,OAAO,IAAI,KAAK,CAAC,EAAE,QAAQ,IAAI,QAAQ,KAAK,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAA;AAC9E,CAAC;AAGD,qEAAqE;AACrE,uEAAuE;AACvE,kEAAkE;AAClE,qEAAqE;AACrE,qEAAqE;AACrE,iEAAiE;AACjE,SAAS,YAAY,CAAC,KAAY;IAChC,MAAM,GAAG,GAAc,EAAE,CAAA;IACzB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAO,EAAE,CAAS,EAAE,EAAE;QACnC,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAA;QACpB,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;YACpB,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;YAClB,OAAM;QACR,CAAC;QACD,IAAI,IAAI,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC;YACvB,OAAM;QACR,CAAC;QACD,MAAM,EAAE,GAAQ,EAAE,CAAC,GAAG,CAAC,EAAE,CAAA;QACzB,IAAI,IAAI,KAAK,EAAE,EAAE,MAAM,EAAE,CAAC;YACvB,EAAE,CAAC,GAAa,CAAC,OAAO,CAAC,CAAC,CAAM,EAAE,CAAS,EAAE,EAAE;gBAC9C,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;gBACpB,IAAI,SAAS,KAAK,EAAE,EAAE,CAAC;oBACrB,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;gBAC/B,CAAC;YACH,CAAC,CAAC,CAAA;QACJ,CAAC;QACD,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC9B,IAAI,SAAS,KAAK,EAAE,EAAE,CAAC;YACrB,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QACpC,CAAC;IACH,CAAC,CAAC,CAAA;IACF,OAAO,GAAG,CAAA;AACZ,CAAC;AAGD,qEAAqE;AACrE,uDAAuD;AACvD,mEAAmE;AACnE,kEAAkE;AAClE,iDAAiD;AACjD,SAAS,YAAY,CAAC,IAAc,EAAE,IAAe;IACnD,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,uBAAY,CAAC,CAAA;IAC3C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7B,OAAO,EAAE,IAAI,EAAE,iBAAiB,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAA;YACnF,CAAC;QACH,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACnD,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAA;QAChE,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC;AAGD,qEAAqE;AACrE,sEAAsE;AACtE,kEAAkE;AAClE,6BAA6B;AAC7B,SAAS,UAAU,CAAC,IAAY,EAAE,KAAa;IAC7C,IAAI,GAAG,GAAG,EAAE,CAAA;IACZ,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACvD,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;YACtB,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAA;YACd,CAAC,IAAI,CAAC,CAAA;QACR,CAAC;aACI,CAAC;YACJ,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAA;YACb,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;QACpB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAGD,+DAA+D;AAC/D,kEAAkE;AAClE,oEAAoE;AACpE,kEAAkE;AAClE,iBAAiB;AACjB,SAAS,WAAW,CAClB,IAAS,EAAE,CAAS,EAAE,IAAe,EAAE,KAAa,EAAE,GAAiB;IAEvE,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACd,SAAQ;QACV,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,qBAAS,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;QAC9D,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;YACtB,IAAY,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAA;QACrC,CAAC;aACI,IAAI,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;YACxB,IAAY,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,CAAA;QAC7B,CAAC;aACI,CAAC;YACJ,IAAI,GAAG,EAAE,CAAA;QACX,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAGD,qEAAqE;AACrE,SAAS,MAAM,CAAC,CAAS;IACvB,OAAO,GAAG,GAAG,CAAC,GAAG,GAAG,CAAA;AACtB,CAAC;AAGD,SAAS,MAAM,CAAC,CAAM;IACpB,OAAO,IAAI,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QACzB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAA;IACX,CAAC;IACD,OAAO,CAAC,CAAA;AACV,CAAC;AASD,qEAAqE;AACrE,qEAAqE;AACrE,iEAAiE;AACjE,iCAAiC;AACjC,SAAS,QAAQ,CAAC,CAAM,EAAE,IAAS,EAAE,GAAiB,EAAE,IAAU;IAChE,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;QAChC,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,GAAG,SAAS,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAA;YACtD,OAAO,CAAC,CAAA;QACV,CAAC;QACD,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QAC5B,mEAAmE;QACnE,kEAAkE;QAClE,iEAAiE;QACjE,mEAAmE;QACnE,mEAAmE;QACnE,+DAA+D;QAC/D,kEAAkE;QAClE,+BAA+B;QAC/B,IAAI,IAAI,IAAK,GAAW,CAAC,MAAM,IAAI,IAAI,IAAK,IAAY,CAAC,MAAM,EAAE,CAAC;YAChE,CAAC;YAAE,GAAW,CAAC,MAAM,GAAI,IAAY,CAAC,MAAM;gBACzC,CAAC,CAAC,GAAgB,CAAC,GAAG,CAAC,CAAC,GAAW,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAChE,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,MAAM,GAAG,GAAQ,CAAC,EAAE,GAAG,CAAA;IACvB,MAAM,KAAK,GAAG,IAAA,wBAAa,EAAC,CAAC,CAAC,CAAA;IAE9B,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACvB,IAAI,OAAO,GAAG,KAAK,CAAA;QACnB,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAU,EAAE,EAAE;YACzC,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,IAAI,KAAK,IAAI,EAAE,EAAE,CAAC;gBACrC,OAAO,CAAC,CAAA;YACV,CAAC;YACD,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;YACtC,OAAO,GAAG,OAAO,IAAI,CAAC,KAAK,CAAC,CAAA;YAC5B,OAAO,CAAC,CAAA;QACV,CAAC,CAAC,CAAA;QACF,OAAO,OAAO,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC3C,CAAC;IAED,IAAI,IAAI,KAAK,GAAG,EAAE,KAAK,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;QACxC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;IAC3C,CAAC;IAED,IAAI,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK,OAAO,GAAG,EAAE,CAAC;QAC3C,IAAI,OAAO,GAAG,KAAK,CAAA;QACnB,MAAM,GAAG,GAAwB,EAAE,CAAA;QACnC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;YAChB,iEAAiE;YACjE,gEAAgE;YAChE,iEAAiE;YACjE,OAAO;YACP,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;YACtC,OAAO,GAAG,OAAO,IAAI,CAAC,KAAK,CAAC,CAAA;YAC5B,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACZ,CAAC;QACD,OAAO,OAAO,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC3C,CAAC;IAED,OAAO,CAAC,CAAA;AACV,CAAC;AAGD,oEAAoE;AACpE,qEAAqE;AACrE,mEAAmE;AACnE,qEAAqE;AACrE,qEAAqE;AACrE,oDAAoD;AACpD,SAAS,SAAS,CAAC,GAAQ,EAAE,IAAS;IACpC,IAAI,GAAG,GAAQ,IAAI,CAAA;IACnB,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,GAAY,EAAE,CAAC;QACnC,IAAI,QAAQ,KAAK,OAAO,GAAG,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;YAC3C,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,MAAM,GAAG,GAAQ,GAAG,EAAE,GAAG,CAAA;QACzB,IAAI,IAAI,KAAK,GAAG,EAAE,KAAK,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;YACvC,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,GAAG,GAAG,IAAI,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACvD,IAAI,IAAI,KAAK,GAAG,EAAE,KAAK,EAAE,CAAC;YACxB,OAAO,SAAS,CAAA;QAClB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAGD,oEAAoE;AACpE,qEAAqE;AACrE,uEAAuE;AACvE,gBAAgB;AAChB,EAAE;AACF,uEAAuE;AACvE,sEAAsE;AACtE,oEAAoE;AACpE,qEAAqE;AACrE,oEAAoE;AACpE,oEAAoE;AACpE,gEAAgE;AAChE,wEAAwE;AACxE,sEAAsE;AACtE,2CAA2C;AAC3C,SAAS,QAAQ,CAAC,GAAuB,EAAE,GAAW,EAAE,IAAS;IAC/D,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC,MAAM,CAAA;IACpB,CAAC;IACD,OAAO,SAAS,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAA;AACjD,CAAC;AAGD,sEAAsE;AACtE,8CAA8C;AAC9C,SAAS,MAAM,CAAC,CAAM,EAAE,GAAU;IAChC,IAAI,IAAI,KAAM,CAAS,EAAE,MAAM,EAAE,CAAC;QAChC,KAAK,MAAM,EAAE,IAAK,CAAS,CAAC,GAAY,EAAE,CAAC;YACzC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;QACjB,CAAC;QACD,OAAM;IACR,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AACb,CAAC;AAGD,MAAM,WAAY,SAAQ,yBAAW;IASnC,YACE,IAAa,EACb,GAAkB;QAElB,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAZlB,eAAU,GAAG,IAAI,CAAA;QAEjB,8DAA8D;QAC9D,oEAAoE;QACpE,kEAAkE;QAClE,gEAAgE;QAChE,WAAM,GAAG,IAAI,CAAA;IAOb,CAAC;IAGD,QAAQ;QACN,OAAO,MAAM,CAAA;IACf,CAAC;IAGD,qEAAqE;IACrE,kEAAkE;IAClE,mEAAmE;IACnE,oDAAoD;IACpD,OAAO,CAAC,IAAkB,EAAE,KAAY;QACtC,OAAO,IAAI,CAAA;IACb,CAAC;IAGD,KAAK,CAAC,IAAS,EAAE,GAAiB;QAChC,iEAAiE;QACjE,2CAA2C;QAC3C,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;YACpC,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAClC,CAAC;QAED,OAAO,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;IAC/B,CAAC;IAGD,OAAO,CAAC,GAAiB,EAAE,IAAW;QACpC,iEAAiE;QACjE,+DAA+D;QAC/D,6DAA6D;QAC7D,mEAAmE;QACnE,8DAA8D;QAC9D,gEAAgE;QAChE,MAAM,KAAK,GAAG,IAAA,oBAAU,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;QACxC,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;YACxB,OAAO,IAAA,gBAAU,EAAC,GAAG,EAAE,WAAW,EAAE,IAAI,CAAC,CAAA;QAC3C,CAAC;QAED,kEAAkE;QAClE,iEAAiE;QACjE,mEAAmE;QACnE,iEAAiE;QACjE,+CAA+C;QAC/C,IAAI,KAAK,GAAQ,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;QAC1B,IAAI,IAAI,KAAK,KAAK,EAAE,KAAK,EAAE,CAAC;YAC1B,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,IAAA,SAAG,GAAE,EAAE,GAAG,CAAC,CAAA;QACjC,CAAC;QAED,MAAM,SAAS,GAAG,cAAc,CAAC,KAAK,CAAC,CAAA;QACvC,IAAI,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,CAAA;QACpC,CAAC;QAED,iEAAiE;QACjE,kEAAkE;QAClE,yDAAyD;QACzD,sDAAsD;QACtD,MAAM,GAAG,GAAG,SAAS,KAAK,GAAG,CAAC,KAAK,CAAA;QACnC,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,CAAE,KAAa,EAAE,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;QAC3D,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,CAAE,IAAI,EAAE,CAAC,CAAC,CAAS,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS,CAAA;QAE5D,MAAM,GAAG,GAAU,EAAE,CAAA;QAErB,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAA;YACvB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;YAChD,IAAI,QAAQ,KAAK,OAAO,IAAI,EAAE,CAAC;gBAC7B,OAAO,IAAA,gBAAU,EAAC,GAAG,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE;oBAC9D,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,KAAK,EAAE,IAAI;iBACZ,CAAC,CAAA;YACJ,CAAC;YACD,MAAM,IAAI,GAAS,EAAE,CAAA;YACrB,IAAI,IAAI,GAA2B,SAAS,CAAA;YAC5C,IAAI,GAAG,EAAE,CAAC;gBACR,6DAA6D;gBAC7D,6DAA6D;gBAC7D,+DAA+D;gBAC/D,4DAA4D;gBAC5D,wCAAwC;gBACxC,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;gBACjD,IAAI,EAAE,KAAK,KAAK,IAAI,IAAI,IAAK,IAAY,CAAC,MAAM,EAAE,CAAC;oBACjD,CAAC;oBAAE,IAAY,CAAC,MAAM,GAAG,KAAK,CAAA;gBAChC,CAAC;gBACD,IAAI,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;YAC1D,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;YAClD,IAAI,SAAS,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;gBAC3B,OAAO,IAAA,gBAAU,EAAC,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE;oBAC7D,GAAG,EAAE,IAAI,CAAC,GAAG;oBACb,KAAK,EAAE,IAAI,CAAC,KAAK;iBAClB,CAAC,CAAA;YACJ,CAAC;YACD,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAA;YACrE,CAAC;QACH,CAAC;QAED,+DAA+D;QAC/D,iEAAiE;QACjE,8DAA8D;QAC9D,oDAAoD;QACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAA,oBAAc,EAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAClD,CAAC;QAED,OAAO,IAAI,iBAAO,CAAC,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,CAAA;IAClC,CAAC;IAGD,mEAAmE;IACnE,4BAA4B;IAC5B,MAAM,CAAC,GAAiB,EAAE,CAAU;QAClC,OAAO,SAAS,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAA,gBAAU,EAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC;YAC5D,CAAC,CAAC,IAAA,gBAAU,EAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC,OAAO,CAAC,CAAA;IACpE,CAAC;IAGD,gEAAgE;IAChE,oEAAoE;IACpE,kEAAkE;IAClE,QAAQ,CAAC,GAAiB,EAAE,IAAS,EAAE,SAAqB;QAC1D,MAAM,KAAK,GAAa,EAAE,CAAA;QAC1B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;YAC5B,8DAA8D;YAC9D,kEAAkE;YAClE,qBAAqB;YACrB,IAAI,SAAS,KAAK,IAAA,wBAAU,EAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC1E,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACxB,CAAC;IAGD,mEAAmE;IACnE,oEAAoE;IACpE,oEAAoE;IACpE,4DAA4D;IAC5D,oEAAoE;IACpE,iEAAiE;IACjE,0DAA0D;IAC1D,iBAAiB;IACjB,YAAY,CAAC,GAAiB,EAAE,IAAS,EAAE,IAAc,EAAE,IAAU;QACnE,IAAI,SAAS,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;YAC/B,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,IAAI,IAAI,GAAQ,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAA;QACtD,IAAI,GAAG,IAAA,oBAAS,EAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAA;QAC5D,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,GAAG,IAAA,aAAK,EAAC,GAAG,EAAE,IAAI,EAAE,IAAA,SAAG,GAAE,EAAE,MAAM,CAAC,CAAA;QACxC,CAAC;QACD,MAAM,KAAK,GAAW,EAAE,CAAA;QACxB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACxC,MAAM,CAAC,GAAQ,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YACpC,MAAM,IAAI,GAAG,IAAA,oBAAQ,EAAC,CAAC,CAAC,CAAA;YACxB,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;gBACvB,IAAI,CAAC,IAAI,GAAG,eAAe,CAAA;gBAC3B,IAAI,CAAC,OAAO,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAA;gBAC5D,OAAO,SAAS,CAAA;YAClB,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAA,mBAAU,EAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAC5E,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAA,uBAAY,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC3E,OAAO,KAAK,CAAA;IACd,CAAC;IAGD,kEAAkE;IAClE,oEAAoE;IACpE,oEAAoE;IACpE,+DAA+D;IAC/D,oEAAoE;IACpE,mEAAmE;IACnE,YAAY;IACZ,WAAW,CAAC,GAAiB,EAAE,IAAS,EAAE,IAAc,EACtD,GAAU,EAAE,IAAU,EAAE,IAAiB;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QACtD,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,OAAM;QACR,CAAC;QAED,MAAM,KAAK,GAAW,IAAI,CAAC,IAAY,CAAC,GAAG,CAAA;QAE3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;YAC7C,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAA;YAC/C,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;gBACxB,IAAI,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;YACtD,CAAC;YACD,IAAI,KAAK,GAAG,IAAA,oBAAS,EAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;YAErE,gEAAgE;YAChE,8DAA8D;YAC9D,8DAA8D;YAC9D,8DAA8D;YAC9D,6DAA6D;YAC7D,0DAA0D;YAC1D,6DAA6D;YAC7D,0DAA0D;YAC1D,4DAA4D;YAC5D,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBAChB,KAAK,GAAG,IAAA,aAAK,EAAC,KAAK,EAAE,KAAK,EAAE,IAAA,SAAG,GAAE,EAAE,MAAM,CAAC,CAAA;YAC5C,CAAC;YAED,6DAA6D;YAC7D,iEAAiE;YACjE,+DAA+D;YAC/D,8DAA8D;YAC9D,oCAAoC;YACpC,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAA;YACrB,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;YAClB,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;gBACvB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,IAAI,IAAI,IAAK,GAAG,CAAC,CAAC,CAAS,CAAC,OAAO,EAAE,CAAC;wBACpC,CAAC;wBAAE,GAAG,CAAC,CAAC,CAAS,CAAC,OAAO,GAAG,IAAI,CAAA;oBAClC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CAEF,CAAC,iCAAiC;QAIjC,WAAW"}

package/dist/val/FilterFuncVal.js

@@ -8,6 +8,7 @@ const ListVal_1 = require("./ListVal");
 const FuncBaseVal_1 = require("./FuncBaseVal");
 const Val_1 = require("./Val");
 const PlaceVal_1 = require("./PlaceVal");
+const members_1 = require("./members");
 class FilterFuncVal extends FuncBaseVal_1.FuncBaseVal {
     constructor(spec, ctx) {
         super(spec, ctx);
@@ -32,8 +33,7 @@ class FilterFuncVal extends FuncBaseVal_1.FuncBaseVal {
         return null;
     }
     unify(peer, ctx) {
-        const ready = this.driveStagedArgs(ctx, 1);
-        if (!ready || !ctx.settle) {
+        if (!this.stagedReady(peer, ctx, 1)) {
             return this.residuate(peer, ctx);
         }
         return super.unify(peer, ctx);
@@ -60,19 +60,22 @@ class FilterFuncVal extends FuncBaseVal_1.FuncBaseVal {
             const met = (0, FuncBaseVal_1.trialUnify)(kctx, child.clone(kctx), test);
             return undefined !== met && met.canon === child.canon;
         };
+        // The candidates are the bag's MEMBERS -- what generation would
+        // emit (./members.ts, BUGS.md §79) -- so a hidden child is never
+        // selected into the result.
         if (true === data?.isMap) {
             const peg = {};
-            for (const key of Object.keys(data.peg)) {
+            for (const { key, val } of (0, members_1.bagMembers)(data, ctx)) {
                 const kctx = ctx.descend(key);
-                if (keeps(data.peg[key], kctx)) {
-                    peg[key] = data.peg[key].clone(kctx);
+                if (keeps(val, kctx)) {
+                    peg[key] = val.clone(kctx);
                 }
             }
             return new MapVal_1.MapVal({ peg }, ctx);
         }
         if (true === data?.isList) {
             const peg = [];
-            for (const el of data.peg) {
+            for (const { val: el } of (0, members_1.bagMembers)(data, ctx)) {
                 // The element context is the position it will END UP at, which
                 // is its index in the RESULT: dropping the third of five moves
                 // the fourth up, and a kept element must be pathed where it

package/dist/val/FilterFuncVal.js.map

@@ -1 +1 @@
-{"version":3,"file":"FilterFuncVal.js","sourceRoot":"","sources":["../../src/val/FilterFuncVal.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;AA0CpD,gCAAmC;AACnC,qCAAiC;AACjC,uCAAmC;AACnC,+CAAuD;AACvD,+BAAsC;AACtC,yCAAsC;AAGtC,MAAM,aAAc,SAAQ,yBAAW;IAOrC,YACE,IAAa,EACb,GAAkB;QAElB,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAVlB,iBAAY,GAAG,IAAI,CAAA;QAEnB,iEAAiE;QACjE,kDAAkD;QAClD,WAAM,GAAG,IAAI,CAAA;IAOb,CAAC;IAGD,QAAQ;QACN,OAAO,QAAQ,CAAA;IACjB,CAAC;IAGD,mEAAmE;IACnE,mEAAmE;IACnE,iEAAiE;IACjE,EAAE;IACF,oEAAoE;IACpE,kEAAkE;IAClE,iEAAiE;IACjE,oEAAoE;IACpE,wDAAwD;IACxD,OAAO,CAAC,IAAkB,EAAE,KAAY;QACtC,OAAO,IAAI,CAAA;IACb,CAAC;IAGD,KAAK,CAAC,IAAS,EAAE,GAAiB;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QAE1C,IAAI,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAClC,CAAC;QAED,OAAO,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;IAC/B,CAAC;IAGD,OAAO,CAAC,GAAiB,EAAE,IAAW;QACpC,MAAM,IAAI,GAAQ,IAAI,CAAC,CAAC,CAAC,CAAA;QACzB,MAAM,IAAI,GAAQ,IAAI,CAAC,CAAC,CAAC,CAAA;QAEzB,mEAAmE;QACnE,iEAAiE;QACjE,0CAA0C;QAC1C,EAAE;QACF,iEAAiE;QACjE,iEAAiE;QACjE,mEAAmE;QACnE,MAAM,KAAK,GAAG,CAAC,KAAU,EAAE,IAAkB,EAAW,EAAE;YACxD,4DAA4D;YAC5D,6DAA6D;YAC7D,+DAA+D;YAC/D,4DAA4D;YAC5D,4DAA4D;YAC5D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAA;YAC5C,IAAA,oBAAc,EAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;YAC/B,MAAM,IAAI,GAAG,IAAA,oBAAS,EAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAA;YACzC,MAAM,GAAG,GAAG,IAAA,wBAAU,EAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAA;YACrD,OAAO,SAAS,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,CAAA;QACvD,CAAC,CAAA;QAED,IAAI,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,CAAC;YACzB,MAAM,GAAG,GAAwB,EAAE,CAAA;YACnC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxC,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;gBAC7B,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC/B,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;gBACtC,CAAC;YACH,CAAC;YACD,OAAO,IAAI,eAAM,CAAC,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,CAAA;QACjC,CAAC;QAED,IAAI,IAAI,KAAK,IAAI,EAAE,MAAM,EAAE,CAAC;YAC1B,MAAM,GAAG,GAAU,EAAE,CAAA;YACrB,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,GAAY,EAAE,CAAC;gBACnC,+DAA+D;gBAC/D,+DAA+D;gBAC/D,4DAA4D;gBAC5D,wCAAwC;gBACxC,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;gBAC5C,IAAI,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;oBACpB,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;gBAC1B,CAAC;YACH,CAAC;YACD,OAAO,IAAI,iBAAO,CAAC,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,CAAA;QAClC,CAAC;QAED,OAAO,IAAA,gBAAU,EAAC,GAAG,EAAE,aAAa,EAAE,IAAI,CAAC,CAAA;IAC7C,CAAC;CAEF,CAAC,iCAAiC;QAIjC,aAAa"}
+{"version":3,"file":"FilterFuncVal.js","sourceRoot":"","sources":["../../src/val/FilterFuncVal.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;AA0CpD,gCAAmC;AACnC,qCAAiC;AACjC,uCAAmC;AACnC,+CAAuD;AACvD,+BAAsC;AACtC,yCAAsC;AACtC,uCAAsC;AAMtC,MAAM,aAAc,SAAQ,yBAAW;IAOrC,YACE,IAAa,EACb,GAAkB;QAElB,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAVlB,iBAAY,GAAG,IAAI,CAAA;QAEnB,iEAAiE;QACjE,kDAAkD;QAClD,WAAM,GAAG,IAAI,CAAA;IAOb,CAAC;IAGD,QAAQ;QACN,OAAO,QAAQ,CAAA;IACjB,CAAC;IAGD,mEAAmE;IACnE,mEAAmE;IACnE,iEAAiE;IACjE,EAAE;IACF,oEAAoE;IACpE,kEAAkE;IAClE,iEAAiE;IACjE,oEAAoE;IACpE,wDAAwD;IACxD,OAAO,CAAC,IAAkB,EAAE,KAAY;QACtC,OAAO,IAAI,CAAA;IACb,CAAC;IAGD,KAAK,CAAC,IAAS,EAAE,GAAiB;QAChC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;YACpC,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAClC,CAAC;QAED,OAAO,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;IAC/B,CAAC;IAGD,OAAO,CAAC,GAAiB,EAAE,IAAW;QACpC,MAAM,IAAI,GAAQ,IAAI,CAAC,CAAC,CAAC,CAAA;QACzB,MAAM,IAAI,GAAQ,IAAI,CAAC,CAAC,CAAC,CAAA;QAEzB,mEAAmE;QACnE,iEAAiE;QACjE,0CAA0C;QAC1C,EAAE;QACF,iEAAiE;QACjE,iEAAiE;QACjE,mEAAmE;QACnE,MAAM,KAAK,GAAG,CAAC,KAAU,EAAE,IAAkB,EAAW,EAAE;YACxD,4DAA4D;YAC5D,6DAA6D;YAC7D,+DAA+D;YAC/D,4DAA4D;YAC5D,4DAA4D;YAC5D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAA;YAC5C,IAAA,oBAAc,EAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;YAC/B,MAAM,IAAI,GAAG,IAAA,oBAAS,EAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAA;YACzC,MAAM,GAAG,GAAG,IAAA,wBAAU,EAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAA;YACrD,OAAO,SAAS,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,CAAA;QACvD,CAAC,CAAA;QAED,gEAAgE;QAChE,iEAAiE;QACjE,4BAA4B;QAC5B,IAAI,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,CAAC;YACzB,MAAM,GAAG,GAAwB,EAAE,CAAA;YACnC,KAAK,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,IAAA,oBAAU,EAAC,IAAI,EAAE,GAAG,CAAa,EAAE,CAAC;gBAC7D,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;gBAC7B,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;oBACrB,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;gBAC5B,CAAC;YACH,CAAC;YACD,OAAO,IAAI,eAAM,CAAC,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,CAAA;QACjC,CAAC;QAED,IAAI,IAAI,KAAK,IAAI,EAAE,MAAM,EAAE,CAAC;YAC1B,MAAM,GAAG,GAAU,EAAE,CAAA;YACrB,KAAK,MAAM,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,IAAA,oBAAU,EAAC,IAAI,EAAE,GAAG,CAAa,EAAE,CAAC;gBAC5D,+DAA+D;gBAC/D,+DAA+D;gBAC/D,4DAA4D;gBAC5D,wCAAwC;gBACxC,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;gBAC5C,IAAI,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;oBACpB,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;gBAC1B,CAAC;YACH,CAAC;YACD,OAAO,IAAI,iBAAO,CAAC,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,CAAA;QAClC,CAAC;QAED,OAAO,IAAA,gBAAU,EAAC,GAAG,EAAE,aAAa,EAAE,IAAI,CAAC,CAAA;IAC7C,CAAC;CAEF,CAAC,iCAAiC;QAIjC,aAAa"}

package/dist/val/FormFuncVal.d.ts

@@ -0,0 +1,14 @@
+import type { Val, ValSpec } from '../type';
+import { AontuContext } from '../ctx';
+import { ListVal } from './ListVal';
+import { FuncBaseVal } from './FuncBaseVal';
+declare class FormFuncVal extends FuncBaseVal {
+    isFormFunc: boolean;
+    staged: boolean;
+    constructor(spec: ValSpec, ctx?: AontuContext);
+    funcname(): string;
+    prepare(_ctx: AontuContext, _args: Val[]): null;
+    unify(peer: Val, ctx: AontuContext): Val;
+    resolve(ctx: AontuContext, args: Val[]): ListVal | import("./NilVal").NilVal;
+}
+export { FormFuncVal, };