@archest/jest 1.0.1

package/node_modules/@archest/core/dist/index.mjs

@@ -0,0 +1,607 @@
+import * as e from "node:path";
+import { dirname as t } from "node:path";
+import { ArchestProject as n } from "@archest/core-rust";
+import * as r from "typescript";
+//#region src/classes/classCheckExtendClass.ts
+function i(e, t, n) {
+	let r = [];
+	for (let i of e.classes) {
+		let e = i.name || "Anonymous", a = !1;
+		i.extends === t && (a = !0), n && a ? r.push(`Class ${e} extends ${t}, but it shouldn't.`) : !n && !a && r.push(`Class ${e} does not extend ${t}, but it should.`);
+	}
+	return {
+		pass: r.length === 0,
+		message: () => r.join("\n")
+	};
+}
+//#endregion
+//#region src/utils/ruleBuilder.ts
+function a(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/shared/sharedCheckHaveMaxCyclomaticComplexity.ts
+function o(e, t, n, r, i, o) {
+	return a(e, o, (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/classes/classCheckHaveMaxCyclomaticComplexity.ts
+function s(e, t, n) {
+	return o(e.classes, (e) => e.name, (e) => e.cyclomatic_complexity || 0, "Class", t, n);
+}
+//#endregion
+//#region src/shared/sharedCheckHaveModifier.ts
+function c(e, t, n, r, i) {
+	return a(e, i, (e) => {
+		let i = t(e), a = !1;
+		switch (r) {
+			case "export":
+				a = !!e.is_exported;
+				break;
+			case "default":
+				a = !!e.is_default;
+				break;
+			case "abstract":
+				a = !!e.is_abstract;
+				break;
+			case "async":
+				a = !!e.is_async;
+				break;
+			case "readonly":
+				a = !!e.is_readonly;
+				break;
+			default: throw Error(`Modifier ${r} is not fully supported.`);
+		}
+		let o = `${n} ${i || "Anonymous"}`;
+		return {
+			passes: a,
+			failMessage: `${o} does not have modifier ${r}, but it should.`,
+			failNotMessage: `${o} has modifier ${r}, but it shouldn't.`
+		};
+	});
+}
+//#endregion
+//#region src/classes/classCheckHaveModifier.ts
+function l(e, t, n) {
+	return c(e.classes, (e) => e.name, "Class", t, n);
+}
+//#endregion
+//#region src/shared/sharedCheckHaveNameMatchingFileName.ts
+function u(t, n, r, i) {
+	return a(t, i, (t) => {
+		let i = n(t);
+		if (!t._filePath) return {
+			passes: !0,
+			failMessage: "",
+			failNotMessage: ""
+		};
+		let a = e.basename(t._filePath, e.extname(t._filePath)), o = i === a, s = `${r} ${i || "Anonymous"}`;
+		return {
+			passes: o,
+			failMessage: `${s} does not have a name matching its filename ${a}, but it should.`,
+			failNotMessage: `${s} has a name matching its filename ${a}, but it shouldn't.`
+		};
+	});
+}
+//#endregion
+//#region src/classes/classCheckHaveNameMatchingFileName.ts
+function d(e, t) {
+	return u(e.classes, (e) => e.name, "Class", t);
+}
+//#endregion
+//#region src/classes/classCheckImplementInterface.ts
+function f(e, t, n) {
+	let r = [];
+	for (let i of e.classes) {
+		let e = i.name || "Anonymous", a = !1;
+		i.implements.includes(t) && (a = !0), n && a ? r.push(`Class ${e} implements ${t}, but it shouldn't.`) : !n && !a && r.push(`Class ${e} does not implement ${t}, but it should.`);
+	}
+	return {
+		pass: r.length === 0,
+		message: () => r.join("\n")
+	};
+}
+//#endregion
+//#region src/shared/sharedCheckMatchNamePattern.ts
+function p(e, t, n, r, i) {
+	let o = typeof r == "string" ? new RegExp(r) : r;
+	return a(e, i, (e) => {
+		let i = t(e), a = i ? o.test(i) : !1, s = `${n} ${i || "Anonymous"}`;
+		return {
+			passes: a,
+			failMessage: `${s} does not match pattern ${r}, but it should.`,
+			failNotMessage: `${s} matches pattern ${r}, but it shouldn't.`
+		};
+	});
+}
+//#endregion
+//#region src/classes/classCheckMatchNamePattern.ts
+function m(e, t, n) {
+	return p(e.classes, (e) => e.name, "Class", t, n);
+}
+//#endregion
+//#region src/classes/classCheckResideInFolder.ts
+function h(e, t, n) {
+	let r = [];
+	for (let i of e.classes) {
+		let e = i.name || "Anonymous Class", a = i._filePath, o = a.includes(`/${t}/`) || a.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/classes/locateClasses.ts
+function g(e, t, n) {
+	let r = e;
+	if (n?.inFolder && (r = r.filter((e) => e._filePath.includes(`/${n.inFolder}/`) || e._filePath.includes(`\\${n.inFolder}\\`))), n?.matchNamePattern) {
+		let e = typeof n.matchNamePattern == "string" ? new RegExp(n.matchNamePattern) : n.matchNamePattern;
+		r = r.filter((t) => t.name && e.test(t.name));
+	}
+	return n?.withDecorator && (r = r.filter((e) => e.decorators.includes(n.withDecorator))), n?.extending && (r = r.filter((e) => e.extends === n.extending)), n?.implementing && (r = r.filter((e) => e.implements.includes(n.implementing))), n?.havingModifier && (r = r.filter((e) => {
+		switch (n.havingModifier) {
+			case "export": return e.is_exported;
+			case "default": return e.is_default;
+			case "abstract": return e.is_abstract;
+			default: throw Error(`Modifier ${n.havingModifier} is not fully supported.`);
+		}
+	})), {
+		type: "ClassLocator",
+		classes: r,
+		projectData: t
+	};
+}
+//#endregion
+//#region src/files/checkDependOnExternalModule.ts
+function _(e, t, n) {
+	let r = [], i = typeof t == "string" ? new RegExp(t) : t;
+	for (let a of e.files) {
+		let e = (a.external_dependencies || []).some((e) => i.test(e));
+		n && e ? r.push(`${a.path} incorrectly depends on external module '${t}'`) : !n && !e && r.push(`${a.path} does not depend on external module '${t}'`);
+	}
+	return {
+		pass: r.length === 0,
+		message: () => r.join("\n")
+	};
+}
+//#endregion
+//#region src/files/getFileDependencies.ts
+function v(e, t) {
+	return e.dependencies || [];
+}
+//#endregion
+//#region src/files/checkDependOnFilesInFolder.ts
+function y(e, t, n) {
+	let r = [];
+	for (let i of e.files) {
+		let a = v(i, e.projectData).some((e) => e.includes(`/${t}/`) || e.includes(`\\${t}\\`));
+		n && a ? r.push(`File ${i.path} depends on files in ${t}, but it shouldn't.`) : !n && !a && r.push(`File ${i.path} does not depend on files in ${t}, but it should.`);
+	}
+	return {
+		pass: r.length === 0,
+		message: () => r.join("\n")
+	};
+}
+//#endregion
+//#region src/files/fileCheckBeFreeOfCycles.ts
+function b(e, t) {
+	let n = e.files.map((e) => e.path), r = e.archestProject;
+	if (!r) return {
+		pass: !0,
+		message: () => "Mock pass: archestProject not in registry"
+	};
+	let i = r.checkFileCycles(n, !!t);
+	return {
+		pass: i.pass,
+		message: () => i.message
+	};
+}
+//#endregion
+//#region src/files/fileCheckHaveMaxCyclomaticComplexity.ts
+function x(e, t, n) {
+	return o(e.files, (e) => e.path, (e) => {
+		let t = 0;
+		for (let n of e.functions) t += n.cyclomatic_complexity || 0;
+		for (let n of e.classes) t += n.cyclomatic_complexity || 0;
+		return t;
+	}, "File", t, n);
+}
+//#endregion
+//#region src/files/fileCheckHaveMaxExportedFunctions.ts
+function S(e, t, n) {
+	let r = [];
+	for (let i of e.files) {
+		let e = i.functions.filter((e) => e.is_exported).length, a = e > t;
+		n && a ? r.push(`File ${i.path} has ${e} exported functions, which exceeds the maximum of ${t}, but it shouldn't.`) : !n && a && r.push(`File ${i.path} has ${e} exported functions, which exceeds the maximum of ${t}.`);
+	}
+	return {
+		pass: n ? r.length > 0 : r.length === 0,
+		message: () => r.join("\n") || (n ? "Expected some files to exceed maximum exported functions, but none did." : "")
+	};
+}
+//#endregion
+//#region src/shared/sharedCheckHaveMinMaintainabilityIndex.ts
+function C(e, t, n, r, i, o) {
+	return a(e, o, (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/files/fileCheckHaveMinMaintainabilityIndex.ts
+function w(e, t, n) {
+	return C(e.files, (e) => e.path, (e) => e.functions.length > 0 && e.functions[0].maintainability_index || 100, "File", t, n);
+}
+//#endregion
+//#region src/files/fileCheckMatchNamePattern.ts
+function T(e, t, n) {
+	return p(e.files, (e) => e.path, "File", t, n);
+}
+//#endregion
+//#region src/files/locateFiles.ts
+function E(e, t, n, r) {
+	let i = e;
+	if (r?.inFolder && (i = i.filter((e) => e.path.includes(`/${r.inFolder}/`) || e.path.includes(`\\${r.inFolder}\\`))), r?.matchNamePattern) {
+		let e = typeof r.matchNamePattern == "string" ? new RegExp(r.matchNamePattern) : r.matchNamePattern;
+		i = i.filter((t) => e.test(t.path));
+	}
+	let a = {
+		type: "FileLocator",
+		files: i,
+		projectData: t
+	};
+	return n && Object.defineProperty(a, "archestProject", {
+		value: n,
+		enumerable: !1
+	}), a;
+}
+//#endregion
+//#region src/functions/functionCheckHaveExplicitReturnType.ts
+function D(e, t) {
+	let n = [];
+	for (let r of e.functions) {
+		let e = r.name || "Anonymous Function", i = r.has_explicit_return_type;
+		t && i ? n.push(`Function ${e} has an explicit return type, but it shouldn't.`) : !t && !i && n.push(`Function ${e} does not have an explicit return type, but it should.`);
+	}
+	return {
+		pass: n.length === 0,
+		message: () => n.join("\n")
+	};
+}
+//#endregion
+//#region src/functions/functionCheckHaveMaxCyclomaticComplexity.ts
+function O(e, t, n) {
+	return o(e.functions, (e) => e.name, (e) => e.cyclomatic_complexity || 0, "Function", t, n);
+}
+//#endregion
+//#region src/functions/functionCheckHaveMinMaintainabilityIndex.ts
+function k(e, t, n) {
+	return C(e.functions, (e) => e.name, (e) => e.maintainability_index || 100, "Function", t, n);
+}
+//#endregion
+//#region src/functions/functionCheckHaveModifier.ts
+function A(e, t, n) {
+	return c(e.functions, (e) => e.name, "Function", t, n);
+}
+//#endregion
+//#region src/functions/functionCheckHaveNameMatchingFileName.ts
+function j(e, t) {
+	return u(e.functions, (e) => e.name, "Function", t);
+}
+//#endregion
+//#region src/functions/functionCheckMatchNamePattern.ts
+function M(e, t, n) {
+	return p(e.functions, (e) => e.name, "Function", t, n);
+}
+//#endregion
+//#region src/functions/locateFunctions.ts
+function N(e, t, n) {
+	let r = e;
+	if (n?.inFolder && (r = r.filter((e) => e._filePath.includes(`/${n.inFolder}/`) || e._filePath.includes(`\\${n.inFolder}\\`))), n?.matchNamePattern) {
+		let e = typeof n.matchNamePattern == "string" ? new RegExp(n.matchNamePattern) : n.matchNamePattern;
+		r = r.filter((t) => t.name && e.test(t.name));
+	}
+	return n?.isTopLevel && (r = r.filter((e) => e.is_top_level)), {
+		type: "FunctionLocator",
+		functions: r,
+		projectData: t
+	};
+}
+//#endregion
+//#region src/layers/checkLayeredArchitecture.ts
+function P(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/layers/createLayeredArchitecture.ts
+function F(e, t) {
+	return {
+		type: "LayeredArchitecture",
+		files: e,
+		layers: /* @__PURE__ */ new Map(),
+		assertions: [],
+		projectData: t
+	};
+}
+//#endregion
+//#region src/layers/layer.ts
+function I(e, t, n) {
+	return e.layers.set(t, n), e;
+}
+//#endregion
+//#region src/layers/getLayerDependencies.ts
+function L(e, t) {
+	return e.dependencies || [];
+}
+//#endregion
+//#region src/layers/layerShouldNotBeAccessedByAnyLayer.ts
+function R(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.path;
+			!n.includes(`/${i}/`) && !n.includes(`\\${i}\\`) && L(a, e.projectData).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/layers/layerShouldOnlyBeAccessedBy.ts
+function z(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.path, c = o.some((e) => r.includes(`/${e}/`) || r.includes(`\\${e}\\`));
+			!r.includes(`/${a}/`) && !r.includes(`\\${a}\\`) && !c && L(s, e.projectData).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/properties/locateProperties.ts
+function B(e, t, n) {
+	let r = e;
+	if (n?.inFolder && (r = r.filter((e) => e._filePath.includes(`/${n.inFolder}/`) || e._filePath.includes(`\\${n.inFolder}\\`))), n?.matchNamePattern) {
+		let e = typeof n.matchNamePattern == "string" ? new RegExp(n.matchNamePattern) : n.matchNamePattern;
+		r = r.filter((t) => e.test(t.name));
+	}
+	return {
+		type: "PropertyLocator",
+		properties: r,
+		projectData: t
+	};
+}
+//#endregion
+//#region src/slices/locateSlices.ts
+function V(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.path.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,
+		projectData: t
+	};
+}
+//#endregion
+//#region src/project/parseProject.ts
+function H(e = {}) {
+	let i = e.tsConfigFilePath || r.findConfigFile(process.cwd(), r.sys.fileExists, "tsconfig.json");
+	if (!i) throw Error("Could not find tsconfig.json");
+	let a = t(i), o = r.readConfigFile(i, r.sys.readFile);
+	e.include && (o.config.include = e.include), e.exclude && (o.config.exclude = e.exclude);
+	let s = r.parseJsonConfigFileContent(o.config, r.sys, a, void 0, i, void 0, [{
+		extension: ".vue",
+		isMixedContent: !0,
+		scriptKind: r.ScriptKind.TS
+	}, {
+		extension: ".svelte",
+		isMixedContent: !0,
+		scriptKind: r.ScriptKind.TS
+	}]), c = n.parse(s.fileNames), l = JSON.parse(c.getProjectData());
+	return {
+		projectData: l,
+		getFiles: (e) => E(l.files, l, c, e),
+		getClasses: (e) => g(l.files.flatMap((e) => e.classes.map((t) => ({
+			...t,
+			_filePath: e.path
+		}))), l, e),
+		layeredArchitecture: () => {
+			let e = F(l.files, l), t = {
+				layer: (n, r) => (e = I(e, n, r), t),
+				whereLayer: (n) => ({
+					shouldNotBeAccessedByAnyLayer: () => (e = R(e, n), t),
+					shouldOnlyBeAccessedBy: (...r) => (e = z(e, n, r), t)
+				}),
+				check: () => P(e),
+				get data() {
+					return e;
+				}
+			};
+			return t;
+		},
+		getFunctions: (e) => N(l.files.flatMap((e) => e.functions.map((t) => ({
+			...t,
+			_filePath: e.path
+		}))), l, e),
+		getProperties: (e) => B(l.files.flatMap((e) => e.properties.map((t) => ({
+			...t,
+			_filePath: e.path
+		}))), l, e),
+		getSlices: (e) => V(l.files, l, e)
+	};
+}
+//#endregion
+//#region src/properties/propertyCheckBeReadonly.ts
+function U(e, t) {
+	let n = [];
+	for (let r of e.properties) {
+		let e = r.name || "Anonymous Property", i = r.is_readonly;
+		t && i ? n.push(`Property ${e} is readonly, but it shouldn't be.`) : !t && !i && n.push(`Property ${e} is not readonly, but it should be.`);
+	}
+	return {
+		pass: n.length === 0,
+		message: () => n.join("\n")
+	};
+}
+//#endregion
+//#region src/slices/sliceCheckBeFreeOfCycles.ts
+function W(e, t) {
+	let n = /* @__PURE__ */ new Map();
+	for (let t of e.sliceIds) n.set(t, /* @__PURE__ */ new Set());
+	for (let [t, r] of e.sliceFiles.entries()) for (let i of r) if (i.dependencies) for (let r of i.dependencies) {
+		let i = r.match(e.slicePattern);
+		if (i?.[1]) {
+			let r = i[1];
+			r !== t && e.sliceIds.has(r) && n.get(t)?.add(r);
+		}
+	}
+	let r = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set(), a = [], o = (e, t) => {
+		r.add(e), i.add(e);
+		for (let s of n.get(e) || []) if (!r.has(s)) {
+			if (o(s, [...t, s])) return !0;
+		} else if (i.has(s)) return a.push(`Cycle detected between slices: ${t.join(" -> ")} -> ${s}`), !0;
+		return i.delete(e), !1;
+	};
+	for (let t of e.sliceIds) r.has(t) || o(t, [t]);
+	return t ? {
+		pass: a.length > 0,
+		message: () => a.length > 0 ? "" : "Expected cycles between slices but found none."
+	} : {
+		pass: a.length === 0,
+		message: () => a.join("\n")
+	};
+}
+//#endregion
+//#region src/slices/sliceCheckHaveMaxDistanceFromMainSequence.ts
+function G(e, t, n) {
+	let r = [], i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map();
+	for (let t of e.sliceIds) i.set(t, /* @__PURE__ */ new Set()), a.set(t, /* @__PURE__ */ new Set());
+	for (let [t, n] of e.sliceFiles.entries()) for (let r of n) if (r.dependencies) for (let n of r.dependencies) {
+		let r = n.match(e.slicePattern);
+		if (r?.[1]) {
+			let n = r[1];
+			n !== t && e.sliceIds.has(n) && (i.get(t)?.add(n), a.get(n)?.add(t));
+		}
+	}
+	for (let o of e.sliceIds) {
+		let s = i.get(o)?.size || 0, c = a.get(o)?.size || 0, l = e.sliceFiles.get(o), u = 0, d = 0;
+		for (let e of l) for (let t of e.classes) d++, t.is_abstract && u++;
+		let f = s + c === 0 ? 0 : s / (c + s), p = d === 0 ? 0 : u / d, m = Math.abs(p + f - 1), h = m > t;
+		n && h ? r.push(`Slice ${o} has a Distance from the Main Sequence of ${m.toFixed(2)}, which exceeds the maximum of ${t}, but it shouldn't.`) : !n && h && r.push(`Slice ${o} has a Distance from the Main Sequence of ${m.toFixed(2)}, which exceeds the maximum of ${t}.`);
+	}
+	return {
+		pass: n ? r.length > 0 : r.length === 0,
+		message: () => r.join("\n") || (n ? "Expected some slices to exceed maximum distance from main sequence, but none did." : "")
+	};
+}
+//#endregion
+//#region src/testUtils.ts
+function K(e, t = "test.ts") {
+	return r.createSourceFile(t, e, r.ScriptTarget.Latest, !0);
+}
+function q(e) {
+	return { files: e.map((e) => ({
+		path: e.fileName,
+		classes: Y(e),
+		functions: X(e),
+		properties: Z(e)
+	})) };
+}
+function J(e) {
+	return n.parseMock(JSON.stringify(e));
+}
+function Y(e) {
+	let t = [];
+	return r.forEachChild(e, (n) => {
+		if (r.isClassDeclaration(n)) {
+			let i = null, a = [];
+			if (n.heritageClauses) for (let e of n.heritageClauses) {
+				if (e.token === r.SyntaxKind.ExtendsKeyword) for (let t of e.types) r.isIdentifier(t.expression) && (i = t.expression.text);
+				if (e.token === r.SyntaxKind.ImplementsKeyword) for (let t of e.types) r.isIdentifier(t.expression) && a.push(t.expression.text);
+			}
+			let o = [];
+			if (r.canHaveDecorators(n)) {
+				let e = r.getDecorators(n);
+				if (e) for (let t of e) r.isIdentifier(t.expression) ? o.push(t.expression.text) : r.isCallExpression(t.expression) && r.isIdentifier(t.expression.expression) && o.push(t.expression.expression.text);
+			}
+			t.push({
+				name: n.name?.text || null,
+				is_exported: r.canHaveModifiers(n) && r.getModifiers(n)?.some((e) => e.kind === r.SyntaxKind.ExportKeyword) || !1,
+				is_default: r.canHaveModifiers(n) && r.getModifiers(n)?.some((e) => e.kind === r.SyntaxKind.DefaultKeyword) || !1,
+				is_abstract: r.canHaveModifiers(n) && r.getModifiers(n)?.some((e) => e.kind === r.SyntaxKind.AbstractKeyword) || !1,
+				extends: i,
+				implements: a,
+				decorators: o,
+				_filePath: e.fileName
+			});
+		}
+	}), t;
+}
+function X(e) {
+	let t = [];
+	return r.forEachChild(e, (n) => {
+		if (r.isFunctionDeclaration(n) || r.isMethodDeclaration(n) || r.isArrowFunction(n)) {
+			let i = null;
+			(r.isFunctionDeclaration(n) || r.isMethodDeclaration(n)) && (i = n.name?.getText() || null), t.push({
+				name: i,
+				is_exported: r.canHaveModifiers(n) && r.getModifiers(n)?.some((e) => e.kind === r.SyntaxKind.ExportKeyword) || !1,
+				is_async: r.canHaveModifiers(n) && r.getModifiers(n)?.some((e) => e.kind === r.SyntaxKind.AsyncKeyword) || !1,
+				is_top_level: !0,
+				has_explicit_return_type: !!n.type,
+				_filePath: e.fileName
+			});
+		}
+	}), t;
+}
+function Z(e) {
+	let t = [];
+	return r.forEachChild(e, (n) => {
+		r.isClassDeclaration(n) && n.members.forEach((n) => {
+			r.isPropertyDeclaration(n) && t.push({
+				name: n.name.getText(),
+				is_readonly: r.canHaveModifiers(n) && r.getModifiers(n)?.some((e) => e.kind === r.SyntaxKind.ReadonlyKeyword) || !1,
+				_filePath: e.fileName
+			});
+		});
+	}), t;
+}
+//#endregion
+export { _ as checkDependOnExternalModule, y as checkDependOnFilesInFolder, P as checkLayeredArchitecture, i as classCheckExtendClass, s as classCheckHaveMaxCyclomaticComplexity, l as classCheckHaveModifier, d as classCheckHaveNameMatchingFileName, f as classCheckImplementInterface, m as classCheckMatchNamePattern, h as classCheckResideInFolder, F as createLayeredArchitecture, J as createMockArchestProject, q as createMockProgram, K as createSourceFile, b as fileCheckBeFreeOfCycles, x as fileCheckHaveMaxCyclomaticComplexity, S as fileCheckHaveMaxExportedFunctions, w as fileCheckHaveMinMaintainabilityIndex, T as fileCheckMatchNamePattern, D as functionCheckHaveExplicitReturnType, O as functionCheckHaveMaxCyclomaticComplexity, k as functionCheckHaveMinMaintainabilityIndex, A as functionCheckHaveModifier, j as functionCheckHaveNameMatchingFileName, M as functionCheckMatchNamePattern, Y as getClasses, X as getFunctions, Z as getProperties, I as layer, R as layerShouldNotBeAccessedByAnyLayer, z as layerShouldOnlyBeAccessedBy, g as locateClasses, E as locateFiles, N as locateFunctions, B as locateProperties, V as locateSlices, H as parseProject, U as propertyCheckBeReadonly, W as sliceCheckBeFreeOfCycles, G as sliceCheckHaveMaxDistanceFromMainSequence };
+
+//# sourceMappingURL=index.mjs.map