@productbrain/cli 0.1.0-beta.22 → 0.1.0-beta.2200

package/dist/generators/boundary-manifest.test.js

@@ -0,0 +1,91 @@
+import { beforeEach, describe, expect, it, vi } from 'vitest';
+import { join } from 'path';
+const { vfs, PB_DIR } = vi.hoisted(() => ({
+    vfs: {},
+    PB_DIR: '/tmp/pb-test/.productbrain',
+}));
+vi.mock('fs', () => ({
+    existsSync: vi.fn((path) => path in vfs),
+    readFileSync: vi.fn((path, _enc) => {
+        if (path in vfs)
+            return vfs[path];
+        throw Object.assign(new Error(`ENOENT: no such file '${path}'`), { code: 'ENOENT' });
+    }),
+}));
+import { generateBoundaryManifest, getBoundaryEnforcementMode, parseBoundaryRules, } from './boundary-manifest.js';
+const SOURCE_PATH = join(PB_DIR, 'rules', 'architecture-boundaries.md');
+function boundaryMarkdown(depcruiseRuleName = 'core-no-feature') {
+    return `---
+name: architecture-boundaries
+enforcement:
+  boundaries:
+    - id: core-no-feature
+      kind: policyBoundary
+      status: active
+      scope: convex
+      chainRefs: [BR-19, ARCH-29]
+      description: "Core must not import Feature."
+      from:
+        path: "^convex/gitchain/"
+      to:
+        path: "^convex/chainwork/"
+      severity: error
+      enforcement:
+        depcruiseRuleName: ${depcruiseRuleName}
+    - id: no-circular
+      kind: localOnlyTechnical
+      status: active
+      scope: repo
+      chainRefs: []
+      description: "Technical graph integrity check."
+      enforcement:
+        depcruiseRuleName: no-circular
+---
+
+# Architecture Boundaries
+`;
+}
+describe('boundary manifest generator', () => {
+    beforeEach(() => {
+        Object.keys(vfs).forEach((key) => delete vfs[key]);
+        vi.clearAllMocks();
+    });
+    it('defaults new workspaces to advisory mode', () => {
+        expect(getBoundaryEnforcementMode(null)).toBe('advisory');
+    });
+    it('parses structured Product Brain boundary frontmatter', () => {
+        const rules = parseBoundaryRules(boundaryMarkdown());
+        expect(rules).toHaveLength(2);
+        expect(rules[0]).toMatchObject({
+            id: 'core-no-feature',
+            kind: 'policyBoundary',
+            status: 'active',
+            scope: 'convex',
+            chainRefs: ['BR-19', 'ARCH-29'],
+            from: { path: '^convex/gitchain/' },
+            to: { path: '^convex/chainwork/' },
+            severity: 'error',
+            enforcement: { depcruiseRuleName: 'core-no-feature' },
+        });
+    });
+    it('generates a stable manifest with source and chain metadata', () => {
+        vfs[SOURCE_PATH] = boundaryMarkdown();
+        const content = generateBoundaryManifest(PB_DIR);
+        expect(content).not.toBeNull();
+        const manifest = JSON.parse(content);
+        expect(manifest.sources[0].path).toBe('.productbrain/rules/architecture-boundaries.md');
+        expect(manifest.chainSources.map((source) => source.entryId)).toEqual([
+            'ARCH-29',
+            'BR-19',
+        ]);
+        expect(manifest.rules.map((rule) => rule.id)).toEqual([
+            'core-no-feature',
+            'no-circular',
+        ]);
+    });
+    it('rejects duplicate dependency-cruiser rule names', () => {
+        vfs[SOURCE_PATH] = boundaryMarkdown('no-circular');
+        expect(() => generateBoundaryManifest(PB_DIR)).toThrow('Duplicate dependency-cruiser rule name "no-circular".');
+    });
+});
+//# sourceMappingURL=boundary-manifest.test.js.map

package/dist/generators/boundary-manifest.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"boundary-manifest.test.js","sourceRoot":"","sources":["../../src/generators/boundary-manifest.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAC9D,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAE5B,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC;IACxC,GAAG,EAAE,EAA4B;IACjC,MAAM,EAAE,4BAA4B;CACrC,CAAC,CAAC,CAAC;AAEJ,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;IACnB,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,IAAY,EAAE,EAAE,CAAC,IAAI,IAAI,GAAG,CAAC;IAChD,YAAY,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,IAAY,EAAE,IAAa,EAAE,EAAE;QAClD,IAAI,IAAI,IAAI,GAAG;YAAE,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,yBAAyB,IAAI,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;IACvF,CAAC,CAAC;CACH,CAAC,CAAC,CAAC;AAEJ,OAAO,EACL,wBAAwB,EACxB,0BAA0B,EAC1B,kBAAkB,GACnB,MAAM,wBAAwB,CAAC;AAEhC,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,4BAA4B,CAAC,CAAC;AAExE,SAAS,gBAAgB,CAAC,iBAAiB,GAAG,iBAAiB;IAC7D,OAAO;;;;;;;;;;;;;;;;6BAgBoB,iBAAiB;;;;;;;;;;;;CAY7C,CAAC;AACF,CAAC;AAED,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,UAAU,CAAC,GAAG,EAAE;QACd,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACnD,EAAE,CAAC,aAAa,EAAE,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,0BAA0B,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG,kBAAkB,CAAC,gBAAgB,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;YAC7B,EAAE,EAAE,iBAAiB;YACrB,IAAI,EAAE,gBAAgB;YACtB,MAAM,EAAE,QAAQ;YAChB,KAAK,EAAE,QAAQ;YACf,SAAS,EAAE,CAAC,OAAO,EAAE,SAAS,CAAC;YAC/B,IAAI,EAAE,EAAE,IAAI,EAAE,mBAAmB,EAAE;YACnC,EAAE,EAAE,EAAE,IAAI,EAAE,oBAAoB,EAAE;YAClC,QAAQ,EAAE,OAAO;YACjB,WAAW,EAAE,EAAE,iBAAiB,EAAE,iBAAiB,EAAE;SACtD,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,GAAG,CAAC,WAAW,CAAC,GAAG,gBAAgB,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,wBAAwB,CAAC,MAAM,CAAC,CAAC;QACjD,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAQ,CAAC,CAAC;QACtC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;QACxF,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,MAA2B,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;YACzF,SAAS;YACT,OAAO;SACR,CAAC,CAAC;QACH,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAoB,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;YACpE,iBAAiB;YACjB,aAAa;SACd,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,GAAG,CAAC,WAAW,CAAC,GAAG,gBAAgB,CAAC,aAAa,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,EAAE,CAAC,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CACpD,uDAAuD,CACxD,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/generators/chain-classifier.d.ts

@@ -0,0 +1,63 @@
+/**
+ * Chain Classifier — BET-286 Slice 1
+ *
+ * Pure function that maps governance entries (from getGovernanceWithRelations)
+ * to the governance function each entry serves. No LLM, no network calls.
+ * Deterministic: same input always produces same output.
+ *
+ * Chain: BET-286 (Chain-Derived Agent Configuration)
+ */
+/** The governance functions that archetypes exist for. */
+export type GovernanceFunction = 'constraint' | 'boundary' | 'convention' | 'policy' | 'workflow' | 'quality-gate' | 'unclassified';
+/** Typed relation edge — mirrors GovernanceRelationEdge from convex/agentKnowledge/governanceQuery.ts */
+export interface GovernanceRelationEdge {
+    type: string;
+    direction: 'outgoing' | 'incoming';
+    otherEntryId: string | null;
+    otherName: string;
+    otherCollectionSlug: string | null;
+}
+/** Input shape — matches GovernanceEntry from the Convex query. */
+export interface GovernanceEntryInput {
+    entryId: string | null;
+    name: string;
+    collectionSlug: string;
+    status: string;
+    verificationStatus: 'verified' | 'unverified' | null;
+    data: Record<string, unknown> | null;
+    relations: GovernanceRelationEdge[];
+}
+/** Workspace collection metadata from chain.listCollections. */
+export interface GovernanceCollectionInput {
+    slug: string;
+    name?: string;
+    description?: string;
+    purpose?: string;
+    usageGuidance?: string;
+    classificationCheck?: string;
+    classificationSignals?: string[];
+    defaultCanonicalKey?: string;
+    governanceRole?: string;
+    thinkingLayer?: string;
+    governanceFunction?: GovernanceFunction;
+}
+/** Result of classifying a single governance entry. */
+export interface ClassifiedGovernance {
+    entryId: string;
+    name: string;
+    collectionSlug: string;
+    governanceFunction: GovernanceFunction;
+    confidence: number;
+    matchedSignals: string[];
+    /** Original entry data passed through for archetype slot resolution */
+    data: Record<string, unknown> | null;
+    /** Original relations passed through */
+    relations: GovernanceRelationEdge[];
+}
+/**
+ * Classify a batch of governance entries, returning one ClassifiedGovernance
+ * per entry that has a non-null entryId. Entries with null entryId are silently
+ * excluded (safety guard — entries without IDs cannot be referenced by archetypes).
+ */
+export declare function classifyGovernance(entries: GovernanceEntryInput[], collections?: GovernanceCollectionInput[]): ClassifiedGovernance[];
+//# sourceMappingURL=chain-classifier.d.ts.map

package/dist/generators/chain-classifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chain-classifier.d.ts","sourceRoot":"","sources":["../../src/generators/chain-classifier.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,0DAA0D;AAC1D,MAAM,MAAM,kBAAkB,GAC1B,YAAY,GACZ,UAAU,GACV,YAAY,GACZ,QAAQ,GACR,UAAU,GACV,cAAc,GACd,cAAc,CAAC;AAEnB,yGAAyG;AACzG,MAAM,WAAW,sBAAsB;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,UAAU,GAAG,UAAU,CAAC;IACnC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,mBAAmB,EAAE,MAAM,GAAG,IAAI,CAAC;CACpC;AAED,mEAAmE;AACnE,MAAM,WAAW,oBAAoB;IACnC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,cAAc,EAAE,MAAM,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;IACf,kBAAkB,EAAE,UAAU,GAAG,YAAY,GAAG,IAAI,CAAC;IACrD,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;IACrC,SAAS,EAAE,sBAAsB,EAAE,CAAC;CACrC;AAED,gEAAgE;AAChE,MAAM,WAAW,yBAAyB;IACxC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,qBAAqB,CAAC,EAAE,MAAM,EAAE,CAAC;IACjC,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,kBAAkB,CAAC,EAAE,kBAAkB,CAAC;CACzC;AAED,uDAAuD;AACvD,MAAM,WAAW,oBAAoB;IACnC,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,cAAc,EAAE,MAAM,CAAC;IACvB,kBAAkB,EAAE,kBAAkB,CAAC;IACvC,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,uEAAuE;IACvE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;IACrC,wCAAwC;IACxC,SAAS,EAAE,sBAAsB,EAAE,CAAC;CACrC;AA2BD;;;;GAIG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,oBAAoB,EAAE,EAC/B,WAAW,GAAE,yBAAyB,EAAO,GAC5C,oBAAoB,EAAE,CAwFxB"}

package/dist/generators/chain-classifier.js

@@ -0,0 +1,131 @@
+/**
+ * Chain Classifier — BET-286 Slice 1
+ *
+ * Pure function that maps governance entries (from getGovernanceWithRelations)
+ * to the governance function each entry serves. No LLM, no network calls.
+ * Deterministic: same input always produces same output.
+ *
+ * Chain: BET-286 (Chain-Derived Agent Configuration)
+ */
+/** Base score awarded for a collection-type match. */
+const COLLECTION_BASE_SCORE = 0.45;
+/** Score boost for a supporting relation type match. */
+const RELATION_BOOST = 0.2;
+/** Score boost for a supporting name pattern match. */
+const NAME_BOOST = 0.15;
+/**
+ * Relation-type signals that boost a governance function.
+ * Key: relation type string (lowercased).
+ * Value: [governanceFunction, boost].
+ */
+const RELATION_SIGNALS = [
+    { type: 'constrains', fn: 'constraint', boost: RELATION_BOOST },
+    { type: 'governs', fn: 'policy', boost: RELATION_BOOST },
+    { type: 'part_of', fn: 'workflow', boost: RELATION_BOOST },
+];
+// ── Classifier ────────────────────────────────────────────────────────
+/**
+ * Classify a batch of governance entries, returning one ClassifiedGovernance
+ * per entry that has a non-null entryId. Entries with null entryId are silently
+ * excluded (safety guard — entries without IDs cannot be referenced by archetypes).
+ */
+export function classifyGovernance(entries, collections = []) {
+    const results = [];
+    const collectionBySlug = new Map(collections.map((c) => [c.slug, c]));
+    for (const entry of entries) {
+        // Safety: skip entries without a human-readable ID
+        if (entry.entryId === null)
+            continue;
+        const scores = new Map();
+        const signals = [];
+        const slug = entry.collectionSlug;
+        const collection = collectionBySlug.get(slug);
+        // ── Signal 1: Collection type (strongest) ──────────────────────
+        const primaryFn = inferCollectionGovernanceFunction(collection, entry);
+        if (primaryFn && primaryFn !== 'unclassified') {
+            addScore(scores, primaryFn, COLLECTION_BASE_SCORE);
+            signals.push(`collection metadata '${slug}' → ${primaryFn}`);
+        }
+        // ── Signal 2: Relation types (refining) ───────────────────────
+        for (const rel of entry.relations) {
+            const relTypeLower = rel.type.toLowerCase();
+            for (const sig of RELATION_SIGNALS) {
+                if (relTypeLower === sig.type) {
+                    addScore(scores, sig.fn, sig.boost);
+                    signals.push(`relation '${rel.type}' → boost ${sig.fn}`);
+                }
+            }
+            if (relTypeLower === 'informed_by' && rel.otherCollectionSlug) {
+                const otherFn = inferCollectionGovernanceFunction(collectionBySlug.get(rel.otherCollectionSlug));
+                if (otherFn === 'boundary') {
+                    // Boost only (matches Signal-2 convention above): an informed_by edge
+                    // REFINES the score, it must not contribute a full collection base —
+                    // otherwise a single edge outscores the entry's own collection signal.
+                    addScore(scores, 'boundary', RELATION_BOOST);
+                    signals.push(`relation '${rel.type}' to boundary collection '${rel.otherCollectionSlug}' → boost boundary`);
+                }
+            }
+        }
+        // ── Signal 3: Workspace collection name signals (weakest) ────
+        if (primaryFn && collection?.classificationSignals?.length) {
+            const entryText = entry.name.toLowerCase();
+            const matchedSignal = collection.classificationSignals.find((signal) => entryText.includes(signal.toLowerCase()));
+            if (matchedSignal) {
+                addScore(scores, primaryFn, NAME_BOOST);
+                signals.push(`collection signal '${matchedSignal}' → boost ${primaryFn}`);
+            }
+        }
+        // ── Pick winner ───────────────────────────────────────────────
+        let bestFn = 'unclassified';
+        let bestScore = 0;
+        for (const [fn, score] of scores) {
+            if (score > bestScore) {
+                bestScore = score;
+                bestFn = fn;
+            }
+        }
+        if (collection?.governanceFunction === 'unclassified') {
+            bestFn = 'unclassified';
+            bestScore = 0;
+        }
+        // Confidence: clamp to [0, 1]
+        const confidence = Math.min(1, Math.max(0, bestScore));
+        results.push({
+            entryId: entry.entryId,
+            name: entry.name,
+            collectionSlug: entry.collectionSlug,
+            governanceFunction: bestFn,
+            confidence,
+            matchedSignals: signals,
+            data: entry.data,
+            relations: entry.relations,
+        });
+    }
+    return results;
+}
+// ── Helpers ────────────────────────────────────────────────────────────
+function addScore(scores, fn, delta) {
+    scores.set(fn, (scores.get(fn) ?? 0) + delta);
+}
+function inferCollectionGovernanceFunction(collection, entry) {
+    const explicit = normalizeGovernanceFunction(collection?.governanceFunction);
+    if (explicit)
+        return explicit;
+    const dataFn = normalizeGovernanceFunction(entry?.data?.governanceFunction);
+    if (dataFn)
+        return dataFn;
+    return 'unclassified';
+}
+function normalizeGovernanceFunction(value) {
+    if (value === 'constraint' ||
+        value === 'boundary' ||
+        value === 'convention' ||
+        value === 'policy' ||
+        value === 'workflow' ||
+        value === 'quality-gate' ||
+        value === 'unclassified') {
+        return value;
+    }
+    return null;
+}
+//# sourceMappingURL=chain-classifier.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"chain-classifier.js","sourceRoot":"","sources":["../../src/generators/chain-classifier.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAoEH,sDAAsD;AACtD,MAAM,qBAAqB,GAAG,IAAI,CAAC;AACnC,wDAAwD;AACxD,MAAM,cAAc,GAAG,GAAG,CAAC;AAC3B,uDAAuD;AACvD,MAAM,UAAU,GAAG,IAAI,CAAC;AAExB;;;;GAIG;AACH,MAAM,gBAAgB,GAAmE;IACvF,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,cAAc,EAAE;IAC/D,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,cAAc,EAAE;IACxD,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,cAAc,EAAE;CAC3D,CAAC;AAEF,yEAAyE;AAEzE;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAChC,OAA+B,EAC/B,cAA2C,EAAE;IAE7C,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtE,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,mDAAmD;QACnD,IAAI,KAAK,CAAC,OAAO,KAAK,IAAI;YAAE,SAAS;QAErC,MAAM,MAAM,GAAa,IAAI,GAAG,EAAE,CAAC;QACnC,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,MAAM,IAAI,GAAG,KAAK,CAAC,cAAc,CAAC;QAClC,MAAM,UAAU,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAE9C,kEAAkE;QAClE,MAAM,SAAS,GAAG,iCAAiC,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACvE,IAAI,SAAS,IAAI,SAAS,KAAK,cAAc,EAAE,CAAC;YAC9C,QAAQ,CAAC,MAAM,EAAE,SAAS,EAAE,qBAAqB,CAAC,CAAC;YACnD,OAAO,CAAC,IAAI,CAAC,wBAAwB,IAAI,OAAO,SAAS,EAAE,CAAC,CAAC;QAC/D,CAAC;QAED,iEAAiE;QACjE,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YAClC,MAAM,YAAY,GAAG,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YAE5C,KAAK,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBACnC,IAAI,YAAY,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC;oBAC9B,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;oBACpC,OAAO,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,IAAI,aAAa,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC3D,CAAC;YACH,CAAC;YAED,IAAI,YAAY,KAAK,aAAa,IAAI,GAAG,CAAC,mBAAmB,EAAE,CAAC;gBAC9D,MAAM,OAAO,GAAG,iCAAiC,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC;gBACjG,IAAI,OAAO,KAAK,UAAU,EAAE,CAAC;oBAC3B,sEAAsE;oBACtE,qEAAqE;oBACrE,uEAAuE;oBACvE,QAAQ,CAAC,MAAM,EAAE,UAAU,EAAE,cAAc,CAAC,CAAC;oBAC7C,OAAO,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,IAAI,6BAA6B,GAAG,CAAC,mBAAmB,oBAAoB,CAAC,CAAC;gBAC9G,CAAC;YACH,CAAC;QACH,CAAC;QAED,gEAAgE;QAChE,IAAI,SAAS,IAAI,UAAU,EAAE,qBAAqB,EAAE,MAAM,EAAE,CAAC;YAC3D,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YAC3C,MAAM,aAAa,GAAG,UAAU,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CACrE,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CACzC,CAAC;YACF,IAAI,aAAa,EAAE,CAAC;gBAClB,QAAQ,CAAC,MAAM,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;gBACxC,OAAO,CAAC,IAAI,CAAC,sBAAsB,aAAa,aAAa,SAAS,EAAE,CAAC,CAAC;YAC5E,CAAC;QACH,CAAC;QAED,iEAAiE;QACjE,IAAI,MAAM,GAAuB,cAAc,CAAC;QAChD,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YACjC,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACtB,SAAS,GAAG,KAAK,CAAC;gBAClB,MAAM,GAAG,EAAE,CAAC;YACd,CAAC;QACH,CAAC;QAED,IAAI,UAAU,EAAE,kBAAkB,KAAK,cAAc,EAAE,CAAC;YACtD,MAAM,GAAG,cAAc,CAAC;YACxB,SAAS,GAAG,CAAC,CAAC;QAChB,CAAC;QAED,8BAA8B;QAC9B,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;QAEvD,OAAO,CAAC,IAAI,CAAC;YACX,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,cAAc,EAAE,KAAK,CAAC,cAAc;YACpC,kBAAkB,EAAE,MAAM;YAC1B,UAAU;YACV,cAAc,EAAE,OAAO;YACvB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,SAAS,EAAE,KAAK,CAAC,SAAS;SAC3B,CAAC,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,0EAA0E;AAE1E,SAAS,QAAQ,CAAC,MAAgB,EAAE,EAAsB,EAAE,KAAa;IACvE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;AAChD,CAAC;AAED,SAAS,iCAAiC,CACxC,UAAiD,EACjD,KAA4B;IAE5B,MAAM,QAAQ,GAAG,2BAA2B,CAAC,UAAU,EAAE,kBAAkB,CAAC,CAAC;IAC7E,IAAI,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAC9B,MAAM,MAAM,GAAG,2BAA2B,CAAC,KAAK,EAAE,IAAI,EAAE,kBAAkB,CAAC,CAAC;IAC5E,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAC1B,OAAO,cAAc,CAAC;AACxB,CAAC;AAED,SAAS,2BAA2B,CAAC,KAAc;IACjD,IACE,KAAK,KAAK,YAAY;QACtB,KAAK,KAAK,UAAU;QACpB,KAAK,KAAK,YAAY;QACtB,KAAK,KAAK,QAAQ;QAClB,KAAK,KAAK,UAAU;QACpB,KAAK,KAAK,cAAc;QACxB,KAAK,KAAK,cAAc,EACxB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

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

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

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

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