@substrate-ai/factory 0.19.54

package/dist/graph/__tests__/edge-selector.test.js

@@ -0,0 +1,452 @@
+/**
+ * Unit tests for edge-selector.ts (story 42-12).
+ * Covers all 7 acceptance criteria.
+ */
+import { describe, it, expect, vi } from 'vitest';
+import { selectEdge, normalizeLabel, bestByWeightThenLexical } from '../edge-selector.js';
+import { GraphContext } from '../context.js';
+// ---------------------------------------------------------------------------
+// Helpers
+// ---------------------------------------------------------------------------
+function makeNode(id) {
+    return {
+        id,
+        label: '',
+        shape: '',
+        type: '',
+        prompt: '',
+        maxRetries: 0,
+        goalGate: false,
+        retryTarget: '',
+        fallbackRetryTarget: '',
+        fidelity: '',
+        threadId: '',
+        class: '',
+        timeout: 0,
+        llmModel: '',
+        llmProvider: '',
+        reasoningEffort: '',
+        autoStatus: false,
+        allowPartial: false,
+        toolCommand: '',
+        backend: '',
+    };
+}
+function makeEdge(fromNode, toNode, overrides) {
+    return {
+        fromNode,
+        toNode,
+        label: '',
+        condition: '',
+        weight: 0,
+        fidelity: '',
+        threadId: '',
+        loopRestart: false,
+        ...overrides,
+    };
+}
+function makeGraph(edges) {
+    return {
+        id: '',
+        goal: '',
+        label: '',
+        modelStylesheet: '',
+        defaultMaxRetries: 0,
+        retryTarget: '',
+        fallbackRetryTarget: '',
+        defaultFidelity: '',
+        nodes: new Map(),
+        edges,
+        outgoingEdges: (nodeId) => edges.filter((e) => e.fromNode === nodeId),
+        startNode: () => {
+            throw new Error('not implemented');
+        },
+        exitNode: () => {
+            throw new Error('not implemented');
+        },
+    };
+}
+const emptyOutcome = { status: 'SUCCESS' };
+// ---------------------------------------------------------------------------
+// AC6: normalizeLabel
+// ---------------------------------------------------------------------------
+describe('normalizeLabel (AC6)', () => {
+    it('strips bracket accelerator prefix [Y] Yes → "yes"', () => {
+        expect(normalizeLabel('[Y] Yes')).toBe('yes');
+    });
+    it('strips bracket accelerator prefix [y] yes (already lowercase)', () => {
+        expect(normalizeLabel('[y] yes')).toBe('yes');
+    });
+    it('strips paren accelerator prefix y) No → "no"', () => {
+        expect(normalizeLabel('y) No')).toBe('no');
+    });
+    it('strips dash accelerator prefix y - Maybe → "maybe"', () => {
+        expect(normalizeLabel('y - Maybe')).toBe('maybe');
+    });
+    it('handles no accelerator prefix — lowercases and trims', () => {
+        expect(normalizeLabel('Continue')).toBe('continue');
+    });
+    it('handles empty string → empty string', () => {
+        expect(normalizeLabel('')).toBe('');
+    });
+    it('trims surrounding whitespace', () => {
+        expect(normalizeLabel('  Continue  ')).toBe('continue');
+    });
+    it('strips dash accelerator without spaces (y-maybe)', () => {
+        expect(normalizeLabel('y-Maybe')).toBe('maybe');
+    });
+});
+// ---------------------------------------------------------------------------
+// bestByWeightThenLexical helper
+// ---------------------------------------------------------------------------
+describe('bestByWeightThenLexical', () => {
+    it('returns the single edge when given one', () => {
+        const edge = makeEdge('a', 'b', { weight: 5 });
+        expect(bestByWeightThenLexical([edge])).toBe(edge);
+    });
+    it('returns higher-weight edge', () => {
+        const low = makeEdge('a', 'b', { weight: 2 });
+        const high = makeEdge('a', 'c', { weight: 5 });
+        expect(bestByWeightThenLexical([low, high])).toBe(high);
+    });
+    it('breaks ties by lexically-first target node ID', () => {
+        const toZ = makeEdge('a', 'node_z', { weight: 3 });
+        const toA = makeEdge('a', 'node_a', { weight: 3 });
+        expect(bestByWeightThenLexical([toZ, toA])).toBe(toA);
+    });
+    it('does not mutate the input array', () => {
+        const edges = [makeEdge('a', 'c', { weight: 1 }), makeEdge('a', 'b', { weight: 5 })];
+        const original = [...edges];
+        bestByWeightThenLexical(edges);
+        expect(edges).toEqual(original);
+    });
+    it('treats missing weight as 0', () => {
+        const noWeight = makeEdge('a', 'x');
+        const weighted = makeEdge('a', 'y', { weight: 1 });
+        expect(bestByWeightThenLexical([noWeight, weighted])).toBe(weighted);
+    });
+});
+// ---------------------------------------------------------------------------
+// AC5: No outgoing edges → null
+// ---------------------------------------------------------------------------
+describe('selectEdge AC5 — no outgoing edges', () => {
+    it('returns null when node has no outgoing edges', async () => {
+        const node = makeNode('a');
+        const graph = makeGraph([makeEdge('other', 'a')]); // edge FROM another node
+        const ctx = new GraphContext();
+        expect(await selectEdge(node, emptyOutcome, ctx, graph)).toBeNull();
+    });
+    it('returns null when edge list is empty', async () => {
+        const node = makeNode('a');
+        const graph = makeGraph([]);
+        const ctx = new GraphContext();
+        expect(await selectEdge(node, emptyOutcome, ctx, graph)).toBeNull();
+    });
+});
+// ---------------------------------------------------------------------------
+// AC1: Step 1 — Condition-matched edges
+// ---------------------------------------------------------------------------
+describe('selectEdge AC1 — condition-matched edges', () => {
+    it('returns a condition-matched edge (ignoring unconditional)', async () => {
+        const node = makeNode('start');
+        const conditional = makeEdge('start', 'conditional_target', {
+            condition: 'status=success',
+            weight: 0,
+        });
+        const unconditional = makeEdge('start', 'unconditional_target', {
+            condition: '',
+            weight: 10, // higher weight but should be ignored
+        });
+        const graph = makeGraph([conditional, unconditional]);
+        const ctx = new GraphContext({ status: 'success' });
+        const result = await selectEdge(node, emptyOutcome, ctx, graph);
+        expect(result).toBe(conditional);
+    });
+    it('returns the higher-weight match when two conditions both match', async () => {
+        const node = makeNode('start');
+        const low = makeEdge('start', 'b', { condition: 'status=success', weight: 1 });
+        const high = makeEdge('start', 'c', { condition: 'status=success', weight: 5 });
+        const graph = makeGraph([low, high]);
+        const ctx = new GraphContext({ status: 'success' });
+        expect(await selectEdge(node, emptyOutcome, ctx, graph)).toBe(high);
+    });
+    it('uses lexically-first target as tiebreak on equal weights', async () => {
+        const node = makeNode('start');
+        const toZ = makeEdge('start', 'node_z', { condition: 'x=y', weight: 3 });
+        const toA = makeEdge('start', 'node_a', { condition: 'x=y', weight: 3 });
+        const graph = makeGraph([toZ, toA]);
+        const ctx = new GraphContext({ x: 'y' });
+        expect(await selectEdge(node, emptyOutcome, ctx, graph)).toBe(toA);
+    });
+    it('ignores condition-bearing edge when condition does not match', async () => {
+        const node = makeNode('start');
+        const nonMatching = makeEdge('start', 'b', { condition: 'status=failure', weight: 10 });
+        const unconditional = makeEdge('start', 'c', { condition: '', weight: 0 });
+        const graph = makeGraph([nonMatching, unconditional]);
+        const ctx = new GraphContext({ status: 'success' });
+        // Falls through to Step 4
+        const result = await selectEdge(node, emptyOutcome, ctx, graph);
+        expect(result).toBe(unconditional);
+    });
+    it('treats invalid condition syntax as non-matching (no throw)', async () => {
+        const node = makeNode('start');
+        const badCondition = makeEdge('start', 'b', { condition: 'invalid==syntax', weight: 10 });
+        const fallback = makeEdge('start', 'c', { condition: '', weight: 0 });
+        const graph = makeGraph([badCondition, fallback]);
+        const ctx = new GraphContext();
+        // Should not throw; falls through to Step 4
+        const result = await selectEdge(node, emptyOutcome, ctx, graph);
+        expect(result).toBe(fallback);
+    });
+});
+// ---------------------------------------------------------------------------
+// AC7: Condition match supersedes preferredLabel and suggestedNextIds
+// ---------------------------------------------------------------------------
+describe('selectEdge AC7 — condition supersedes preferredLabel and suggestedNextIds', () => {
+    it('returns conditional edge even when preferredLabel and suggestedNextIds point elsewhere', async () => {
+        const node = makeNode('start');
+        const conditional = makeEdge('start', 'cond_target', {
+            condition: 'go=yes',
+            label: 'Conditional Path',
+            weight: 0,
+        });
+        const preferredTarget = makeEdge('start', 'preferred_target', {
+            condition: '',
+            label: 'preferred',
+            weight: 5,
+        });
+        const suggestedTarget = makeEdge('start', 'suggested_target', {
+            condition: '',
+            label: 'suggested',
+            weight: 0,
+        });
+        const graph = makeGraph([conditional, preferredTarget, suggestedTarget]);
+        const ctx = new GraphContext({ go: 'yes' });
+        const outcome = {
+            status: 'SUCCESS',
+            preferredLabel: 'preferred',
+            suggestedNextIds: ['suggested_target'],
+        };
+        expect(await selectEdge(node, outcome, ctx, graph)).toBe(conditional);
+    });
+});
+// ---------------------------------------------------------------------------
+// AC2: Step 2 — Preferred label match
+// ---------------------------------------------------------------------------
+describe('selectEdge AC2 — preferred label match', () => {
+    it('matches unconditional edge by preferred label (exact after normalization)', async () => {
+        const node = makeNode('start');
+        const edgeYes = makeEdge('start', 'yes_node', { label: 'Yes', condition: '' });
+        const edgeNo = makeEdge('start', 'no_node', { label: 'No', condition: '' });
+        const graph = makeGraph([edgeYes, edgeNo]);
+        const ctx = new GraphContext();
+        const outcome = { status: 'SUCCESS', preferredLabel: 'Yes' };
+        expect(await selectEdge(node, outcome, ctx, graph)).toBe(edgeYes);
+    });
+    it('matches with accelerator-prefix normalization', async () => {
+        const node = makeNode('start');
+        const edgeYes = makeEdge('start', 'yes_node', { label: '[Y] Yes', condition: '' });
+        const graph = makeGraph([edgeYes]);
+        const ctx = new GraphContext();
+        const outcome = { status: 'SUCCESS', preferredLabel: 'Yes' };
+        expect(await selectEdge(node, outcome, ctx, graph)).toBe(edgeYes);
+    });
+    it('falls through to Step 3/4 when preferred label does not match any edge', async () => {
+        const node = makeNode('start');
+        const edgeA = makeEdge('start', 'node_a', { label: 'Alpha', condition: '', weight: 5 });
+        const edgeB = makeEdge('start', 'node_b', { label: 'Beta', condition: '', weight: 1 });
+        const graph = makeGraph([edgeA, edgeB]);
+        const ctx = new GraphContext();
+        const outcome = { status: 'SUCCESS', preferredLabel: 'Gamma' }; // no match
+        // Falls to Step 4: highest weight is node_a
+        expect(await selectEdge(node, outcome, ctx, graph)).toBe(edgeA);
+    });
+    it('does not match conditional edge via preferred label', async () => {
+        const node = makeNode('start');
+        const conditional = makeEdge('start', 'cond_node', {
+            label: 'yes',
+            condition: 'x=y', // conditional — will not match because condition fails
+        });
+        const unconditional = makeEdge('start', 'uncond_node', {
+            label: 'yes',
+            condition: '',
+        });
+        const graph = makeGraph([conditional, unconditional]);
+        const ctx = new GraphContext({ x: 'z' }); // condition does NOT match
+        const outcome = { status: 'SUCCESS', preferredLabel: 'yes' };
+        // Step 1: conditional edge's condition fails → no match
+        // Step 2: unconditional edge label matches preferredLabel → returns it
+        expect(await selectEdge(node, outcome, ctx, graph)).toBe(unconditional);
+    });
+});
+// ---------------------------------------------------------------------------
+// AC3: Step 3 — Suggested next IDs
+// ---------------------------------------------------------------------------
+describe('selectEdge AC3 — suggested next IDs', () => {
+    it('returns edge to first matching suggested ID', async () => {
+        const node = makeNode('start');
+        const edgeB = makeEdge('start', 'b', { condition: '', label: 'B' });
+        const edgeC = makeEdge('start', 'c', { condition: '', label: 'C' });
+        const graph = makeGraph([edgeC, edgeB]); // C listed first in edges, but order of suggestedNextIds wins
+        const ctx = new GraphContext();
+        const outcome = { status: 'SUCCESS', suggestedNextIds: ['b', 'c'] };
+        // b is first in suggestedNextIds → should return edge to b
+        expect(await selectEdge(node, outcome, ctx, graph)).toBe(edgeB);
+    });
+    it('skips first suggested ID if not in edges, returns second match', async () => {
+        const node = makeNode('start');
+        const edgeC = makeEdge('start', 'c', { condition: '', label: 'C' });
+        const graph = makeGraph([edgeC]);
+        const ctx = new GraphContext();
+        const outcome = { status: 'SUCCESS', suggestedNextIds: ['missing', 'c'] };
+        expect(await selectEdge(node, outcome, ctx, graph)).toBe(edgeC);
+    });
+    it('falls through to Step 4 when no suggested ID matches any edge', async () => {
+        const node = makeNode('start');
+        const edgeA = makeEdge('start', 'a', { condition: '', weight: 3 });
+        const edgeB = makeEdge('start', 'b', { condition: '', weight: 1 });
+        const graph = makeGraph([edgeA, edgeB]);
+        const ctx = new GraphContext();
+        const outcome = { status: 'SUCCESS', suggestedNextIds: ['nonexistent'] };
+        // Falls to Step 4: highest weight is 'a'
+        expect(await selectEdge(node, outcome, ctx, graph)).toBe(edgeA);
+    });
+    it('does not match conditional edge via suggestedNextIds', async () => {
+        const node = makeNode('start');
+        const conditional = makeEdge('start', 'x', { condition: 'a=b', weight: 0 });
+        const unconditional = makeEdge('start', 'y', { condition: '', weight: 0 });
+        const graph = makeGraph([conditional, unconditional]);
+        const ctx = new GraphContext({ a: 'z' }); // condition fails
+        const outcome = { status: 'SUCCESS', suggestedNextIds: ['x'] };
+        // Step 1: conditional edge condition fails → no match
+        // Step 3: 'x' is in suggestedNextIds BUT edge to 'x' has a condition → skip
+        // Step 4: unconditional edge to 'y'
+        expect(await selectEdge(node, outcome, ctx, graph)).toBe(unconditional);
+    });
+});
+// ---------------------------------------------------------------------------
+// AC4: Steps 4 & 5 — Highest weight with lexical tiebreak
+// ---------------------------------------------------------------------------
+describe('selectEdge AC4 — highest weight with lexical tiebreak', () => {
+    it('returns the edge with the highest weight', async () => {
+        const node = makeNode('start');
+        const low = makeEdge('start', 'x', { condition: '', weight: 2 });
+        const high = makeEdge('start', 'y', { condition: '', weight: 5 });
+        const graph = makeGraph([low, high]);
+        const ctx = new GraphContext();
+        expect(await selectEdge(node, emptyOutcome, ctx, graph)).toBe(high);
+    });
+    it('returns lexically-first target when weights are equal', async () => {
+        const node = makeNode('start');
+        const toB = makeEdge('start', 'node_b', { condition: '', weight: 3 });
+        const toA = makeEdge('start', 'node_a', { condition: '', weight: 3 });
+        const graph = makeGraph([toB, toA]);
+        const ctx = new GraphContext();
+        expect(await selectEdge(node, emptyOutcome, ctx, graph)).toBe(toA);
+    });
+    it('returns null when all outgoing edges are conditional and none match', async () => {
+        const node = makeNode('start');
+        const cond = makeEdge('start', 'x', { condition: 'a=b', weight: 5 });
+        const graph = makeGraph([cond]);
+        const ctx = new GraphContext({ a: 'z' }); // condition fails
+        // Step 1: no match, Step 2: no preferredLabel, Step 3: no suggestedNextIds
+        // Steps 4&5: no unconditional edges → null
+        expect(await selectEdge(node, emptyOutcome, ctx, graph)).toBeNull();
+    });
+    it('treats default weight (0) correctly in comparison', async () => {
+        const node = makeNode('start');
+        const defaultW = makeEdge('start', 'a', { condition: '' }); // weight: 0
+        const posW = makeEdge('start', 'b', { condition: '', weight: 1 });
+        const graph = makeGraph([defaultW, posW]);
+        const ctx = new GraphContext();
+        expect(await selectEdge(node, emptyOutcome, ctx, graph)).toBe(posW);
+    });
+});
+// ---------------------------------------------------------------------------
+// LLM condition tests (story 50-4)
+// ---------------------------------------------------------------------------
+describe('selectEdge — LLM conditions', () => {
+    it('selects LLM-conditioned edge when llmCall returns "yes"', async () => {
+        const node = makeNode('start');
+        const llmEdge = makeEdge('start', 'llm_target', {
+            condition: 'llm:Is this ready?',
+            weight: 0,
+        });
+        const unconditional = makeEdge('start', 'fallback', { condition: '', weight: 0 });
+        const graph = makeGraph([llmEdge, unconditional]);
+        const ctx = new GraphContext();
+        const mockLlmCall = vi.fn(async (_prompt) => 'yes');
+        const result = await selectEdge(node, emptyOutcome, ctx, graph, { llmCall: mockLlmCall });
+        expect(result).toBe(llmEdge);
+        expect(mockLlmCall).toHaveBeenCalledOnce();
+    });
+    it('does not select LLM-conditioned edge when llmCall returns "no"; falls through to unconditional', async () => {
+        const node = makeNode('start');
+        const llmEdge = makeEdge('start', 'llm_target', {
+            condition: 'llm:Is this ready?',
+            weight: 0,
+        });
+        const unconditional = makeEdge('start', 'fallback', { condition: '', weight: 0 });
+        const graph = makeGraph([llmEdge, unconditional]);
+        const ctx = new GraphContext();
+        const mockLlmCall = vi.fn(async (_prompt) => 'no');
+        const result = await selectEdge(node, emptyOutcome, ctx, graph, { llmCall: mockLlmCall });
+        expect(result).toBe(unconditional);
+    });
+    it('treats llmCall error as non-match; falls through to unconditional; populates llm.edge_eval_errors', async () => {
+        const node = makeNode('start');
+        const llmEdge = makeEdge('start', 'llm_target', {
+            condition: 'llm:Is this ready?',
+            weight: 0,
+        });
+        const unconditional = makeEdge('start', 'fallback', { condition: '', weight: 0 });
+        const graph = makeGraph([llmEdge, unconditional]);
+        const ctx = new GraphContext();
+        const mockLlmCall = vi.fn(async (_prompt) => {
+            throw new Error('LLM network failure');
+        });
+        const result = await selectEdge(node, emptyOutcome, ctx, graph, { llmCall: mockLlmCall });
+        expect(result).toBe(unconditional);
+        const errors = ctx.get('llm.edge_eval_errors');
+        expect(Array.isArray(errors)).toBe(true);
+        expect(errors.length).toBe(1);
+    });
+    it('selects regular condition edge when both regular and llm: conditions are present; llm: returns no', async () => {
+        const node = makeNode('start');
+        // Regular condition listed first — matches (outcome=success is in context)
+        const regularEdge = makeEdge('start', 'regular_target', {
+            condition: 'outcome=success',
+            weight: 5,
+        });
+        // LLM condition listed second — returns "no" so does not match
+        const llmEdge = makeEdge('start', 'llm_target', {
+            condition: 'llm:Is this ready?',
+            weight: 10, // higher weight, but won't match
+        });
+        const graph = makeGraph([regularEdge, llmEdge]);
+        const ctx = new GraphContext({ outcome: 'success' });
+        // LLM returns "no" → only regular condition matches → regular edge selected
+        const mockLlmCall = vi.fn(async (_prompt) => 'no');
+        const result = await selectEdge(node, emptyOutcome, ctx, graph, { llmCall: mockLlmCall });
+        expect(result).toBe(regularEdge);
+    });
+    it('increments llm.edge_eval_count by 1 for each LLM evaluation (AC6)', async () => {
+        const node = makeNode('start');
+        const llmEdge1 = makeEdge('start', 'target1', {
+            condition: 'llm:Is step 1 ready?',
+            weight: 0,
+        });
+        const llmEdge2 = makeEdge('start', 'target2', {
+            condition: 'llm:Is step 2 ready?',
+            weight: 0,
+        });
+        const graph = makeGraph([llmEdge1, llmEdge2]);
+        const ctx = new GraphContext();
+        // Both return "no" so neither matches — both are evaluated, counting to 2
+        const mockLlmCall = vi.fn(async (_prompt) => 'no');
+        await selectEdge(node, emptyOutcome, ctx, graph, { llmCall: mockLlmCall });
+        expect(ctx.get('llm.edge_eval_count')).toBe(2);
+        expect(mockLlmCall).toHaveBeenCalledTimes(2);
+    });
+});
+//# sourceMappingURL=edge-selector.test.js.map

package/dist/graph/__tests__/edge-selector.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-selector.test.js","sourceRoot":"","sources":["../../../src/graph/__tests__/edge-selector.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAA;AACjD,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,uBAAuB,EAAE,MAAM,qBAAqB,CAAA;AACzF,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAA;AAG5C,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E,SAAS,QAAQ,CAAC,EAAU;IAC1B,OAAO;QACL,EAAE;QACF,KAAK,EAAE,EAAE;QACT,KAAK,EAAE,EAAE;QACT,IAAI,EAAE,EAAE;QACR,MAAM,EAAE,EAAE;QACV,UAAU,EAAE,CAAC;QACb,QAAQ,EAAE,KAAK;QACf,WAAW,EAAE,EAAE;QACf,mBAAmB,EAAE,EAAE;QACvB,QAAQ,EAAE,EAAE;QACZ,QAAQ,EAAE,EAAE;QACZ,KAAK,EAAE,EAAE;QACT,OAAO,EAAE,CAAC;QACV,QAAQ,EAAE,EAAE;QACZ,WAAW,EAAE,EAAE;QACf,eAAe,EAAE,EAAE;QACnB,UAAU,EAAE,KAAK;QACjB,YAAY,EAAE,KAAK;QACnB,WAAW,EAAE,EAAE;QACf,OAAO,EAAE,EAAE;KACZ,CAAA;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,QAAgB,EAAE,MAAc,EAAE,SAA8B;IAChF,OAAO;QACL,QAAQ;QACR,MAAM;QACN,KAAK,EAAE,EAAE;QACT,SAAS,EAAE,EAAE;QACb,MAAM,EAAE,CAAC;QACT,QAAQ,EAAE,EAAE;QACZ,QAAQ,EAAE,EAAE;QACZ,WAAW,EAAE,KAAK;QAClB,GAAG,SAAS;KACb,CAAA;AACH,CAAC;AAED,SAAS,SAAS,CAAC,KAAkB;IACnC,OAAO;QACL,EAAE,EAAE,EAAE;QACN,IAAI,EAAE,EAAE;QACR,KAAK,EAAE,EAAE;QACT,eAAe,EAAE,EAAE;QACnB,iBAAiB,EAAE,CAAC;QACpB,WAAW,EAAE,EAAE;QACf,mBAAmB,EAAE,EAAE;QACvB,eAAe,EAAE,EAAE;QACnB,KAAK,EAAE,IAAI,GAAG,EAAE;QAChB,KAAK;QACL,aAAa,EAAE,CAAC,MAAc,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC;QAC7E,SAAS,EAAE,GAAG,EAAE;YACd,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAA;QACpC,CAAC;QACD,QAAQ,EAAE,GAAG,EAAE;YACb,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAA;QACpC,CAAC;KACF,CAAA;AACH,CAAC;AAED,MAAM,YAAY,GAAY,EAAE,MAAM,EAAE,SAAS,EAAE,CAAA;AAEnD,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAC/C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAC/C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC5C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACnD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;IACrD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACrC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,cAAc,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;IACzD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACjD,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,iCAAiC;AACjC,8EAA8E;AAE9E,QAAQ,CAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAC9C,MAAM,CAAC,uBAAuB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACpD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAC7C,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAC9C,MAAM,CAAC,uBAAuB,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACzD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAClD,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAClD,MAAM,CAAC,uBAAuB,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACvD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QACpF,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,CAAA;QAC3B,uBAAuB,CAAC,KAAK,CAAC,CAAA;QAC9B,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;IACjC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;QACnC,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAClD,MAAM,CAAC,uBAAuB,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;IACtE,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,gCAAgC;AAChC,8EAA8E;AAE9E,QAAQ,CAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,EAAE,CAAC,8CAA8C,EAAE,KAAK,IAAI,EAAE;QAC5D,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAA;QAC1B,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAA,CAAC,yBAAyB;QAC3E,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAC9B,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;IACrE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,sCAAsC,EAAE,KAAK,IAAI,EAAE;QACpD,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAA;QAC1B,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAA;QAC3B,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAC9B,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;IACrE,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,wCAAwC;AACxC,8EAA8E;AAE9E,QAAQ,CAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,EAAE,CAAC,2DAA2D,EAAE,KAAK,IAAI,EAAE;QACzE,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,WAAW,GAAG,QAAQ,CAAC,OAAO,EAAE,oBAAoB,EAAE;YAC1D,SAAS,EAAE,gBAAgB;YAC3B,MAAM,EAAE,CAAC;SACV,CAAC,CAAA;QACF,MAAM,aAAa,GAAG,QAAQ,CAAC,OAAO,EAAE,sBAAsB,EAAE;YAC9D,SAAS,EAAE,EAAE;YACb,MAAM,EAAE,EAAE,EAAE,sCAAsC;SACnD,CAAC,CAAA;QACF,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC,CAAA;QACrD,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAA;QAEnD,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;QAC/D,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;IAClC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,gEAAgE,EAAE,KAAK,IAAI,EAAE;QAC9E,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,gBAAgB,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAC9E,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,gBAAgB,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAC/E,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAA;QACpC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAA;QAEnD,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACrE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,0DAA0D,EAAE,KAAK,IAAI,EAAE;QACxE,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACxE,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACxE,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAA;QACnC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAA;QAExC,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACpE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,8DAA8D,EAAE,KAAK,IAAI,EAAE;QAC5E,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,WAAW,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,gBAAgB,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAA;QACvF,MAAM,aAAa,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAC1E,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC,CAAA;QACrD,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAA;QAEnD,0BAA0B;QAC1B,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;QAC/D,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAA;IACpC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,4DAA4D,EAAE,KAAK,IAAI,EAAE;QAC1E,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAA;QACzF,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACrE,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAA;QACjD,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAE9B,4CAA4C;QAC5C,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;QAC/D,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,sEAAsE;AACtE,8EAA8E;AAE9E,QAAQ,CAAC,2EAA2E,EAAE,GAAG,EAAE;IACzF,EAAE,CAAC,wFAAwF,EAAE,KAAK,IAAI,EAAE;QACtG,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,WAAW,GAAG,QAAQ,CAAC,OAAO,EAAE,aAAa,EAAE;YACnD,SAAS,EAAE,QAAQ;YACnB,KAAK,EAAE,kBAAkB;YACzB,MAAM,EAAE,CAAC;SACV,CAAC,CAAA;QACF,MAAM,eAAe,GAAG,QAAQ,CAAC,OAAO,EAAE,kBAAkB,EAAE;YAC5D,SAAS,EAAE,EAAE;YACb,KAAK,EAAE,WAAW;YAClB,MAAM,EAAE,CAAC;SACV,CAAC,CAAA;QACF,MAAM,eAAe,GAAG,QAAQ,CAAC,OAAO,EAAE,kBAAkB,EAAE;YAC5D,SAAS,EAAE,EAAE;YACb,KAAK,EAAE,WAAW;YAClB,MAAM,EAAE,CAAC;SACV,CAAC,CAAA;QACF,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,WAAW,EAAE,eAAe,EAAE,eAAe,CAAC,CAAC,CAAA;QACxE,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAA;QAC3C,MAAM,OAAO,GAAY;YACvB,MAAM,EAAE,SAAS;YACjB,cAAc,EAAE,WAAW;YAC3B,gBAAgB,EAAE,CAAC,kBAAkB,CAAC;SACvC,CAAA;QAED,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;IACvE,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,sCAAsC;AACtC,8EAA8E;AAE9E,QAAQ,CAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,EAAE,CAAC,2EAA2E,EAAE,KAAK,IAAI,EAAE;QACzF,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,EAAE,UAAU,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAA;QAC9E,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAA;QAC3E,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAA;QAC1C,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAC9B,MAAM,OAAO,GAAY,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,EAAE,KAAK,EAAE,CAAA;QAErE,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACnE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,+CAA+C,EAAE,KAAK,IAAI,EAAE;QAC7D,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,EAAE,UAAU,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAA;QAClF,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,CAAA;QAClC,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAC9B,MAAM,OAAO,GAAY,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,EAAE,KAAK,EAAE,CAAA;QAErE,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACnE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;QACtF,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACvF,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACtF,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAA;QACvC,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAC9B,MAAM,OAAO,GAAY,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,EAAE,OAAO,EAAE,CAAA,CAAC,WAAW;QAEnF,4CAA4C;QAC5C,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACjE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACnE,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,WAAW,GAAG,QAAQ,CAAC,OAAO,EAAE,WAAW,EAAE;YACjD,KAAK,EAAE,KAAK;YACZ,SAAS,EAAE,KAAK,EAAE,uDAAuD;SAC1E,CAAC,CAAA;QACF,MAAM,aAAa,GAAG,QAAQ,CAAC,OAAO,EAAE,aAAa,EAAE;YACrD,KAAK,EAAE,KAAK;YACZ,SAAS,EAAE,EAAE;SACd,CAAC,CAAA;QACF,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC,CAAA;QACrD,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAA,CAAC,2BAA2B;QACpE,MAAM,OAAO,GAAY,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,EAAE,KAAK,EAAE,CAAA;QAErE,wDAAwD;QACxD,uEAAuE;QACvE,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAA;IACzE,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,mCAAmC;AACnC,8EAA8E;AAE9E,QAAQ,CAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,EAAE,CAAC,6CAA6C,EAAE,KAAK,IAAI,EAAE;QAC3D,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAA;QACnE,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAA;QACnE,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAA,CAAC,8DAA8D;QACtG,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAC9B,MAAM,OAAO,GAAY,EAAE,MAAM,EAAE,SAAS,EAAE,gBAAgB,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAA;QAE5E,2DAA2D;QAC3D,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACjE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,gEAAgE,EAAE,KAAK,IAAI,EAAE;QAC9E,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAA;QACnE,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;QAChC,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAC9B,MAAM,OAAO,GAAY,EAAE,MAAM,EAAE,SAAS,EAAE,gBAAgB,EAAE,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAA;QAElF,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACjE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,+DAA+D,EAAE,KAAK,IAAI,EAAE;QAC7E,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAClE,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAClE,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAA;QACvC,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAC9B,MAAM,OAAO,GAAY,EAAE,MAAM,EAAE,SAAS,EAAE,gBAAgB,EAAE,CAAC,aAAa,CAAC,EAAE,CAAA;QAEjF,yCAAyC;QACzC,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACjE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,sDAAsD,EAAE,KAAK,IAAI,EAAE;QACpE,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,WAAW,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAC3E,MAAM,aAAa,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAC1E,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC,CAAA;QACrD,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAA,CAAC,kBAAkB;QAC3D,MAAM,OAAO,GAAY,EAAE,MAAM,EAAE,SAAS,EAAE,gBAAgB,EAAE,CAAC,GAAG,CAAC,EAAE,CAAA;QAEvE,sDAAsD;QACtD,4EAA4E;QAC5E,oCAAoC;QACpC,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAA;IACzE,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,0DAA0D;AAC1D,8EAA8E;AAE9E,QAAQ,CAAC,uDAAuD,EAAE,GAAG,EAAE;IACrE,EAAE,CAAC,0CAA0C,EAAE,KAAK,IAAI,EAAE;QACxD,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAChE,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACjE,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAA;QACpC,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAE9B,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACrE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,uDAAuD,EAAE,KAAK,IAAI,EAAE;QACrE,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACrE,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACrE,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAA;QACnC,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAE9B,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACpE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,qEAAqE,EAAE,KAAK,IAAI,EAAE;QACnF,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACpE,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;QAC/B,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAA,CAAC,kBAAkB;QAE3D,2EAA2E;QAC3E,2CAA2C;QAC3C,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;IACrE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mDAAmD,EAAE,KAAK,IAAI,EAAE;QACjE,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAA,CAAC,YAAY;QACvE,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACjE,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAA;QACzC,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAE9B,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACrE,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,mCAAmC;AACnC,8EAA8E;AAE9E,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,EAAE,CAAC,yDAAyD,EAAE,KAAK,IAAI,EAAE;QACvE,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,EAAE,YAAY,EAAE;YAC9C,SAAS,EAAE,oBAAoB;YAC/B,MAAM,EAAE,CAAC;SACV,CAAC,CAAA;QACF,MAAM,aAAa,GAAG,QAAQ,CAAC,OAAO,EAAE,UAAU,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACjF,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAA;QACjD,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAC9B,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,OAAe,EAAE,EAAE,CAAC,KAAK,CAAC,CAAA;QAE3D,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAA;QACzF,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAC5B,MAAM,CAAC,WAAW,CAAC,CAAC,oBAAoB,EAAE,CAAA;IAC5C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,gGAAgG,EAAE,KAAK,IAAI,EAAE;QAC9G,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,EAAE,YAAY,EAAE;YAC9C,SAAS,EAAE,oBAAoB;YAC/B,MAAM,EAAE,CAAC;SACV,CAAC,CAAA;QACF,MAAM,aAAa,GAAG,QAAQ,CAAC,OAAO,EAAE,UAAU,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACjF,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAA;QACjD,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAC9B,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,OAAe,EAAE,EAAE,CAAC,IAAI,CAAC,CAAA;QAE1D,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAA;QACzF,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAA;IACpC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mGAAmG,EAAE,KAAK,IAAI,EAAE;QACjH,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,EAAE,YAAY,EAAE;YAC9C,SAAS,EAAE,oBAAoB;YAC/B,MAAM,EAAE,CAAC;SACV,CAAC,CAAA;QACF,MAAM,aAAa,GAAG,QAAQ,CAAC,OAAO,EAAE,UAAU,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QACjF,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAA;QACjD,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAC9B,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,OAAe,EAAmB,EAAE;YACnE,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAA;QACxC,CAAC,CAAC,CAAA;QAEF,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAA;QACzF,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAA;QAClC,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAA;QAC9C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,CAAE,MAAmB,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAC7C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mGAAmG,EAAE,KAAK,IAAI,EAAE;QACjH,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,2EAA2E;QAC3E,MAAM,WAAW,GAAG,QAAQ,CAAC,OAAO,EAAE,gBAAgB,EAAE;YACtD,SAAS,EAAE,iBAAiB;YAC5B,MAAM,EAAE,CAAC;SACV,CAAC,CAAA;QACF,+DAA+D;QAC/D,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,EAAE,YAAY,EAAE;YAC9C,SAAS,EAAE,oBAAoB;YAC/B,MAAM,EAAE,EAAE,EAAE,iCAAiC;SAC9C,CAAC,CAAA;QACF,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAA;QAC/C,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAA;QACpD,4EAA4E;QAC5E,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,OAAe,EAAE,EAAE,CAAC,IAAI,CAAC,CAAA;QAE1D,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAA;QACzF,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;IAClC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mEAAmE,EAAE,KAAK,IAAI,EAAE;QACjF,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC9B,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,EAAE,SAAS,EAAE;YAC5C,SAAS,EAAE,sBAAsB;YACjC,MAAM,EAAE,CAAC;SACV,CAAC,CAAA;QACF,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,EAAE,SAAS,EAAE;YAC5C,SAAS,EAAE,sBAAsB;YACjC,MAAM,EAAE,CAAC;SACV,CAAC,CAAA;QACF,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAA;QAC7C,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAA;QAC9B,0EAA0E;QAC1E,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,OAAe,EAAE,EAAE,CAAC,IAAI,CAAC,CAAA;QAE1D,MAAM,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAA;QAC1E,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC9C,MAAM,CAAC,WAAW,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAA;IAC9C,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}

package/dist/graph/__tests__/executor-convergence.test.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Convergence controller integration tests for the graph executor.
+ * Story 45-8: tests that all convergence components are wired into the
+ * execution loop (goal gate resolution, retry routing, budget enforcement,
+ * plateau detection, and remediation context injection).
+ *
+ * DO NOT modify executor.test.ts — this file is the focused integration
+ * test for the convergence loop wiring. The existing executor.test.ts
+ * mocks out the convergence module entirely; these tests use real implementations.
+ */
+export {};
+//# sourceMappingURL=executor-convergence.test.d.ts.map

package/dist/graph/__tests__/executor-convergence.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"executor-convergence.test.d.ts","sourceRoot":"","sources":["../../../src/graph/__tests__/executor-convergence.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG"}