@nielspeter/eess-ts 0.1.0

package/dist/conditions/reverse-dependency.js

@@ -0,0 +1,275 @@
+import picomatch from 'picomatch';
+import nodePath from 'node:path';
+import { Node, SyntaxKind } from 'ts-morph';
+const graphCache = new WeakMap();
+/**
+ * Build or retrieve the reverse import graph for a project.
+ *
+ * Maps each file path to the list of files that import it.
+ * Cached per ts-morph Project instance — multiple rules in the same
+ * test suite share the same graph. Cache is cleared automatically
+ * when resetProjectCache() creates new ArchProject instances (WeakMap GC).
+ */
+/**
+ * Add an edge to the reverse import graph: targetPath is imported by sf.
+ * Deduplicates entries when `deduplicate` is true (used for re-exports
+ * where the same file may appear via both import and export declarations).
+ */
+function addToGraph(graph, targetPath, sf, deduplicate) {
+    const existing = graph.get(targetPath);
+    if (existing) {
+        if (!deduplicate || !existing.includes(sf)) {
+            existing.push(sf);
+        }
+    }
+    else {
+        graph.set(targetPath, [sf]);
+    }
+}
+/**
+ * Resolve a dynamic import specifier to a project source file.
+ *
+ * Handles relative specifiers with ESM extension mappings (.js→.ts, .jsx→.tsx,
+ * .mjs→.mts) and directory index imports. Non-relative specifiers (bare packages)
+ * are skipped — they resolve to node_modules, which are outside the project.
+ */
+function resolveDynamicImport(fromFile, specifier) {
+    if (!specifier.startsWith('.'))
+        return undefined;
+    const dirPath = fromFile.getDirectory().getPath();
+    const project = fromFile.getProject();
+    // Try the specifier as-is, with ESM extension mappings, and as a directory index
+    const candidates = [
+        specifier,
+        specifier.replace(/\.js$/, '.ts'),
+        specifier.replace(/\.jsx$/, '.tsx'),
+        specifier.replace(/\.mjs$/, '.mts'),
+        specifier + '.ts',
+        specifier + '.tsx',
+        specifier + '/index.ts',
+        specifier + '/index.tsx',
+    ];
+    for (const candidate of candidates) {
+        const absolutePath = nodePath.resolve(dirPath, candidate);
+        const resolved = project.getSourceFile(absolutePath);
+        if (resolved)
+            return resolved;
+    }
+    return undefined;
+}
+/** Index static import declarations from a source file into the reverse graph. */
+function indexStaticImports(graph, sf) {
+    for (const decl of sf.getImportDeclarations()) {
+        const resolved = decl.getModuleSpecifierSourceFile();
+        if (!resolved)
+            continue;
+        addToGraph(graph, resolved.getFilePath(), sf, false);
+    }
+}
+/** Index re-export declarations from a source file into the reverse graph. */
+function indexReExports(graph, sf) {
+    for (const decl of sf.getExportDeclarations()) {
+        const resolved = decl.getModuleSpecifierSourceFile();
+        if (!resolved)
+            continue;
+        addToGraph(graph, resolved.getFilePath(), sf, true);
+    }
+}
+/** Index dynamic import() expressions from a source file into the reverse graph. */
+function indexDynamicImports(graph, sf) {
+    for (const callExpr of sf.getDescendantsOfKind(SyntaxKind.CallExpression)) {
+        if (callExpr.getExpression().getKind() !== SyntaxKind.ImportKeyword)
+            continue;
+        const args = callExpr.getArguments();
+        if (args.length === 0)
+            continue;
+        const arg = args[0];
+        if (!arg)
+            continue;
+        let specifier;
+        if (Node.isStringLiteral(arg) || Node.isNoSubstitutionTemplateLiteral(arg)) {
+            specifier = arg.getLiteralValue();
+        }
+        if (specifier === undefined)
+            continue;
+        const resolved = resolveDynamicImport(sf, specifier);
+        if (resolved) {
+            addToGraph(graph, resolved.getFilePath(), sf, true);
+        }
+    }
+}
+function getReverseImportGraph(sourceFiles) {
+    if (sourceFiles.length === 0)
+        return new Map();
+    const firstFile = sourceFiles[0];
+    if (!firstFile)
+        return new Map();
+    const project = firstFile.getProject();
+    const cached = graphCache.get(project);
+    if (cached)
+        return cached;
+    const graph = new Map();
+    for (const sf of sourceFiles) {
+        indexStaticImports(graph, sf);
+        indexReExports(graph, sf);
+        indexDynamicImports(graph, sf);
+    }
+    graphCache.set(project, graph);
+    return graph;
+}
+// ─── Conditions ──────────────────────────────────────────────────
+/**
+ * Every file that imports this module must match at least one of the globs.
+ *
+ * Enforces barrel/facade patterns: internal modules should only be
+ * imported through their public API (e.g., index.ts).
+ *
+ * Modules with zero importers pass vacuously. Chain `.andShould().beImported()`
+ * if you also want to catch orphaned files.
+ *
+ * Both static `import` declarations and dynamic `import()` expressions with
+ * string-literal specifiers are resolved. `require()` calls are not resolved.
+ */
+export function onlyBeImportedVia(...globs) {
+    const matchers = globs.map((g) => picomatch(g));
+    const quotedGlobs = globs.map((g) => `"${g}"`).join(', ');
+    return {
+        description: `only be imported via ${quotedGlobs}`,
+        evaluate(elements, context) {
+            // Build graph from ALL project files, not just the filtered elements
+            const first = elements[0];
+            const allFiles = first ? first.getProject().getSourceFiles() : [];
+            const graph = getReverseImportGraph(allFiles);
+            const violations = [];
+            for (const sf of elements) {
+                const importers = graph.get(sf.getFilePath()) ?? [];
+                for (const importer of importers) {
+                    const importerPath = importer.getFilePath();
+                    if (!matchers.some((m) => m(importerPath))) {
+                        violations.push({
+                            rule: context.rule,
+                            element: sf.getBaseName(),
+                            file: sf.getFilePath(),
+                            line: 1,
+                            message: `${sf.getBaseName()} is imported by ${importer.getBaseName()} which does not match [${globs.join(', ')}]`,
+                            because: context.because,
+                        });
+                    }
+                }
+            }
+            return violations;
+        },
+    };
+}
+/**
+ * Module must be imported by at least one other file in the project.
+ *
+ * Detects dead/orphaned modules that nobody references.
+ * Use `.excluding('index.ts', 'main.ts')` to skip entry points.
+ *
+ * Both static `import` declarations and dynamic `import()` expressions with
+ * string-literal specifiers are resolved. Modules loaded via `require()` or
+ * dynamic imports with computed specifiers will still be falsely reported.
+ */
+export function beImported() {
+    return {
+        description: 'be imported by at least one other module',
+        evaluate(elements, context) {
+            const first = elements[0];
+            const allFiles = first ? first.getProject().getSourceFiles() : [];
+            const graph = getReverseImportGraph(allFiles);
+            const violations = [];
+            for (const sf of elements) {
+                const importers = graph.get(sf.getFilePath()) ?? [];
+                if (importers.length === 0) {
+                    violations.push({
+                        rule: context.rule,
+                        element: sf.getBaseName(),
+                        file: sf.getFilePath(),
+                        line: 1,
+                        message: `${sf.getBaseName()} is not imported by any other module`,
+                        because: context.because,
+                    });
+                }
+            }
+            return violations;
+        },
+    };
+}
+/**
+ * Every named export in the module must be referenced by at least one other file.
+ *
+ * Uses ts-morph's findReferencesAsNodes() per export symbol.
+ * Short-circuits after first external reference is found.
+ *
+ * More expensive than file-level checks — scope with `.that().resideInFolder()`
+ * to limit the search space.
+ *
+ * **Note:** Default exports are excluded from this check. Use `beImported()` for
+ * file-level dead code detection. Only named exports are analyzed.
+ */
+/**
+ * Scan a single source file for unused named exports, returning violations.
+ */
+function findUnusedExportsInFile(sf, context) {
+    const violations = [];
+    const exportMap = sf.getExportedDeclarations();
+    for (const [name, declarations] of exportMap) {
+        if (name === 'default')
+            continue;
+        const firstDecl = declarations[0];
+        if (firstDecl === undefined)
+            continue;
+        if (!hasExternalReference(firstDecl, sf)) {
+            const line = Node.isNode(firstDecl) ? firstDecl.getStartLineNumber() : 1;
+            violations.push({
+                rule: context.rule,
+                element: sf.getBaseName(),
+                file: sf.getFilePath(),
+                line,
+                message: `${sf.getBaseName()} exports "${name}" which is not referenced by any other file`,
+                because: context.because,
+            });
+        }
+    }
+    return violations;
+}
+export function haveNoUnusedExports() {
+    return {
+        description: 'have no unused exports',
+        evaluate(elements, context) {
+            const violations = [];
+            for (const sf of elements) {
+                violations.push(...findUnusedExportsInFile(sf, context));
+            }
+            return violations;
+        },
+    };
+}
+/**
+ * Check if a declaration has at least one reference from a different file.
+ * Short-circuits on first external reference found.
+ *
+ * Uses the project's LanguageService.findReferencesAsNodes() which accepts
+ * any Node (unlike the ReferenceFindableNode mixin which only some types have).
+ */
+function hasExternalReference(declaration, sourceFile) {
+    const selfPath = sourceFile.getFilePath();
+    const languageService = sourceFile.getProject().getLanguageService();
+    try {
+        const refs = languageService.findReferencesAsNodes(declaration);
+        for (const ref of refs) {
+            if (ref.getSourceFile().getFilePath() !== selfPath) {
+                return true; // short-circuit
+            }
+        }
+    }
+    catch (err) {
+        void err; // deliberate: fall through to the safe answer below
+        // Some nodes (e.g., shorthand property assignments in re-exports) may fail
+        // Treat as "referenced" to avoid false positives
+        return true;
+    }
+    return false;
+}
+//# sourceMappingURL=reverse-dependency.js.map

package/dist/conditions/reverse-dependency.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reverse-dependency.js","sourceRoot":"","sources":["../../src/conditions/reverse-dependency.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,WAAW,CAAA;AACjC,OAAO,QAAQ,MAAM,WAAW,CAAA;AAChC,OAAO,EAAiC,IAAI,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAQ1E,MAAM,UAAU,GAAG,IAAI,OAAO,EAA+B,CAAA;AAE7D;;;;;;;GAOG;AACH;;;;GAIG;AACH,SAAS,UAAU,CACjB,KAAyB,EACzB,UAAkB,EAClB,EAAc,EACd,WAAoB;IAEpB,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;IACtC,IAAI,QAAQ,EAAE,CAAC;QACb,IAAI,CAAC,WAAW,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3C,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACnB,CAAC;IACH,CAAC;SAAM,CAAC;QACN,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IAC7B,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,oBAAoB,CAAC,QAAoB,EAAE,SAAiB;IACnE,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,SAAS,CAAA;IAEhD,MAAM,OAAO,GAAG,QAAQ,CAAC,YAAY,EAAE,CAAC,OAAO,EAAE,CAAA;IACjD,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAA;IAErC,iFAAiF;IACjF,MAAM,UAAU,GAAG;QACjB,SAAS;QACT,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC;QACjC,SAAS,CAAC,OAAO,CAAC,QAAQ,EAAE,MAAM,CAAC;QACnC,SAAS,CAAC,OAAO,CAAC,QAAQ,EAAE,MAAM,CAAC;QACnC,SAAS,GAAG,KAAK;QACjB,SAAS,GAAG,MAAM;QAClB,SAAS,GAAG,WAAW;QACvB,SAAS,GAAG,YAAY;KACzB,CAAA;IAED,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,CAAA;QACzD,MAAM,QAAQ,GAAG,OAAO,CAAC,aAAa,CAAC,YAAY,CAAC,CAAA;QACpD,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAA;IAC/B,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,kFAAkF;AAClF,SAAS,kBAAkB,CAAC,KAAyB,EAAE,EAAc;IACnE,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,qBAAqB,EAAE,EAAE,CAAC;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,4BAA4B,EAAE,CAAA;QACpD,IAAI,CAAC,QAAQ;YAAE,SAAQ;QACvB,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAA;IACtD,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,SAAS,cAAc,CAAC,KAAyB,EAAE,EAAc;IAC/D,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,qBAAqB,EAAE,EAAE,CAAC;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,4BAA4B,EAAE,CAAA;QACpD,IAAI,CAAC,QAAQ;YAAE,SAAQ;QACvB,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAA;IACrD,CAAC;AACH,CAAC;AAED,oFAAoF;AACpF,SAAS,mBAAmB,CAAC,KAAyB,EAAE,EAAc;IACpE,KAAK,MAAM,QAAQ,IAAI,EAAE,CAAC,oBAAoB,CAAC,UAAU,CAAC,cAAc,CAAC,EAAE,CAAC;QAC1E,IAAI,QAAQ,CAAC,aAAa,EAAE,CAAC,OAAO,EAAE,KAAK,UAAU,CAAC,aAAa;YAAE,SAAQ;QAC7E,MAAM,IAAI,GAAG,QAAQ,CAAC,YAAY,EAAE,CAAA;QACpC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QAE/B,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QACnB,IAAI,CAAC,GAAG;YAAE,SAAQ;QAClB,IAAI,SAA6B,CAAA;QACjC,IAAI,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,+BAA+B,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3E,SAAS,GAAG,GAAG,CAAC,eAAe,EAAE,CAAA;QACnC,CAAC;QAED,IAAI,SAAS,KAAK,SAAS;YAAE,SAAQ;QAErC,MAAM,QAAQ,GAAG,oBAAoB,CAAC,EAAE,EAAE,SAAS,CAAC,CAAA;QACpD,IAAI,QAAQ,EAAE,CAAC;YACb,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAA;QACrD,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAAC,WAAyB;IACtD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAA;IAE9C,MAAM,SAAS,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;IAChC,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,GAAG,EAAE,CAAA;IAChC,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,EAAE,CAAA;IACtC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;IACtC,IAAI,MAAM;QAAE,OAAO,MAAM,CAAA;IAEzB,MAAM,KAAK,GAAuB,IAAI,GAAG,EAAE,CAAA;IAE3C,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC7B,kBAAkB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;QAC7B,cAAc,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;QACzB,mBAAmB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;IAChC,CAAC;IAED,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;IAC9B,OAAO,KAAK,CAAA;AACd,CAAC;AAED,oEAAoE;AAEpE;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAG,KAAe;IAClD,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;IAC/C,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACzD,OAAO;QACL,WAAW,EAAE,wBAAwB,WAAW,EAAE;QAClD,QAAQ,CAAC,QAAsB,EAAE,OAAyB;YACxD,qEAAqE;YACrE,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;YACzB,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;YACjE,MAAM,KAAK,GAAG,qBAAqB,CAAC,QAAQ,CAAC,CAAA;YAC7C,MAAM,UAAU,GAAoB,EAAE,CAAA;YAEtC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAA;gBACnD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBACjC,MAAM,YAAY,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAA;oBAC3C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC;wBAC3C,UAAU,CAAC,IAAI,CAAC;4BACd,IAAI,EAAE,OAAO,CAAC,IAAI;4BAClB,OAAO,EAAE,EAAE,CAAC,WAAW,EAAE;4BACzB,IAAI,EAAE,EAAE,CAAC,WAAW,EAAE;4BACtB,IAAI,EAAE,CAAC;4BACP,OAAO,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,mBAAmB,QAAQ,CAAC,WAAW,EAAE,0BAA0B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;4BAClH,OAAO,EAAE,OAAO,CAAC,OAAO;yBACzB,CAAC,CAAA;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YAED,OAAO,UAAU,CAAA;QACnB,CAAC;KACF,CAAA;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,UAAU;IACxB,OAAO;QACL,WAAW,EAAE,0CAA0C;QACvD,QAAQ,CAAC,QAAsB,EAAE,OAAyB;YACxD,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;YACzB,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;YACjE,MAAM,KAAK,GAAG,qBAAqB,CAAC,QAAQ,CAAC,CAAA;YAC7C,MAAM,UAAU,GAAoB,EAAE,CAAA;YAEtC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAA;gBACnD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC3B,UAAU,CAAC,IAAI,CAAC;wBACd,IAAI,EAAE,OAAO,CAAC,IAAI;wBAClB,OAAO,EAAE,EAAE,CAAC,WAAW,EAAE;wBACzB,IAAI,EAAE,EAAE,CAAC,WAAW,EAAE;wBACtB,IAAI,EAAE,CAAC;wBACP,OAAO,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,sCAAsC;wBAClE,OAAO,EAAE,OAAO,CAAC,OAAO;qBACzB,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;YAED,OAAO,UAAU,CAAA;QACnB,CAAC;KACF,CAAA;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH;;GAEG;AACH,SAAS,uBAAuB,CAAC,EAAc,EAAE,OAAyB;IACxE,MAAM,UAAU,GAAoB,EAAE,CAAA;IACtC,MAAM,SAAS,GAAG,EAAE,CAAC,uBAAuB,EAAE,CAAA;IAE9C,KAAK,MAAM,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,SAAS,EAAE,CAAC;QAC7C,IAAI,IAAI,KAAK,SAAS;YAAE,SAAQ;QAEhC,MAAM,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,CAAA;QACjC,IAAI,SAAS,KAAK,SAAS;YAAE,SAAQ;QACrC,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YACxE,UAAU,CAAC,IAAI,CAAC;gBACd,IAAI,EAAE,OAAO,CAAC,IAAI;gBAClB,OAAO,EAAE,EAAE,CAAC,WAAW,EAAE;gBACzB,IAAI,EAAE,EAAE,CAAC,WAAW,EAAE;gBACtB,IAAI;gBACJ,OAAO,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,aAAa,IAAI,6CAA6C;gBAC1F,OAAO,EAAE,OAAO,CAAC,OAAO;aACzB,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAA;AACnB,CAAC;AAED,MAAM,UAAU,mBAAmB;IACjC,OAAO;QACL,WAAW,EAAE,wBAAwB;QACrC,QAAQ,CAAC,QAAsB,EAAE,OAAyB;YACxD,MAAM,UAAU,GAAoB,EAAE,CAAA;YACtC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,UAAU,CAAC,IAAI,CAAC,GAAG,uBAAuB,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAA;YAC1D,CAAC;YACD,OAAO,UAAU,CAAA;QACnB,CAAC;KACF,CAAA;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,oBAAoB,CAAC,WAAiB,EAAE,UAAsB;IACrE,MAAM,QAAQ,GAAG,UAAU,CAAC,WAAW,EAAE,CAAA;IACzC,MAAM,eAAe,GAAG,UAAU,CAAC,UAAU,EAAE,CAAC,kBAAkB,EAAE,CAAA;IAEpE,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,eAAe,CAAC,qBAAqB,CAAC,WAAW,CAAC,CAAA;QAC/D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,GAAG,CAAC,aAAa,EAAE,CAAC,WAAW,EAAE,KAAK,QAAQ,EAAE,CAAC;gBACnD,OAAO,IAAI,CAAA,CAAC,gBAAgB;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,KAAK,GAAG,CAAA,CAAC,oDAAoD;QAC7D,2EAA2E;QAC3E,iDAAiD;QACjD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC"}

package/dist/conditions/slice.d.ts

@@ -0,0 +1,49 @@
+import type { Condition } from '@nielspeter/eess';
+import type { Slice } from '../models/slice.js';
+/**
+ * Assert that no circular dependencies exist between slices.
+ *
+ * Builds a directed dependency graph from import declarations,
+ * then runs Tarjan's SCC algorithm to detect cycles.
+ * Each cycle produces a violation listing the cycle path.
+ *
+ * @example
+ * slices(project)
+ *   .matching('src/features/*\/')
+ *   .should().beFreeOfCycles()
+ *   .check()
+ */
+export declare function beFreeOfCycles(): Condition<Slice>;
+/**
+ * Assert that slices respect a layered dependency order.
+ *
+ * Given layers ['presentation', 'application', 'persistence', 'domain'],
+ * layer N may depend on layers N+1, N+2, ... but NOT on layers N-1, N-2, ...
+ * That is, dependencies must flow downward (toward higher indices) only.
+ *
+ * A layer not present in the slice set is silently skipped.
+ *
+ * @param layers - Ordered layer names, from highest (e.g., UI) to lowest (e.g., domain)
+ *
+ * @example
+ * slices(project)
+ *   .assignedFrom(layers)
+ *   .should().respectLayerOrder('presentation', 'application', 'persistence', 'domain')
+ *   .check()
+ */
+export declare function respectLayerOrder(...layers: string[]): Condition<Slice>;
+/**
+ * Assert that no slice depends on any of the listed slices.
+ *
+ * Use for explicit isolation rules, e.g., "no slice may depend on legacy".
+ *
+ * @param forbiddenSlices - Names of slices that must not be depended upon
+ *
+ * @example
+ * slices(project)
+ *   .matching('src/features/*\/')
+ *   .should().notDependOn('legacy', 'deprecated')
+ *   .check()
+ */
+export declare function notDependOn(...forbiddenSlices: string[]): Condition<Slice>;
+//# sourceMappingURL=slice.d.ts.map

package/dist/conditions/slice.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"slice.d.ts","sourceRoot":"","sources":["../../src/conditions/slice.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAoB,MAAM,kBAAkB,CAAA;AAEnE,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAA;AAQ/C;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,IAAI,SAAS,CAAC,KAAK,CAAC,CAmDjD;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CAsCvE;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,WAAW,CAAC,GAAG,eAAe,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CA6B1E"}

package/dist/conditions/slice.js

@@ -0,0 +1,153 @@
+import { buildSliceDependencyGraph, buildFileToSliceMap, findSliceDependencyDetails, } from '../helpers/slice-graph.js';
+import { tarjanSCC } from '../helpers/tarjan.js';
+/**
+ * Assert that no circular dependencies exist between slices.
+ *
+ * Builds a directed dependency graph from import declarations,
+ * then runs Tarjan's SCC algorithm to detect cycles.
+ * Each cycle produces a violation listing the cycle path.
+ *
+ * @example
+ * slices(project)
+ *   .matching('src/features/*\/')
+ *   .should().beFreeOfCycles()
+ *   .check()
+ */
+export function beFreeOfCycles() {
+    return {
+        description: 'be free of cycles',
+        evaluate(slices, context) {
+            const fileToSlice = buildFileToSliceMap(slices);
+            const edges = buildSliceDependencyGraph(slices, fileToSlice);
+            // Map slice names to indices for Tarjan's
+            const sliceNames = slices.map((s) => s.name);
+            const nameToIndex = new Map(sliceNames.map((name, i) => [name, i]));
+            const adjacency = new Map();
+            for (const edge of edges) {
+                const fromIdx = nameToIndex.get(edge.from);
+                const toIdx = nameToIndex.get(edge.to);
+                if (fromIdx === undefined || toIdx === undefined)
+                    continue;
+                const existing = adjacency.get(fromIdx);
+                if (existing) {
+                    existing.push(toIdx);
+                }
+                else {
+                    adjacency.set(fromIdx, [toIdx]);
+                }
+            }
+            const sccs = tarjanSCC(slices.length, adjacency);
+            const violations = [];
+            for (const scc of sccs) {
+                const cycleNames = scc.map((i) => sliceNames[i]);
+                const cyclePath = [...cycleNames, cycleNames[0]].join(' -> ');
+                // Find one concrete file causing the cycle for the violation location
+                const fromSlice = cycleNames[0] ?? '';
+                const toSlice = cycleNames[1] ?? fromSlice;
+                const details = findSliceDependencyDetails(slices, fromSlice, toSlice, fileToSlice);
+                const firstDetail = details[0];
+                violations.push({
+                    rule: context.rule,
+                    element: `[${cycleNames.join(', ')}]`,
+                    file: firstDetail ? firstDetail.sourceFile.getFilePath() : 'unknown',
+                    line: firstDetail ? firstDetail.importLine : 0,
+                    message: `Cycle detected: ${cyclePath}`,
+                    because: context.because,
+                });
+            }
+            return violations;
+        },
+    };
+}
+/**
+ * Assert that slices respect a layered dependency order.
+ *
+ * Given layers ['presentation', 'application', 'persistence', 'domain'],
+ * layer N may depend on layers N+1, N+2, ... but NOT on layers N-1, N-2, ...
+ * That is, dependencies must flow downward (toward higher indices) only.
+ *
+ * A layer not present in the slice set is silently skipped.
+ *
+ * @param layers - Ordered layer names, from highest (e.g., UI) to lowest (e.g., domain)
+ *
+ * @example
+ * slices(project)
+ *   .assignedFrom(layers)
+ *   .should().respectLayerOrder('presentation', 'application', 'persistence', 'domain')
+ *   .check()
+ */
+export function respectLayerOrder(...layers) {
+    return {
+        description: `respect layer order [${layers.join(' -> ')}]`,
+        evaluate(slices, context) {
+            const fileToSlice = buildFileToSliceMap(slices);
+            const edges = buildSliceDependencyGraph(slices, fileToSlice);
+            // Map layer names to their position (lower index = higher layer)
+            const layerIndex = new Map(layers.map((name, i) => [name, i]));
+            const violations = [];
+            for (const edge of edges) {
+                const fromIdx = layerIndex.get(edge.from);
+                const toIdx = layerIndex.get(edge.to);
+                // Skip edges involving non-layer slices
+                if (fromIdx === undefined || toIdx === undefined)
+                    continue;
+                // Violation: depending on a higher layer (lower index)
+                if (toIdx < fromIdx) {
+                    const details = findSliceDependencyDetails(slices, edge.from, edge.to, fileToSlice);
+                    for (const detail of details) {
+                        violations.push({
+                            rule: context.rule,
+                            element: detail.sourceFile.getBaseName(),
+                            file: detail.sourceFile.getFilePath(),
+                            line: detail.importLine,
+                            message: `Layer "${edge.from}" depends on higher layer "${edge.to}" (allowed: ${layers.slice(fromIdx + 1).join(', ') || 'none'})`,
+                            because: context.because,
+                        });
+                    }
+                }
+            }
+            return violations;
+        },
+    };
+}
+/**
+ * Assert that no slice depends on any of the listed slices.
+ *
+ * Use for explicit isolation rules, e.g., "no slice may depend on legacy".
+ *
+ * @param forbiddenSlices - Names of slices that must not be depended upon
+ *
+ * @example
+ * slices(project)
+ *   .matching('src/features/*\/')
+ *   .should().notDependOn('legacy', 'deprecated')
+ *   .check()
+ */
+export function notDependOn(...forbiddenSlices) {
+    const forbiddenSet = new Set(forbiddenSlices);
+    return {
+        description: `not depend on [${forbiddenSlices.join(', ')}]`,
+        evaluate(slices, context) {
+            const fileToSlice = buildFileToSliceMap(slices);
+            const edges = buildSliceDependencyGraph(slices, fileToSlice);
+            const violations = [];
+            for (const edge of edges) {
+                if (forbiddenSet.has(edge.to)) {
+                    const details = findSliceDependencyDetails(slices, edge.from, edge.to, fileToSlice);
+                    for (const detail of details) {
+                        violations.push({
+                            rule: context.rule,
+                            element: detail.sourceFile.getBaseName(),
+                            file: detail.sourceFile.getFilePath(),
+                            line: detail.importLine,
+                            message: `Slice "${edge.from}" depends on forbidden slice "${edge.to}"`,
+                            because: context.because,
+                        });
+                    }
+                }
+            }
+            return violations;
+        },
+    };
+}
+//# sourceMappingURL=slice.js.map

package/dist/conditions/slice.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"slice.js","sourceRoot":"","sources":["../../src/conditions/slice.ts"],"names":[],"mappings":"AAGA,OAAO,EACL,yBAAyB,EACzB,mBAAmB,EACnB,0BAA0B,GAC3B,MAAM,2BAA2B,CAAA;AAClC,OAAO,EAAE,SAAS,EAAsB,MAAM,sBAAsB,CAAA;AAEpE;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,cAAc;IAC5B,OAAO;QACL,WAAW,EAAE,mBAAmB;QAChC,QAAQ,CAAC,MAAe,EAAE,OAAyB;YACjD,MAAM,WAAW,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAA;YAC/C,MAAM,KAAK,GAAG,yBAAyB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;YAE5D,0CAA0C;YAC1C,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;YAC5C,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YAEnE,MAAM,SAAS,GAAkB,IAAI,GAAG,EAAE,CAAA;YAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC1C,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACtC,IAAI,OAAO,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;oBAAE,SAAQ;gBAE1D,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;gBACvC,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACtB,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;gBACjC,CAAC;YACH,CAAC;YAED,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;YAEhD,MAAM,UAAU,GAAoB,EAAE,CAAA;YACtC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;gBAChD,MAAM,SAAS,GAAG,CAAC,GAAG,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBAE7D,sEAAsE;gBACtE,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;gBACrC,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,SAAS,CAAA;gBAC1C,MAAM,OAAO,GAAG,0BAA0B,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,WAAW,CAAC,CAAA;gBACnF,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;gBAE9B,UAAU,CAAC,IAAI,CAAC;oBACd,IAAI,EAAE,OAAO,CAAC,IAAI;oBAClB,OAAO,EAAE,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;oBACrC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,SAAS;oBACpE,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;oBAC9C,OAAO,EAAE,mBAAmB,SAAS,EAAE;oBACvC,OAAO,EAAE,OAAO,CAAC,OAAO;iBACzB,CAAC,CAAA;YACJ,CAAC;YAED,OAAO,UAAU,CAAA;QACnB,CAAC;KACF,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAG,MAAgB;IACnD,OAAO;QACL,WAAW,EAAE,wBAAwB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG;QAC3D,QAAQ,CAAC,MAAe,EAAE,OAAyB;YACjD,MAAM,WAAW,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAA;YAC/C,MAAM,KAAK,GAAG,yBAAyB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;YAE5D,iEAAiE;YACjE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YAE9D,MAAM,UAAU,GAAoB,EAAE,CAAA;YAEtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACzC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBAErC,wCAAwC;gBACxC,IAAI,OAAO,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;oBAAE,SAAQ;gBAE1D,uDAAuD;gBACvD,IAAI,KAAK,GAAG,OAAO,EAAE,CAAC;oBACpB,MAAM,OAAO,GAAG,0BAA0B,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAA;oBACnF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;wBAC7B,UAAU,CAAC,IAAI,CAAC;4BACd,IAAI,EAAE,OAAO,CAAC,IAAI;4BAClB,OAAO,EAAE,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE;4BACxC,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE;4BACrC,IAAI,EAAE,MAAM,CAAC,UAAU;4BACvB,OAAO,EAAE,UAAU,IAAI,CAAC,IAAI,8BAA8B,IAAI,CAAC,EAAE,eAAe,MAAM,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG;4BACjI,OAAO,EAAE,OAAO,CAAC,OAAO;yBACzB,CAAC,CAAA;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YAED,OAAO,UAAU,CAAA;QACnB,CAAC;KACF,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,WAAW,CAAC,GAAG,eAAyB;IACtD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAA;IAC7C,OAAO;QACL,WAAW,EAAE,kBAAkB,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;QAC5D,QAAQ,CAAC,MAAe,EAAE,OAAyB;YACjD,MAAM,WAAW,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAA;YAC/C,MAAM,KAAK,GAAG,yBAAyB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;YAE5D,MAAM,UAAU,GAAoB,EAAE,CAAA;YAEtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC9B,MAAM,OAAO,GAAG,0BAA0B,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAA;oBACnF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;wBAC7B,UAAU,CAAC,IAAI,CAAC;4BACd,IAAI,EAAE,OAAO,CAAC,IAAI;4BAClB,OAAO,EAAE,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE;4BACxC,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE;4BACrC,IAAI,EAAE,MAAM,CAAC,UAAU;4BACvB,OAAO,EAAE,UAAU,IAAI,CAAC,IAAI,iCAAiC,IAAI,CAAC,EAAE,GAAG;4BACvE,OAAO,EAAE,OAAO,CAAC,OAAO;yBACzB,CAAC,CAAA;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YAED,OAAO,UAAU,CAAA;QACnB,CAAC;KACF,CAAA;AACH,CAAC"}

package/dist/conditions/structural.d.ts

@@ -0,0 +1,58 @@
+import { Node } from 'ts-morph';
+import type { Condition } from '@nielspeter/eess';
+/**
+ * Elements must reside in a file matching the glob pattern.
+ *
+ * Uses picomatch for glob matching against the absolute file path.
+ *
+ * @example
+ * // Assert all matched elements are in repository files
+ * .should(resideInFile('** /repositories/*.ts'))
+ */
+export declare function resideInFile<T extends Node>(glob: string): Condition<T>;
+/**
+ * Elements must reside in a folder matching the glob pattern.
+ *
+ * Matches against the directory portion of the file path (everything
+ * before the last path separator).
+ *
+ * @example
+ * // Assert all matched elements are in the services folder
+ * .should(resideInFolder('** /services'))
+ */
+export declare function resideInFolder<T extends Node>(glob: string): Condition<T>;
+/**
+ * Elements must have a name matching the regex pattern.
+ *
+ * @example
+ * // Assert all matched elements follow the naming convention
+ * .should(haveNameMatching(/Service$/))
+ */
+export declare function haveNameMatching<T extends Node>(regex: RegExp): Condition<T>;
+/**
+ * Elements must be exported from their module.
+ *
+ * Checks for the `export` keyword on the node. For variable declarations,
+ * checks the parent variable statement.
+ *
+ * @example
+ * // Assert all matched services are exported
+ * .should(beExported())
+ */
+export declare function beExported<T extends Node>(): Condition<T>;
+/**
+ * The predicate set must be empty — no elements should match.
+ *
+ * This is a set-level condition, not an element-level condition.
+ * If ANY elements exist after predicate filtering, each one becomes
+ * a violation with the message "X should not exist".
+ *
+ * @example
+ * // Assert no parse*Order functions exist
+ * functions(project)
+ *   .that(haveNameMatching(/^parse\w+Order$/))
+ *   .should(notExist())
+ *   .because('use shared parseOrder() utility instead')
+ */
+export declare function notExist<T extends Node>(): Condition<T>;
+//# sourceMappingURL=structural.d.ts.map

package/dist/conditions/structural.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"structural.d.ts","sourceRoot":"","sources":["../../src/conditions/structural.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,UAAU,CAAA;AAE/B,OAAO,KAAK,EAAE,SAAS,EAAoB,MAAM,kBAAkB,CAAA;AAKnE;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,CAAC,SAAS,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAQvE;AAED;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,CAAC,SAAS,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAezE;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAM5E;AAED;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAyBzD;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAS,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CASvD"}

package/dist/conditions/structural.js

@@ -0,0 +1,102 @@
+import { Node } from 'ts-morph';
+import picomatch from 'picomatch';
+import { createViolation, getElementFile, getElementName } from '../core/violation.js';
+import { elementCondition } from './helpers.js';
+/**
+ * Elements must reside in a file matching the glob pattern.
+ *
+ * Uses picomatch for glob matching against the absolute file path.
+ *
+ * @example
+ * // Assert all matched elements are in repository files
+ * .should(resideInFile('** /repositories/*.ts'))
+ */
+export function resideInFile(glob) {
+    const isMatch = picomatch(glob);
+    return elementCondition(`reside in file matching '${glob}'`, (element) => isMatch(getElementFile(element)), (element) => `${getElementName(element)} resides in '${getElementFile(element)}' which does not match '${glob}'`);
+}
+/**
+ * Elements must reside in a folder matching the glob pattern.
+ *
+ * Matches against the directory portion of the file path (everything
+ * before the last path separator).
+ *
+ * @example
+ * // Assert all matched elements are in the services folder
+ * .should(resideInFolder('** /services'))
+ */
+export function resideInFolder(glob) {
+    const isMatch = picomatch(glob);
+    return elementCondition(`reside in folder matching '${glob}'`, (element) => {
+        const filePath = getElementFile(element);
+        const folder = filePath.substring(0, filePath.lastIndexOf('/'));
+        return isMatch(folder);
+    }, (element) => {
+        const filePath = getElementFile(element);
+        const folder = filePath.substring(0, filePath.lastIndexOf('/'));
+        return `${getElementName(element)} resides in folder '${folder}' which does not match '${glob}'`;
+    });
+}
+/**
+ * Elements must have a name matching the regex pattern.
+ *
+ * @example
+ * // Assert all matched elements follow the naming convention
+ * .should(haveNameMatching(/Service$/))
+ */
+export function haveNameMatching(regex) {
+    return elementCondition(`have name matching ${String(regex)}`, (element) => regex.test(getElementName(element)), (element) => `${getElementName(element)} does not have a name matching ${String(regex)}`);
+}
+/**
+ * Elements must be exported from their module.
+ *
+ * Checks for the `export` keyword on the node. For variable declarations,
+ * checks the parent variable statement.
+ *
+ * @example
+ * // Assert all matched services are exported
+ * .should(beExported())
+ */
+export function beExported() {
+    return elementCondition('be exported', (element) => {
+        // ts-morph type guards for nodes with isExported()
+        if (Node.isClassDeclaration(element) ||
+            Node.isFunctionDeclaration(element) ||
+            Node.isInterfaceDeclaration(element) ||
+            Node.isTypeAliasDeclaration(element) ||
+            Node.isEnumDeclaration(element)) {
+            return element.isExported();
+        }
+        // VariableDeclaration — check parent VariableStatement
+        if (Node.isVariableDeclaration(element)) {
+            const varStatement = element.getVariableStatement();
+            if (varStatement) {
+                return varStatement.isExported();
+            }
+        }
+        return false;
+    }, (element) => `${getElementName(element)} is not exported`);
+}
+/**
+ * The predicate set must be empty — no elements should match.
+ *
+ * This is a set-level condition, not an element-level condition.
+ * If ANY elements exist after predicate filtering, each one becomes
+ * a violation with the message "X should not exist".
+ *
+ * @example
+ * // Assert no parse*Order functions exist
+ * functions(project)
+ *   .that(haveNameMatching(/^parse\w+Order$/))
+ *   .should(notExist())
+ *   .because('use shared parseOrder() utility instead')
+ */
+export function notExist() {
+    return {
+        description: 'not exist',
+        evaluate(elements, context) {
+            return elements.map((element) => createViolation(element, `${getElementName(element)} should not exist`, context));
+        },
+    };
+}
+//# sourceMappingURL=structural.js.map