@productbrain/cli 0.1.0-beta.978 → 0.1.0-beta.9784

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

@@ -1,257 +0,0 @@
-/**
- * chain-classifier — unit tests.
- * BET-286 Slice 1: relation-aware governance function classifier.
- */
-import { describe, expect, it } from 'vitest';
-import { classifyGovernance, } from './chain-classifier.js';
-// ── Helpers ────────────────────────────────────────────────────────────
-function makeEntry(overrides) {
-    return {
-        status: 'committed',
-        verificationStatus: null,
-        data: null,
-        relations: [],
-        ...overrides,
-    };
-}
-function makeRelation(overrides) {
-    return {
-        direction: 'outgoing',
-        otherEntryId: null,
-        otherName: 'other entry',
-        otherCollectionSlug: null,
-        ...overrides,
-    };
-}
-// ── Test cases ─────────────────────────────────────────────────────────
-describe('classifyGovernance — collection signal', () => {
-    it('STD entry with constrains relation → constraint with high confidence (>=0.6)', () => {
-        const entry = makeEntry({
-            entryId: 'STD-1',
-            name: 'Trunk-based development standard',
-            collectionSlug: 'standards',
-            relations: [makeRelation({ type: 'constrains', otherCollectionSlug: 'bets' })],
-        });
-        const results = classifyGovernance([entry]);
-        expect(results).toHaveLength(1);
-        expect(results[0].governanceFunction).toBe('constraint');
-        expect(results[0].confidence).toBeGreaterThanOrEqual(0.6);
-    });
-    it('ARCH entry → boundary with medium confidence (>=0.4)', () => {
-        const entry = makeEntry({
-            entryId: 'ARCH-1',
-            name: 'Seven system domains',
-            collectionSlug: 'architecture',
-        });
-        const results = classifyGovernance([entry]);
-        expect(results).toHaveLength(1);
-        expect(results[0].governanceFunction).toBe('boundary');
-        expect(results[0].confidence).toBeGreaterThanOrEqual(0.4);
-    });
-    it('DEC entry with deployment in name → convention with boosted confidence', () => {
-        const entry = makeEntry({
-            entryId: 'DEC-1',
-            name: 'deployment ordering for Convex and Railway',
-            collectionSlug: 'decisions',
-        });
-        const noNameEntry = makeEntry({
-            entryId: 'DEC-2',
-            name: 'some decision',
-            collectionSlug: 'decisions',
-        });
-        const withName = classifyGovernance([entry]);
-        const withoutName = classifyGovernance([noNameEntry]);
-        expect(withName[0].governanceFunction).toBe('convention');
-        expect(withName[0].confidence).toBeGreaterThan(withoutName[0].confidence);
-    });
-    it('FLOW entry → workflow', () => {
-        const entry = makeEntry({
-            entryId: 'FLOW-1',
-            name: 'Feature flag lifecycle flow',
-            collectionSlug: 'flows',
-        });
-        const results = classifyGovernance([entry]);
-        expect(results).toHaveLength(1);
-        expect(results[0].governanceFunction).toBe('workflow');
-    });
-    it('POL entry with governs relation → policy with high confidence', () => {
-        const entry = makeEntry({
-            entryId: 'POL-1',
-            name: 'Access control policy',
-            collectionSlug: 'policies',
-            relations: [makeRelation({ type: 'governs', otherCollectionSlug: 'bets' })],
-        });
-        const results = classifyGovernance([entry]);
-        expect(results).toHaveLength(1);
-        expect(results[0].governanceFunction).toBe('policy');
-        expect(results[0].confidence).toBeGreaterThanOrEqual(0.6);
-    });
-    it('STD entry with test in name → quality-gate with boosted confidence', () => {
-        const entry = makeEntry({
-            entryId: 'STD-2',
-            name: 'Test coverage quality gate for all slices',
-            collectionSlug: 'standards',
-        });
-        const results = classifyGovernance([entry]);
-        expect(results).toHaveLength(1);
-        expect(results[0].governanceFunction).toBe('quality-gate');
-        expect(results[0].confidence).toBeGreaterThanOrEqual(0.5);
-    });
-});
-describe('classifyGovernance — null entryId safety', () => {
-    it('entry with null entryId is excluded from output', () => {
-        const entry = makeEntry({
-            entryId: null,
-            name: 'Draft entry without ID',
-            collectionSlug: 'standards',
-        });
-        const results = classifyGovernance([entry]);
-        expect(results).toHaveLength(0);
-    });
-});
-describe('classifyGovernance — empty input', () => {
-    it('empty input → empty output', () => {
-        const results = classifyGovernance([]);
-        expect(results).toHaveLength(0);
-    });
-});
-describe('classifyGovernance — unclassified', () => {
-    it('glossary entry → unclassified regardless of signals', () => {
-        const entry = makeEntry({
-            entryId: 'GLO-1',
-            name: 'Trunk-based development',
-            collectionSlug: 'glossary',
-            relations: [makeRelation({ type: 'constrains' })],
-        });
-        const results = classifyGovernance([entry]);
-        expect(results).toHaveLength(1);
-        expect(results[0].governanceFunction).toBe('unclassified');
-        expect(results[0].confidence).toBe(0);
-    });
-});
-describe('classifyGovernance — multiple signal matches', () => {
-    it('entry with multiple signals → highest confidence function wins', () => {
-        // BR entry with both constrains AND governs relations.
-        // constrains boosts 'constraint', governs boosts 'policy'.
-        // business-rules base maps to 'constraint', so constraint should win.
-        const entry = makeEntry({
-            entryId: 'BR-1',
-            name: 'Entry creation must use createEntry gate',
-            collectionSlug: 'business-rules',
-            relations: [
-                makeRelation({ type: 'constrains' }),
-                makeRelation({ type: 'constrains' }),
-                makeRelation({ type: 'governs' }),
-            ],
-        });
-        const results = classifyGovernance([entry]);
-        expect(results).toHaveLength(1);
-        // Both constraint and policy are plausible; the function with the highest score wins.
-        // With 2x constrains boosts, constraint should dominate.
-        expect(results[0].governanceFunction).toBe('constraint');
-        expect(results[0].confidence).toBeGreaterThanOrEqual(0.6);
-    });
-});
-describe('classifyGovernance — passthrough fields', () => {
-    it('passes data and relations through to result', () => {
-        const data = { someField: 'someValue' };
-        const relation = makeRelation({ type: 'constrains' });
-        const entry = makeEntry({
-            entryId: 'STD-99',
-            name: 'Some standard',
-            collectionSlug: 'standards',
-            data,
-            relations: [relation],
-        });
-        const results = classifyGovernance([entry]);
-        expect(results[0].data).toBe(data);
-        expect(results[0].relations).toEqual([relation]);
-    });
-    it('returns entryId, name, and collectionSlug unchanged', () => {
-        const entry = makeEntry({
-            entryId: 'ARCH-42',
-            name: 'My architecture entry',
-            collectionSlug: 'architecture',
-        });
-        const results = classifyGovernance([entry]);
-        expect(results[0].entryId).toBe('ARCH-42');
-        expect(results[0].name).toBe('My architecture entry');
-        expect(results[0].collectionSlug).toBe('architecture');
-    });
-});
-describe('classifyGovernance — name signal boosts', () => {
-    it('security keyword boosts policy for business-rules collection', () => {
-        const withKeyword = makeEntry({
-            entryId: 'BR-2',
-            name: 'Auth security check before MCP tool execution',
-            collectionSlug: 'business-rules',
-        });
-        const withoutKeyword = makeEntry({
-            entryId: 'BR-3',
-            name: 'Some business rule',
-            collectionSlug: 'business-rules',
-        });
-        const [withResult] = classifyGovernance([withKeyword]);
-        const [withoutResult] = classifyGovernance([withoutKeyword]);
-        // Security keyword → policy wins over default constraint
-        expect(withResult.governanceFunction).toBe('policy');
-        // Without keyword, default constraint wins
-        expect(withoutResult.governanceFunction).toBe('constraint');
-    });
-    it('matchedSignals contains human-readable explanations', () => {
-        const entry = makeEntry({
-            entryId: 'STD-5',
-            name: 'Quality gate for test coverage',
-            collectionSlug: 'standards',
-            relations: [makeRelation({ type: 'constrains' })],
-        });
-        const [result] = classifyGovernance([entry]);
-        expect(result.matchedSignals.length).toBeGreaterThan(0);
-        expect(result.matchedSignals.some((s) => s.includes('standards'))).toBe(true);
-    });
-});
-describe('classifyGovernance — mixed null/non-null entryIds', () => {
-    it('only entries with non-null entryIds are returned', () => {
-        const entries = [
-            makeEntry({ entryId: 'STD-1', name: 'Valid standard', collectionSlug: 'standards' }),
-            makeEntry({ entryId: null, name: 'Draft entry', collectionSlug: 'standards' }),
-            makeEntry({ entryId: 'ARCH-2', name: 'Architecture entry', collectionSlug: 'architecture' }),
-        ];
-        const results = classifyGovernance(entries);
-        expect(results).toHaveLength(2);
-        expect(results.map((r) => r.entryId)).toEqual(['STD-1', 'ARCH-2']);
-    });
-});
-describe('classifyGovernance — patterns collection', () => {
-    it('PAT entry → convention', () => {
-        const entry = makeEntry({
-            entryId: 'PAT-1',
-            name: 'Additive wrapping pattern for feature flags',
-            collectionSlug: 'patterns',
-        });
-        const results = classifyGovernance([entry]);
-        expect(results[0].governanceFunction).toBe('convention');
-    });
-});
-describe('classifyGovernance — informed_by ARCH relation boosts boundary', () => {
-    it('DEC informed_by an architecture entry → boundary wins over convention', () => {
-        const entry = makeEntry({
-            entryId: 'DEC-5',
-            name: 'Domain boundaries for the seven layers',
-            collectionSlug: 'decisions',
-            relations: [
-                makeRelation({
-                    type: 'informed_by',
-                    direction: 'outgoing',
-                    otherCollectionSlug: 'architecture',
-                    otherName: 'Seven system domains',
-                    otherEntryId: 'ARCH-26',
-                }),
-            ],
-        });
-        // Also include 'domain' keyword in the name → double boundary boost
-        const results = classifyGovernance([entry]);
-        expect(results[0].governanceFunction).toBe('boundary');
-    });
-});
-//# sourceMappingURL=chain-classifier.test.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"chain-classifier.test.js","sourceRoot":"","sources":["../../src/generators/chain-classifier.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EACL,kBAAkB,GAGnB,MAAM,uBAAuB,CAAC;AAE/B,0EAA0E;AAE1E,SAAS,SAAS,CAAC,SAA2G;IAC5H,OAAO;QACL,MAAM,EAAE,WAAW;QACnB,kBAAkB,EAAE,IAAI;QACxB,IAAI,EAAE,IAAI;QACV,SAAS,EAAE,EAAE;QACb,GAAG,SAAS;KACb,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CAAC,SAA6D;IACjF,OAAO;QACL,SAAS,EAAE,UAAU;QACrB,YAAY,EAAE,IAAI;QAClB,SAAS,EAAE,aAAa;QACxB,mBAAmB,EAAE,IAAI;QACzB,GAAG,SAAS;KACb,CAAC;AACJ,CAAC;AAED,0EAA0E;AAE1E,QAAQ,CAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,EAAE,CAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,kCAAkC;YACxC,cAAc,EAAE,WAAW;YAC3B,SAAS,EAAE,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,mBAAmB,EAAE,MAAM,EAAE,CAAC,CAAC;SAC/E,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACzD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,QAAQ;YACjB,IAAI,EAAE,sBAAsB;YAC5B,cAAc,EAAE,cAAc;SAC/B,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,4CAA4C;YAClD,cAAc,EAAE,WAAW;SAC5B,CAAC,CAAC;QAEH,MAAM,WAAW,GAAG,SAAS,CAAC;YAC5B,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,eAAe;YACrB,cAAc,EAAE,WAAW;SAC5B,CAAC,CAAC;QAEH,MAAM,QAAQ,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,MAAM,WAAW,GAAG,kBAAkB,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;QAEtD,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC1D,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;QAC/B,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,QAAQ;YACjB,IAAI,EAAE,6BAA6B;YACnC,cAAc,EAAE,OAAO;SACxB,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,uBAAuB;YAC7B,cAAc,EAAE,UAAU;YAC1B,SAAS,EAAE,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,mBAAmB,EAAE,MAAM,EAAE,CAAC,CAAC;SAC5E,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,2CAA2C;YACjD,cAAc,EAAE,WAAW;SAC5B,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC3D,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,IAAI;YACb,IAAI,EAAE,wBAAwB;YAC9B,cAAc,EAAE,WAAW;SAC5B,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,OAAO,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACvC,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,yBAAyB;YAC/B,cAAc,EAAE,UAAU;YAC1B,SAAS,EAAE,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;SAClD,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC3D,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,8CAA8C,EAAE,GAAG,EAAE;IAC5D,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,uDAAuD;QACvD,2DAA2D;QAC3D,sEAAsE;QACtE,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,MAAM;YACf,IAAI,EAAE,0CAA0C;YAChD,cAAc,EAAE,gBAAgB;YAChC,SAAS,EAAE;gBACT,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC;gBACpC,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC;gBACpC,YAAY,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;aAClC;SACF,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,sFAAsF;QACtF,yDAAyD;QACzD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACzD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,IAAI,GAAG,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,QAAQ;YACjB,IAAI,EAAE,eAAe;YACrB,cAAc,EAAE,WAAW;YAC3B,IAAI;YACJ,SAAS,EAAE,CAAC,QAAQ,CAAC;SACtB,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,SAAS;YAClB,IAAI,EAAE,uBAAuB;YAC7B,cAAc,EAAE,cAAc;SAC/B,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;QACtD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,WAAW,GAAG,SAAS,CAAC;YAC5B,OAAO,EAAE,MAAM;YACf,IAAI,EAAE,+CAA+C;YACrD,cAAc,EAAE,gBAAgB;SACjC,CAAC,CAAC;QACH,MAAM,cAAc,GAAG,SAAS,CAAC;YAC/B,OAAO,EAAE,MAAM;YACf,IAAI,EAAE,oBAAoB;YAC1B,cAAc,EAAE,gBAAgB;SACjC,CAAC,CAAC;QAEH,MAAM,CAAC,UAAU,CAAC,GAAG,kBAAkB,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,aAAa,CAAC,GAAG,kBAAkB,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;QAE7D,yDAAyD;QACzD,MAAM,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrD,2CAA2C;QAC3C,MAAM,CAAC,aAAa,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,gCAAgC;YACtC,cAAc,EAAE,WAAW;YAC3B,SAAS,EAAE,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;SAClD,CAAC,CAAC;QAEH,MAAM,CAAC,MAAM,CAAC,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChF,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mDAAmD,EAAE,GAAG,EAAE;IACjE,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,OAAO,GAAG;YACd,SAAS,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,cAAc,EAAE,WAAW,EAAE,CAAC;YACpF,SAAS,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,cAAc,EAAE,WAAW,EAAE,CAAC;YAC9E,SAAS,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,oBAAoB,EAAE,cAAc,EAAE,cAAc,EAAE,CAAC;SAC7F,CAAC;QAEF,MAAM,OAAO,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,6CAA6C;YACnD,cAAc,EAAE,UAAU;SAC3B,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gEAAgE,EAAE,GAAG,EAAE;IAC9E,EAAE,CAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,wCAAwC;YAC9C,cAAc,EAAE,WAAW;YAC3B,SAAS,EAAE;gBACT,YAAY,CAAC;oBACX,IAAI,EAAE,aAAa;oBACnB,SAAS,EAAE,UAAU;oBACrB,mBAAmB,EAAE,cAAc;oBACnC,SAAS,EAAE,sBAAsB;oBACjC,YAAY,EAAE,SAAS;iBACxB,CAAC;aACH;SACF,CAAC,CAAC;QAEH,oEAAoE;QACpE,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

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

@@ -1,42 +0,0 @@
-/**
- * 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 type { CanonicalRule } from './portable-knowledge.js';
-import type { kernelCall as McpCallFn } from '../lib/client.js';
-/** Statistics from a generateChainRules() call. */
-export interface ChainRulesStats {
-    totalEntries: number;
-    classifiedEntries: number;
-    generatedRules: number;
-    suppressedByManual: number;
-    suppressedByZeroEntries: number;
-}
-/** Result returned by generateChainRules(). */
-export interface ChainRulesResult {
-    /** Generated rules ready to merge into canonical rules array. */
-    rules: CanonicalRule[];
-    /** Function keys with no matching governance entries. */
-    gaps: string[];
-    /** Sentinel rule when MCP is unreachable — null on success. */
-    sentinel: CanonicalRule | null;
-    stats: ChainRulesStats;
-    /** Classified governance entries — passed through for diff engine confidence data. */
-    classified: import('./chain-classifier.js').ClassifiedGovernance[];
-}
-/**
- * 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 declare function generateChainRules(kernelCallFn: typeof McpCallFn, manualRules: CanonicalRule[]): Promise<ChainRulesResult>;
-//# sourceMappingURL=chain-rules.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"chain-rules.d.ts","sourceRoot":"","sources":["../../src/generators/chain-rules.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAI7D,OAAO,KAAK,EAAE,UAAU,IAAI,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAIhE,mDAAmD;AACnD,MAAM,WAAW,eAAe;IAC9B,YAAY,EAAE,MAAM,CAAC;IACrB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,cAAc,EAAE,MAAM,CAAC;IACvB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,uBAAuB,EAAE,MAAM,CAAC;CACjC;AAED,+CAA+C;AAC/C,MAAM,WAAW,gBAAgB;IAC/B,iEAAiE;IACjE,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,yDAAyD;IACzD,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,+DAA+D;IAC/D,QAAQ,EAAE,aAAa,GAAG,IAAI,CAAC;IAC/B,KAAK,EAAE,eAAe,CAAC;IACvB,sFAAsF;IACtF,UAAU,EAAE,OAAO,uBAAuB,EAAE,oBAAoB,EAAE,CAAC;CACpE;AAkCD;;;;;;;;GAQG;AACH,wBAAsB,kBAAkB,CACtC,YAAY,EAAE,OAAO,SAAS,EAC9B,WAAW,EAAE,aAAa,EAAE,GAC3B,OAAO,CAAC,gBAAgB,CAAC,CAoF3B"}

package/dist/generators/chain-rules.js

@@ -1,144 +0,0 @@
-/**
- * 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 { classifyGovernance } from './chain-classifier.js';
-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;
-    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: [],
-        };
-    }
-    // Step 2: Classify entries
-    const classified = classifyGovernance(entries);
-    // 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

@@ -1 +0,0 @@
-{"version":3,"file":"chain-rules.js","sourceRoot":"","sources":["../../src/generators/chain-rules.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AA2BnD,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,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,YAAY,CAAqD,kCAAkC,EAAE,EAAE,CAAC,CAAC;QAC9H,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,2BAA2B;IAC3B,MAAM,UAAU,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;IAE/C,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,UAAiD;IAEjD,+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

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

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

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

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

@@ -1,179 +0,0 @@
-/**
- * chain-rules — unit tests.
- * BET-286 Slice 3: chain rules assembler.
- */
-import { describe, expect, it, vi } from 'vitest';
-import { generateChainRules } from './chain-rules.js';
-// ── Helpers ────────────────────────────────────────────────────────────
-function makeEntry(overrides) {
-    return {
-        status: 'active',
-        verificationStatus: 'verified',
-        data: null,
-        relations: [],
-        ...overrides,
-    };
-}
-function makeManualRule(name) {
-    return {
-        name,
-        description: 'Manual rule',
-        body: 'Manual rule body',
-        sourcePath: `.productbrain/rules/${name}.md`,
-        autoApply: true,
-        level: 'core',
-        scope: undefined,
-        targets: undefined,
-    };
-}
-/** Mock kernelCall that returns the given entries wrapped in the Convex response shape. */
-function mockMcpSuccess(entries) {
-    return vi.fn().mockResolvedValue({ entries, total: entries.length });
-}
-/** Mock kernelCall that throws. */
-function mockMcpFailure(error = new Error('Network error')) {
-    return vi.fn().mockRejectedValue(error);
-}
-// ── Tests ──────────────────────────────────────────────────────────────
-describe('generateChainRules', () => {
-    it('happy path: produces rules from classified entries', async () => {
-        const entries = [
-            makeEntry({ entryId: 'STD-1', name: 'No direct Convex imports', collectionSlug: 'standards' }),
-            makeEntry({ entryId: 'STD-2', name: 'Auth check on all routes', collectionSlug: 'business-rules' }),
-            makeEntry({ entryId: 'ARCH-1', name: 'Domain boundary rules', collectionSlug: 'architecture' }),
-        ];
-        const mcpFn = mockMcpSuccess(entries);
-        const result = await generateChainRules(mcpFn, []);
-        expect(mcpFn).toHaveBeenCalledWith('chain.getGovernanceWithRelations', {});
-        expect(result.sentinel).toBeNull();
-        expect(result.rules.length).toBeGreaterThan(0);
-        // All generated rules must have chain:// sourcePath
-        for (const rule of result.rules) {
-            expect(rule.sourcePath).toMatch(/^chain:\/\//);
-        }
-        expect(result.stats.totalEntries).toBe(3);
-        expect(result.stats.classifiedEntries).toBe(3);
-    });
-    it('MCP failure: returns sentinel rule and empty rules array', async () => {
-        const mcpFn = mockMcpFailure();
-        const result = await generateChainRules(mcpFn, []);
-        expect(result.rules).toHaveLength(0);
-        expect(result.sentinel).not.toBeNull();
-        expect(result.sentinel.name).toBe('_chain_degraded');
-        expect(result.sentinel.level).toBe('core');
-        expect(result.sentinel.sourcePath).toBe('chain://_sentinel');
-        expect(result.sentinel.autoApply).toBe(true);
-        expect(result.gaps).toHaveLength(0);
-        expect(result.stats.totalEntries).toBe(0);
-    });
-    it('manual suppression: existing manual rule suppresses generated rule', async () => {
-        // 'chain-constraints' is the archetype name for 'constraint' function
-        const entries = [
-            makeEntry({ entryId: 'STD-1', name: 'No direct imports', collectionSlug: 'standards' }),
-        ];
-        const mcpFn = mockMcpSuccess(entries);
-        const manualRules = [makeManualRule('chain-constraints')];
-        const result = await generateChainRules(mcpFn, manualRules);
-        // The constraint archetype should be suppressed since manual rule with same name exists
-        const constraintRule = result.rules.find((r) => r.sourcePath === 'chain://constraint');
-        expect(constraintRule).toBeUndefined();
-        expect(result.stats.suppressedByManual).toBeGreaterThan(0);
-    });
-    it('zero entries: function with no matching entries appears in gaps', async () => {
-        // Only provide boundary entries — all other functions should gap
-        const entries = [
-            makeEntry({ entryId: 'ARCH-1', name: 'Domain layers', collectionSlug: 'architecture' }),
-        ];
-        const mcpFn = mockMcpSuccess(entries);
-        const result = await generateChainRules(mcpFn, []);
-        // boundary gets a rule; others go to gaps
-        expect(result.gaps.length).toBeGreaterThan(0);
-        // 'workflow', 'convention', 'policy', 'quality-gate', 'constraint' should be in gaps
-        expect(result.gaps).toContain('workflow');
-        expect(result.gaps).toContain('constraint');
-        expect(result.stats.suppressedByZeroEntries).toBe(result.gaps.length);
-    });
-    it('caps at 8 rules: 9+ entries across functions → only top 8', async () => {
-        // Provide entries for all 6 functions — but we only have 6 functions so need
-        // to test with all 6 populated. The cap of 8 means all 6 pass through here.
-        // To test capping we need to produce more than 8. Since we only have 6
-        // governance functions, 6 is the max. So we verify the cap does not drop below 6.
-        // The cap only fires when a future function count exceeds 8.
-        // We still verify that when fewer than 8 rules exist, all are returned.
-        const entries = [
-            makeEntry({ entryId: 'STD-1', name: 'Import rule', collectionSlug: 'standards' }),
-            makeEntry({ entryId: 'ARCH-1', name: 'Domain layers', collectionSlug: 'architecture' }),
-            makeEntry({ entryId: 'DEC-1', name: 'Deploy convention', collectionSlug: 'decisions' }),
-            makeEntry({ entryId: 'POL-1', name: 'Auth policy', collectionSlug: 'policies' }),
-            makeEntry({ entryId: 'FLO-1', name: 'Capture flow', collectionSlug: 'flows' }),
-        ];
-        const mcpFn = mockMcpSuccess(entries);
-        const result = await generateChainRules(mcpFn, []);
-        // 5 entries across different functions → at most 5 rules, well under the cap of 8
-        expect(result.rules.length).toBeLessThanOrEqual(8);
-    });
-    it('cap at 8 rules enforced when more than 8 rules would be generated', async () => {
-        // We cannot generate more than 6 rules (only 6 functions), so we test the
-        // ranking/sorting logic and confirm the result is <= 8.
-        // Provide entries with dense relations to test ranking path.
-        const entries = [
-            makeEntry({
-                entryId: 'STD-1',
-                name: 'Import constraint',
-                collectionSlug: 'standards',
-                relations: [
-                    { type: 'constrains', direction: 'outgoing', otherEntryId: 'BET-1', otherName: 'BET-1', otherCollectionSlug: 'bets' },
-                    { type: 'constrains', direction: 'outgoing', otherEntryId: 'BET-2', otherName: 'BET-2', otherCollectionSlug: 'bets' },
-                ],
-            }),
-            makeEntry({
-                entryId: 'ARCH-1',
-                name: 'Layer boundaries',
-                collectionSlug: 'architecture',
-                relations: [
-                    { type: 'informed_by', direction: 'incoming', otherEntryId: 'DEC-1', otherName: 'DEC-1', otherCollectionSlug: 'architecture' },
-                ],
-            }),
-        ];
-        const mcpFn = mockMcpSuccess(entries);
-        const result = await generateChainRules(mcpFn, []);
-        expect(result.rules.length).toBeLessThanOrEqual(8);
-        // Rules are sorted — verify stable output
-        for (const rule of result.rules) {
-            expect(rule.sourcePath).toMatch(/^chain:\/\//);
-        }
-    });
-    it('empty workspace: no governance entries → empty rules, all functions in gaps', async () => {
-        const mcpFn = mockMcpSuccess([]);
-        const result = await generateChainRules(mcpFn, []);
-        expect(result.rules).toHaveLength(0);
-        expect(result.sentinel).toBeNull();
-        expect(result.gaps).toHaveLength(6); // all 6 functions gap
-        expect(result.gaps).toContain('constraint');
-        expect(result.gaps).toContain('boundary');
-        expect(result.gaps).toContain('convention');
-        expect(result.gaps).toContain('policy');
-        expect(result.gaps).toContain('workflow');
-        expect(result.gaps).toContain('quality-gate');
-        expect(result.stats.totalEntries).toBe(0);
-        expect(result.stats.classifiedEntries).toBe(0);
-        expect(result.stats.generatedRules).toBe(0);
-        expect(result.stats.suppressedByZeroEntries).toBe(6);
-    });
-    it('stats are accurate: counts match actual outcomes', async () => {
-        const entries = [
-            makeEntry({ entryId: 'STD-1', name: 'Import rule', collectionSlug: 'standards' }),
-            makeEntry({ entryId: 'STD-2', name: 'Null check rule', collectionSlug: 'standards' }),
-        ];
-        const mcpFn = mockMcpSuccess(entries);
-        const result = await generateChainRules(mcpFn, []);
-        expect(result.stats.totalEntries).toBe(2);
-        expect(result.stats.classifiedEntries).toBe(2);
-        // generatedRules + suppressedByManual + suppressedByZeroEntries = 6 (total governance functions)
-        const total = result.stats.generatedRules + result.stats.suppressedByManual + result.stats.suppressedByZeroEntries;
-        expect(total).toBe(6);
-        // gaps length equals suppressedByZeroEntries
-        expect(result.gaps.length).toBe(result.stats.suppressedByZeroEntries);
-    });
-});
-//# sourceMappingURL=chain-rules.test.js.map