@substrate-ai/factory 0.19.54

package/dist/graph/__tests__/validator-warnings.test.js

@@ -0,0 +1,363 @@
+/**
+ * Unit tests for GraphValidator — 5 warning rules (story 42-5)
+ *
+ * Covers:
+ *  AC1 — type_known warning rule
+ *  AC2 — fidelity_valid warning rule
+ *  AC3 — retry_target_exists warning rule
+ *  AC4 — goal_gate_has_retry warning rule
+ *  AC5 — prompt_on_llm_nodes warning rule
+ *  AC6 — custom rule via registerRule()
+ *  AC7 — warnings do not block validateOrRaise()
+ *  AC8 — all tests pass, no regressions
+ */
+import { describe, it, expect } from 'vitest';
+import { createValidator } from '../validator.js';
+// ---------------------------------------------------------------------------
+// Test helper — build a minimal Graph object conforming to the Graph interface
+// ---------------------------------------------------------------------------
+function makeNode(overrides) {
+    return {
+        id: overrides.id,
+        label: overrides.label ?? overrides.id,
+        shape: overrides.shape ?? 'box',
+        type: overrides.type ?? '',
+        prompt: overrides.prompt ?? '',
+        maxRetries: overrides.maxRetries ?? 0,
+        goalGate: overrides.goalGate ?? false,
+        retryTarget: overrides.retryTarget ?? '',
+        fallbackRetryTarget: overrides.fallbackRetryTarget ?? '',
+        fidelity: overrides.fidelity ?? '',
+        threadId: overrides.threadId ?? '',
+        class: overrides.class ?? '',
+        timeout: overrides.timeout ?? 0,
+        llmModel: overrides.llmModel ?? '',
+        llmProvider: overrides.llmProvider ?? '',
+        reasoningEffort: overrides.reasoningEffort ?? '',
+        autoStatus: overrides.autoStatus ?? false,
+        allowPartial: overrides.allowPartial ?? false,
+        toolCommand: overrides.toolCommand ?? '',
+        backend: overrides.backend ?? '',
+    };
+}
+/**
+ * Build a minimal valid Graph that passes all 8 error rules.
+ * Nodes: start (Mdiamond) → work (box, label='work') → exit (Msquare)
+ * Graph-level retryTarget/fallbackRetryTarget are empty by default.
+ */
+function makeValidGraph(overrides) {
+    const startNode = makeNode({ id: 'start', shape: 'Mdiamond', label: 'start' });
+    const workNode = makeNode({ id: 'work', shape: 'box', label: 'work task', prompt: 'do work' });
+    const exitNode = makeNode({ id: 'exit', shape: 'Msquare', label: 'exit' });
+    const allNodes = [startNode, workNode, exitNode, ...(overrides?.extraNodes ?? [])];
+    const nodeMap = new Map();
+    for (const n of allNodes) {
+        nodeMap.set(n.id, n);
+    }
+    const edges = [
+        { fromNode: 'start', toNode: 'work', label: '', condition: '', weight: 1, fidelity: '', threadId: '', loopRestart: false },
+        { fromNode: 'work', toNode: 'exit', label: '', condition: '', weight: 1, fidelity: '', threadId: '', loopRestart: false },
+    ];
+    return {
+        id: 'test',
+        goal: '',
+        label: '',
+        modelStylesheet: '',
+        defaultMaxRetries: 0,
+        retryTarget: overrides?.graphRetryTarget ?? '',
+        fallbackRetryTarget: overrides?.graphFallbackRetryTarget ?? '',
+        defaultFidelity: '',
+        nodes: nodeMap,
+        edges,
+        outgoingEdges(nodeId) {
+            return edges.filter((e) => e.fromNode === nodeId);
+        },
+        startNode() {
+            return nodeMap.get('start');
+        },
+        exitNode() {
+            return nodeMap.get('exit');
+        },
+    };
+}
+// ---------------------------------------------------------------------------
+// AC1: type_known rule
+// ---------------------------------------------------------------------------
+describe('type_known rule', () => {
+    it('node with empty type → no warning', () => {
+        const graph = makeValidGraph();
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'type_known');
+        expect(diags).toHaveLength(0);
+    });
+    it('node with type=codergen (known) → no warning', () => {
+        const graph = makeValidGraph({
+            extraNodes: [makeNode({ id: 'coder1', type: 'codergen', label: 'coder', prompt: 'generate code' })],
+        });
+        // Also add an edge so reachability passes
+        const coder1 = graph.nodes.get('coder1');
+        coder1.type = 'codergen';
+        // coder1 is unreachable, let's put it in the graph reachably
+        // Rebuild the graph with coder1 reachable
+        const nodeMap = new Map([
+            ['start', makeNode({ id: 'start', shape: 'Mdiamond', label: 'start' })],
+            ['coder1', makeNode({ id: 'coder1', type: 'codergen', label: 'coder', prompt: 'gen' })],
+            ['exit', makeNode({ id: 'exit', shape: 'Msquare', label: 'exit' })],
+        ]);
+        const edges = [
+            { fromNode: 'start', toNode: 'coder1', label: '', condition: '', weight: 1, fidelity: '', threadId: '', loopRestart: false },
+            { fromNode: 'coder1', toNode: 'exit', label: '', condition: '', weight: 1, fidelity: '', threadId: '', loopRestart: false },
+        ];
+        const g = {
+            id: 'test', goal: '', label: '', modelStylesheet: '', defaultMaxRetries: 0,
+            retryTarget: '', fallbackRetryTarget: '', defaultFidelity: '',
+            nodes: nodeMap, edges,
+            outgoingEdges(nodeId) { return edges.filter((e) => e.fromNode === nodeId); },
+            startNode() { return nodeMap.get('start'); },
+            exitNode() { return nodeMap.get('exit'); },
+        };
+        const validator = createValidator();
+        const diags = validator.validate(g).filter((d) => d.ruleId === 'type_known');
+        expect(diags).toHaveLength(0);
+    });
+    it('node with type=unknown_handler (unknown) → 1 warning with correct ruleId and nodeId', () => {
+        // Put the unknown-type node in the valid graph as the work node
+        const graph = makeValidGraph();
+        graph.nodes.get('work').type = 'unknown_handler';
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'type_known');
+        expect(diags).toHaveLength(1);
+        expect(diags[0].severity).toBe('warning');
+        expect(diags[0].ruleId).toBe('type_known');
+        expect(diags[0].nodeId).toBe('work');
+        expect(diags[0].message).toMatch(/unknown_handler/);
+    });
+});
+// ---------------------------------------------------------------------------
+// AC2: fidelity_valid rule
+// ---------------------------------------------------------------------------
+describe('fidelity_valid rule', () => {
+    it('node with empty fidelity → no warning', () => {
+        const graph = makeValidGraph();
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'fidelity_valid');
+        expect(diags).toHaveLength(0);
+    });
+    it('node with fidelity=high (valid) → no warning', () => {
+        const graph = makeValidGraph();
+        graph.nodes.get('work').fidelity = 'high';
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'fidelity_valid');
+        expect(diags).toHaveLength(0);
+    });
+    it('node with fidelity=ultra (invalid) → 1 warning with correct ruleId and nodeId', () => {
+        const graph = makeValidGraph();
+        graph.nodes.get('work').fidelity = 'ultra';
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'fidelity_valid');
+        expect(diags).toHaveLength(1);
+        expect(diags[0].severity).toBe('warning');
+        expect(diags[0].ruleId).toBe('fidelity_valid');
+        expect(diags[0].nodeId).toBe('work');
+        expect(diags[0].message).toMatch(/ultra/);
+    });
+});
+// ---------------------------------------------------------------------------
+// AC3: retry_target_exists rule
+// ---------------------------------------------------------------------------
+describe('retry_target_exists rule', () => {
+    it('node with empty retryTarget → no warning', () => {
+        const graph = makeValidGraph();
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'retry_target_exists');
+        expect(diags).toHaveLength(0);
+    });
+    it('node with retryTarget pointing to existing node → no warning', () => {
+        const graph = makeValidGraph();
+        graph.nodes.get('work').retryTarget = 'start';
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'retry_target_exists');
+        expect(diags).toHaveLength(0);
+    });
+    it('node with retryTarget pointing to ghost_node → 1 warning', () => {
+        const graph = makeValidGraph();
+        graph.nodes.get('work').retryTarget = 'ghost_node';
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'retry_target_exists');
+        expect(diags).toHaveLength(1);
+        expect(diags[0].severity).toBe('warning');
+        expect(diags[0].ruleId).toBe('retry_target_exists');
+        expect(diags[0].message).toMatch(/ghost_node/);
+    });
+    it('node with fallbackRetryTarget pointing to ghost_node → 1 warning', () => {
+        const graph = makeValidGraph();
+        graph.nodes.get('work').fallbackRetryTarget = 'ghost_node';
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'retry_target_exists');
+        expect(diags).toHaveLength(1);
+        expect(diags[0].severity).toBe('warning');
+        expect(diags[0].message).toMatch(/ghost_node/);
+    });
+    it('graph.retryTarget pointing to ghost_node → 1 warning', () => {
+        const graph = makeValidGraph({ graphRetryTarget: 'ghost_node' });
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'retry_target_exists');
+        expect(diags).toHaveLength(1);
+        expect(diags[0].severity).toBe('warning');
+        expect(diags[0].message).toMatch(/ghost_node/);
+    });
+    it('graph.fallbackRetryTarget pointing to ghost_node → 1 warning', () => {
+        const graph = makeValidGraph({ graphFallbackRetryTarget: 'ghost_node' });
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'retry_target_exists');
+        expect(diags).toHaveLength(1);
+        expect(diags[0].severity).toBe('warning');
+        expect(diags[0].message).toMatch(/ghost_node/);
+    });
+});
+// ---------------------------------------------------------------------------
+// AC4: goal_gate_has_retry rule
+// ---------------------------------------------------------------------------
+describe('goal_gate_has_retry rule', () => {
+    it('goalGate=false → no warning', () => {
+        const graph = makeValidGraph();
+        graph.nodes.get('work').goalGate = false;
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'goal_gate_has_retry');
+        expect(diags).toHaveLength(0);
+    });
+    it('goalGate=true with node-level retryTarget set → no warning', () => {
+        const graph = makeValidGraph();
+        graph.nodes.get('work').goalGate = true;
+        graph.nodes.get('work').retryTarget = 'start';
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'goal_gate_has_retry');
+        expect(diags).toHaveLength(0);
+    });
+    it('goalGate=true with graph-level retryTarget set → no warning', () => {
+        const graph = makeValidGraph({ graphRetryTarget: 'start' });
+        graph.nodes.get('work').goalGate = true;
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'goal_gate_has_retry');
+        expect(diags).toHaveLength(0);
+    });
+    it('goalGate=true, node retryTarget empty, no graph-level default → 1 warning', () => {
+        const graph = makeValidGraph();
+        graph.nodes.get('work').goalGate = true;
+        // retryTarget remains '', graph.retryTarget remains ''
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'goal_gate_has_retry');
+        expect(diags).toHaveLength(1);
+        expect(diags[0].severity).toBe('warning');
+        expect(diags[0].ruleId).toBe('goal_gate_has_retry');
+        expect(diags[0].nodeId).toBe('work');
+        expect(diags[0].message).toMatch(/goal_gate/);
+    });
+});
+// ---------------------------------------------------------------------------
+// AC5: prompt_on_llm_nodes rule
+// ---------------------------------------------------------------------------
+describe('prompt_on_llm_nodes rule', () => {
+    it('shape=box with prompt set → no warning', () => {
+        const graph = makeValidGraph();
+        // work node already has shape=box and prompt='do work'
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'prompt_on_llm_nodes');
+        expect(diags).toHaveLength(0);
+    });
+    it('shape=box with label set (no prompt) → no warning', () => {
+        const graph = makeValidGraph();
+        graph.nodes.get('work').prompt = '';
+        graph.nodes.get('work').label = 'My Task';
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'prompt_on_llm_nodes');
+        expect(diags).toHaveLength(0);
+    });
+    it('shape=box with both prompt and label empty → 1 warning', () => {
+        const graph = makeValidGraph();
+        graph.nodes.get('work').prompt = '';
+        graph.nodes.get('work').label = '';
+        const validator = createValidator();
+        const diags = validator.validate(graph).filter((d) => d.ruleId === 'prompt_on_llm_nodes');
+        expect(diags).toHaveLength(1);
+        expect(diags[0].severity).toBe('warning');
+        expect(diags[0].ruleId).toBe('prompt_on_llm_nodes');
+        expect(diags[0].nodeId).toBe('work');
+        expect(diags[0].message).toMatch(/no prompt or label/);
+    });
+    it('shape=diamond (non-codergen) with both empty → no warning', () => {
+        // Use a non-box, non-codergen shape; add it as an extra node to a valid graph
+        // We need to make it reachable from start, so we rebuild the graph
+        const nodeMap = new Map([
+            ['start', makeNode({ id: 'start', shape: 'Mdiamond', label: 'start' })],
+            ['diamond_node', makeNode({ id: 'diamond_node', shape: 'diamond', label: '', prompt: '' })],
+            ['exit', makeNode({ id: 'exit', shape: 'Msquare', label: 'exit' })],
+        ]);
+        const edges = [
+            { fromNode: 'start', toNode: 'diamond_node', label: '', condition: '', weight: 1, fidelity: '', threadId: '', loopRestart: false },
+            { fromNode: 'diamond_node', toNode: 'exit', label: '', condition: '', weight: 1, fidelity: '', threadId: '', loopRestart: false },
+        ];
+        const g = {
+            id: 'test', goal: '', label: '', modelStylesheet: '', defaultMaxRetries: 0,
+            retryTarget: '', fallbackRetryTarget: '', defaultFidelity: '',
+            nodes: nodeMap, edges,
+            outgoingEdges(nodeId) { return edges.filter((e) => e.fromNode === nodeId); },
+            startNode() { return nodeMap.get('start'); },
+            exitNode() { return nodeMap.get('exit'); },
+        };
+        const validator = createValidator();
+        const diags = validator.validate(g).filter((d) => d.ruleId === 'prompt_on_llm_nodes');
+        expect(diags).toHaveLength(0);
+    });
+});
+// ---------------------------------------------------------------------------
+// AC6: Custom rule via registerRule()
+// ---------------------------------------------------------------------------
+describe('registerRule()', () => {
+    it('registered custom rule diagnostics appear in validate() output alongside built-in results', () => {
+        const graph = makeValidGraph();
+        const validator = createValidator();
+        const customRule = {
+            id: 'custom_warning_rule',
+            severity: 'warning',
+            check: () => [
+                {
+                    ruleId: 'custom_warning_rule',
+                    severity: 'warning',
+                    message: 'custom warning fired',
+                    nodeId: 'work',
+                },
+            ],
+        };
+        validator.registerRule(customRule);
+        const diags = validator.validate(graph);
+        const custom = diags.find((d) => d.ruleId === 'custom_warning_rule');
+        expect(custom).toBeDefined();
+        expect(custom.severity).toBe('warning');
+        expect(custom.message).toBe('custom warning fired');
+        expect(custom.nodeId).toBe('work');
+    });
+});
+// ---------------------------------------------------------------------------
+// AC7: Warnings do not block validateOrRaise()
+// ---------------------------------------------------------------------------
+describe('validateOrRaise() with warnings only', () => {
+    it('graph with warnings but no errors → validateOrRaise does NOT throw', () => {
+        // Trigger type_known warning by setting an unknown type on the work node
+        const graph = makeValidGraph();
+        graph.nodes.get('work').type = 'some_unknown_type';
+        graph.nodes.get('work').prompt = 'do work'; // keep prompt to avoid prompt_on_llm_nodes warning
+        // Also clear the label on start/exit so only type_known fires on work
+        const validator = createValidator();
+        // Confirm there is at least one warning
+        const diags = validator.validate(graph);
+        const warnings = diags.filter((d) => d.severity === 'warning');
+        const errors = diags.filter((d) => d.severity === 'error');
+        expect(warnings.length).toBeGreaterThan(0);
+        expect(errors).toHaveLength(0);
+        // validateOrRaise should NOT throw
+        expect(() => validator.validateOrRaise(graph)).not.toThrow();
+        expect(validator.validateOrRaise(graph)).toBeUndefined();
+    });
+});
+//# sourceMappingURL=validator-warnings.test.js.map

package/dist/graph/__tests__/validator-warnings.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validator-warnings.test.js","sourceRoot":"","sources":["../../../src/graph/__tests__/validator-warnings.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAC7C,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAA;AAGjD,8EAA8E;AAC9E,+EAA+E;AAC/E,8EAA8E;AAE9E,SAAS,QAAQ,CAAC,SAA8C;IAC9D,OAAO;QACL,EAAE,EAAE,SAAS,CAAC,EAAE;QAChB,KAAK,EAAE,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,EAAE;QACtC,KAAK,EAAE,SAAS,CAAC,KAAK,IAAI,KAAK;QAC/B,IAAI,EAAE,SAAS,CAAC,IAAI,IAAI,EAAE;QAC1B,MAAM,EAAE,SAAS,CAAC,MAAM,IAAI,EAAE;QAC9B,UAAU,EAAE,SAAS,CAAC,UAAU,IAAI,CAAC;QACrC,QAAQ,EAAE,SAAS,CAAC,QAAQ,IAAI,KAAK;QACrC,WAAW,EAAE,SAAS,CAAC,WAAW,IAAI,EAAE;QACxC,mBAAmB,EAAE,SAAS,CAAC,mBAAmB,IAAI,EAAE;QACxD,QAAQ,EAAE,SAAS,CAAC,QAAQ,IAAI,EAAE;QAClC,QAAQ,EAAE,SAAS,CAAC,QAAQ,IAAI,EAAE;QAClC,KAAK,EAAE,SAAS,CAAC,KAAK,IAAI,EAAE;QAC5B,OAAO,EAAE,SAAS,CAAC,OAAO,IAAI,CAAC;QAC/B,QAAQ,EAAE,SAAS,CAAC,QAAQ,IAAI,EAAE;QAClC,WAAW,EAAE,SAAS,CAAC,WAAW,IAAI,EAAE;QACxC,eAAe,EAAE,SAAS,CAAC,eAAe,IAAI,EAAE;QAChD,UAAU,EAAE,SAAS,CAAC,UAAU,IAAI,KAAK;QACzC,YAAY,EAAE,SAAS,CAAC,YAAY,IAAI,KAAK;QAC7C,WAAW,EAAE,SAAS,CAAC,WAAW,IAAI,EAAE;QACxC,OAAO,EAAE,SAAS,CAAC,OAAO,IAAI,EAAE;KACjC,CAAA;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,SAIvB;IACC,MAAM,SAAS,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAA;IAC9E,MAAM,QAAQ,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAA;IAC9F,MAAM,QAAQ,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAA;IAE1E,MAAM,QAAQ,GAAG,CAAC,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,CAAC,SAAS,EAAE,UAAU,IAAI,EAAE,CAAC,CAAC,CAAA;IAClF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAqB,CAAA;IAC5C,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;IACtB,CAAC;IAED,MAAM,KAAK,GAAgB;QACzB,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE;QAC1H,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE;KAC1H,CAAA;IAED,OAAO;QACL,EAAE,EAAE,MAAM;QACV,IAAI,EAAE,EAAE;QACR,KAAK,EAAE,EAAE;QACT,eAAe,EAAE,EAAE;QACnB,iBAAiB,EAAE,CAAC;QACpB,WAAW,EAAE,SAAS,EAAE,gBAAgB,IAAI,EAAE;QAC9C,mBAAmB,EAAE,SAAS,EAAE,wBAAwB,IAAI,EAAE;QAC9D,eAAe,EAAE,EAAE;QACnB,KAAK,EAAE,OAAO;QACd,KAAK;QACL,aAAa,CAAC,MAAc;YAC1B,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAA;QACnD,CAAC;QACD,SAAS;YACP,OAAO,OAAO,CAAC,GAAG,CAAC,OAAO,CAAE,CAAA;QAC9B,CAAC;QACD,QAAQ;YACN,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAA;QAC7B,CAAC;KACF,CAAA;AACH,CAAC;AAED,8EAA8E;AAC9E,uBAAuB;AACvB,8EAA8E;AAE9E,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,YAAY,CAAC,CAAA;QAChF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,KAAK,GAAG,cAAc,CAAC;YAC3B,UAAU,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC,CAAC;SACpG,CAAC,CAAA;QACF,0CAA0C;QAC1C,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAA;QACzC,MAAM,CAAC,IAAI,GAAG,UAAU,CAAA;QACxB,6DAA6D;QAC7D,0CAA0C;QAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAoB;YACzC,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;YACvE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;YACvF,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;SACpE,CAAC,CAAA;QACF,MAAM,KAAK,GAAgB;YACzB,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE;YAC5H,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE;SAC5H,CAAA;QACD,MAAM,CAAC,GAAU;YACf,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,iBAAiB,EAAE,CAAC;YAC1E,WAAW,EAAE,EAAE,EAAE,mBAAmB,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE;YAC7D,KAAK,EAAE,OAAO,EAAE,KAAK;YACrB,aAAa,CAAC,MAAc,IAAI,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAA,CAAC,CAAC;YACnF,SAAS,KAAK,OAAO,OAAO,CAAC,GAAG,CAAC,OAAO,CAAE,CAAA,CAAC,CAAC;YAC5C,QAAQ,KAAK,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAA,CAAC,CAAC;SAC3C,CAAA;QACD,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,YAAY,CAAC,CAAA;QAC5E,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,qFAAqF,EAAE,GAAG,EAAE;QAC7F,gEAAgE;QAChE,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,IAAI,GAAG,iBAAiB,CAAA;QACjD,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,YAAY,CAAC,CAAA;QAChF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAC7B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC1C,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;QAC3C,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACrC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAA;IACtD,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,2BAA2B;AAC3B,8EAA8E;AAE9E,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,gBAAgB,CAAC,CAAA;QACpF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,QAAQ,GAAG,MAAM,CAAA;QAC1C,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,gBAAgB,CAAC,CAAA;QACpF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,+EAA+E,EAAE,GAAG,EAAE;QACvF,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,QAAQ,GAAG,OAAO,CAAA;QAC3C,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,gBAAgB,CAAC,CAAA;QACpF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAC7B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC1C,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAA;QAC/C,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACrC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;IAC5C,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,gCAAgC;AAChC,8EAA8E;AAE9E,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,WAAW,GAAG,OAAO,CAAA;QAC9C,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,WAAW,GAAG,YAAY,CAAA;QACnD,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAC7B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC1C,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAA;QACpD,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAA;IACjD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,mBAAmB,GAAG,YAAY,CAAA;QAC3D,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAC7B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC1C,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAA;IACjD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG,cAAc,CAAC,EAAE,gBAAgB,EAAE,YAAY,EAAE,CAAC,CAAA;QAChE,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAC7B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC1C,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAA;IACjD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,KAAK,GAAG,cAAc,CAAC,EAAE,wBAAwB,EAAE,YAAY,EAAE,CAAC,CAAA;QACxE,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAC7B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC1C,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAA;IACjD,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,gCAAgC;AAChC,8EAA8E;AAE9E,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,QAAQ,GAAG,KAAK,CAAA;QACzC,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,QAAQ,GAAG,IAAI,CAAA;QACxC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,WAAW,GAAG,OAAO,CAAA;QAC9C,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,KAAK,GAAG,cAAc,CAAC,EAAE,gBAAgB,EAAE,OAAO,EAAE,CAAC,CAAA;QAC3D,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,QAAQ,GAAG,IAAI,CAAA;QACxC,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,2EAA2E,EAAE,GAAG,EAAE;QACnF,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,QAAQ,GAAG,IAAI,CAAA;QACxC,uDAAuD;QACvD,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAC7B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC1C,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAA;QACpD,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACrC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAA;IAChD,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,gCAAgC;AAChC,8EAA8E;AAE9E,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,uDAAuD;QACvD,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,MAAM,GAAG,EAAE,CAAA;QACpC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,KAAK,GAAG,SAAS,CAAA;QAC1C,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,MAAM,GAAG,EAAE,CAAA;QACpC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,KAAK,GAAG,EAAE,CAAA;QACnC,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACzF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAC7B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAC1C,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAA;QACpD,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACrC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAA;IACzD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,8EAA8E;QAC9E,mEAAmE;QACnE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAoB;YACzC,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;YACvE,CAAC,cAAc,EAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3F,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;SACpE,CAAC,CAAA;QACF,MAAM,KAAK,GAAgB;YACzB,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE;YAClI,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE;SAClI,CAAA;QACD,MAAM,CAAC,GAAU;YACf,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,iBAAiB,EAAE,CAAC;YAC1E,WAAW,EAAE,EAAE,EAAE,mBAAmB,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE;YAC7D,KAAK,EAAE,OAAO,EAAE,KAAK;YACrB,aAAa,CAAC,MAAc,IAAI,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAA,CAAC,CAAC;YACnF,SAAS,KAAK,OAAO,OAAO,CAAC,GAAG,CAAC,OAAO,CAAE,CAAA,CAAC,CAAC;YAC5C,QAAQ,KAAK,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAA,CAAC,CAAC;SAC3C,CAAA;QACD,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACrF,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,sCAAsC;AACtC,8EAA8E;AAE9E,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,EAAE,CAAC,2FAA2F,EAAE,GAAG,EAAE;QACnG,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QAEnC,MAAM,UAAU,GAAa;YAC3B,EAAE,EAAE,qBAAqB;YACzB,QAAQ,EAAE,SAAS;YACnB,KAAK,EAAE,GAAG,EAAE,CAAC;gBACX;oBACE,MAAM,EAAE,qBAAqB;oBAC7B,QAAQ,EAAE,SAAS;oBACnB,OAAO,EAAE,sBAAsB;oBAC/B,MAAM,EAAE,MAAM;iBACf;aACF;SACF,CAAA;QAED,SAAS,CAAC,YAAY,CAAC,UAAU,CAAC,CAAA;QAClC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;QAEvC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,qBAAqB,CAAC,CAAA;QACpE,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAA;QAC5B,MAAM,CAAC,MAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QACxC,MAAM,CAAC,MAAO,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAA;QACpD,MAAM,CAAC,MAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACrC,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,+CAA+C;AAC/C,8EAA8E;AAE9E,QAAQ,CAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,EAAE,CAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,yEAAyE;QACzE,MAAM,KAAK,GAAG,cAAc,EAAE,CAAA;QAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,IAAI,GAAG,mBAAmB,CAAA;QACnD,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,MAAM,GAAG,SAAS,CAAA,CAAC,mDAAmD;QAC/F,sEAAsE;QACtE,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;QAEnC,wCAAwC;QACxC,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;QACvC,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAA;QAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAA;QAC1D,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAA;QAC1C,MAAM,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAE9B,mCAAmC;QACnC,MAAM,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAA;QAC5D,MAAM,CAAC,SAAS,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,EAAE,CAAA;IAC1D,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}

package/dist/graph/checkpoint.d.ts

@@ -0,0 +1,61 @@
+/**
+ * CheckpointManager — serializes and restores graph execution state.
+ *
+ * Writes a spec-compliant JSON checkpoint after each completed node and
+ * can restore that state for resume, allowing graph runs to survive
+ * process crashes without re-executing already-finished work.
+ *
+ * Story 42-13.
+ */
+import type { Checkpoint, ResumeState, Graph, IGraphContext } from './types.js';
+/**
+ * Parameters passed to `CheckpointManager.save()`.
+ */
+export interface CheckpointSaveParams {
+    currentNode: string;
+    completedNodes: string[];
+    nodeRetries: Record<string, number>;
+    context: IGraphContext;
+    logs?: string[];
+}
+/**
+ * Manages checkpoint serialization and restoration for the graph executor.
+ */
+export declare class CheckpointManager {
+    /**
+     * Persist execution state to `{logsRoot}/checkpoint.json`.
+     *
+     * Creates `logsRoot` (and any missing parent directories) if absent.
+     * The resulting JSON file contains all six spec-mandated fields.
+     *
+     * @param logsRoot  Directory in which to write `checkpoint.json`.
+     * @param params    Current execution state to serialize.
+     */
+    save(logsRoot: string, params: CheckpointSaveParams): Promise<void>;
+    /**
+     * Load and deserialize a checkpoint from disk.
+     *
+     * Errors from `readFile` (file not found) or `JSON.parse` (corrupt file)
+     * propagate naturally to the caller.
+     *
+     * @param checkpointPath  Absolute path to the `checkpoint.json` file.
+     * @returns The deserialized `Checkpoint` object.
+     */
+    load(checkpointPath: string): Promise<Checkpoint>;
+    /**
+     * Restore execution state from a checkpoint and return a `ResumeState`
+     * that the executor uses to skip completed nodes and seed the context.
+     *
+     * If the last completed node used `fidelity="full"`, the first resumed
+     * node must use `"summary:high"` because in-memory LLM sessions cannot
+     * be serialized across process boundaries.
+     *
+     * This method is synchronous — all inputs are already in-memory.
+     *
+     * @param graph       The parsed factory graph for the current run.
+     * @param checkpoint  The deserialized checkpoint to restore from.
+     * @returns A `ResumeState` ready for use by the executor.
+     */
+    resume(graph: Graph, checkpoint: Checkpoint): ResumeState;
+}
+//# sourceMappingURL=checkpoint.d.ts.map

package/dist/graph/checkpoint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"checkpoint.d.ts","sourceRoot":"","sources":["../../src/graph/checkpoint.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAA;AAG/E;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,WAAW,EAAE,MAAM,CAAA;IACnB,cAAc,EAAE,MAAM,EAAE,CAAA;IACxB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACnC,OAAO,EAAE,aAAa,CAAA;IACtB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAA;CAChB;AAED;;GAEG;AACH,qBAAa,iBAAiB;IAC5B;;;;;;;;OAQG;IACG,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,oBAAoB,GAAG,OAAO,CAAC,IAAI,CAAC;IAkBzE;;;;;;;;OAQG;IACG,IAAI,CAAC,cAAc,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC;IAKvD;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,GAAG,WAAW;CAa1D"}

package/dist/graph/checkpoint.js

@@ -0,0 +1,80 @@
+/**
+ * CheckpointManager — serializes and restores graph execution state.
+ *
+ * Writes a spec-compliant JSON checkpoint after each completed node and
+ * can restore that state for resume, allowing graph runs to survive
+ * process crashes without re-executing already-finished work.
+ *
+ * Story 42-13.
+ */
+import { mkdir, writeFile, readFile } from 'node:fs/promises';
+import path from 'node:path';
+import { GraphContext } from './context.js';
+/**
+ * Manages checkpoint serialization and restoration for the graph executor.
+ */
+export class CheckpointManager {
+    /**
+     * Persist execution state to `{logsRoot}/checkpoint.json`.
+     *
+     * Creates `logsRoot` (and any missing parent directories) if absent.
+     * The resulting JSON file contains all six spec-mandated fields.
+     *
+     * @param logsRoot  Directory in which to write `checkpoint.json`.
+     * @param params    Current execution state to serialize.
+     */
+    async save(logsRoot, params) {
+        // Create directory (and parents) if absent; no-op if already exists.
+        await mkdir(logsRoot, { recursive: true });
+        const checkpoint = {
+            timestamp: Date.now(),
+            currentNode: params.currentNode,
+            completedNodes: params.completedNodes,
+            nodeRetries: params.nodeRetries,
+            contextValues: params.context.snapshot(),
+            logs: params.logs ?? [],
+        };
+        const json = JSON.stringify(checkpoint, null, 2);
+        const filePath = path.join(logsRoot, 'checkpoint.json');
+        await writeFile(filePath, json, 'utf-8');
+    }
+    /**
+     * Load and deserialize a checkpoint from disk.
+     *
+     * Errors from `readFile` (file not found) or `JSON.parse` (corrupt file)
+     * propagate naturally to the caller.
+     *
+     * @param checkpointPath  Absolute path to the `checkpoint.json` file.
+     * @returns The deserialized `Checkpoint` object.
+     */
+    async load(checkpointPath) {
+        const raw = await readFile(checkpointPath, 'utf-8');
+        return JSON.parse(raw);
+    }
+    /**
+     * Restore execution state from a checkpoint and return a `ResumeState`
+     * that the executor uses to skip completed nodes and seed the context.
+     *
+     * If the last completed node used `fidelity="full"`, the first resumed
+     * node must use `"summary:high"` because in-memory LLM sessions cannot
+     * be serialized across process boundaries.
+     *
+     * This method is synchronous — all inputs are already in-memory.
+     *
+     * @param graph       The parsed factory graph for the current run.
+     * @param checkpoint  The deserialized checkpoint to restore from.
+     * @returns A `ResumeState` ready for use by the executor.
+     */
+    resume(graph, checkpoint) {
+        const context = new GraphContext(checkpoint.contextValues);
+        const completedNodes = new Set(checkpoint.completedNodes);
+        const nodeRetries = { ...checkpoint.nodeRetries };
+        // Determine fidelity degradation for the first resumed node.
+        // If the last-executed node used 'full' fidelity, the LLM session cannot
+        // be restored from disk, so the first resumed node must use 'summary:high'.
+        const lastNode = graph.nodes.get(checkpoint.currentNode);
+        const firstResumedNodeFidelity = lastNode?.fidelity === 'full' ? 'summary:high' : '';
+        return { context, completedNodes, nodeRetries, firstResumedNodeFidelity };
+    }
+}
+//# sourceMappingURL=checkpoint.js.map

package/dist/graph/checkpoint.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"checkpoint.js","sourceRoot":"","sources":["../../src/graph/checkpoint.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAA;AAC7D,OAAO,IAAI,MAAM,WAAW,CAAA;AAE5B,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAA;AAa3C;;GAEG;AACH,MAAM,OAAO,iBAAiB;IAC5B;;;;;;;;OAQG;IACH,KAAK,CAAC,IAAI,CAAC,QAAgB,EAAE,MAA4B;QACvD,qEAAqE;QACrE,MAAM,KAAK,CAAC,QAAQ,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;QAE1C,MAAM,UAAU,GAAe;YAC7B,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,WAAW,EAAE,MAAM,CAAC,WAAW;YAC/B,cAAc,EAAE,MAAM,CAAC,cAAc;YACrC,WAAW,EAAE,MAAM,CAAC,WAAW;YAC/B,aAAa,EAAE,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE;YACxC,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE;SACxB,CAAA;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAA;QACvD,MAAM,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;IAC1C,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,IAAI,CAAC,cAAsB;QAC/B,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC,CAAA;QACnD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAe,CAAA;IACtC,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,KAAY,EAAE,UAAsB;QACzC,MAAM,OAAO,GAAG,IAAI,YAAY,CAAC,UAAU,CAAC,aAAa,CAAC,CAAA;QAC1D,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC,CAAA;QACzD,MAAM,WAAW,GAAG,EAAE,GAAG,UAAU,CAAC,WAAW,EAAE,CAAA;QAEjD,6DAA6D;QAC7D,yEAAyE;QACzE,4EAA4E;QAC5E,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,CAAA;QACxD,MAAM,wBAAwB,GAAG,QAAQ,EAAE,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAA;QAEpF,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,wBAAwB,EAAE,CAAA;IAC3E,CAAC;CACF"}

package/dist/graph/condition-parser.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Condition expression parser and evaluator for the factory graph engine.
+ *
+ * Grammar (Attractor Spec §10, extended in story 44-5):
+ *   condition      ::= clause ('&&' clause)*
+ *   clause         ::= key op value
+ *   key            ::= [a-zA-Z_][a-zA-Z0-9_]*
+ *   op             ::= '=' | '!=' | '>=' | '<=' | '>' | '<'
+ *   value          ::= quoted_string | unquoted_token
+ *   quoted_string  ::= '"' [^"]* '"' | "'" [^']* "'"
+ *   unquoted_token ::= [^\s&&]+
+ *
+ * Numeric operators (>=, <=, >, <) coerce context values to Number and compare.
+ * String operators (=, !=) retain existing case-sensitive string-equality semantics.
+ * Missing context keys resolve to "" for = / != and NaN for numeric operators.
+ * Only && conjunction is supported; || is out of scope.
+ *
+ * Story 42-6, extended in story 44-5.
+ */
+import type { ParsedCondition } from './types.js';
+/**
+ * Thrown by `parseCondition` when a condition string does not conform
+ * to the supported grammar.
+ */
+export declare class ConditionParseError extends Error {
+    constructor(message: string);
+}
+/**
+ * Parse a condition expression string into a `ParsedCondition` (array of clauses).
+ *
+ * @param conditionStr - The condition string to parse (e.g. `"outcome=success && iteration!=0"`).
+ * @returns An array of `ConditionClause` objects representing the conjunction.
+ * @throws `ConditionParseError` if the string is empty, contains an empty clause,
+ *   uses an invalid operator (`==`), or otherwise does not conform to the grammar.
+ */
+export declare function parseCondition(conditionStr: string): ParsedCondition;
+/**
+ * Evaluate a condition expression against a runtime context.
+ *
+ * String operators (=, !=): context values are coerced to strings via String().
+ *   Context keys absent from context resolve to "" (empty string).
+ *
+ * Numeric operators (>=, <=, >, <): context values are coerced to numbers via Number().
+ *   Absent keys or non-numeric values produce NaN, which causes the comparison to return false.
+ *   The clause value is parsed via parseFloat().
+ *
+ * Returns `true` only if every clause in the conjunction passes.
+ *
+ * @param conditionStr - The condition string to evaluate.
+ * @param context      - Key/value map of the current runtime context.
+ * @returns `true` if all clauses evaluate to true, `false` otherwise.
+ * @throws `ConditionParseError` if `conditionStr` has invalid syntax.
+ */
+export declare function evaluateCondition(conditionStr: string, context: Record<string, unknown>): boolean;
+//# sourceMappingURL=condition-parser.d.ts.map

package/dist/graph/condition-parser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"condition-parser.d.ts","sourceRoot":"","sources":["../../src/graph/condition-parser.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,EAAmB,eAAe,EAAE,MAAM,YAAY,CAAA;AAMlE;;;GAGG;AACH,qBAAa,mBAAoB,SAAQ,KAAK;gBAChC,OAAO,EAAE,MAAM;CAI5B;AAwID;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,YAAY,EAAE,MAAM,GAAG,eAAe,CAapE;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,iBAAiB,CAC/B,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC/B,OAAO,CAsCT"}