@productbrain/cli 0.1.0-beta.5 → 0.1.0-beta.5060

package/dist/generators/chain-rules.js

@@ -0,0 +1,256 @@
+/**
+ * Chain Rules Assembler — BET-286 Slice 3
+ *
+ * Fetches governance entries via MCP, classifies them, resolves archetype
+ * templates, and returns CanonicalRule objects ready to merge into the
+ * canonical rules array in runHandshake().
+ *
+ * Chain: BET-286 (Chain-Derived Agent Configuration)
+ */
+import { resolveArchetype } from './archetypes.js';
+// ── Sentinel ──────────────────────────────────────────────────────────
+/** Produced when chain.getGovernanceWithRelations is unreachable. */
+const CHAIN_DEGRADED_SENTINEL = {
+    name: '_chain_degraded',
+    description: 'Chain governance unavailable — agent operating with manual rules only',
+    body: 'WARNING: The Chain MCP endpoint is unreachable. Generated governance rules are unavailable. Agent is operating with manual rules only. Exercise extra caution on governance decisions — check with the human before proceeding.',
+    sourcePath: 'chain://_sentinel',
+    autoApply: true,
+    level: 'core',
+    scope: undefined,
+    targets: undefined,
+};
+// ── Governance functions to attempt (excluding 'unclassified') ────────
+const GOVERNANCE_FUNCTIONS = [
+    'constraint',
+    'boundary',
+    'convention',
+    'policy',
+    'workflow',
+    'quality-gate',
+];
+/** Maximum number of generated rules (ranked by relation density). */
+const MAX_GENERATED_RULES = 8;
+// ── Assembler ─────────────────────────────────────────────────────────
+/**
+ * Fetch governance entries, classify them, resolve archetypes, and produce
+ * CanonicalRule objects ready to merge into the handshake pipeline.
+ *
+ * @param kernelCallFn - Injected kernelCall function for testability.
+ * @param manualRules - Existing manual rules from .productbrain/rules/.
+ *                      Used to suppress generated rules when a manual rule
+ *                      with the same name already exists.
+ */
+export async function generateChainRules(kernelCallFn, manualRules) {
+    const emptyStats = {
+        totalEntries: 0,
+        classifiedEntries: 0,
+        generatedRules: 0,
+        suppressedByManual: 0,
+        suppressedByZeroEntries: 0,
+    };
+    // Step 1: Fetch governance entries — return sentinel on failure
+    // The Convex query returns { entries: [...], total: N } — unwrap the array.
+    let entries;
+    let collections = [];
+    try {
+        const result = await kernelCallFn('chain.getGovernanceWithRelations', {});
+        if (!Array.isArray(result?.entries)) {
+            return { rules: [], gaps: [], sentinel: CHAIN_DEGRADED_SENTINEL, stats: emptyStats, classified: [] };
+        }
+        entries = result.entries;
+    }
+    catch {
+        return {
+            rules: [],
+            gaps: [],
+            sentinel: CHAIN_DEGRADED_SENTINEL,
+            stats: emptyStats,
+            classified: [],
+        };
+    }
+    try {
+        const collectionResult = await kernelCallFn('chain.listCollections', {});
+        collections = Array.isArray(collectionResult) ? collectionResult : [];
+    }
+    catch {
+        collections = [];
+    }
+    // Step 2: Classify entries — WP-488 Slice 4 (FEAT-1378, TEN-2733): served verdict
+    // (chain.classifyGovernance), not a local scorer. `ClassifiedGovernance[]` is a
+    // hand-typed local generic, not derived via kernel-client's GatewayRouteReturnByName —
+    // verified in WP-488 Slice 3 that reaching kernel-client's type derivation from
+    // packages/cli fails (`rootDir: "src"` + `moduleResolution: "NodeNext"`); same
+    // documented deviation as promote.ts/orient.ts.
+    //
+    // Project down to exactly the fields `chain.classifyGovernance`'s
+    // `governanceEntryInputValidator` declares (convex/agentKnowledge/governanceQuery.ts)
+    // before sending [Codex review, PR #378 P1]: `entries` here is populated from
+    // `chain.getGovernanceWithRelations`'s response, whose real runtime shape
+    // (`GovernanceEntry`) carries `attestation` + `verifiedBy` — display-only fields the
+    // kernel judge never reads. The CLI's `kernelCallFn<T>` generic is a type ASSERTION,
+    // not a runtime projection, so `entries: GovernanceEntryInput[]` above is a compile-time
+    // convenience, not a guarantee — the underlying objects still carry those extra fields.
+    // Convex's `v.object(...)` validators are strict (unknown keys are a validation error,
+    // not a silent strip), so forwarding the un-projected objects would fail validation on
+    // every real workspace that has governance entries (an empty-entries workspace never hit
+    // this, since there's nothing to validate) — the classify call would always throw, and
+    // fall into the catch below.
+    const classifyEntries = entries.map((e) => ({
+        entryId: e.entryId,
+        name: e.name,
+        collectionSlug: e.collectionSlug,
+        status: e.status,
+        verificationStatus: e.verificationStatus,
+        data: e.data,
+        relations: e.relations,
+    }));
+    // Same class of bug, same fix, for `collections` [Copilot review, PR #378, follow-up to
+    // Codex P1 #1]: `chain.listCollections` (convex/agentKnowledge/collections.ts) returns
+    // full DB rows via `{ ...c, descriptionFieldKey }` — `_id`, `_creationTime`,
+    // `workspaceId`, `descriptionFieldKey`, and every other `collections` table field, none
+    // of which `governanceCollectionInputValidator` declares. The CLI's
+    // `kernelCallFn<GovernanceCollectionInput[]>` generic is a type assertion, not a runtime
+    // projection, so `collections` above carries all of that at runtime despite its narrower
+    // compile-time type. Forwarding it un-projected would fail Convex's strict `v.object()`
+    // validation in any real workspace with collections (the corpus/unit-test fixtures never
+    // carried extra keys, so this was masked there too).
+    //
+    // [Codex P1, PR #378 follow-up round] Send only the fields the kernel judge actually
+    // reads. Checked kernel/governance/classifyGovernance.ts directly: `slug` (map key),
+    // `classificationSignals`, and `governanceFunction` are the ONLY collection fields the
+    // scorer touches (`inferCollectionGovernanceFunction`, Signal 3's name-boost lookup) —
+    // `name`, `description`, `purpose`, `usageGuidance`, `classificationCheck`,
+    // `defaultCanonicalKey`, `governanceRole`, `thinkingLayer` are read by nothing in the
+    // classifier and were being forwarded as pure dead weight. That matters beyond bytes:
+    // the AKI gateway rejects the WHOLE request if any single string argument exceeds 10KB
+    // (convex/http.ts:933-935, `validateArgLengths`) — a workspace collection with a long
+    // `description`/`usageGuidance` (the MCP tool allows up to 20KB) would have broken every
+    // handshake, even though the classifier never looks at that text. No truncation-with-
+    // marker is needed here (contrast the entries fix): these fields are unused, not merely
+    // long, so the honest fix is to not send them at all, not to send a truncated copy.
+    const classifyCollections = collections.map((c) => ({
+        slug: c.slug,
+        classificationSignals: c.classificationSignals,
+        governanceFunction: c.governanceFunction,
+    }));
+    // A classify failure is NOT equivalent to "zero governance entries" — no rules can be
+    // derived without classification, so [Codex review, PR #378 P1] this failure now gets
+    // the SAME degraded-sentinel treatment as the two fetch failures above, instead of
+    // silently continuing with an empty classified list (which would report success with 0
+    // generated rules, indistinguishable from a genuinely empty workspace and masking the
+    // real error). The pre-migration local `classifyGovernance()` was a pure synchronous
+    // function with no failure mode to preserve — this is a new failure surface introduced
+    // by moving classification behind a network call, so there is no prior degraded
+    // semantics to match; the fetch steps' existing pattern is the honest precedent to
+    // extend rather than a fresh invention.
+    // [Codex P1, PR #378 follow-up round] Chunk below Convex's function-argument ceiling.
+    // At production scale (SCALE_TIERS.xl, convex/lib/scaleTiers.ts: ~4,000 governance
+    // entries × 3 relations each) the full corpus as one `entries` argument — echoed back
+    // in the response too, since `data`/`relations` pass through — can exceed the <1MB cap
+    // a Convex function argument/value must stay under (convex/http.ts:1816-1819 documents
+    // the same platform ceiling for a different route). Batch by an estimated worst-case
+    // per-entry byte size with headroom, not a fixed entry count, so the batch size adapts
+    // to how large individual entries/relations actually are; merge each batch's results.
+    const CLASSIFY_BATCH_BUDGET_BYTES = 400_000; // headroom under the ~1MB ceiling —
+    // covers this call's args AND its response echo (roughly 2x the entries payload),
+    // plus classifyCollections and JSON/HTTP framing overhead, with margin to spare.
+    const collectionsBytes = classifyCollections.length
+        ? new TextEncoder().encode(JSON.stringify(classifyCollections)).length
+        : 0;
+    const worstCaseEntryBytes = classifyEntries.reduce((max, e) => Math.max(max, new TextEncoder().encode(JSON.stringify(e)).length), 1);
+    const entryBudgetBytes = Math.max(CLASSIFY_BATCH_BUDGET_BYTES - collectionsBytes, worstCaseEntryBytes);
+    const batchSize = Math.max(1, Math.floor(entryBudgetBytes / worstCaseEntryBytes));
+    const entryBatches = [];
+    for (let i = 0; i < classifyEntries.length; i += batchSize) {
+        entryBatches.push(classifyEntries.slice(i, i + batchSize));
+    }
+    if (entryBatches.length === 0)
+        entryBatches.push([]); // preserve one call at zero entries
+    let classified = [];
+    try {
+        for (const batch of entryBatches) {
+            const classifyResult = await kernelCallFn('chain.classifyGovernance', {
+                entries: batch,
+                collections: classifyCollections,
+            });
+            if (!Array.isArray(classifyResult)) {
+                return { rules: [], gaps: [], sentinel: CHAIN_DEGRADED_SENTINEL, stats: emptyStats, classified: [] };
+            }
+            classified = classified.concat(classifyResult);
+        }
+    }
+    catch {
+        return { rules: [], gaps: [], sentinel: CHAIN_DEGRADED_SENTINEL, stats: emptyStats, classified: [] };
+    }
+    // Step 3: Build manual rule name set for suppression check
+    const manualRuleNames = new Set(manualRules.map((r) => r.name));
+    // Step 4: Resolve an archetype per governance function
+    const resolvedRules = [];
+    const gaps = [];
+    let suppressedByManual = 0;
+    let suppressedByZeroEntries = 0;
+    for (const fn of GOVERNANCE_FUNCTIONS) {
+        const matching = classified.filter((e) => e.governanceFunction === fn);
+        if (matching.length === 0) {
+            // Zero entries for this function — add to gaps
+            gaps.push(fn);
+            suppressedByZeroEntries++;
+            continue;
+        }
+        const result = resolveArchetype(fn, classified, manualRuleNames);
+        if ('skipped' in result) {
+            if (result.skipped === 'manual-suppression') {
+                suppressedByManual++;
+            }
+            // 'no-template' and 'zero-entries' are not counted as manual suppression.
+            // Zero-entries is already handled above; no-template is a missing file (not a user action).
+            continue;
+        }
+        resolvedRules.push(result.resolved.rule);
+    }
+    // Step 5: Cap at MAX_GENERATED_RULES — rank by relation density
+    // Relation density = total relations across all classified entries matching this function
+    const ranked = rankByRelationDensity(resolvedRules, classified);
+    const cappedRules = ranked.slice(0, MAX_GENERATED_RULES);
+    const stats = {
+        totalEntries: entries.length,
+        classifiedEntries: classified.length,
+        generatedRules: cappedRules.length,
+        suppressedByManual,
+        suppressedByZeroEntries,
+    };
+    return {
+        rules: cappedRules,
+        gaps,
+        sentinel: null,
+        stats,
+        classified,
+    };
+}
+// ── Ranking ───────────────────────────────────────────────────────────
+/**
+ * Rank generated rules by the total number of relations across classified
+ * entries that contributed to each rule. Higher relation density → ranked first.
+ *
+ * Falls back to name-based sort for ties to ensure stable output.
+ */
+function rankByRelationDensity(rules, classified) {
+    // Build a density score per sourcePath (chain://<functionKey>)
+    const densityMap = new Map();
+    for (const rule of rules) {
+        // sourcePath is 'chain://<functionKey>'
+        const functionKey = rule.sourcePath.replace('chain://', '');
+        const matching = classified.filter((e) => e.governanceFunction === functionKey);
+        const density = matching.reduce((sum, e) => sum + e.relations.length, 0);
+        densityMap.set(rule.sourcePath, density);
+    }
+    return [...rules].sort((a, b) => {
+        const densityA = densityMap.get(a.sourcePath) ?? 0;
+        const densityB = densityMap.get(b.sourcePath) ?? 0;
+        if (densityB !== densityA)
+            return densityB - densityA;
+        return a.name.localeCompare(b.name);
+    });
+}
+//# sourceMappingURL=chain-rules.js.map

package/dist/generators/chain-rules.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chain-rules.js","sourceRoot":"","sources":["../../src/generators/chain-rules.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AA4BnD,yEAAyE;AAEzE,qEAAqE;AACrE,MAAM,uBAAuB,GAAkB;IAC7C,IAAI,EAAE,iBAAiB;IACvB,WAAW,EAAE,uEAAuE;IACpF,IAAI,EAAE,iOAAiO;IACvO,UAAU,EAAE,mBAAmB;IAC/B,SAAS,EAAE,IAAI;IACf,KAAK,EAAE,MAAM;IACb,KAAK,EAAE,SAAS;IAChB,OAAO,EAAE,SAAS;CACnB,CAAC;AAEF,yEAAyE;AAEzE,MAAM,oBAAoB,GAAG;IAC3B,YAAY;IACZ,UAAU;IACV,YAAY;IACZ,QAAQ;IACR,UAAU;IACV,cAAc;CACN,CAAC;AAIX,sEAAsE;AACtE,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAE9B,yEAAyE;AAEzE;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,YAA8B,EAC9B,WAA4B;IAE5B,MAAM,UAAU,GAAoB;QAClC,YAAY,EAAE,CAAC;QACf,iBAAiB,EAAE,CAAC;QACpB,cAAc,EAAE,CAAC;QACjB,kBAAkB,EAAE,CAAC;QACrB,uBAAuB,EAAE,CAAC;KAC3B,CAAC;IAEF,gEAAgE;IAChE,4EAA4E;IAC5E,IAAI,OAA+B,CAAC;IACpC,IAAI,WAAW,GAAgC,EAAE,CAAC;IAClD,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,YAAY,CAA+D,kCAAkC,EAAE,EAAE,CAAC,CAAC;QACxI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;YACpC,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,uBAAuB,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QACvG,CAAC;QACD,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAC3B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO;YACL,KAAK,EAAE,EAAE;YACT,IAAI,EAAE,EAAE;YACR,QAAQ,EAAE,uBAAuB;YACjC,KAAK,EAAE,UAAU;YACjB,UAAU,EAAE,EAAE;SACf,CAAC;IACJ,CAAC;IAED,IAAI,CAAC;QACH,MAAM,gBAAgB,GAAG,MAAM,YAAY,CAA8B,uBAAuB,EAAE,EAAE,CAAC,CAAC;QACtG,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;IACxE,CAAC;IAAC,MAAM,CAAC;QACP,WAAW,GAAG,EAAE,CAAC;IACnB,CAAC;IAED,kFAAkF;IAClF,gFAAgF;IAChF,uFAAuF;IACvF,gFAAgF;IAChF,+EAA+E;IAC/E,gDAAgD;IAChD,EAAE;IACF,kEAAkE;IAClE,sFAAsF;IACtF,8EAA8E;IAC9E,0EAA0E;IAC1E,qFAAqF;IACrF,qFAAqF;IACrF,yFAAyF;IACzF,wFAAwF;IACxF,uFAAuF;IACvF,uFAAuF;IACvF,yFAAyF;IACzF,uFAAuF;IACvF,6BAA6B;IAC7B,MAAM,eAAe,GAA2B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClE,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,cAAc,EAAE,CAAC,CAAC,cAAc;QAChC,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,kBAAkB,EAAE,CAAC,CAAC,kBAAkB;QACxC,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,SAAS,EAAE,CAAC,CAAC,SAAS;KACvB,CAAC,CAAC,CAAC;IAEJ,wFAAwF;IACxF,uFAAuF;IACvF,6EAA6E;IAC7E,wFAAwF;IACxF,oEAAoE;IACpE,yFAAyF;IACzF,yFAAyF;IACzF,wFAAwF;IACxF,yFAAyF;IACzF,qDAAqD;IACrD,EAAE;IACF,qFAAqF;IACrF,qFAAqF;IACrF,uFAAuF;IACvF,uFAAuF;IACvF,4EAA4E;IAC5E,sFAAsF;IACtF,sFAAsF;IACtF,uFAAuF;IACvF,sFAAsF;IACtF,yFAAyF;IACzF,sFAAsF;IACtF,wFAAwF;IACxF,oFAAoF;IACpF,MAAM,mBAAmB,GAAgC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/E,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,qBAAqB,EAAE,CAAC,CAAC,qBAAqB;QAC9C,kBAAkB,EAAE,CAAC,CAAC,kBAAkB;KACzC,CAAC,CAAC,CAAC;IAEJ,sFAAsF;IACtF,sFAAsF;IACtF,mFAAmF;IACnF,uFAAuF;IACvF,sFAAsF;IACtF,qFAAqF;IACrF,uFAAuF;IACvF,gFAAgF;IAChF,mFAAmF;IACnF,wCAAwC;IACxC,sFAAsF;IACtF,mFAAmF;IACnF,sFAAsF;IACtF,uFAAuF;IACvF,uFAAuF;IACvF,qFAAqF;IACrF,uFAAuF;IACvF,sFAAsF;IACtF,MAAM,2BAA2B,GAAG,OAAO,CAAC,CAAC,oCAAoC;IACjF,kFAAkF;IAClF,iFAAiF;IACjF,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,MAAM;QACjD,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAC,CAAC,MAAM;QACtE,CAAC,CAAC,CAAC,CAAC;IACN,MAAM,mBAAmB,GAAG,eAAe,CAAC,MAAM,CAChD,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAC7E,CAAC,CACF,CAAC;IACF,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAC/B,2BAA2B,GAAG,gBAAgB,EAC9C,mBAAmB,CAIpB,CAAC;IACF,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,gBAAgB,GAAG,mBAAmB,CAAC,CAAC,CAAC;IAClF,MAAM,YAAY,GAA6B,EAAE,CAAC;IAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;QAC3D,YAAY,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;IAC7D,CAAC;IACD,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,oCAAoC;IAE1F,IAAI,UAAU,GAA2B,EAAE,CAAC;IAC5C,IAAI,CAAC;QACH,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,MAAM,cAAc,GAAG,MAAM,YAAY,CAAuD,0BAA0B,EAAE;gBAC1H,OAAO,EAAE,KAAK;gBACd,WAAW,EAAE,mBAAmB;aACjC,CAAC,CAAC;YACH,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;gBACnC,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,uBAAuB,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;YACvG,CAAC;YACD,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,uBAAuB,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IACvG,CAAC;IAED,2DAA2D;IAC3D,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAEhE,uDAAuD;IACvD,MAAM,aAAa,GAAoB,EAAE,CAAC;IAC1C,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,uBAAuB,GAAG,CAAC,CAAC;IAEhC,KAAK,MAAM,EAAE,IAAI,oBAAoB,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,kBAAkB,KAAK,EAAE,CAAC,CAAC;QAEvE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,+CAA+C;YAC/C,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACd,uBAAuB,EAAE,CAAC;YAC1B,SAAS;QACX,CAAC;QAED,MAAM,MAAM,GAAG,gBAAgB,CAAC,EAAE,EAAE,UAAU,EAAE,eAAe,CAAC,CAAC;QAEjE,IAAI,SAAS,IAAI,MAAM,EAAE,CAAC;YACxB,IAAI,MAAM,CAAC,OAAO,KAAK,oBAAoB,EAAE,CAAC;gBAC5C,kBAAkB,EAAE,CAAC;YACvB,CAAC;YACD,0EAA0E;YAC1E,4FAA4F;YAC5F,SAAS;QACX,CAAC;QAED,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED,gEAAgE;IAChE,0FAA0F;IAC1F,MAAM,MAAM,GAAG,qBAAqB,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;IAChE,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;IAEzD,MAAM,KAAK,GAAoB;QAC7B,YAAY,EAAE,OAAO,CAAC,MAAM;QAC5B,iBAAiB,EAAE,UAAU,CAAC,MAAM;QACpC,cAAc,EAAE,WAAW,CAAC,MAAM;QAClC,kBAAkB;QAClB,uBAAuB;KACxB,CAAC;IAEF,OAAO;QACL,KAAK,EAAE,WAAW;QAClB,IAAI;QACJ,QAAQ,EAAE,IAAI;QACd,KAAK;QACL,UAAU;KACX,CAAC;AACJ,CAAC;AAED,yEAAyE;AAEzE;;;;;GAKG;AACH,SAAS,qBAAqB,CAC5B,KAAsB,EACtB,UAAkC;IAElC,+DAA+D;IAC/D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,wCAAwC;QACxC,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAiC,CAAC;QAC5F,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,kBAAkB,KAAK,WAAW,CAAC,CAAC;QAChF,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACzE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAC3C,CAAC;IAED,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACnD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACnD,IAAI,QAAQ,KAAK,QAAQ;YAAE,OAAO,QAAQ,GAAG,QAAQ,CAAC;QACtD,OAAO,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/generators/chain-rules.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=chain-rules.test.d.ts.map

package/dist/generators/chain-rules.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chain-rules.test.d.ts","sourceRoot":"","sources":["../../src/generators/chain-rules.test.ts"],"names":[],"mappings":""}