@opensip-cli/fitness 0.1.0

package/dist/framework/import-graph.js

@@ -0,0 +1,217 @@
+// @fitness-ignore-file toctou-race-condition -- Tarjan's SCC strongConnect() walks Maps/Sets local to the function; entirely synchronous graph traversal, no async gap, safe in single-threaded Node.js
+/**
+ * @fileoverview Project-wide import graph builder.
+ *
+ * Builds a file-level dependency graph from a set of TypeScript/JavaScript
+ * source files, plus a Tarjan's strongly-connected-components implementation
+ * for cycle detection. Used by structural-drift checks like
+ * circular-import-detection and module-coupling-fan-out.
+ *
+ * Module resolution is deliberately a heuristic: relative imports are
+ * resolved by trying common extension/index.ts suffixes; bare specifiers
+ * (npm packages) are dropped; tsconfig path aliases are NOT resolved
+ * (treated as unresolved — they simply don't appear as edges in the graph).
+ *
+ * This matches the heuristic the existing `phantom-dependency-detection`
+ * check uses, which has been shipping reliably. Adding tsconfig-aware
+ * resolution is a follow-up plan.
+ */
+import * as path from 'node:path';
+import ts from 'typescript';
+import { getSharedSourceFile } from './parse-cache.js';
+// =============================================================================
+// PUBLIC API
+// =============================================================================
+/**
+ * Build an import graph from a collection of file paths and their content.
+ *
+ * Each file's TS AST is walked for top-level `import` and `export ... from`
+ * declarations. Relative specifiers (`./foo`, `../bar/baz.js`) are resolved
+ * against the importing file's directory using the heuristic in
+ * `resolveRelativeSpecifier`. Bare specifiers (`react`, `lodash`) are
+ * dropped — they don't represent intra-project edges.
+ *
+ * Files that fail to parse are still added as nodes (with no edges) so the
+ * graph remains complete.
+ */
+export function buildImportGraph(files) {
+    const nodes = new Set(files.keys());
+    const outbound = new Map();
+    const inbound = new Map();
+    // Initialize empty edge sets for every node so callers can safely
+    // outbound.get(file) without checking for undefined.
+    for (const node of nodes) {
+        outbound.set(node, new Set());
+        inbound.set(node, new Set());
+    }
+    for (const [filePath, content] of files) {
+        const specifiers = extractImportSpecifiers(filePath, content);
+        for (const spec of specifiers) {
+            const resolved = resolveRelativeSpecifier(filePath, spec, nodes);
+            if (resolved !== null) {
+                outbound.get(filePath).add(resolved);
+                inbound.get(resolved).add(filePath);
+            }
+        }
+    }
+    return { nodes, outbound, inbound };
+}
+/**
+ * Find strongly-connected components in the graph using Tarjan's algorithm.
+ *
+ * Returns an array of SCCs, each represented as an array of node names. SCCs
+ * of size 1 represent a node with no cycle (or a self-loop, which is rare in
+ * import graphs). Cycle-detection callers typically filter to `scc.length > 1`
+ * to get only real multi-file cycles.
+ *
+ * Algorithm: standard iterative Tarjan's SCC. O(V + E), single pass.
+ */
+export function findStronglyConnectedComponents(graph) {
+    const indexOf = new Map();
+    const lowlinkOf = new Map();
+    const onStack = new Set();
+    const stack = [];
+    const sccs = [];
+    let nextIndex = 0;
+    // eslint-disable-next-line sonarjs/cognitive-complexity -- iterative Tarjan SCC: explicit stack to avoid recursion; the algorithm is canonical and reads cleanest as a single function
+    function strongConnect(start) {
+        const callStack = [];
+        indexOf.set(start, nextIndex);
+        lowlinkOf.set(start, nextIndex);
+        nextIndex++;
+        stack.push(start);
+        onStack.add(start);
+        callStack.push({
+            node: start,
+            neighbors: [...(graph.outbound.get(start) ?? [])],
+            next: 0,
+        });
+        while (callStack.length > 0) {
+            const frame = callStack.at(-1);
+            if (frame.next < frame.neighbors.length) {
+                const w = frame.neighbors[frame.next];
+                frame.next++;
+                if (!indexOf.has(w)) {
+                    // Recurse into w.
+                    indexOf.set(w, nextIndex);
+                    lowlinkOf.set(w, nextIndex);
+                    nextIndex++;
+                    stack.push(w);
+                    onStack.add(w);
+                    callStack.push({
+                        node: w,
+                        neighbors: [...(graph.outbound.get(w) ?? [])],
+                        next: 0,
+                    });
+                    continue;
+                }
+                if (onStack.has(w)) {
+                    // Back edge — update v's lowlink.
+                    const vLow = lowlinkOf.get(frame.node);
+                    const wIdx = indexOf.get(w);
+                    if (wIdx < vLow)
+                        lowlinkOf.set(frame.node, wIdx);
+                }
+                continue;
+            }
+            // All neighbors processed — finalize this node.
+            const v = frame.node;
+            const vLow = lowlinkOf.get(v);
+            const vIdx = indexOf.get(v);
+            if (vLow === vIdx) {
+                // v is the root of an SCC — pop until v is removed.
+                const scc = [];
+                let w;
+                do {
+                    w = stack.pop();
+                    onStack.delete(w);
+                    scc.push(w);
+                } while (w !== v);
+                sccs.push(scc);
+            }
+            callStack.pop();
+            // Propagate lowlink up to the parent frame.
+            if (callStack.length > 0) {
+                const parent = callStack.at(-1);
+                const parentLow = lowlinkOf.get(parent.node);
+                if (vLow < parentLow)
+                    lowlinkOf.set(parent.node, vLow);
+            }
+        }
+    }
+    for (const node of graph.nodes) {
+        if (!indexOf.has(node)) {
+            strongConnect(node);
+        }
+    }
+    return sccs;
+}
+// =============================================================================
+// INTERNAL HELPERS
+// =============================================================================
+/** Walk the AST and collect top-level import / export-from specifiers. */
+function extractImportSpecifiers(filePath, content) {
+    const sourceFile = getSharedSourceFile(filePath, content);
+    if (sourceFile === null)
+        return [];
+    const specifiers = [];
+    for (const stmt of sourceFile.statements) {
+        // import foo from './bar';  import './side-effect';  import * as ns from './m';
+        if (ts.isImportDeclaration(stmt) && ts.isStringLiteral(stmt.moduleSpecifier)) {
+            specifiers.push(stmt.moduleSpecifier.text);
+            continue;
+        }
+        // export * from './foo';   export { x } from './foo';
+        if (ts.isExportDeclaration(stmt) &&
+            stmt.moduleSpecifier !== undefined &&
+            ts.isStringLiteral(stmt.moduleSpecifier)) {
+            specifiers.push(stmt.moduleSpecifier.text);
+        }
+    }
+    return specifiers;
+}
+/**
+ * Resolve a module specifier to an actual file path in the project, or
+ * return null if the specifier is non-relative (npm package, path alias) or
+ * doesn't resolve to a known project file.
+ *
+ * Supports:
+ *   - `./foo` → `<dir>/foo.ts`, `.tsx`, `/index.ts`, `/index.tsx`
+ *   - `./foo.js` → `<dir>/foo.ts` (ESM extension swap, common in TS+ESM)
+ *   - `./foo.ts` → `<dir>/foo.ts` (literal)
+ *   - `../bar/baz` → resolved relative to importer's directory
+ *
+ * Does NOT support:
+ *   - tsconfig `paths` aliases (deferred per plan)
+ *   - npm packages (correctly dropped — out of scope for intra-project graph)
+ */
+function resolveRelativeSpecifier(importerPath, specifier, knownPaths) {
+    // Only relative specifiers participate in the intra-project graph.
+    if (!specifier.startsWith('.'))
+        return null;
+    const importerDir = path.dirname(importerPath);
+    const base = path.resolve(importerDir, specifier);
+    // Try the candidate paths in priority order. The first one that exists in
+    // the project's file set wins.
+    const candidates = [base];
+    // 1. Literal path (specifier already includes extension).
+    // 2. ESM extension swap: `.js` → `.ts` / `.tsx` (TypeScript ESM convention).
+    if (base.endsWith('.js')) {
+        candidates.push(base.slice(0, -3) + '.ts', base.slice(0, -3) + '.tsx');
+    }
+    if (base.endsWith('.jsx')) {
+        candidates.push(base.slice(0, -4) + '.tsx');
+    }
+    // 3. Append common extensions if the specifier was extension-less.
+    const hasExt = path.extname(base) !== '';
+    if (!hasExt) {
+        // Direct extensions and index resolution.
+        candidates.push(base + '.ts', base + '.tsx', base + '.js', base + '.jsx', path.join(base, 'index.ts'), path.join(base, 'index.tsx'), path.join(base, 'index.js'), path.join(base, 'index.jsx'));
+    }
+    for (const candidate of candidates) {
+        if (knownPaths.has(candidate))
+            return candidate;
+    }
+    return null;
+}
+//# sourceMappingURL=import-graph.js.map

package/dist/framework/import-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"import-graph.js","sourceRoot":"","sources":["../../src/framework/import-graph.ts"],"names":[],"mappings":"AAAA,wMAAwM;AACxM;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAElC,OAAO,EAAE,MAAM,YAAY,CAAC;AAE5B,OAAO,EAAE,mBAAmB,EAAE,MAAM,kBAAkB,CAAC;AAgBvD,gFAAgF;AAChF,aAAa;AACb,gFAAgF;AAEhF;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAkC;IACjE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE/C,kEAAkE;IAClE,qDAAqD;IACrD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC9B,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,KAAK,EAAE,CAAC;QACxC,MAAM,UAAU,GAAG,uBAAuB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC9D,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,MAAM,QAAQ,GAAG,wBAAwB,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YACjE,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;gBACtB,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACtC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;AACtC,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,+BAA+B,CAC7C,KAAkB;IAElB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAe,EAAE,CAAC;IAC5B,IAAI,SAAS,GAAG,CAAC,CAAC;IAUlB,uLAAuL;IACvL,SAAS,aAAa,CAAC,KAAa;QAClC,MAAM,SAAS,GAAY,EAAE,CAAC;QAE9B,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC9B,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAChC,SAAS,EAAE,CAAC;QACZ,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACnB,SAAS,CAAC,IAAI,CAAC;YACb,IAAI,EAAE,KAAK;YACX,SAAS,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;YACjD,IAAI,EAAE,CAAC;SACR,CAAC,CAAC;QAEH,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;YAEhC,IAAI,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;gBACxC,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBACtC,KAAK,CAAC,IAAI,EAAE,CAAC;gBAEb,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACpB,kBAAkB;oBAClB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC1B,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC5B,SAAS,EAAE,CAAC;oBACZ,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACd,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACf,SAAS,CAAC,IAAI,CAAC;wBACb,IAAI,EAAE,CAAC;wBACP,SAAS,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;wBAC7C,IAAI,EAAE,CAAC;qBACR,CAAC,CAAC;oBACH,SAAS;gBACX,CAAC;gBAED,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnB,kCAAkC;oBAClC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;oBACxC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;oBAC7B,IAAI,IAAI,GAAG,IAAI;wBAAE,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBACnD,CAAC;gBACD,SAAS;YACX,CAAC;YAED,gDAAgD;YAChD,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;YACrB,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;YAE7B,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB,oDAAoD;gBACpD,MAAM,GAAG,GAAa,EAAE,CAAC;gBACzB,IAAI,CAAS,CAAC;gBACd,GAAG,CAAC;oBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;oBACjB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAClB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACd,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;gBAClB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,CAAC;YAED,SAAS,CAAC,GAAG,EAAE,CAAC;YAEhB,4CAA4C;YAC5C,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,MAAM,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;gBACjC,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAE,CAAC;gBAC9C,IAAI,IAAI,GAAG,SAAS;oBAAE,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,aAAa,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF,0EAA0E;AAC1E,SAAS,uBAAuB,CAAC,QAAgB,EAAE,OAAe;IAChE,MAAM,UAAU,GAAG,mBAAmB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC1D,IAAI,UAAU,KAAK,IAAI;QAAE,OAAO,EAAE,CAAC;IAEnC,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,UAAU,EAAE,CAAC;QACzC,gFAAgF;QAChF,IAAI,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC;YAC7E,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YAC3C,SAAS;QACX,CAAC;QACD,sDAAsD;QACtD,IACE,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC;YAC5B,IAAI,CAAC,eAAe,KAAK,SAAS;YAClC,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,eAAe,CAAC,EACxC,CAAC;YACD,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAS,wBAAwB,CAC/B,YAAoB,EACpB,SAAiB,EACjB,UAA+B;IAE/B,mEAAmE;IACnE,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAE5C,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;IAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAElD,0EAA0E;IAC1E,+BAA+B;IAC/B,MAAM,UAAU,GAAa,CAAC,IAAI,CAAC,CAAC;IAEpC,0DAA0D;IAE1D,6EAA6E;IAC7E,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IACzE,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QAC1B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED,mEAAmE;IACnE,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACzC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,0CAA0C;QAC1C,UAAU,CAAC,IAAI,CACb,IAAI,GAAG,KAAK,EACZ,IAAI,GAAG,MAAM,EACb,IAAI,GAAG,KAAK,EACZ,IAAI,GAAG,MAAM,EACb,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,EAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,EAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,EAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAC7B,CAAC;IACJ,CAAC;IAED,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;IAClD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/framework/memory-profiler.d.ts

@@ -0,0 +1,53 @@
+/**
+ * @fileoverview Memory profiler for fitness checks
+ *
+ * Always-on, low-overhead memory tracking for check execution.
+ * Collects per-check profiles for trending analysis.
+ */
+/** Memory usage profile recorded for a single check execution */
+export interface CheckMemoryProfile {
+    readonly checkId: string;
+    readonly memoryBeforeMB: number;
+    readonly memoryAfterMB: number;
+    readonly memoryDeltaMB: number;
+    readonly violationCount: number;
+    readonly durationMs: number;
+}
+/** Aggregated memory profiling summary across all check executions */
+interface MemoryProfileSummary {
+    readonly prewarmMemoryMB: number;
+    readonly peakMemoryMB: number;
+    readonly checksExceedingThreshold: number;
+    readonly topConsumers: readonly CheckMemoryProfile[];
+    readonly allProfiles: readonly CheckMemoryProfile[];
+}
+/** Low-overhead memory profiler that tracks per-check heap usage during fitness runs */
+declare class MemoryProfiler {
+    private readonly profiles;
+    private prewarmMemoryMB;
+    private peakMemoryMB;
+    private readonly warningThresholdMB;
+    constructor(warningThresholdMB?: number);
+    private takeSnapshot;
+    private bytesToMB;
+    /** Record memory baseline after cache prewarm completes */
+    recordPrewarmComplete(): void;
+    /** Return current heap usage in megabytes */
+    getCurrentMemoryMB(): number;
+    /** Record memory before a check starts; returns the pre-check heap in MB */
+    recordCheckStart(): number;
+    /** Record memory after a check completes and return the check's memory profile */
+    recordCheckComplete(checkId: string, memoryBeforeMB: number, violationCount: number, durationMs: number): CheckMemoryProfile;
+    /** Check whether a memory delta exceeds the configured warning threshold */
+    exceedsThreshold(deltaMB: number): boolean;
+    /** Return the configured warning threshold in megabytes */
+    getWarningThresholdMB(): number;
+    /** Build and return an aggregated summary of all recorded check profiles */
+    getSummary(): MemoryProfileSummary;
+    /** Reset all recorded profiles and counters */
+    reset(): void;
+}
+/** Shared singleton memory profiler instance used across fitness check runs */
+export declare const memoryProfiler: MemoryProfiler;
+export {};
+//# sourceMappingURL=memory-profiler.d.ts.map

package/dist/framework/memory-profiler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-profiler.d.ts","sourceRoot":"","sources":["../../src/framework/memory-profiler.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAWH,iEAAiE;AACjE,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,sEAAsE;AACtE,UAAU,oBAAoB;IAC5B,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,wBAAwB,EAAE,MAAM,CAAC;IAC1C,QAAQ,CAAC,YAAY,EAAE,SAAS,kBAAkB,EAAE,CAAC;IACrD,QAAQ,CAAC,WAAW,EAAE,SAAS,kBAAkB,EAAE,CAAC;CACrD;AAID,wFAAwF;AACxF,cAAM,cAAc;IAClB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAA4B;IACrD,OAAO,CAAC,eAAe,CAAK;IAC5B,OAAO,CAAC,YAAY,CAAK;IACzB,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAS;gBAEhC,kBAAkB,SAAsC;IAIpE,OAAO,CAAC,YAAY;IAWpB,OAAO,CAAC,SAAS;IAIjB,2DAA2D;IAC3D,qBAAqB,IAAI,IAAI;IAM7B,6CAA6C;IAC7C,kBAAkB,IAAI,MAAM;IAK5B,4EAA4E;IAC5E,gBAAgB,IAAI,MAAM;IAI1B,kFAAkF;IAClF,mBAAmB,CACjB,OAAO,EAAE,MAAM,EACf,cAAc,EAAE,MAAM,EACtB,cAAc,EAAE,MAAM,EACtB,UAAU,EAAE,MAAM,GACjB,kBAAkB;IAqBrB,4EAA4E;IAC5E,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO;IAI1C,2DAA2D;IAC3D,qBAAqB,IAAI,MAAM;IAI/B,4EAA4E;IAC5E,UAAU,IAAI,oBAAoB;IAgBlC,+CAA+C;IAC/C,KAAK,IAAI,IAAI;CAKd;AAED,+EAA+E;AAC/E,eAAO,MAAM,cAAc,gBAAuB,CAAC"}

package/dist/framework/memory-profiler.js

@@ -0,0 +1,92 @@
+/**
+ * @fileoverview Memory profiler for fitness checks
+ *
+ * Always-on, low-overhead memory tracking for check execution.
+ * Collects per-check profiles for trending analysis.
+ */
+const DEFAULT_MEMORY_WARNING_THRESHOLD_MB = 200;
+/** Low-overhead memory profiler that tracks per-check heap usage during fitness runs */
+class MemoryProfiler {
+    profiles = [];
+    prewarmMemoryMB = 0;
+    peakMemoryMB = 0;
+    warningThresholdMB;
+    constructor(warningThresholdMB = DEFAULT_MEMORY_WARNING_THRESHOLD_MB) {
+        this.warningThresholdMB = warningThresholdMB;
+    }
+    takeSnapshot() {
+        const mem = process.memoryUsage();
+        return {
+            heapUsed: mem.heapUsed,
+            heapTotal: mem.heapTotal,
+            external: mem.external,
+            arrayBuffers: mem.arrayBuffers,
+            rss: mem.rss,
+        };
+    }
+    bytesToMB(bytes) {
+        return bytes / 1024 / 1024;
+    }
+    /** Record memory baseline after cache prewarm completes */
+    recordPrewarmComplete() {
+        const snapshot = this.takeSnapshot();
+        this.prewarmMemoryMB = this.bytesToMB(snapshot.heapUsed);
+        this.peakMemoryMB = this.prewarmMemoryMB;
+    }
+    /** Return current heap usage in megabytes */
+    getCurrentMemoryMB() {
+        const snapshot = this.takeSnapshot();
+        return this.bytesToMB(snapshot.heapUsed);
+    }
+    /** Record memory before a check starts; returns the pre-check heap in MB */
+    recordCheckStart() {
+        return this.getCurrentMemoryMB();
+    }
+    /** Record memory after a check completes and return the check's memory profile */
+    recordCheckComplete(checkId, memoryBeforeMB, violationCount, durationMs) {
+        const memoryAfterMB = this.getCurrentMemoryMB();
+        const memoryDeltaMB = memoryAfterMB - memoryBeforeMB;
+        if (memoryAfterMB > this.peakMemoryMB) {
+            this.peakMemoryMB = memoryAfterMB;
+        }
+        const profile = {
+            checkId,
+            memoryBeforeMB: Math.round(memoryBeforeMB * 100) / 100,
+            memoryAfterMB: Math.round(memoryAfterMB * 100) / 100,
+            memoryDeltaMB: Math.round(memoryDeltaMB * 100) / 100,
+            violationCount,
+            durationMs,
+        };
+        this.profiles.push(profile);
+        return profile;
+    }
+    /** Check whether a memory delta exceeds the configured warning threshold */
+    exceedsThreshold(deltaMB) {
+        return deltaMB > this.warningThresholdMB;
+    }
+    /** Return the configured warning threshold in megabytes */
+    getWarningThresholdMB() {
+        return this.warningThresholdMB;
+    }
+    /** Build and return an aggregated summary of all recorded check profiles */
+    getSummary() {
+        const sortedProfiles = [...this.profiles].sort((a, b) => b.memoryDeltaMB - a.memoryDeltaMB);
+        const checksExceedingThreshold = this.profiles.filter((p) => p.memoryDeltaMB > this.warningThresholdMB).length;
+        return {
+            prewarmMemoryMB: Math.round(this.prewarmMemoryMB * 100) / 100,
+            peakMemoryMB: Math.round(this.peakMemoryMB * 100) / 100,
+            checksExceedingThreshold,
+            topConsumers: sortedProfiles.slice(0, 10),
+            allProfiles: this.profiles,
+        };
+    }
+    /** Reset all recorded profiles and counters */
+    reset() {
+        this.profiles.length = 0;
+        this.prewarmMemoryMB = 0;
+        this.peakMemoryMB = 0;
+    }
+}
+/** Shared singleton memory profiler instance used across fitness check runs */
+export const memoryProfiler = new MemoryProfiler();
+//# sourceMappingURL=memory-profiler.js.map

package/dist/framework/memory-profiler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-profiler.js","sourceRoot":"","sources":["../../src/framework/memory-profiler.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AA8BH,MAAM,mCAAmC,GAAG,GAAG,CAAC;AAEhD,wFAAwF;AACxF,MAAM,cAAc;IACD,QAAQ,GAAyB,EAAE,CAAC;IAC7C,eAAe,GAAG,CAAC,CAAC;IACpB,YAAY,GAAG,CAAC,CAAC;IACR,kBAAkB,CAAS;IAE5C,YAAY,kBAAkB,GAAG,mCAAmC;QAClE,IAAI,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;IAC/C,CAAC;IAEO,YAAY;QAClB,MAAM,GAAG,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;QAClC,OAAO;YACL,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,GAAG,EAAE,GAAG,CAAC,GAAG;SACb,CAAC;IACJ,CAAC;IAEO,SAAS,CAAC,KAAa;QAC7B,OAAO,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;IAC7B,CAAC;IAED,2DAA2D;IAC3D,qBAAqB;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACrC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC;IAC3C,CAAC;IAED,6CAA6C;IAC7C,kBAAkB;QAChB,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACrC,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAC3C,CAAC;IAED,4EAA4E;IAC5E,gBAAgB;QACd,OAAO,IAAI,CAAC,kBAAkB,EAAE,CAAC;IACnC,CAAC;IAED,kFAAkF;IAClF,mBAAmB,CACjB,OAAe,EACf,cAAsB,EACtB,cAAsB,EACtB,UAAkB;QAElB,MAAM,aAAa,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAChD,MAAM,aAAa,GAAG,aAAa,GAAG,cAAc,CAAC;QAErD,IAAI,aAAa,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YACtC,IAAI,CAAC,YAAY,GAAG,aAAa,CAAC;QACpC,CAAC;QAED,MAAM,OAAO,GAAuB;YAClC,OAAO;YACP,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,GAAG,CAAC,GAAG,GAAG;YACtD,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,GAAG,CAAC,GAAG,GAAG;YACpD,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,GAAG,CAAC,GAAG,GAAG;YACpD,cAAc;YACd,UAAU;SACX,CAAC;QAEF,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5B,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,4EAA4E;IAC5E,gBAAgB,CAAC,OAAe;QAC9B,OAAO,OAAO,GAAG,IAAI,CAAC,kBAAkB,CAAC;IAC3C,CAAC;IAED,2DAA2D;IAC3D,qBAAqB;QACnB,OAAO,IAAI,CAAC,kBAAkB,CAAC;IACjC,CAAC;IAED,4EAA4E;IAC5E,UAAU;QACR,MAAM,cAAc,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;QAE5F,MAAM,wBAAwB,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CACnD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,IAAI,CAAC,kBAAkB,CACjD,CAAC,MAAM,CAAC;QAET,OAAO;YACL,eAAe,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,eAAe,GAAG,GAAG,CAAC,GAAG,GAAG;YAC7D,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC,GAAG,GAAG;YACvD,wBAAwB;YACxB,YAAY,EAAE,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;YACzC,WAAW,EAAE,IAAI,CAAC,QAAQ;SAC3B,CAAC;IACJ,CAAC;IAED,+CAA+C;IAC/C,KAAK;QACH,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;IACxB,CAAC;CACF;AAED,+EAA+E;AAC/E,MAAM,CAAC,MAAM,cAAc,GAAG,IAAI,cAAc,EAAE,CAAC"}

package/dist/framework/parse-cache.d.ts

@@ -0,0 +1,24 @@
+/**
+ * @fileoverview TS SourceFile helper for framework/import-graph.ts.
+ *
+ * Sole export: `getSharedSourceFile`, a TS-specific convenience wrapper
+ * that resolves the TypeScript adapter from the language registry and
+ * parses through the language-aware cache (core/src/languages/
+ * parse-cache.ts), falling back to a direct parse when no adapter is
+ * registered (e.g. unit tests without CLI bootstrap).
+ *
+ * This file no longer re-exports the parse-cache lifecycle/getParseTree
+ * API — `import-graph.ts` is its only internal consumer. New TS check
+ * authors should import the canonical AST helpers from
+ * @opensip-cli/lang-typescript instead.
+ */
+import ts from 'typescript';
+/**
+ * Get a TypeScript SourceFile via the language-aware cache when the TS
+ * adapter is registered, falling back to a direct parse otherwise.
+ *
+ * @internal Used by framework/import-graph.ts. New TS check authors
+ * should import getSharedSourceFile from @opensip-cli/lang-typescript.
+ */
+export declare function getSharedSourceFile(filePath: string, content: string): ts.SourceFile | null;
+//# sourceMappingURL=parse-cache.d.ts.map

package/dist/framework/parse-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parse-cache.d.ts","sourceRoot":"","sources":["../../src/framework/parse-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,EAAE,MAAM,YAAY,CAAC;AAE5B;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,EAAE,CAAC,UAAU,GAAG,IAAI,CAe3F"}

package/dist/framework/parse-cache.js

@@ -0,0 +1,41 @@
+/**
+ * @fileoverview TS SourceFile helper for framework/import-graph.ts.
+ *
+ * Sole export: `getSharedSourceFile`, a TS-specific convenience wrapper
+ * that resolves the TypeScript adapter from the language registry and
+ * parses through the language-aware cache (core/src/languages/
+ * parse-cache.ts), falling back to a direct parse when no adapter is
+ * registered (e.g. unit tests without CLI bootstrap).
+ *
+ * This file no longer re-exports the parse-cache lifecycle/getParseTree
+ * API — `import-graph.ts` is its only internal consumer. New TS check
+ * authors should import the canonical AST helpers from
+ * @opensip-cli/lang-typescript instead.
+ */
+import { getParseTree, currentScope } from '@opensip-cli/core';
+import ts from 'typescript';
+/**
+ * Get a TypeScript SourceFile via the language-aware cache when the TS
+ * adapter is registered, falling back to a direct parse otherwise.
+ *
+ * @internal Used by framework/import-graph.ts. New TS check authors
+ * should import getSharedSourceFile from @opensip-cli/lang-typescript.
+ */
+export function getSharedSourceFile(filePath, content) {
+    const adapter = currentScope()?.languages.get('typescript');
+    if (adapter) {
+        return getParseTree(adapter, filePath, content);
+    }
+    // No adapter registered yet (e.g. unit tests that run without CLI bootstrap).
+    // Fall back to direct parse — preserves prior behavior.
+    try {
+        return ts.createSourceFile(filePath, content, ts.ScriptTarget.Latest, true, ts.ScriptKind.TSX);
+        /* v8 ignore start -- defensive: ts.createSourceFile is permissive (recovers from syntax errors) and effectively does not throw on real input */
+    }
+    catch {
+        // @fitness-ignore-next-line error-handling-quality -- defensive parse-or-null fallback for the no-adapter-bootstrap path; ts.createSourceFile is permissive and effectively unreachable on real input (see v8 ignore above).
+        return null;
+    }
+    /* v8 ignore stop */
+}
+//# sourceMappingURL=parse-cache.js.map

package/dist/framework/parse-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parse-cache.js","sourceRoot":"","sources":["../../src/framework/parse-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC/D,OAAO,EAAE,MAAM,YAAY,CAAC;AAE5B;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,QAAgB,EAAE,OAAe;IACnE,MAAM,OAAO,GAAG,YAAY,EAAE,EAAE,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAC5D,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,YAAY,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAyB,CAAC;IAC1E,CAAC;IACD,8EAA8E;IAC9E,wDAAwD;IACxD,IAAI,CAAC;QACH,OAAO,EAAE,CAAC,gBAAgB,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAC/F,gJAAgJ;IAClJ,CAAC;IAAC,MAAM,CAAC;QACP,6NAA6N;QAC7N,OAAO,IAAI,CAAC;IACd,CAAC;IACD,oBAAoB;AACtB,CAAC"}

package/dist/framework/path-matcher.d.ts

@@ -0,0 +1,86 @@
+/**
+ * @fileoverview PathMatcher - Strategy pattern for file matching
+ *
+ * Provides glob-based file matching with include/exclude patterns.
+ * Supports lazy evaluation and composition.
+ */
+/**
+ * Options for PathMatcher.
+ */
+export interface PathMatcherOptions {
+    /** Root directory to search from */
+    readonly cwd: string;
+    /** Glob patterns to include */
+    readonly include: readonly string[];
+    /** Glob patterns to exclude */
+    readonly exclude: readonly string[];
+    /** Additional exclusion patterns (combined with exclude) */
+    readonly additionalExcludes?: readonly string[];
+}
+/**
+ * Result of file matching operation.
+ */
+export interface MatchResult {
+    /** Matched files (absolute paths) */
+    readonly files: readonly string[];
+    /** Files that were excluded */
+    readonly excluded: readonly string[];
+    /** Time taken for glob operation in ms */
+    readonly durationMs: number;
+}
+/**
+ * Strategy for matching files based on glob patterns.
+ * Supports both custom patterns and composition.
+ *
+ * @example
+ * ```typescript
+ * const matcher = PathMatcher.create({
+ *   cwd: '/path/to/repo',
+ *   include: ['src/**\/*.ts'],
+ *   exclude: ['**\/__tests__/**'],
+ * });
+ * const files = await matcher.files();
+ * ```
+ */
+export declare class PathMatcher {
+    private readonly options;
+    private constructor();
+    /**
+     * Create a PathMatcher from options.
+     */
+    static create(options: PathMatcherOptions): PathMatcher;
+    /**
+     * Get all matching files.
+     * @returns Array of absolute file paths matching the patterns
+     */
+    files(): Promise<readonly string[]>;
+    /**
+     * Get detailed match result including timing.
+     */
+    match(): Promise<MatchResult>;
+    /**
+     * Check if a file matches the patterns.
+     * @param filePath - Absolute path to check
+     * @returns True if file matches include patterns and is not excluded
+     */
+    matches(filePath: string): boolean;
+    /**
+     * Create a new PathMatcher with additional exclusions.
+     */
+    withExcludes(additionalExcludes: readonly string[]): PathMatcher;
+    /**
+     * Create a new PathMatcher that only includes TypeScript files.
+     */
+    typescriptOnly(): PathMatcher;
+    /**
+     * Create a new PathMatcher that excludes test files.
+     */
+    noTests(): PathMatcher;
+    /** Get the current working directory. */
+    get cwd(): string;
+    /** Get the include patterns. */
+    get includePatterns(): readonly string[];
+    /** Get the exclude patterns. */
+    get excludePatterns(): readonly string[];
+}
+//# sourceMappingURL=path-matcher.d.ts.map

package/dist/framework/path-matcher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-matcher.d.ts","sourceRoot":"","sources":["../../src/framework/path-matcher.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,oCAAoC;IACpC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,+BAA+B;IAC/B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,+BAA+B;IAC/B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,4DAA4D;IAC5D,QAAQ,CAAC,kBAAkB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACjD;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,qCAAqC;IACrC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,+BAA+B;IAC/B,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,0CAA0C;IAC1C,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED;;;;;;;;;;;;;GAaG;AACH,qBAAa,WAAW;IACF,OAAO,CAAC,QAAQ,CAAC,OAAO;IAA5C,OAAO;IAEP;;OAEG;IACH,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,kBAAkB,GAAG,WAAW;IAIvD;;;OAGG;IACG,KAAK,IAAI,OAAO,CAAC,SAAS,MAAM,EAAE,CAAC;IAKzC;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,WAAW,CAAC;IAmCnC;;;;OAIG;IACH,OAAO,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IAoBlC;;OAEG;IACH,YAAY,CAAC,kBAAkB,EAAE,SAAS,MAAM,EAAE,GAAG,WAAW;IAOhE;;OAEG;IACH,cAAc,IAAI,WAAW;IAgB7B;;OAEG;IACH,OAAO,IAAI,WAAW;IAUtB,yCAAyC;IACzC,IAAI,GAAG,IAAI,MAAM,CAEhB;IAED,gCAAgC;IAChC,IAAI,eAAe,IAAI,SAAS,MAAM,EAAE,CAEvC;IAED,gCAAgC;IAChC,IAAI,eAAe,IAAI,SAAS,MAAM,EAAE,CAEvC;CACF"}