@archest/vitest 1.0.1 → 1.0.3

package/dist/index.mjs

@@ -1,749 +1,20 @@
-import * as e from "typescript";
-import * as t from "node:path";
-import { dirname as n } from "node:path";
-import { expect as r } from "vitest";
-//#region \0rolldown/runtime.js
-var i = /* @__PURE__ */ ((e) => typeof require < "u" ? require : typeof Proxy < "u" ? new Proxy(e, { get: (e, t) => (typeof require < "u" ? require : e)[t] }) : e)(function(e) {
-	if (typeof require < "u") return require.apply(this, arguments);
-	throw Error("Calling `require` for \"" + e + "\" in an environment that doesn't expose the `require` function. See https://rolldown.rs/in-depth/bundling-cjs#require-external-modules for more details.");
-});
-//#endregion
-//#region src/core/classes/classCheckExtendClass.ts
-function a(t, n, r) {
-	let i = [];
-	for (let a of t.classes) {
-		let t = a.name?.text || "Anonymous", o = !1;
-		if (a.heritageClauses) {
-			for (let t of a.heritageClauses) if (t.token === e.SyntaxKind.ExtendsKeyword) {
-				for (let r of t.types) if (e.isIdentifier(r.expression) && r.expression.text === n) {
-					o = !0;
-					break;
-				}
-			}
-		}
-		r && o ? i.push(`Class ${t} extends ${n}, but it shouldn't.`) : !r && !o && i.push(`Class ${t} does not extend ${n}, but it should.`);
-	}
-	return {
-		pass: i.length === 0,
-		message: () => i.join("\n")
-	};
-}
-//#endregion
-//#region src/core/metrics/calculateCyclomaticComplexity.ts
-function o(t) {
-	let n = 1, r = (t) => {
-		switch (t.kind) {
-			case e.SyntaxKind.IfStatement:
-			case e.SyntaxKind.ForStatement:
-			case e.SyntaxKind.ForInStatement:
-			case e.SyntaxKind.ForOfStatement:
-			case e.SyntaxKind.WhileStatement:
-			case e.SyntaxKind.DoStatement:
-			case e.SyntaxKind.CaseClause:
-			case e.SyntaxKind.CatchClause:
-			case e.SyntaxKind.ConditionalExpression:
-				n++;
-				break;
-			case e.SyntaxKind.BinaryExpression: {
-				let r = t;
-				(r.operatorToken.kind === e.SyntaxKind.AmpersandAmpersandToken || r.operatorToken.kind === e.SyntaxKind.BarBarToken || r.operatorToken.kind === e.SyntaxKind.QuestionQuestionToken) && n++;
-				break;
-			}
-		}
-		e.forEachChild(t, r);
-	};
-	return e.forEachChild(t, r), n;
-}
-//#endregion
-//#region src/core/utils/ruleBuilder.ts
-function s(e, t, n) {
-	let r = [];
-	for (let i of e) {
-		let { passes: e, failMessage: a, failNotMessage: o } = n(i);
-		t && e ? o && r.push(o) : !t && !e && a && r.push(a);
-	}
-	return {
-		pass: r.length === 0,
-		message: () => r.join("\n")
-	};
-}
-//#endregion
-//#region src/core/shared/sharedCheckHaveMaxCyclomaticComplexity.ts
-function c(e, t, n, r, i, a) {
-	return s(e, a, (e) => {
-		let a = t(e), o = n(e), s = o > i, c = `${r} ${a || "Anonymous"}`;
-		return {
-			passes: !s,
-			failMessage: `${c} has a total cyclomatic complexity of ${o}, which exceeds the maximum of ${i}.`,
-			failNotMessage: `${c} has a total cyclomatic complexity of ${o}, which exceeds the maximum of ${i}, but it shouldn't.`
-		};
-	});
-}
-//#endregion
-//#region src/core/classes/classCheckHaveMaxCyclomaticComplexity.ts
-function l(t, n, r) {
-	return c(t.classes, (e) => e.name?.text, (t) => {
-		let n = 0, r = (t) => {
-			(e.isMethodDeclaration(t) || e.isConstructorDeclaration(t) || e.isGetAccessor(t) || e.isSetAccessor(t)) && (n += o(t)), e.forEachChild(t, r);
-		};
-		return r(t), n;
-	}, "Class", n, r);
-}
-//#endregion
-//#region src/core/shared/sharedCheckHaveModifier.ts
-function u(t, n, r, i, a) {
-	let o;
-	switch (i) {
-		case "export":
-			o = e.SyntaxKind.ExportKeyword;
-			break;
-		case "default":
-			o = e.SyntaxKind.DefaultKeyword;
-			break;
-		case "abstract":
-			o = e.SyntaxKind.AbstractKeyword;
-			break;
-		case "async":
-			o = e.SyntaxKind.AsyncKeyword;
-			break;
-		case "public":
-			o = e.SyntaxKind.PublicKeyword;
-			break;
-		case "private":
-			o = e.SyntaxKind.PrivateKeyword;
-			break;
-		default: throw Error(`Modifier ${i} is not fully supported.`);
-	}
-	return s(t, a, (t) => {
-		let a = n(t), s = e.canHaveModifiers(t) ? e.getModifiers(t) : void 0, c = s ? s.some((e) => e.kind === o) : !1, l = `${r} ${a || "Anonymous"}`;
-		return {
-			passes: c,
-			failMessage: `${l} does not have modifier ${i}, but it should.`,
-			failNotMessage: `${l} has modifier ${i}, but it shouldn't.`
-		};
-	});
-}
-//#endregion
-//#region src/core/classes/classCheckHaveModifier.ts
-function d(e, t, n) {
-	return u(e.classes, (e) => e.name?.text, "Class", t, n);
-}
-//#endregion
-//#region src/core/shared/sharedCheckHaveNameMatchingFileName.ts
-function f(n, r, i, a) {
-	return s(n, a, (n) => {
-		let a = r(n), o = n.getSourceFile ? n.getSourceFile() : n.parent ? e.getSourceFileOfNode(n) : void 0;
-		if (!o) return {
-			passes: !0,
-			failMessage: "",
-			failNotMessage: ""
-		};
-		let s = t.basename(o.fileName, t.extname(o.fileName)), c = a === s, l = `${i} ${a || "Anonymous"}`;
-		return {
-			passes: c,
-			failMessage: `${l} does not have a name matching its filename ${s}, but it should.`,
-			failNotMessage: `${l} has a name matching its filename ${s}, but it shouldn't.`
-		};
-	});
-}
-//#endregion
-//#region src/core/classes/classCheckHaveNameMatchingFileName.ts
-function p(e, t) {
-	return f(e.classes, (e) => e.name?.text, "Class", t);
-}
-//#endregion
-//#region src/core/classes/classCheckImplementInterface.ts
-function m(t, n, r) {
-	let i = [];
-	for (let a of t.classes) {
-		let t = a.name?.text || "Anonymous", o = !1;
-		if (a.heritageClauses) {
-			for (let t of a.heritageClauses) if (t.token === e.SyntaxKind.ImplementsKeyword) {
-				for (let r of t.types) if (e.isIdentifier(r.expression) && r.expression.text === n) {
-					o = !0;
-					break;
-				}
-			}
-		}
-		r && o ? i.push(`Class ${t} implements ${n}, but it shouldn't.`) : !r && !o && i.push(`Class ${t} does not implement ${n}, but it should.`);
-	}
-	return {
-		pass: i.length === 0,
-		message: () => i.join("\n")
-	};
-}
-//#endregion
-//#region src/core/shared/sharedCheckMatchNamePattern.ts
-function h(e, t, n, r, i) {
-	let a = typeof r == "string" ? new RegExp(r) : r;
-	return s(e, i, (e) => {
-		let i = t(e), o = i ? a.test(i) : !1, s = `${n} ${i || "Anonymous"}`;
-		return {
-			passes: o,
-			failMessage: `${s} does not match pattern ${r}, but it should.`,
-			failNotMessage: `${s} matches pattern ${r}, but it shouldn't.`
-		};
-	});
-}
-//#endregion
-//#region src/core/classes/classCheckMatchNamePattern.ts
-function g(e, t, n) {
-	return h(e.classes, (e) => e.name?.text, "Class", t, n);
-}
-//#endregion
-//#region src/core/classes/classCheckResideInFolder.ts
-function _(e, t, n) {
-	let r = [];
-	for (let i of e.classes) {
-		let e = i.name?.text || "Anonymous Class", a = i.getSourceFile(), o = a.fileName.includes(`/${t}/`) || a.fileName.includes(`\\${t}\\`);
-		n && o ? r.push(`Class ${e} resides in ${t}, but it shouldn't.`) : !n && !o && r.push(`Class ${e} does not reside in ${t}, but it should.`);
-	}
-	return {
-		pass: r.length === 0,
-		message: () => r.join("\n")
-	};
-}
-//#endregion
-//#region src/core/classes/locateClasses.ts
-function v(t, n, r) {
-	let i = t;
-	if (r?.inFolder && (i = i.filter((t) => {
-		let n = t.getSourceFile ? t.getSourceFile() : t.parent ? e.getSourceFileOfNode(t) : void 0;
-		return n ? n.fileName.includes(`/${r.inFolder}/`) || n.fileName.includes(`\\${r.inFolder}\\`) : !1;
-	})), r?.matchNamePattern) {
-		let e = typeof r.matchNamePattern == "string" ? new RegExp(r.matchNamePattern) : r.matchNamePattern;
-		i = i.filter((t) => {
-			let n = t.name?.text;
-			return n && e.test(n);
-		});
-	}
-	if (r?.withDecorator && (i = i.filter((t) => {
-		let n = e.canHaveDecorators(t) ? e.getDecorators(t) : void 0, i = !1;
-		if (n) for (let t of n) {
-			let n = t.expression, a = "";
-			e.isIdentifier(n) ? a = n.text : e.isCallExpression(n) && e.isIdentifier(n.expression) && (a = n.expression.text), a === r.withDecorator && (i = !0);
-		}
-		return i;
-	})), r?.extending && (i = i.filter((t) => {
-		if (t.heritageClauses) {
-			for (let n of t.heritageClauses) if (n.token === e.SyntaxKind.ExtendsKeyword) {
-				for (let t of n.types) if (e.isIdentifier(t.expression) && t.expression.text === r.extending) return !0;
-			}
-		}
-		return !1;
-	})), r?.implementing && (i = i.filter((t) => {
-		if (t.heritageClauses) {
-			for (let n of t.heritageClauses) if (n.token === e.SyntaxKind.ImplementsKeyword) {
-				for (let t of n.types) if (e.isIdentifier(t.expression) && t.expression.text === r.implementing) return !0;
-			}
-		}
-		return !1;
-	})), r?.havingModifier) {
-		let t;
-		switch (r.havingModifier) {
-			case "export":
-				t = e.SyntaxKind.ExportKeyword;
-				break;
-			case "default":
-				t = e.SyntaxKind.DefaultKeyword;
-				break;
-			case "abstract":
-				t = e.SyntaxKind.AbstractKeyword;
-				break;
-			default: throw Error(`Modifier ${r.havingModifier} is not fully supported.`);
-		}
-		i = i.filter((n) => (e.canHaveModifiers(n) ? e.getModifiers(n) : void 0)?.some((e) => e.kind === t));
-	}
-	return {
-		type: "ClassLocator",
-		classes: i,
-		program: n
-	};
-}
-//#endregion
-//#region src/core/files/getFileDependencies.ts
-function y(t, n) {
-	let r = [], i = n.getCompilerOptions(), a = (n) => {
-		if (e.isImportDeclaration(n)) {
-			let a = n.moduleSpecifier.text, o = e.resolveModuleName(a, t.fileName, i, e.sys);
-			o.resolvedModule?.resolvedFileName && (o.resolvedModule.isExternalLibraryImport || r.push(o.resolvedModule.resolvedFileName));
-		} else if (e.isExportDeclaration(n) && n.moduleSpecifier) {
-			let a = n.moduleSpecifier.text, o = e.resolveModuleName(a, t.fileName, i, e.sys);
-			o.resolvedModule?.resolvedFileName && (o.resolvedModule.isExternalLibraryImport || r.push(o.resolvedModule.resolvedFileName));
-		}
-		e.forEachChild(n, a);
-	};
-	return a(t), r;
-}
-//#endregion
-//#region src/core/files/checkDependOnFilesInFolder.ts
-function b(e, t, n) {
-	let r = [];
-	for (let i of e.files) {
-		let a = y(i, e.program).some((e) => e.includes(`/${t}/`) || e.includes(`\\${t}\\`));
-		n && a ? r.push(`File ${i.fileName} depends on files in ${t}, but it shouldn't.`) : !n && !a && r.push(`File ${i.fileName} does not depend on files in ${t}, but it should.`);
-	}
-	return {
-		pass: r.length === 0,
-		message: () => r.join("\n")
-	};
-}
-//#endregion
-//#region src/core/files/fileCheckBeFreeOfCycles.ts
-function x(e, t) {
-	let n = [], r = new Set(e.files.map((e) => e.fileName)), i = /* @__PURE__ */ new Map();
-	for (let t of e.files) {
-		let n = t.fileName, a = y(t, e.program).filter((e) => r.has(e));
-		i.set(n, a);
-	}
-	let a = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Set(), s = [], c = (e, t) => {
-		if (o.has(e)) {
-			let n = t.indexOf(e), r = [...t.slice(n), e].join("->");
-			return s.some((e) => e.join("->") === r) || s.push([...t.slice(n), e]), !0;
-		}
-		if (a.has(e)) return !1;
-		a.add(e), o.add(e), t.push(e);
-		let n = i.get(e) || [];
-		for (let e of n) c(e, t);
-		return o.delete(e), t.pop(), !1;
-	};
-	for (let e of i.keys()) a.has(e) || c(e, []);
-	if (t && s.length === 0) n.push("Expected cyclic dependencies, but found none.");
-	else if (!t && s.length > 0) for (let e of s) n.push(`Cycle detected: ${e.join(" -> ")}`);
-	return {
-		pass: n.length === 0,
-		message: () => n.join("\n")
-	};
-}
-//#endregion
-//#region src/core/files/fileCheckHaveMaxCyclomaticComplexity.ts
-function S(t, n, r) {
-	return c(t.files, (e) => e.fileName, (t) => {
-		let n = 0, r = (t) => {
-			(e.isFunctionDeclaration(t) || e.isMethodDeclaration(t) || e.isArrowFunction(t) || e.isFunctionExpression(t)) && (n += o(t)), e.forEachChild(t, r);
-		};
-		return r(t), n;
-	}, "File", n, r);
-}
-//#endregion
-//#region src/core/files/fileCheckHaveMaxExportedFunctions.ts
-function C(t, n, r) {
-	let i = [];
-	for (let a of t.files) {
-		let t = 0;
-		e.forEachChild(a, (n) => {
-			e.isFunctionDeclaration(n) && (e.canHaveModifiers(n) ? e.getModifiers(n) : void 0)?.some((t) => t.kind === e.SyntaxKind.ExportKeyword) && t++;
-		});
-		let o = t > n;
-		r && o ? i.push(`File ${a.fileName} has ${t} exported functions, which exceeds the maximum of ${n}, but it shouldn't.`) : !r && o && i.push(`File ${a.fileName} has ${t} exported functions, which exceeds the maximum of ${n}.`);
-	}
-	return {
-		pass: r ? i.length > 0 : i.length === 0,
-		message: () => i.join("\n") || (r ? "Expected some files to exceed maximum exported functions, but none did." : "")
-	};
-}
-//#endregion
-//#region src/core/metrics/calculateMaintainabilityIndex.ts
-function w(t) {
-	let n = 0, r = 0, i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), s = 1, c = t.getSourceFile();
-	if (c) {
-		let e = c.getLineAndCharacterOfPosition(t.getStart());
-		s = c.getLineAndCharacterOfPosition(t.getEnd()).line - e.line + 1;
-	}
-	let l = (t) => {
-		e.isBinaryExpression(t) || e.isPrefixUnaryExpression(t) || e.isPostfixUnaryExpression(t) ? (n++, i.add(t.kind)) : (e.isIdentifier(t) || e.isLiteralExpression(t)) && (r++, a.add(t.getText(c))), e.forEachChild(t, l);
-	};
-	l(t);
-	let u = n + r, d = i.size + a.size, f = d === 0 ? 0 : u * Math.log2(d), p = o(t);
-	return Math.max(0, (171 - 5.2 * Math.log(f || 1) - .23 * p - 16.2 * Math.log(s)) * 100 / 171);
-}
-//#endregion
-//#region src/core/shared/sharedCheckHaveMinMaintainabilityIndex.ts
-function T(e, t, n, r, i, a) {
-	return s(e, a, (e) => {
-		let a = t(e), o = n(e), s = o < i, c = `${r} ${a || "Anonymous"}`;
-		return {
-			passes: !s,
-			failMessage: `${c} has a maintainability index of ${o.toFixed(2)}, which falls below the minimum of ${i}.`,
-			failNotMessage: `${c} has a maintainability index of ${o.toFixed(2)}, which falls below the minimum of ${i}, but it shouldn't.`
-		};
-	});
-}
-//#endregion
-//#region src/core/files/fileCheckHaveMinMaintainabilityIndex.ts
-function E(e, t, n) {
-	return T(e.files, (e) => e.fileName, w, "File", t, n);
-}
-//#endregion
-//#region src/core/files/fileCheckMatchNamePattern.ts
-function D(e, t, n) {
-	return h(e.files, (e) => e.fileName, "File", t, n);
-}
-//#endregion
-//#region src/core/files/locateFiles.ts
-function O(e, t, n) {
-	let r = e;
-	if (n?.inFolder && (r = r.filter((e) => e.fileName.includes(`/${n.inFolder}/`) || e.fileName.includes(`\\${n.inFolder}\\`))), n?.matchNamePattern) {
-		let e = typeof n.matchNamePattern == "string" ? new RegExp(n.matchNamePattern) : n.matchNamePattern;
-		r = r.filter((t) => e.test(t.fileName));
-	}
-	return {
-		type: "FileLocator",
-		files: r,
-		program: t
-	};
-}
-//#endregion
-//#region src/core/functions/functionCheckHaveExplicitReturnType.ts
-function k(t, n) {
-	let r = [];
-	for (let i of t.functions) {
-		let t = i.name && e.isIdentifier(i.name) ? i.name.text : "Anonymous Function", a = !!i.type;
-		n && a ? r.push(`Function ${t} has an explicit return type, but it shouldn't.`) : !n && !a && r.push(`Function ${t} does not have an explicit return type, but it should.`);
-	}
-	return {
-		pass: r.length === 0,
-		message: () => r.join("\n")
-	};
-}
-//#endregion
-//#region src/core/functions/functionCheckHaveMaxCyclomaticComplexity.ts
-function A(t, n, r) {
-	return c(t.functions, (t) => t.name && e.isIdentifier(t.name) ? t.name.text : void 0, o, "Function", n, r);
-}
-//#endregion
-//#region src/core/functions/functionCheckHaveMinMaintainabilityIndex.ts
-function j(t, n, r) {
-	return T(t.functions, (t) => t.name && e.isIdentifier(t.name) ? t.name.text : void 0, w, "Function", n, r);
-}
-//#endregion
-//#region src/core/functions/functionCheckHaveModifier.ts
-function M(t, n, r) {
-	return u(t.functions, (t) => t.name && e.isIdentifier(t.name) ? t.name.text : void 0, "Function", n, r);
-}
-//#endregion
-//#region src/core/functions/functionCheckHaveNameMatchingFileName.ts
-function N(t, n) {
-	return f(t.functions, (t) => t.name && e.isIdentifier(t.name) ? t.name.text : void 0, "Function", n);
-}
-//#endregion
-//#region src/core/functions/functionCheckMatchNamePattern.ts
-function P(t, n, r) {
-	return h(t.functions, (t) => t.name && e.isIdentifier(t.name) ? t.name.text : void 0, "Function", n, r);
-}
-//#endregion
-//#region src/core/functions/locateFunctions.ts
-function F(t, n, r) {
-	let i = t;
-	if (r?.inFolder && (i = i.filter((t) => {
-		let n = t.getSourceFile ? t.getSourceFile() : t.parent ? e.getSourceFileOfNode(t) : void 0;
-		return n ? n.fileName.includes(`/${r.inFolder}/`) || n.fileName.includes(`\\${r.inFolder}\\`) : !1;
-	})), r?.matchNamePattern) {
-		let t = typeof r.matchNamePattern == "string" ? new RegExp(r.matchNamePattern) : r.matchNamePattern;
-		i = i.filter((n) => n.name && e.isIdentifier(n.name) && t.test(n.name.text));
-	}
-	return r?.isTopLevel && (i = i.filter((t) => e.isSourceFile(t.parent))), {
-		type: "FunctionLocator",
-		functions: i,
-		program: n
-	};
-}
-//#endregion
-//#region src/core/layers/checkLayeredArchitecture.ts
-function I(e) {
-	let t = [];
-	for (let n of e.assertions) t.push(...n(e.files));
-	return {
-		pass: t.length === 0,
-		message: () => t.join("\n")
-	};
-}
-//#endregion
-//#region src/core/layers/createLayeredArchitecture.ts
-function L(e, t) {
-	return {
-		type: "LayeredArchitecture",
-		files: e,
-		layers: /* @__PURE__ */ new Map(),
-		assertions: [],
-		program: t
-	};
-}
-//#endregion
-//#region src/core/layers/layer.ts
-function R(e, t, n) {
-	return e.layers.set(t, n), e;
-}
-//#endregion
-//#region src/core/layers/getLayerDependencies.ts
-function z(t, n) {
-	let r = [], i = n.getCompilerOptions(), a = (n) => {
-		if (e.isImportDeclaration(n)) {
-			let a = n.moduleSpecifier.text, o = e.resolveModuleName(a, t.fileName, i, e.sys);
-			o.resolvedModule?.resolvedFileName && !o.resolvedModule.isExternalLibraryImport && r.push(o.resolvedModule.resolvedFileName);
-		} else if (e.isExportDeclaration(n) && n.moduleSpecifier) {
-			let a = n.moduleSpecifier.text, o = e.resolveModuleName(a, t.fileName, i, e.sys);
-			o.resolvedModule?.resolvedFileName && !o.resolvedModule.isExternalLibraryImport && r.push(o.resolvedModule.resolvedFileName);
-		}
-		e.forEachChild(n, a);
-	};
-	return a(t), r;
-}
-//#endregion
-//#region src/core/layers/layerShouldNotBeAccessedByAnyLayer.ts
-function B(e, t) {
-	if (!e.layers.has(t)) throw Error(`Layer ${t} is not defined`);
-	return e.assertions.push((n) => {
-		let r = [], i = e.layers.get(t);
-		for (let a of n) {
-			let n = a.fileName;
-			!n.includes(`/${i}/`) && !n.includes(`\\${i}\\`) && z(a, e.program).some((e) => e.includes(`/${i}/`) || e.includes(`\\${i}\\`)) && r.push(`File ${n} accesses layer ${t} but it shouldn't.`);
-		}
-		return r;
-	}), e;
-}
-//#endregion
-//#region src/core/layers/layerShouldOnlyBeAccessedBy.ts
-function V(e, t, n) {
-	if (!e.layers.has(t)) throw Error(`Layer ${t} is not defined`);
-	return e.assertions.push((r) => {
-		let i = [], a = e.layers.get(t), o = n.map((t) => e.layers.get(t));
-		for (let s of r) {
-			let r = s.fileName, c = o.some((e) => r.includes(`/${e}/`) || r.includes(`\\${e}\\`));
-			!r.includes(`/${a}/`) && !r.includes(`\\${a}\\`) && !c && z(s, e.program).some((e) => e.includes(`/${a}/`) || e.includes(`\\${a}\\`)) && i.push(`File ${r} accesses layer ${t} but only ${n.join(", ")} are allowed.`);
-		}
-		return i;
-	}), e;
-}
-//#endregion
-//#region src/core/properties/locateProperties.ts
-function H(t, n, r) {
-	let i = t;
-	if (r?.inFolder && (i = i.filter((t) => {
-		let n = t.getSourceFile ? t.getSourceFile() : t.parent ? e.getSourceFileOfNode(t) : void 0;
-		return n ? n.fileName.includes(`/${r.inFolder}/`) || n.fileName.includes(`\\${r.inFolder}\\`) : !1;
-	})), r?.matchNamePattern) {
-		let t = typeof r.matchNamePattern == "string" ? new RegExp(r.matchNamePattern) : r.matchNamePattern;
-		i = i.filter((n) => e.isIdentifier(n.name) && t.test(n.name.text));
-	}
-	return {
-		type: "PropertyLocator",
-		properties: i,
-		program: n
-	};
-}
-//#endregion
-//#region src/core/slices/locateSlices.ts
-function U(e, t, n) {
-	let r = n.replace(/[.+?^${}()|[\]\\]/g, "\\$&").replace(/\*/g, "([^/\\\\]+)"), i = new RegExp(r), a = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Map();
-	for (let t of e) {
-		let e = t.fileName.match(i);
-		if (e?.[1]) {
-			let n = e[1];
-			a.add(n), o.has(n) || o.set(n, []), o.get(n)?.push(t);
-		}
-	}
-	return {
-		type: "SliceLocator",
-		slicePattern: i,
-		sliceIds: a,
-		sliceFiles: o,
-		program: t
-	};
-}
-//#endregion
-//#region src/core/project/parseProject.ts
-function W(t = {}) {
-	let r = {}, a = t.tsConfigFilePath || e.findConfigFile(process.cwd(), e.sys.fileExists, "tsconfig.json"), o;
-	if (a) {
-		let t = e.readConfigFile(a, e.sys.readFile), s = e.parseJsonConfigFileContent(t.config, e.sys, n(a), void 0, a, void 0, [{
-			extension: ".vue",
-			isMixedContent: !0,
-			scriptKind: e.ScriptKind.TS
-		}, {
-			extension: ".svelte",
-			isMixedContent: !0,
-			scriptKind: e.ScriptKind.TS
-		}]);
-		r = s.options;
-		let c = e.createCompilerHost(r), l = c.getSourceFile, u;
-		try {
-			u = i("@vue/compiler-sfc");
-		} catch {}
-		c.getSourceFile = (t, n, r, i) => {
-			if (t.endsWith(".vue")) {
-				let r = e.sys.readFile(t);
-				if (r) {
-					let i = "";
-					if (u) {
-						let e = u.parse(r), t = e.descriptor.script, n = e.descriptor.scriptSetup;
-						t && (i += `${t.content}\n`), n && (i += `${n.content}\n`);
-					} else {
-						let e = r.match(/<script[^>]*>(.*?)<\/script>/s);
-						e && (i = e[1]);
-					}
-					return e.createSourceFile(t, i, n, !0, e.ScriptKind.TS);
-				}
-			}
-			if (t.endsWith(".svelte")) {
-				let r = e.sys.readFile(t);
-				if (r) {
-					let i = "", a = r.match(/<script[^>]*>(.*?)<\/script>/s);
-					return a && (i = a[1]), e.createSourceFile(t, i, n, !0, e.ScriptKind.TS);
-				}
-			}
-			return l(t, n, r, i);
-		}, o = e.createProgram({
-			rootNames: s.fileNames,
-			options: r,
-			host: c
-		}), o.getTypeChecker();
-	} else throw Error("Could not find tsconfig.json");
-	let s = () => o.getSourceFiles().filter((e) => !e.isDeclarationFile && !e.fileName.includes("node_modules"));
-	return {
-		getFiles: (e) => O(s(), o, e),
-		getClasses: (t) => {
-			let n = [];
-			for (let t of s()) {
-				let r = (t) => {
-					e.isClassDeclaration(t) && n.push(t), e.forEachChild(t, r);
-				};
-				r(t);
-			}
-			return v(n, o, t);
-		},
-		layeredArchitecture: () => {
-			let e = L(s(), o), t = {
-				layer: (n, r) => (e = R(e, n, r), t),
-				whereLayer: (n) => ({
-					shouldNotBeAccessedByAnyLayer: () => (e = B(e, n), t),
-					shouldOnlyBeAccessedBy: (...r) => (e = V(e, n, r), t)
-				}),
-				check: () => I(e),
-				get data() {
-					return e;
-				}
-			};
-			return t;
-		},
-		getFunctions: (t) => {
-			let n = [];
-			for (let t of s()) {
-				let r = (t) => {
-					(e.isFunctionDeclaration(t) || e.isMethodDeclaration(t) || e.isArrowFunction(t)) && n.push(t), e.forEachChild(t, r);
-				};
-				r(t);
-			}
-			return F(n, o, t);
-		},
-		getProperties: (t) => {
-			let n = [];
-			for (let t of s()) {
-				let r = (t) => {
-					e.isPropertyDeclaration(t) && n.push(t), e.forEachChild(t, r);
-				};
-				r(t);
-			}
-			return H(n, o, t);
-		},
-		getSlices: (e) => U(s(), o, e)
-	};
-}
-//#endregion
-//#region src/core/properties/propertyCheckBeReadonly.ts
-function G(t, n) {
-	let r = [];
-	for (let i of t.properties) {
-		let t = e.isIdentifier(i.name) ? i.name.text : "Anonymous Property", a = (e.canHaveModifiers(i) ? e.getModifiers(i) : void 0)?.some((t) => t.kind === e.SyntaxKind.ReadonlyKeyword);
-		n && a ? r.push(`Property ${t} is readonly, but it shouldn't be.`) : !n && !a && r.push(`Property ${t} is not readonly, but it should be.`);
-	}
-	return {
-		pass: r.length === 0,
-		message: () => r.join("\n")
-	};
-}
-//#endregion
-//#region src/core/slices/sliceCheckBeFreeOfCycles.ts
-function K(t, n) {
-	let r = /* @__PURE__ */ new Map();
-	for (let e of t.sliceIds) r.set(e, /* @__PURE__ */ new Set());
-	for (let [n, i] of t.sliceFiles.entries()) for (let a of i) e.forEachChild(a, (i) => {
-		if (e.isImportDeclaration(i) && i.moduleSpecifier && e.isStringLiteral(i.moduleSpecifier)) {
-			let o = i.moduleSpecifier.text, s = e.resolveModuleName(o, a.fileName, t.program.getCompilerOptions(), e.sys);
-			if (s.resolvedModule?.resolvedFileName) {
-				let e = s.resolvedModule.resolvedFileName.match(t.slicePattern);
-				if (e?.[1]) {
-					let i = e[1];
-					i !== n && t.sliceIds.has(i) && r.get(n)?.add(i);
-				}
-			}
-		}
-	});
-	let i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), o = [], s = (e, t) => {
-		i.add(e), a.add(e);
-		for (let n of r.get(e) || []) if (!i.has(n)) {
-			if (s(n, [...t, n])) return !0;
-		} else if (a.has(n)) return o.push(`Cycle detected between slices: ${t.join(" -> ")} -> ${n}`), !0;
-		return a.delete(e), !1;
-	};
-	for (let e of t.sliceIds) i.has(e) || s(e, [e]);
-	return n ? {
-		pass: o.length > 0,
-		message: () => o.length > 0 ? "" : "Expected cycles between slices but found none."
-	} : {
-		pass: o.length === 0,
-		message: () => o.join("\n")
-	};
-}
-//#endregion
-//#region src/core/slices/sliceCheckHaveMaxDistanceFromMainSequence.ts
-function q(t, n, r) {
-	let i = [], a = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map();
-	for (let e of t.sliceIds) a.set(e, /* @__PURE__ */ new Set()), o.set(e, /* @__PURE__ */ new Set());
-	for (let [n, r] of t.sliceFiles.entries()) for (let i of r) e.forEachChild(i, (r) => {
-		if (e.isImportDeclaration(r) && r.moduleSpecifier && e.isStringLiteral(r.moduleSpecifier)) {
-			let s = r.moduleSpecifier.text, c = e.resolveModuleName(s, i.fileName, t.program.getCompilerOptions(), e.sys);
-			if (c.resolvedModule?.resolvedFileName) {
-				let e = c.resolvedModule.resolvedFileName.match(t.slicePattern);
-				if (e?.[1]) {
-					let r = e[1];
-					r !== n && t.sliceIds.has(r) && (a.get(n)?.add(r), o.get(r)?.add(n));
-				}
-			}
-		}
-	});
-	for (let s of t.sliceIds) {
-		let c = a.get(s)?.size, l = o.get(s)?.size, u = t.sliceFiles.get(s), d = 0, f = 0;
-		for (let t of u) {
-			let n = (t) => {
-				e.isClassDeclaration(t) ? (f++, (e.canHaveModifiers(t) ? e.getModifiers(t) : void 0)?.some((t) => t.kind === e.SyntaxKind.AbstractKeyword) && d++) : e.isInterfaceDeclaration(t) && (f++, d++), e.forEachChild(t, n);
-			};
-			n(t);
-		}
-		let p = c + l === 0 ? 0 : c / (l + c), m = f === 0 ? 0 : d / f, h = Math.abs(m + p - 1), g = h > n;
-		r && g ? i.push(`Slice ${s} has a Distance from the Main Sequence of ${h.toFixed(2)}, which exceeds the maximum of ${n}, but it shouldn't.`) : !r && g && i.push(`Slice ${s} has a Distance from the Main Sequence of ${h.toFixed(2)}, which exceeds the maximum of ${n}.`);
-	}
-	return {
-		pass: r ? i.length > 0 : i.length === 0,
-		message: () => i.join("\n") || (r ? "Expected some slices to exceed maximum distance from main sequence, but none did." : "")
-	};
-}
-//#endregion
+import { checkDependOnExternalModule as e, checkDependOnFilesInFolder as t, checkLayeredArchitecture as n, classCheckExtendClass as r, classCheckHaveMaxCyclomaticComplexity as i, classCheckHaveModifier as a, classCheckHaveNameMatchingFileName as o, classCheckImplementInterface as s, classCheckMatchNamePattern as c, classCheckResideInFolder as l, fileCheckBeFreeOfCycles as u, fileCheckHaveMaxCyclomaticComplexity as d, fileCheckHaveMaxExportedFunctions as f, fileCheckHaveMinMaintainabilityIndex as p, fileCheckMatchNamePattern as m, functionCheckHaveExplicitReturnType as h, functionCheckHaveMaxCyclomaticComplexity as g, functionCheckHaveMinMaintainabilityIndex as _, functionCheckHaveModifier as v, functionCheckHaveNameMatchingFileName as y, functionCheckMatchNamePattern as b, parseProject as x, propertyCheckBeReadonly as S, sliceCheckBeFreeOfCycles as C, sliceCheckHaveMaxDistanceFromMainSequence as w } from "@archest/core";
+import { expect as T } from "vitest";
 //#region src/matchers/index.ts
-function J() {
-	r.extend({
+function E() {
+	T.extend({
 		toPass(e) {
 			let t;
-			t = e?.data && e.data.type === "LayeredArchitecture" ? I(e.data) : e;
-			let { pass: n, message: r } = t;
+			t = e?.data && e.data.type === "LayeredArchitecture" ? n(e.data) : e;
+			let { pass: r, message: i } = t;
 			return {
-				pass: this.isNot ? !n : n,
-				message: n ? () => "Expected rule not to pass" : () => r()
+				pass: this.isNot ? !r : r,
+				message: r ? () => "Expected rule not to pass" : () => i()
 			};
 		},
 		toResideInFolder(e, t) {
 			let n;
-			if (e.type === "ClassLocator") n = _(e, t, this.isNot);
+			if (e.type === "ClassLocator") n = l(e, t, this.isNot);
 			else throw Error(`toResideInFolder matcher does not support ${e.type}`);
 			return {
 				pass: this.isNot ? !n.pass : n.pass,
@@ -752,8 +23,8 @@ function J() {
 		},
 		toHaveModifier(e, t) {
 			let n;
-			if (e.type === "ClassLocator") n = d(e, t, this.isNot);
-			else if (e.type === "FunctionLocator") n = M(e, t, this.isNot);
+			if (e.type === "ClassLocator") n = a(e, t, this.isNot);
+			else if (e.type === "FunctionLocator") n = v(e, t, this.isNot);
 			else throw Error(`toHaveModifier matcher does not support ${e.type}`);
 			return {
 				pass: this.isNot ? !n.pass : n.pass,
@@ -762,7 +33,7 @@ function J() {
 		},
 		toExtendClass(e, t) {
 			let n;
-			if (e.type === "ClassLocator") n = a(e, t, this.isNot);
+			if (e.type === "ClassLocator") n = r(e, t, this.isNot);
 			else throw Error(`toExtendClass matcher does not support ${e.type}`);
 			return {
 				pass: this.isNot ? !n.pass : n.pass,
@@ -771,7 +42,7 @@ function J() {
 		},
 		toImplementInterface(e, t) {
 			let n;
-			if (e.type === "ClassLocator") n = m(e, t, this.isNot);
+			if (e.type === "ClassLocator") n = s(e, t, this.isNot);
 			else throw Error(`toImplementInterface matcher does not support ${e.type}`);
 			return {
 				pass: this.isNot ? !n.pass : n.pass,
@@ -780,7 +51,7 @@ function J() {
 		},
 		toHaveExplicitReturnType(e) {
 			let t;
-			if (e.type === "FunctionLocator") t = k(e, this.isNot);
+			if (e.type === "FunctionLocator") t = h(e, this.isNot);
 			else throw Error(`toHaveExplicitReturnType matcher does not support ${e.type}`);
 			return {
 				pass: this.isNot ? !t.pass : t.pass,
@@ -789,26 +60,35 @@ function J() {
 		},
 		toBeReadonly(e) {
 			let t;
-			if (e.type === "PropertyLocator") t = G(e, this.isNot);
+			if (e.type === "PropertyLocator") t = S(e, this.isNot);
 			else throw Error(`toBeReadonly matcher does not support ${e.type}`);
 			return {
 				pass: this.isNot ? !t.pass : t.pass,
 				message: t.message
 			};
 		},
-		toDependOnFilesInFolder(e, t) {
-			let n;
-			if (e.type === "FileLocator") n = b(e, t, this.isNot);
+		toDependOnFilesInFolder(e, n) {
+			let r;
+			if (e.type === "FileLocator") r = t(e, n, this.isNot);
 			else throw Error(`toDependOnFilesInFolder matcher does not support ${e.type}`);
 			return {
-				pass: this.isNot ? !n.pass : n.pass,
-				message: n.message
+				pass: this.isNot ? !r.pass : r.pass,
+				message: r.message
+			};
+		},
+		toDependOnExternalModule(t, n) {
+			let r;
+			if (t.type === "FileLocator") r = e(t, n, this.isNot);
+			else throw Error(`toDependOnExternalModule matcher does not support ${t.type}`);
+			return {
+				pass: this.isNot ? !r.pass : r.pass,
+				message: r.message
 			};
 		},
 		toBeFreeOfCycles(e) {
 			let t;
-			if (e.type === "FileLocator") t = x(e, this.isNot);
-			else if (e.type === "SliceLocator") t = K(e, this.isNot);
+			if (e.type === "FileLocator") t = u(e, this.isNot);
+			else if (e.type === "SliceLocator") t = C(e, this.isNot);
 			else throw Error(`toBeFreeOfCycles matcher does not support ${e.type}`);
 			return {
 				pass: this.isNot ? !t.pass : t.pass,
@@ -817,9 +97,9 @@ function J() {
 		},
 		toMatchNamePattern(e, t) {
 			let n;
-			if (e.type === "FileLocator") n = D(e, t, this.isNot);
-			else if (e.type === "ClassLocator") n = g(e, t, this.isNot);
-			else if (e.type === "FunctionLocator") n = P(e, t, this.isNot);
+			if (e.type === "FileLocator") n = m(e, t, this.isNot);
+			else if (e.type === "ClassLocator") n = c(e, t, this.isNot);
+			else if (e.type === "FunctionLocator") n = b(e, t, this.isNot);
 			else throw Error(`toMatchNamePattern matcher does not support ${e.type}`);
 			return {
 				pass: this.isNot ? !n.pass : n.pass,
@@ -828,9 +108,9 @@ function J() {
 		},
 		toHaveMaxCyclomaticComplexity(e, t) {
 			let n;
-			if (e.type === "FileLocator") n = S(e, t, this.isNot);
-			else if (e.type === "ClassLocator") n = l(e, t, this.isNot);
-			else if (e.type === "FunctionLocator") n = A(e, t, this.isNot);
+			if (e.type === "FileLocator") n = d(e, t, this.isNot);
+			else if (e.type === "ClassLocator") n = i(e, t, this.isNot);
+			else if (e.type === "FunctionLocator") n = g(e, t, this.isNot);
 			else throw Error(`toHaveMaxCyclomaticComplexity matcher does not support ${e.type}`);
 			return {
 				pass: this.isNot ? !n.pass : n.pass,
@@ -839,8 +119,8 @@ function J() {
 		},
 		toHaveMinMaintainabilityIndex(e, t) {
 			let n;
-			if (e.type === "FileLocator") n = E(e, t, this.isNot);
-			else if (e.type === "FunctionLocator") n = j(e, t, this.isNot);
+			if (e.type === "FileLocator") n = p(e, t, this.isNot);
+			else if (e.type === "FunctionLocator") n = _(e, t, this.isNot);
 			else throw Error(`toHaveMinMaintainabilityIndex matcher does not support ${e.type}`);
 			return {
 				pass: this.isNot ? !n.pass : n.pass,
@@ -849,7 +129,7 @@ function J() {
 		},
 		toHaveMaxDistanceFromMainSequence(e, t) {
 			let n;
-			if (e.type === "SliceLocator") n = q(e, t, this.isNot);
+			if (e.type === "SliceLocator") n = w(e, t, this.isNot);
 			else throw Error(`toHaveMaxDistanceFromMainSequence matcher does not support ${e.type}`);
 			return {
 				pass: this.isNot ? !n.pass : n.pass,
@@ -858,8 +138,8 @@ function J() {
 		},
 		toHaveNameMatchingFileName(e) {
 			let t;
-			if (e.type === "FunctionLocator") t = N(e, this.isNot);
-			else if (e.type === "ClassLocator") t = p(e, this.isNot);
+			if (e.type === "FunctionLocator") t = y(e, this.isNot);
+			else if (e.type === "ClassLocator") t = o(e, this.isNot);
 			else throw Error(`toHaveNameMatchingFileName matcher does not support ${e.type}`);
 			return {
 				pass: this.isNot ? !t.pass : t.pass,
@@ -868,7 +148,7 @@ function J() {
 		},
 		toHaveMaxExportedFunctions(e, t) {
 			let n;
-			if (e.type === "FileLocator") n = C(e, t, this.isNot);
+			if (e.type === "FileLocator") n = f(e, t, this.isNot);
 			else throw Error(`toHaveMaxExportedFunctions matcher does not support ${e.type}`);
 			return {
 				pass: this.isNot ? !n.pass : n.pass,
@@ -878,6 +158,6 @@ function J() {
 	});
 }
 //#endregion
-export { b as checkDependOnFilesInFolder, I as checkLayeredArchitecture, a as classCheckExtendClass, l as classCheckHaveMaxCyclomaticComplexity, d as classCheckHaveModifier, p as classCheckHaveNameMatchingFileName, m as classCheckImplementInterface, g as classCheckMatchNamePattern, _ as classCheckResideInFolder, L as createLayeredArchitecture, x as fileCheckBeFreeOfCycles, S as fileCheckHaveMaxCyclomaticComplexity, C as fileCheckHaveMaxExportedFunctions, E as fileCheckHaveMinMaintainabilityIndex, D as fileCheckMatchNamePattern, k as functionCheckHaveExplicitReturnType, A as functionCheckHaveMaxCyclomaticComplexity, j as functionCheckHaveMinMaintainabilityIndex, M as functionCheckHaveModifier, N as functionCheckHaveNameMatchingFileName, P as functionCheckMatchNamePattern, R as layer, B as layerShouldNotBeAccessedByAnyLayer, V as layerShouldOnlyBeAccessedBy, v as locateClasses, O as locateFiles, F as locateFunctions, H as locateProperties, U as locateSlices, W as parseProject, G as propertyCheckBeReadonly, J as setupMatchers, K as sliceCheckBeFreeOfCycles, q as sliceCheckHaveMaxDistanceFromMainSequence };
+export { x as parseProject, E as setupMatchers };
 
 //# sourceMappingURL=index.mjs.map