ppef 1.0.0 → 1.0.1

package/README.md

@@ -0,0 +1,172 @@
+# PPEF - Portable Programmatic Evaluation Framework
+
+A claim-driven, deterministic evaluation framework for experiments. PPEF provides a structured approach to testing and validating software components through reusable test cases, statistical aggregation, and claim-based evaluation.
+
+## Features
+
+- **Core**: Type-safe foundation with zero external dependencies
+- **Store**: Centralized registry for Systems Under Test (SUTs)
+- **Case**: Reusable test case infrastructure with setup/teardown
+- **Execute**: Deterministic test execution with snapshot capture
+- **Aggregate**: Statistical aggregation across test runs (mean, median, mode, min, max, stdDev)
+- **Evaluate**: Claim-driven validation with custom predicates
+- **Render**: Report generation in multiple formats (console, Markdown, JSON)
+- **Monitor**: Built-in memory and CPU monitoring for resource tracking
+
+## Installation
+
+```bash
+# Install as a dependency
+pnpm add ppef
+
+# Or use locally for development
+git clone <repository-url>
+cd ppef
+pnpm install
+pnpm build
+```
+
+## Quick Start
+
+```typescript
+import { Store, Case, Execute, Aggregate, Evaluate, Render } from 'ppef';
+
+// 1. Register your System Under Test (SUT)
+Store.register('sort-algo', {
+  name: 'QuickSort',
+  execute: (input: number[]) => input.sort((a, b) => a - b)
+});
+
+// 2. Define test cases
+const ascendingCase = new Case({
+  name: 'ascending-order',
+  setup: () => [1, 2, 3, 4, 5],
+  teardown: (result) => console.log('Result:', result)
+});
+
+const descendingCase = new Case({
+  name: 'descending-order',
+  setup: () => [5, 4, 3, 2, 1],
+  teardown: (result) => console.log('Result:', result)
+});
+
+// 3. Execute tests
+const results = Execute.run('sort-algo', [ascendingCase, descendingCase]);
+
+// 4. Aggregate metrics across multiple runs
+const aggregated = Aggregate.mean(results);
+
+// 5. Evaluate claims
+const claims = Evaluate.claims(aggregated, {
+  'always-sorted': (result) => {
+    const arr = result.output;
+    for (let i = 0; i < arr.length - 1; i++) {
+      if (arr[i] > arr[i + 1]) return false;
+    }
+    return true;
+  }
+});
+
+// 6. Render reports
+Render.console(claims);
+Render.markdown(claims, './results.md');
+Render.json(claims, './results.json');
+```
+
+## Modules
+
+### Core
+Type-safe foundation providing primitive types and interfaces. Zero external dependencies - pure TypeScript utilities for the entire framework.
+
+### Store
+Centralized registry for managing Systems Under Test (SUTs). Register implementations with unique identifiers and retrieve them for execution.
+
+```typescript
+Store.register('my-sut', {
+  name: 'My Implementation',
+  version: '1.0.0',
+  execute: (input) => { /* implementation */ }
+});
+
+const sut = Store.get('my-sut');
+```
+
+### Case
+Reusable test case infrastructure with lifecycle management. Each case includes setup, execution, and teardown phases with automatic resource cleanup.
+
+```typescript
+const testCase = new Case({
+  name: 'test-case-1',
+  setup: () => ({ data: [1, 2, 3] }),
+  teardown: (result) => console.log('Cleanup:', result)
+});
+```
+
+### Execute
+Deterministic test execution engine. Runs SUTs against test cases and captures snapshots of inputs, outputs, and execution metadata.
+
+```typescript
+const results = Execute.run('my-sut', [testCase]);
+const snapshot = Execute.capture('my-sut', testCase);
+```
+
+### Aggregate
+Statistical aggregation utilities for analyzing test results across multiple runs. Compute mean, median, mode, min, max, and standard deviation.
+
+```typescript
+const stats = Aggregate.mean(results);
+const median = Aggregate.median(results);
+const deviation = Aggregate.stdDev(results);
+```
+
+### Evaluate
+Claim-driven validation framework. Define custom predicates to validate test results against expected properties and behaviors.
+
+```typescript
+const claims = Evaluate.claims(results, {
+  'performance': (r) => r.duration < 100,
+  'correctness': (r) => r.output === expected,
+  'memory-safe': (r) => r.memoryUsage < 1024 * 1024
+});
+```
+
+### Render
+Multi-format report generation. Output results to console, Markdown files, or JSON for documentation and CI/CD integration.
+
+```typescript
+Render.console(results);
+Render.markdown(results, './report.md');
+Render.json(results, './report.json');
+```
+
+### Monitor
+Built-in resource tracking for performance profiling. Monitor memory usage and CPU consumption during test execution.
+
+```typescript
+const monitor = new Monitor();
+monitor.start();
+// ... run tests ...
+const metrics = monitor.stop();
+console.log('Memory used:', metrics.memoryUsage);
+```
+
+## API Reference
+
+Detailed type definitions and API documentation are available in the source files:
+
+- `src/core/` - Core types and interfaces
+- `src/store.ts` - SUT registry API
+- `src/case.ts` - Test case API
+- `src/execute.ts` - Execution engine API
+- `src/aggregate.ts` - Statistical functions
+- `src/evaluate.ts` - Claim evaluation API
+- `src/render.ts` - Report generation API
+- `src/monitor.ts` - Resource monitoring API
+
+## License
+
+MIT
+
+---
+
+**PPEF** - Making experiments reproducible, evaluable, and documentable.

package/dist/__tests__/framework-pipeline.integration.test.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Integration tests for Framework Pipeline
+ *
+ * Tests the complete flow: Results → Aggregate → Evaluate Claims → Render
+ */
+export {};
+//# sourceMappingURL=framework-pipeline.integration.test.d.ts.map

package/dist/__tests__/framework-pipeline.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"framework-pipeline.integration.test.d.ts","sourceRoot":"","sources":["../../src/__tests__/framework-pipeline.integration.test.ts"],"names":[],"mappings":"AAAA;;;;GAIG"}

package/dist/__tests__/framework-pipeline.integration.test.js

@@ -0,0 +1,413 @@
+/**
+ * Integration tests for Framework Pipeline
+ *
+ * Tests the complete flow: Results → Aggregate → Evaluate Claims → Render
+ */
+import { describe, it } from "node:test";
+import { strict as assert } from "node:assert";
+import { aggregateResults } from "../aggregation/pipeline.js";
+import { createClaimSummary, evaluateClaims } from "../claims/evaluator.js";
+import { ResultCollector } from "../collector/result-collector.js";
+import { LaTeXRenderer } from "../renderers/latex-renderer.js";
+import { createMockResult } from "./test-helpers.js";
+describe("Framework Pipeline Integration", () => {
+    /**
+     * Create a realistic set of evaluation results for testing
+     */
+    const createTestResults = () => {
+        const results = [];
+        // Degree-Prioritised (primary) - faster, better hub avoidance
+        for (let index = 0; index < 10; index++) {
+            results.push(createMockResult({
+                run: {
+                    runId: `dp-run-${index}`,
+                    sut: "degree-prioritised-v1.0.0",
+                    sutRole: "primary",
+                    caseId: `case-${index}`,
+                    caseClass: "scale-free",
+                },
+                correctness: {
+                    expectedExists: true,
+                    producedOutput: true,
+                    valid: true,
+                    matchesExpected: true,
+                },
+                metrics: {
+                    numeric: {
+                        "execution-time": 80 + Math.random() * 20,
+                        "nodes-expanded": 40 + Math.random() * 10,
+                        "hub-traversal": 5 + Math.random() * 5,
+                        "path-diversity": 0.75 + Math.random() * 0.15,
+                    },
+                },
+            }));
+        }
+        // Standard BFS (baseline) - slower, more hub visits
+        for (let index = 0; index < 10; index++) {
+            results.push(createMockResult({
+                run: {
+                    runId: `bfs-run-${index}`,
+                    sut: "standard-bfs-v1.0.0",
+                    sutRole: "baseline",
+                    caseId: `case-${index}`,
+                    caseClass: "scale-free",
+                },
+                correctness: {
+                    expectedExists: true,
+                    producedOutput: true,
+                    valid: true,
+                    matchesExpected: true,
+                },
+                metrics: {
+                    numeric: {
+                        "execution-time": 120 + Math.random() * 30,
+                        "nodes-expanded": 70 + Math.random() * 20,
+                        "hub-traversal": 20 + Math.random() * 10,
+                        "path-diversity": 0.6 + Math.random() * 0.15,
+                    },
+                },
+            }));
+        }
+        // Frontier-Balanced (baseline) - between the two
+        for (let index = 0; index < 10; index++) {
+            results.push(createMockResult({
+                run: {
+                    runId: `fb-run-${index}`,
+                    sut: "frontier-balanced-v1.0.0",
+                    sutRole: "baseline",
+                    caseId: `case-${index}`,
+                    caseClass: "scale-free",
+                },
+                correctness: {
+                    expectedExists: true,
+                    producedOutput: true,
+                    valid: true,
+                    matchesExpected: true,
+                },
+                metrics: {
+                    numeric: {
+                        "execution-time": 100 + Math.random() * 25,
+                        "nodes-expanded": 55 + Math.random() * 15,
+                        "hub-traversal": 12 + Math.random() * 8,
+                        "path-diversity": 0.65 + Math.random() * 0.15,
+                    },
+                },
+            }));
+        }
+        return results;
+    };
+    it("should flow: results → aggregate → evaluate claims → render", () => {
+        // Step 1: Collect results
+        const collector = new ResultCollector();
+        const results = createTestResults();
+        collector.recordBatch(results);
+        assert.strictEqual(collector.count, 30);
+        assert.strictEqual(collector.getUniqueSuts().length, 3);
+        // Step 2: Aggregate
+        const aggregates = aggregateResults(collector.getAll());
+        assert.ok(aggregates.length > 0);
+        // Find primary aggregate
+        const dpAggregate = aggregates.find((a) => a.sut === "degree-prioritised-v1.0.0");
+        assert.ok(dpAggregate);
+        assert.ok(dpAggregate?.metrics["execution-time"]);
+        assert.strictEqual(dpAggregate?.group.runCount, 10);
+        // Step 3: Define and evaluate claims
+        const claims = [
+            {
+                claimId: "C1",
+                description: "DP is faster than BFS",
+                sut: "degree-prioritised-v1.0.0",
+                baseline: "standard-bfs-v1.0.0",
+                metric: "execution-time",
+                direction: "less",
+                scope: "global",
+            },
+            {
+                claimId: "C2",
+                description: "DP visits fewer hubs than BFS",
+                sut: "degree-prioritised-v1.0.0",
+                baseline: "standard-bfs-v1.0.0",
+                metric: "hub-traversal",
+                direction: "less",
+                scope: "global",
+            },
+            {
+                claimId: "C3",
+                description: "DP has higher path diversity than BFS",
+                sut: "degree-prioritised-v1.0.0",
+                baseline: "standard-bfs-v1.0.0",
+                metric: "path-diversity",
+                direction: "greater",
+                scope: "global",
+            },
+        ];
+        const evaluations = evaluateClaims(claims, aggregates);
+        assert.strictEqual(evaluations.length, 3);
+        assert.ok(evaluations.every((e) => e.status === "satisfied" || e.status === "violated" || e.status === "inconclusive"));
+        // Step 4: Create summary
+        const summary = createClaimSummary(evaluations);
+        assert.strictEqual(summary.summary.total, 3);
+        assert.strictEqual(summary.summary.satisfied + summary.summary.violated + summary.summary.inconclusive, 3);
+        // Step 5: Render
+        const renderer = new LaTeXRenderer();
+        const tableSpec = {
+            id: "performance-comparison",
+            filename: "06-performance-comparison.tex",
+            label: "tab:performance-comparison",
+            caption: "Performance comparison across methods",
+            columns: [
+                { key: "method", header: "Method", align: "l" },
+                { key: "execTime", header: "Time (ms)", align: "r" },
+                { key: "nodesExpanded", header: "Nodes", align: "r" },
+            ],
+            extractData: (aggs) => aggs.map((a) => ({
+                method: a.sut.replace("-v1.0.0", ""),
+                execTime: a.metrics["execution-time"]?.mean.toFixed(1),
+                nodesExpanded: a.metrics["nodes-expanded"]?.mean.toFixed(0),
+            })),
+        };
+        const tableOutput = renderer.renderTable(aggregates, tableSpec);
+        const claimOutput = renderer.renderClaimSummary(evaluations);
+        assert.ok(tableOutput.content.includes(String.raw `\begin{table}`));
+        assert.ok(tableOutput.content.includes("Performance comparison"));
+        assert.ok(claimOutput.content.includes("Claim"));
+        assert.ok(claimOutput.content.includes("Status"));
+    });
+    it("should handle the complete pipeline with real-world-like data", () => {
+        // Create results with deterministic values for predictable testing
+        const results = [];
+        // Primary: consistently better
+        for (let index = 0; index < 5; index++) {
+            results.push(createMockResult({
+                run: {
+                    runId: `primary-${index}`,
+                    sut: "primary-algorithm",
+                    sutRole: "primary",
+                    caseId: `case-${index}`,
+                },
+                metrics: {
+                    numeric: {
+                        "execution-time": 50,
+                        "quality-score": 0.9,
+                    },
+                },
+            }));
+        }
+        // Baseline: consistently worse
+        for (let index = 0; index < 5; index++) {
+            results.push(createMockResult({
+                run: {
+                    runId: `baseline-${index}`,
+                    sut: "baseline-algorithm",
+                    sutRole: "baseline",
+                    caseId: `case-${index}`,
+                },
+                metrics: {
+                    numeric: {
+                        "execution-time": 100,
+                        "quality-score": 0.7,
+                    },
+                },
+            }));
+        }
+        // Aggregate
+        const aggregates = aggregateResults(results, { groupByCaseClass: false });
+        const primaryAgg = aggregates.find((a) => a.sut === "primary-algorithm");
+        const baselineAgg = aggregates.find((a) => a.sut === "baseline-algorithm");
+        assert.strictEqual(primaryAgg?.metrics["execution-time"].mean, 50);
+        assert.strictEqual(baselineAgg?.metrics["execution-time"].mean, 100);
+        // Evaluate claims
+        const claims = [
+            {
+                claimId: "SPEED",
+                description: "Primary is faster",
+                sut: "primary-algorithm",
+                baseline: "baseline-algorithm",
+                metric: "execution-time",
+                direction: "less",
+                scope: "global",
+            },
+            {
+                claimId: "QUALITY",
+                description: "Primary has higher quality",
+                sut: "primary-algorithm",
+                baseline: "baseline-algorithm",
+                metric: "quality-score",
+                direction: "greater",
+                scope: "global",
+            },
+        ];
+        const evaluations = evaluateClaims(claims, aggregates);
+        // Both claims should be satisfied
+        assert.strictEqual(evaluations.find((e) => e.claim.claimId === "SPEED")?.status, "satisfied");
+        assert.strictEqual(evaluations.find((e) => e.claim.claimId === "QUALITY")?.status, "satisfied");
+        // Evidence should show correct values
+        const speedEvidence = evaluations.find((e) => e.claim.claimId === "SPEED")?.evidence;
+        assert.strictEqual(speedEvidence?.primaryValue, 50);
+        assert.strictEqual(speedEvidence?.baselineValue, 100);
+        assert.strictEqual(speedEvidence?.delta, -50); // 50 - 100 = -50
+    });
+    it("should properly serialize and deserialize through ResultCollector", () => {
+        const collector = new ResultCollector();
+        const results = createTestResults();
+        // Record results
+        collector.recordBatch(results);
+        // Serialize
+        const batch = collector.serialize({ experimentName: "test-exp" });
+        assert.strictEqual(batch.version, "1.0.0");
+        assert.strictEqual(batch.results.length, 30);
+        assert.strictEqual(batch.metadata?.experimentName, "test-exp");
+        // Load into new collector
+        const newCollector = new ResultCollector();
+        newCollector.load(batch);
+        assert.strictEqual(newCollector.count, 30);
+        assert.strictEqual(newCollector.getUniqueSuts().length, 3);
+        // Verify aggregation works on loaded data
+        const aggregates = aggregateResults(newCollector.getAll());
+        assert.ok(aggregates.length > 0);
+    });
+    it("should generate multiple tables from same aggregates", () => {
+        const results = createTestResults();
+        const aggregates = aggregateResults(results);
+        const renderer = new LaTeXRenderer();
+        const specs = [
+            {
+                id: "runtime",
+                filename: "runtime.tex",
+                label: "tab:runtime",
+                caption: "Runtime comparison",
+                columns: [
+                    { key: "method", header: "Method", align: "l" },
+                    { key: "time", header: "Time (ms)", align: "r" },
+                ],
+                extractData: (aggs) => aggs.map((a) => ({
+                    method: a.sut,
+                    time: a.metrics["execution-time"]?.mean.toFixed(1),
+                })),
+            },
+            {
+                id: "quality",
+                filename: "quality.tex",
+                label: "tab:quality",
+                caption: "Quality metrics",
+                columns: [
+                    { key: "method", header: "Method", align: "l" },
+                    { key: "diversity", header: "Diversity", align: "r" },
+                ],
+                extractData: (aggs) => aggs.map((a) => ({
+                    method: a.sut,
+                    diversity: a.metrics["path-diversity"]?.mean.toFixed(3),
+                })),
+            },
+        ];
+        const outputs = renderer.renderAll(aggregates, specs);
+        assert.strictEqual(outputs.length, 2);
+        assert.strictEqual(outputs[0].id, "runtime");
+        assert.strictEqual(outputs[1].id, "quality");
+        assert.ok(outputs[0].content.includes("Runtime comparison"));
+        assert.ok(outputs[1].content.includes("Quality metrics"));
+    });
+    it("should handle claims with scope constraints", () => {
+        // Create results with different case classes
+        const results = [];
+        // Scale-free: primary is better
+        for (let index = 0; index < 5; index++) {
+            results.push(createMockResult({
+                run: {
+                    runId: `dp-sf-${index}`,
+                    sut: "degree-prioritised-v1.0.0",
+                    sutRole: "primary",
+                    caseId: `sf-case-${index}`,
+                    caseClass: "scale-free",
+                },
+                metrics: { numeric: { "execution-time": 50 } },
+            }));
+            results.push(createMockResult({
+                run: {
+                    runId: `bfs-sf-${index}`,
+                    sut: "standard-bfs-v1.0.0",
+                    sutRole: "baseline",
+                    caseId: `sf-case-${index}`,
+                    caseClass: "scale-free",
+                },
+                metrics: { numeric: { "execution-time": 100 } },
+            }));
+        }
+        // Random: baseline is better (hypothetically)
+        for (let index = 0; index < 5; index++) {
+            results.push(createMockResult({
+                run: {
+                    runId: `dp-rand-${index}`,
+                    sut: "degree-prioritised-v1.0.0",
+                    sutRole: "primary",
+                    caseId: `rand-case-${index}`,
+                    caseClass: "random",
+                },
+                metrics: { numeric: { "execution-time": 100 } },
+            }));
+            results.push(createMockResult({
+                run: {
+                    runId: `bfs-rand-${index}`,
+                    sut: "standard-bfs-v1.0.0",
+                    sutRole: "baseline",
+                    caseId: `rand-case-${index}`,
+                    caseClass: "random",
+                },
+                metrics: { numeric: { "execution-time": 100 } },
+            }));
+        }
+        const aggregates = aggregateResults(results);
+        // Claim scoped to scale-free should be satisfied
+        const scopedClaim = {
+            claimId: "SF-SPEED",
+            description: "DP is faster on scale-free graphs",
+            sut: "degree-prioritised-v1.0.0",
+            baseline: "standard-bfs-v1.0.0",
+            metric: "execution-time",
+            direction: "less",
+            scope: "caseClass",
+            scopeConstraints: { caseClass: "scale-free" },
+        };
+        const evaluations = evaluateClaims([scopedClaim], aggregates);
+        assert.strictEqual(evaluations[0].status, "satisfied");
+    });
+    it("should detect violated claims correctly", () => {
+        // Create results where the claim will be violated
+        const results = [];
+        // Primary is SLOWER than baseline (claim violation)
+        for (let index = 0; index < 5; index++) {
+            results.push(createMockResult({
+                run: {
+                    runId: `primary-${index}`,
+                    sut: "primary-algorithm",
+                    sutRole: "primary",
+                    caseId: `case-${index}`,
+                },
+                metrics: { numeric: { "execution-time": 150 } },
+            }));
+            results.push(createMockResult({
+                run: {
+                    runId: `baseline-${index}`,
+                    sut: "baseline-algorithm",
+                    sutRole: "baseline",
+                    caseId: `case-${index}`,
+                },
+                metrics: { numeric: { "execution-time": 100 } },
+            }));
+        }
+        const aggregates = aggregateResults(results, { groupByCaseClass: false });
+        const claim = {
+            claimId: "VIOLATED",
+            description: "Primary should be faster (but isn't)",
+            sut: "primary-algorithm",
+            baseline: "baseline-algorithm",
+            metric: "execution-time",
+            direction: "less",
+            scope: "global",
+        };
+        const evaluations = evaluateClaims([claim], aggregates);
+        assert.strictEqual(evaluations[0].status, "violated");
+        assert.ok(evaluations[0].evidence.delta > 0); // 150 - 100 = 50
+    });
+});
+//# sourceMappingURL=framework-pipeline.integration.test.js.map

package/dist/__tests__/framework-pipeline.integration.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"framework-pipeline.integration.test.js","sourceRoot":"","sources":["../../src/__tests__/framework-pipeline.integration.test.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,WAAW,CAAC;AACzC,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,aAAa,CAAC;AAE/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAC9D,OAAO,EAAE,kBAAkB,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAC5E,OAAO,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AACnE,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAI/D,OAAO,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAErD,QAAQ,CAAC,gCAAgC,EAAE,GAAG,EAAE;IAC/C;;OAEG;IACH,MAAM,iBAAiB,GAAG,GAAuB,EAAE;QAClD,MAAM,OAAO,GAAuB,EAAE,CAAC;QAEvC,8DAA8D;QAC9D,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC;YACzC,OAAO,CAAC,IAAI,CACX,gBAAgB,CAAC;gBAChB,GAAG,EAAE;oBACJ,KAAK,EAAE,UAAU,KAAK,EAAE;oBACxB,GAAG,EAAE,2BAA2B;oBAChC,OAAO,EAAE,SAAS;oBAClB,MAAM,EAAE,QAAQ,KAAK,EAAE;oBACvB,SAAS,EAAE,YAAY;iBACvB;gBACD,WAAW,EAAE;oBACZ,cAAc,EAAE,IAAI;oBACpB,cAAc,EAAE,IAAI;oBACpB,KAAK,EAAE,IAAI;oBACX,eAAe,EAAE,IAAI;iBACrB;gBACD,OAAO,EAAE;oBACR,OAAO,EAAE;wBACR,gBAAgB,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE;wBACzC,gBAAgB,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE;wBACzC,eAAe,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;wBACtC,gBAAgB,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI;qBAC7C;iBACD;aACD,CAAC,CACF,CAAC;QACH,CAAC;QAED,oDAAoD;QACpD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC;YACzC,OAAO,CAAC,IAAI,CACX,gBAAgB,CAAC;gBAChB,GAAG,EAAE;oBACJ,KAAK,EAAE,WAAW,KAAK,EAAE;oBACzB,GAAG,EAAE,qBAAqB;oBAC1B,OAAO,EAAE,UAAU;oBACnB,MAAM,EAAE,QAAQ,KAAK,EAAE;oBACvB,SAAS,EAAE,YAAY;iBACvB;gBACD,WAAW,EAAE;oBACZ,cAAc,EAAE,IAAI;oBACpB,cAAc,EAAE,IAAI;oBACpB,KAAK,EAAE,IAAI;oBACX,eAAe,EAAE,IAAI;iBACrB;gBACD,OAAO,EAAE;oBACR,OAAO,EAAE;wBACR,gBAAgB,EAAE,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE;wBAC1C,gBAAgB,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE;wBACzC,eAAe,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE;wBACxC,gBAAgB,EAAE,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI;qBAC5C;iBACD;aACD,CAAC,CACF,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC;YACzC,OAAO,CAAC,IAAI,CACX,gBAAgB,CAAC;gBAChB,GAAG,EAAE;oBACJ,KAAK,EAAE,UAAU,KAAK,EAAE;oBACxB,GAAG,EAAE,0BAA0B;oBAC/B,OAAO,EAAE,UAAU;oBACnB,MAAM,EAAE,QAAQ,KAAK,EAAE;oBACvB,SAAS,EAAE,YAAY;iBACvB;gBACD,WAAW,EAAE;oBACZ,cAAc,EAAE,IAAI;oBACpB,cAAc,EAAE,IAAI;oBACpB,KAAK,EAAE,IAAI;oBACX,eAAe,EAAE,IAAI;iBACrB;gBACD,OAAO,EAAE;oBACR,OAAO,EAAE;wBACR,gBAAgB,EAAE,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE;wBAC1C,gBAAgB,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE;wBACzC,eAAe,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;wBACvC,gBAAgB,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI;qBAC7C;iBACD;aACD,CAAC,CACF,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IAChB,CAAC,CAAC;IAEF,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACtE,0BAA0B;QAC1B,MAAM,SAAS,GAAG,IAAI,eAAe,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,SAAS,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAE/B,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACxC,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,aAAa,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAExD,oBAAoB;QACpB,MAAM,UAAU,GAAG,gBAAgB,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;QAExD,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEjC,yBAAyB;QACzB,MAAM,WAAW,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,2BAA2B,CAAC,CAAC;QAClF,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC;QACvB,MAAM,CAAC,EAAE,CAAC,WAAW,EAAE,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,WAAW,CAAC,WAAW,EAAE,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAEpD,qCAAqC;QACrC,MAAM,MAAM,GAAsB;YACjC;gBACC,OAAO,EAAE,IAAI;gBACb,WAAW,EAAE,uBAAuB;gBACpC,GAAG,EAAE,2BAA2B;gBAChC,QAAQ,EAAE,qBAAqB;gBAC/B,MAAM,EAAE,gBAAgB;gBACxB,SAAS,EAAE,MAAM;gBACjB,KAAK,EAAE,QAAQ;aACf;YACD;gBACC,OAAO,EAAE,IAAI;gBACb,WAAW,EAAE,+BAA+B;gBAC5C,GAAG,EAAE,2BAA2B;gBAChC,QAAQ,EAAE,qBAAqB;gBAC/B,MAAM,EAAE,eAAe;gBACvB,SAAS,EAAE,MAAM;gBACjB,KAAK,EAAE,QAAQ;aACf;YACD;gBACC,OAAO,EAAE,IAAI;gBACb,WAAW,EAAE,uCAAuC;gBACpD,GAAG,EAAE,2BAA2B;gBAChC,QAAQ,EAAE,qBAAqB;gBAC/B,MAAM,EAAE,gBAAgB;gBACxB,SAAS,EAAE,SAAS;gBACpB,KAAK,EAAE,QAAQ;aACf;SACD,CAAC;QAEF,MAAM,WAAW,GAAG,cAAc,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAEvD,MAAM,CAAC,WAAW,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,EAAE,CACR,WAAW,CAAC,KAAK,CAChB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,IAAI,CAAC,CAAC,MAAM,KAAK,UAAU,IAAI,CAAC,CAAC,MAAM,KAAK,cAAc,CACzF,CACD,CAAC;QAEF,yBAAyB;QACzB,MAAM,OAAO,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;QAEhD,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,WAAW,CACjB,OAAO,CAAC,OAAO,CAAC,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,YAAY,EACnF,CAAC,CACD,CAAC;QAEF,iBAAiB;QACjB,MAAM,QAAQ,GAAG,IAAI,aAAa,EAAE,CAAC;QAErC,MAAM,SAAS,GAAoB;YAClC,EAAE,EAAE,wBAAwB;YAC5B,QAAQ,EAAE,+BAA+B;YACzC,KAAK,EAAE,4BAA4B;YACnC,OAAO,EAAE,uCAAuC;YAChD,OAAO,EAAE;gBACR,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE;gBAC/C,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,EAAE;gBACpD,EAAE,GAAG,EAAE,eAAe,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE;aACrD;YACD,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CACrB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAChB,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;gBACpC,QAAQ,EAAE,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;gBACtD,aAAa,EAAE,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;aAC3D,CAAC,CAAC;SACJ,CAAC;QAEF,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAChE,MAAM,WAAW,GAAG,QAAQ,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;QAE7D,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAA,eAAe,CAAC,CAAC,CAAC;QACnE,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,wBAAwB,CAAC,CAAC,CAAC;QAClE,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;QACxE,mEAAmE;QACnE,MAAM,OAAO,GAAuB,EAAE,CAAC;QAEvC,+BAA+B;QAC/B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACxC,OAAO,CAAC,IAAI,CACX,gBAAgB,CAAC;gBAChB,GAAG,EAAE;oBACJ,KAAK,EAAE,WAAW,KAAK,EAAE;oBACzB,GAAG,EAAE,mBAAmB;oBACxB,OAAO,EAAE,SAAS;oBAClB,MAAM,EAAE,QAAQ,KAAK,EAAE;iBACvB;gBACD,OAAO,EAAE;oBACR,OAAO,EAAE;wBACR,gBAAgB,EAAE,EAAE;wBACpB,eAAe,EAAE,GAAG;qBACpB;iBACD;aACD,CAAC,CACF,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACxC,OAAO,CAAC,IAAI,CACX,gBAAgB,CAAC;gBAChB,GAAG,EAAE;oBACJ,KAAK,EAAE,YAAY,KAAK,EAAE;oBAC1B,GAAG,EAAE,oBAAoB;oBACzB,OAAO,EAAE,UAAU;oBACnB,MAAM,EAAE,QAAQ,KAAK,EAAE;iBACvB;gBACD,OAAO,EAAE;oBACR,OAAO,EAAE;wBACR,gBAAgB,EAAE,GAAG;wBACrB,eAAe,EAAE,GAAG;qBACpB;iBACD;aACD,CAAC,CACF,CAAC;QACH,CAAC;QAED,YAAY;QACZ,MAAM,UAAU,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC,CAAC;QAE1E,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,mBAAmB,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,oBAAoB,CAAC,CAAC;QAE3E,MAAM,CAAC,WAAW,CAAC,UAAU,EAAE,OAAO,CAAC,gBAAgB,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnE,MAAM,CAAC,WAAW,CAAC,WAAW,EAAE,OAAO,CAAC,gBAAgB,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAErE,kBAAkB;QAClB,MAAM,MAAM,GAAsB;YACjC;gBACC,OAAO,EAAE,OAAO;gBAChB,WAAW,EAAE,mBAAmB;gBAChC,GAAG,EAAE,mBAAmB;gBACxB,QAAQ,EAAE,oBAAoB;gBAC9B,MAAM,EAAE,gBAAgB;gBACxB,SAAS,EAAE,MAAM;gBACjB,KAAK,EAAE,QAAQ;aACf;YACD;gBACC,OAAO,EAAE,SAAS;gBAClB,WAAW,EAAE,4BAA4B;gBACzC,GAAG,EAAE,mBAAmB;gBACxB,QAAQ,EAAE,oBAAoB;gBAC9B,MAAM,EAAE,eAAe;gBACvB,SAAS,EAAE,SAAS;gBACpB,KAAK,EAAE,QAAQ;aACf;SACD,CAAC;QAEF,MAAM,WAAW,GAAG,cAAc,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAEvD,kCAAkC;QAClC,MAAM,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,KAAK,OAAO,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;QAC9F,MAAM,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,KAAK,SAAS,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;QAEhG,sCAAsC;QACtC,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,KAAK,OAAO,CAAC,EAAE,QAAQ,CAAC;QACrF,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,YAAY,EAAE,EAAE,CAAC,CAAC;QACpD,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,aAAa,EAAE,GAAG,CAAC,CAAC;QACtD,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,iBAAiB;IACjE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;QAC5E,MAAM,SAAS,GAAG,IAAI,eAAe,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QAEpC,iBAAiB;QACjB,SAAS,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAE/B,YAAY;QACZ,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,EAAE,cAAc,EAAE,UAAU,EAAE,CAAC,CAAC;QAElE,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC3C,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAC7C,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,QAAQ,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;QAE/D,0BAA0B;QAC1B,MAAM,YAAY,GAAG,IAAI,eAAe,EAAE,CAAC;QAC3C,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEzB,MAAM,CAAC,WAAW,CAAC,YAAY,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC3C,MAAM,CAAC,WAAW,CAAC,YAAY,CAAC,aAAa,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAE3D,0CAA0C;QAC1C,MAAM,UAAU,GAAG,gBAAgB,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3D,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC/D,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,UAAU,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC7C,MAAM,QAAQ,GAAG,IAAI,aAAa,EAAE,CAAC;QAErC,MAAM,KAAK,GAAsB;YAChC;gBACC,EAAE,EAAE,SAAS;gBACb,QAAQ,EAAE,aAAa;gBACvB,KAAK,EAAE,aAAa;gBACpB,OAAO,EAAE,oBAAoB;gBAC7B,OAAO,EAAE;oBACR,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE;oBAC/C,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,EAAE;iBAChD;gBACD,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CACrB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBAChB,MAAM,EAAE,CAAC,CAAC,GAAG;oBACb,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;iBAClD,CAAC,CAAC;aACJ;YACD;gBACC,EAAE,EAAE,SAAS;gBACb,QAAQ,EAAE,aAAa;gBACvB,KAAK,EAAE,aAAa;gBACpB,OAAO,EAAE,iBAAiB;gBAC1B,OAAO,EAAE;oBACR,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE;oBAC/C,EAAE,GAAG,EAAE,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,EAAE;iBACrD;gBACD,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CACrB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBAChB,MAAM,EAAE,CAAC,CAAC,GAAG;oBACb,SAAS,EAAE,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;iBACvD,CAAC,CAAC;aACJ;SACD,CAAC;QAEF,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAEtD,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACtC,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAC7C,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAC7C,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAAC,CAAC,CAAC;QAC7D,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,6CAA6C;QAC7C,MAAM,OAAO,GAAuB,EAAE,CAAC;QAEvC,gCAAgC;QAChC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACxC,OAAO,CAAC,IAAI,CACX,gBAAgB,CAAC;gBAChB,GAAG,EAAE;oBACJ,KAAK,EAAE,SAAS,KAAK,EAAE;oBACvB,GAAG,EAAE,2BAA2B;oBAChC,OAAO,EAAE,SAAS;oBAClB,MAAM,EAAE,WAAW,KAAK,EAAE;oBAC1B,SAAS,EAAE,YAAY;iBACvB;gBACD,OAAO,EAAE,EAAE,OAAO,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE,EAAE;aAC9C,CAAC,CACF,CAAC;YACF,OAAO,CAAC,IAAI,CACX,gBAAgB,CAAC;gBAChB,GAAG,EAAE;oBACJ,KAAK,EAAE,UAAU,KAAK,EAAE;oBACxB,GAAG,EAAE,qBAAqB;oBAC1B,OAAO,EAAE,UAAU;oBACnB,MAAM,EAAE,WAAW,KAAK,EAAE;oBAC1B,SAAS,EAAE,YAAY;iBACvB;gBACD,OAAO,EAAE,EAAE,OAAO,EAAE,EAAE,gBAAgB,EAAE,GAAG,EAAE,EAAE;aAC/C,CAAC,CACF,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACxC,OAAO,CAAC,IAAI,CACX,gBAAgB,CAAC;gBAChB,GAAG,EAAE;oBACJ,KAAK,EAAE,WAAW,KAAK,EAAE;oBACzB,GAAG,EAAE,2BAA2B;oBAChC,OAAO,EAAE,SAAS;oBAClB,MAAM,EAAE,aAAa,KAAK,EAAE;oBAC5B,SAAS,EAAE,QAAQ;iBACnB;gBACD,OAAO,EAAE,EAAE,OAAO,EAAE,EAAE,gBAAgB,EAAE,GAAG,EAAE,EAAE;aAC/C,CAAC,CACF,CAAC;YACF,OAAO,CAAC,IAAI,CACX,gBAAgB,CAAC;gBAChB,GAAG,EAAE;oBACJ,KAAK,EAAE,YAAY,KAAK,EAAE;oBAC1B,GAAG,EAAE,qBAAqB;oBAC1B,OAAO,EAAE,UAAU;oBACnB,MAAM,EAAE,aAAa,KAAK,EAAE;oBAC5B,SAAS,EAAE,QAAQ;iBACnB;gBACD,OAAO,EAAE,EAAE,OAAO,EAAE,EAAE,gBAAgB,EAAE,GAAG,EAAE,EAAE;aAC/C,CAAC,CACF,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAE7C,iDAAiD;QACjD,MAAM,WAAW,GAAoB;YACpC,OAAO,EAAE,UAAU;YACnB,WAAW,EAAE,mCAAmC;YAChD,GAAG,EAAE,2BAA2B;YAChC,QAAQ,EAAE,qBAAqB;YAC/B,MAAM,EAAE,gBAAgB;YACxB,SAAS,EAAE,MAAM;YACjB,KAAK,EAAE,WAAW;YAClB,gBAAgB,EAAE,EAAE,SAAS,EAAE,YAAY,EAAE;SAC7C,CAAC;QAEF,MAAM,WAAW,GAAG,cAAc,CAAC,CAAC,WAAW,CAAC,EAAE,UAAU,CAAC,CAAC;QAE9D,MAAM,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,kDAAkD;QAClD,MAAM,OAAO,GAAuB,EAAE,CAAC;QAEvC,oDAAoD;QACpD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACxC,OAAO,CAAC,IAAI,CACX,gBAAgB,CAAC;gBAChB,GAAG,EAAE;oBACJ,KAAK,EAAE,WAAW,KAAK,EAAE;oBACzB,GAAG,EAAE,mBAAmB;oBACxB,OAAO,EAAE,SAAS;oBAClB,MAAM,EAAE,QAAQ,KAAK,EAAE;iBACvB;gBACD,OAAO,EAAE,EAAE,OAAO,EAAE,EAAE,gBAAgB,EAAE,GAAG,EAAE,EAAE;aAC/C,CAAC,CACF,CAAC;YACF,OAAO,CAAC,IAAI,CACX,gBAAgB,CAAC;gBAChB,GAAG,EAAE;oBACJ,KAAK,EAAE,YAAY,KAAK,EAAE;oBAC1B,GAAG,EAAE,oBAAoB;oBACzB,OAAO,EAAE,UAAU;oBACnB,MAAM,EAAE,QAAQ,KAAK,EAAE;iBACvB;gBACD,OAAO,EAAE,EAAE,OAAO,EAAE,EAAE,gBAAgB,EAAE,GAAG,EAAE,EAAE;aAC/C,CAAC,CACF,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC,CAAC;QAE1E,MAAM,KAAK,GAAoB;YAC9B,OAAO,EAAE,UAAU;YACnB,WAAW,EAAE,sCAAsC;YACnD,GAAG,EAAE,mBAAmB;YACxB,QAAQ,EAAE,oBAAoB;YAC9B,MAAM,EAAE,gBAAgB;YACxB,SAAS,EAAE,MAAM;YACjB,KAAK,EAAE,QAAQ;SACf,CAAC;QAEF,MAAM,WAAW,GAAG,cAAc,CAAC,CAAC,KAAK,CAAC,EAAE,UAAU,CAAC,CAAC;QAExD,MAAM,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACtD,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,iBAAiB;IAChE,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC"}

package/dist/__tests__/registry-executor.integration.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Integration tests for SUT Registry and Case Registry
+ */
+export {};
+//# sourceMappingURL=registry-executor.integration.test.d.ts.map

package/dist/__tests__/registry-executor.integration.test.d.ts.map

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