@tamagui/compiler-core 3.0.0-beta.807.1 → 3.0.0-beta.881.1

package/dist/cjs/evaluate.cjs

@@ -262,10 +262,7 @@ function evaluateNode(resolver, id, input, state) {
 			const expressions = (0, import_ast.childNodes)(node, "expressions");
 			let output = "";
 			for (let index = 0; index < quasis.length; index++) {
-				const quasi = quasis[index];
-				const cooked = quasi?.value?.cooked;
-				const raw = quasi?.value?.raw;
-				output += typeof cooked === "string" ? cooked : typeof raw === "string" ? raw : "";
+				output += quasiText(quasis[index]);
 				const expression = expressions[index];
 				if (expression) {
 					const value = evaluateNode(resolver, id, expression, state);
@@ -278,6 +275,11 @@ function evaluateNode(resolver, id, input, state) {
 		default: return unsupported(id, node);
 	}
 }
+function quasiText(quasi) {
+	const cooked = quasi?.value?.cooked;
+	const raw = quasi?.value?.raw;
+	return typeof cooked === "string" ? cooked : typeof raw === "string" ? raw : "";
+}
 function dynamicPrimitive(value) {
 	if (value === null) return "null";
 	if (typeof value === "number") return "number";
@@ -412,6 +414,9 @@ function evaluateBranchesNode(resolver, id, input, depth, state, sourceId) {
 			whenFalse
 		};
 	}
+	if (node.type === "TemplateLiteral") {
+		return templateBranchesNode(resolver, id, (0, import_ast.childNodes)(node, "quasis"), (0, import_ast.childNodes)(node, "expressions"), 0, "", depth, state, sourceId);
+	}
 	if (node.type === "LogicalExpression") {
 		const left = (0, import_ast.childNode)(node, "left");
 		const right = (0, import_ast.childNode)(node, "right");
@@ -459,6 +464,54 @@ function evaluateBranchesNode(resolver, id, input, depth, state, sourceId) {
 	}
 	return null;
 }
+function mapBranchLeaves(node, map) {
+	if (node.kind === "leaf") return map(node);
+	const whenTrue = mapBranchLeaves(node.whenTrue, map);
+	if (!whenTrue) return null;
+	const whenFalse = mapBranchLeaves(node.whenFalse, map);
+	if (!whenFalse) return null;
+	return {
+		kind: "branch",
+		test: node.test,
+		whenTrue,
+		whenFalse
+	};
+}
+function templateBranchesNode(resolver, id, quasis, expressions, index, prefix, depth, state, sourceId) {
+	let text = prefix;
+	for (let position = index; position < quasis.length; position++) {
+		text += quasiText(quasis[position]);
+		const expression = expressions[position];
+		if (!expression) continue;
+		const exact = evaluateNode(resolver, id, expression, state);
+		if (exact.ok) {
+			const interpolated = templateInterpolation(exact.value);
+			if (interpolated === null) return null;
+			text += interpolated;
+			continue;
+		}
+		const tree = evaluateBranchesNode(resolver, id, expression, depth + 1, state, sourceId);
+		if (!tree) return null;
+		return mapBranchLeaves(tree, (leaf) => {
+			if (leaf.value === void 0) return null;
+			const interpolated = templateInterpolation(leaf.value);
+			if (interpolated === null) return null;
+			return templateBranchesNode(resolver, id, quasis, expressions, position + 1, text + interpolated, depth + 1, state, sourceId);
+		});
+	}
+	return {
+		kind: "leaf",
+		value: text,
+		dependencies: [...state.dependencies].sort()
+	};
+}
+function templateInterpolation(value) {
+	if (value === null) return "null";
+	if (typeof value === "string" || typeof value === "number" || typeof value === "boolean") {
+		return String(value);
+	}
+	return null;
+}
 function evaluateBranches(resolver, reference) {
 	const node = resolver.expressionNode(reference);
 	if (!node) return null;

package/dist/cjs/graph.cjs

@@ -89,6 +89,16 @@ var ProjectGraph = class {
 	dependentsOf(id) {
 		return [...this.#dependents.get(id) ?? []].sort(compareIds);
 	}
+	/** resolved ids a module imports that the graph does not own (package entries) */
+	externalImportsOf(id) {
+		const record = this.#modules.get(id);
+		if (!record) return [];
+		const ids = /* @__PURE__ */ new Set();
+		for (const dependency of record.input.imports) {
+			if (dependency.external) ids.add(dependency.resolvedId);
+		}
+		return [...ids].sort(compareIds);
+	}
 	affectedBy(id) {
 		const affected = /* @__PURE__ */ new Set([id]);
 		const queue = [id];

package/dist/cjs/normalize.cjs

@@ -458,6 +458,12 @@ const DOM_STYLE_FRONTENDS = /* @__PURE__ */ new Set([
 	"@tamagui/core/dom",
 	"@tamagui/tailwind"
 ]);
+const STYLE_FRONTENDS = /* @__PURE__ */ new Set([
+	...DOM_STYLE_FRONTENDS,
+	"tamagui",
+	"@tamagui/core",
+	"@tamagui/web"
+]);
 function domStyleDefinitions(id, program, imports) {
 	const definitions = [];
 	(0, import_ast.walkAst)(program, (node) => {
@@ -470,7 +476,7 @@ function domStyleDefinitions(id, program, imports) {
 		const factoryName = callee && (0, import_ast.identifierName)(callee);
 		if (!factoryName) return;
 		const binding = importBinding(program, factoryName);
-		if (!binding || binding.imported !== "style" || !DOM_STYLE_FRONTENDS.has(binding.source)) {
+		if (!binding || binding.imported !== "style" || !STYLE_FRONTENDS.has(binding.source)) {
 			return;
 		}
 		const factory = (0, import_ir.hostImportProvenance)(imports, binding.source, binding.imported);
@@ -501,7 +507,7 @@ function domStyleArgument(candidate, id, program, node) {
 	const factoryName = callee && (0, import_ast.identifierName)(callee);
 	if (!factoryName) return null;
 	const binding = importBinding(program, factoryName);
-	if (!binding || binding.imported !== "style" || !DOM_STYLE_FRONTENDS.has(binding.source)) {
+	if (!binding || binding.imported !== "style" || !STYLE_FRONTENDS.has(binding.source)) {
 		return null;
 	}
 	return (0, import_ast.childNodes)(call, "arguments")[0] ?? null;

package/dist/cjs/planCache.cjs

@@ -24,6 +24,7 @@ __export(planCache_exports, {
 	ModulePlanCache: () => ModulePlanCache,
 	PLAN_CACHE_MAX_ENTRIES: () => PLAN_CACHE_MAX_ENTRIES,
 	PLAN_CACHE_SCHEMA_VERSION: () => PLAN_CACHE_SCHEMA_VERSION,
+	createExternalClosureLookup: () => createExternalClosureLookup,
 	defaultPlanCacheRoot: () => defaultPlanCacheRoot,
 	moduleClosureDigest: () => moduleClosureDigest,
 	moduleClosureNode: () => moduleClosureNode,
@@ -32,6 +33,7 @@ __export(planCache_exports, {
 });
 module.exports = __toCommonJS(planCache_exports);
 var import_node_crypto = require("node:crypto");
+var import_node_fs = require("node:fs");
 var import_promises = require("node:fs/promises");
 var import_node_path = require("node:path");
 var import_hash = require("./hash.cjs");
@@ -45,10 +47,47 @@ function tamaguiCacheRoot(projectRoot) {
 function defaultPlanCacheRoot(projectRoot, target) {
 	return (0, import_node_path.join)(tamaguiCacheRoot(projectRoot), "plans", target);
 }
-function moduleClosureNode(input) {
+function moduleClosureNode(input, options) {
 	return {
 		contentHash: (0, import_graph.moduleContentHash)(input),
-		dependencies: input.imports.filter(({ external }) => !external).map(({ resolvedId }) => resolvedId)
+		dependencies: input.imports.filter(({ external }) => options?.includeExternal || !external).map(({ resolvedId }) => resolvedId)
+	};
+}
+function createExternalClosureLookup() {
+	const memo = /* @__PURE__ */ new Map();
+	return (id) => {
+		const file = id.split(/[?#]/, 1)[0];
+		if (!file.startsWith("/") && !/^[A-Za-z]:[\\/]/.test(file)) {
+			return {
+				contentHash: "external",
+				dependencies: []
+			};
+		}
+		try {
+			const stat2 = (0, import_node_fs.statSync)(file);
+			const cached = memo.get(file);
+			if (cached && cached.size === stat2.size && cached.mtimeMs === stat2.mtimeMs) {
+				return {
+					contentHash: cached.contentHash,
+					dependencies: []
+				};
+			}
+			const hash = (0, import_node_crypto.createHash)("sha256").update((0, import_node_fs.readFileSync)(file)).digest("hex");
+			memo.set(file, {
+				size: stat2.size,
+				mtimeMs: stat2.mtimeMs,
+				contentHash: hash
+			});
+			return {
+				contentHash: hash,
+				dependencies: []
+			};
+		} catch {
+			return {
+				contentHash: "external",
+				dependencies: []
+			};
+		}
 	};
 }
 function moduleClosureDigest(id, lookup, memo) {

package/dist/cjs/session.cjs

@@ -32,6 +32,7 @@ function compareIds(left, right) {
 }
 var CompilerSession = class {
 	#graph = new import_graph.ProjectGraph(import_yuku.yukuFactory, { modules: [] });
+	#externalClosure = (0, import_planCache.createExternalClosureLookup)();
 	#queue = Promise.resolve();
 	compile(input) {
 		const operation = this.#queue.then(() => this.#compile(input));
@@ -65,10 +66,13 @@ var CompilerSession = class {
 		const cache = adapter.planCache?.stamp ? adapter.planCache : null;
 		const closureDigest = cache ? (0, import_planCache.moduleClosureDigest)(module2.id, (id) => {
 			const hash = graph.contentHash(id);
-			return hash ? {
-				contentHash: hash,
-				dependencies: graph.dependenciesOf(id)
-			} : null;
+			if (hash) {
+				return {
+					contentHash: hash,
+					dependencies: [...graph.dependenciesOf(id), ...graph.externalImportsOf(id)]
+				};
+			}
+			return this.#externalClosure(id);
 		}) : null;
 		const entry = cache && closureDigest ? {
 			store: cache.store,
@@ -80,14 +84,19 @@ var CompilerSession = class {
 			}, module2.id, closureDigest)
 		} : null;
 		const cached = entry ? await entry.store.read(entry.key, module2.id, entry.digest) : null;
-		const plan = cached?.plan ?? (0, import_lower.lowerModule)({
-			module: (0, import_materialize.materializeModule)(graph, module2.id),
-			source: module2.source,
-			target: adapter.target,
-			host: adapter.host,
-			options: { projectGeneration: adapter.projectGeneration },
-			structuralPass
-		});
+		let plan = cached?.plan;
+		if (!plan) {
+			const materialized = (0, import_materialize.materializeModule)(graph, module2.id);
+			if (adapter.prepare) await adapter.prepare(materialized);
+			plan = (0, import_lower.lowerModule)({
+				module: materialized,
+				source: module2.source,
+				target: adapter.target,
+				host: adapter.host,
+				options: { projectGeneration: adapter.projectGeneration },
+				structuralPass
+			});
+		}
 		if (entry && !cached) {
 			await entry.store.write(entry.key, {
 				schemaVersion: import_planCache.PLAN_CACHE_SCHEMA_VERSION,

package/dist/cjs/zero.cjs

@@ -45,8 +45,7 @@ const ZERO_DESIGN_STATE_APIS = /* @__PURE__ */ new Set([
 	"useMedia",
 	"useTheme",
 	"useThemeName",
-	"useProps",
-	"usePropsAndStyle",
+	"splitStyleProps",
 	"getConfig",
 	"getTokens",
 	"useTokens",

package/dist/esm/evaluate.mjs

@@ -233,10 +233,7 @@ function evaluateNode(resolver, id, input, state) {
 			const expressions = childNodes(node, "expressions");
 			let output = "";
 			for (let index = 0; index < quasis.length; index++) {
-				const quasi = quasis[index];
-				const cooked = quasi?.value?.cooked;
-				const raw = quasi?.value?.raw;
-				output += typeof cooked === "string" ? cooked : typeof raw === "string" ? raw : "";
+				output += quasiText(quasis[index]);
 				const expression = expressions[index];
 				if (expression) {
 					const value = evaluateNode(resolver, id, expression, state);
@@ -249,6 +246,11 @@ function evaluateNode(resolver, id, input, state) {
 		default: return unsupported(id, node);
 	}
 }
+function quasiText(quasi) {
+	const cooked = quasi?.value?.cooked;
+	const raw = quasi?.value?.raw;
+	return typeof cooked === "string" ? cooked : typeof raw === "string" ? raw : "";
+}
 function dynamicPrimitive(value) {
 	if (value === null) return "null";
 	if (typeof value === "number") return "number";
@@ -383,6 +385,9 @@ function evaluateBranchesNode(resolver, id, input, depth, state, sourceId) {
 			whenFalse
 		};
 	}
+	if (node.type === "TemplateLiteral") {
+		return templateBranchesNode(resolver, id, childNodes(node, "quasis"), childNodes(node, "expressions"), 0, "", depth, state, sourceId);
+	}
 	if (node.type === "LogicalExpression") {
 		const left = childNode(node, "left");
 		const right = childNode(node, "right");
@@ -430,6 +435,54 @@ function evaluateBranchesNode(resolver, id, input, depth, state, sourceId) {
 	}
 	return null;
 }
+function mapBranchLeaves(node, map) {
+	if (node.kind === "leaf") return map(node);
+	const whenTrue = mapBranchLeaves(node.whenTrue, map);
+	if (!whenTrue) return null;
+	const whenFalse = mapBranchLeaves(node.whenFalse, map);
+	if (!whenFalse) return null;
+	return {
+		kind: "branch",
+		test: node.test,
+		whenTrue,
+		whenFalse
+	};
+}
+function templateBranchesNode(resolver, id, quasis, expressions, index, prefix, depth, state, sourceId) {
+	let text = prefix;
+	for (let position = index; position < quasis.length; position++) {
+		text += quasiText(quasis[position]);
+		const expression = expressions[position];
+		if (!expression) continue;
+		const exact = evaluateNode(resolver, id, expression, state);
+		if (exact.ok) {
+			const interpolated = templateInterpolation(exact.value);
+			if (interpolated === null) return null;
+			text += interpolated;
+			continue;
+		}
+		const tree = evaluateBranchesNode(resolver, id, expression, depth + 1, state, sourceId);
+		if (!tree) return null;
+		return mapBranchLeaves(tree, (leaf) => {
+			if (leaf.value === void 0) return null;
+			const interpolated = templateInterpolation(leaf.value);
+			if (interpolated === null) return null;
+			return templateBranchesNode(resolver, id, quasis, expressions, position + 1, text + interpolated, depth + 1, state, sourceId);
+		});
+	}
+	return {
+		kind: "leaf",
+		value: text,
+		dependencies: [...state.dependencies].sort()
+	};
+}
+function templateInterpolation(value) {
+	if (value === null) return "null";
+	if (typeof value === "string" || typeof value === "number" || typeof value === "boolean") {
+		return String(value);
+	}
+	return null;
+}
 function evaluateBranches(resolver, reference) {
 	const node = resolver.expressionNode(reference);
 	if (!node) return null;

package/dist/esm/evaluate.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"evaluate.js","names":[],"sources":["esm/evaluate.js"],"sourcesContent":["import { childNode, childNodes, identifierName, isAstNode, unwrapExpression } from \"./ast\";\nimport { expressionReference, spanOf } from \"./contracts\";\nimport { linkedBailout, localBailout } from \"./diagnostics\";\nfunction success(value) {\n  return { ok: true, value };\n}\nfunction literal(node) {\n  if (node.type === \"NullLiteral\") return null;\n  if (node.type === \"Literal\" || node.type.endsWith(\"Literal\")) {\n    const value = node.value;\n    if (typeof value === \"string\" || typeof value === \"number\" || typeof value === \"boolean\" || value === null) {\n      return value;\n    }\n  }\n  return void 0;\n}\nfunction unsupported(id, node, detail = `Expression ${node.type} is not statically supported`) {\n  return {\n    ok: false,\n    bailout: localBailout(\"local/unsupported-expression\", spanOf(id, node), detail)\n  };\n}\nfunction evaluateDefinition(resolver, definition, useSpan, state) {\n  const key = `${definition.id}:${definition.span.start}`;\n  if (state.activeDefinitions.has(key)) {\n    return {\n      ok: false,\n      bailout: localBailout(\n        \"local/static-evaluation-cycle\",\n        useSpan,\n        `Static evaluation cycle reached ${definition.name}`\n      )\n    };\n  }\n  if (!definition.initializer) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/missing-initializer\",\n        useSpan,\n        `Binding ${definition.name} has no static initializer`,\n        definition.id\n      )\n    };\n  }\n  if (!definition.constant) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/unresolved-binding\",\n        useSpan,\n        `Binding ${definition.name} is mutable and cannot be statically evaluated`,\n        definition.id\n      )\n    };\n  }\n  const initializer = resolver.expressionNode(definition.initializer);\n  if (!initializer) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/missing-initializer\",\n        useSpan,\n        `Binding ${definition.name} initializer is outside the linked graph`,\n        definition.id\n      )\n    };\n  }\n  state.dependencies.add(definition.id);\n  state.activeDefinitions.add(key);\n  try {\n    return evaluateNode(resolver, definition.id, initializer, state);\n  } finally {\n    state.activeDefinitions.delete(key);\n  }\n}\nfunction evaluateObject(resolver, id, node, state) {\n  const output = {};\n  for (const property of childNodes(node, \"properties\")) {\n    if (property.type === \"SpreadElement\") {\n      const argument = childNode(property, \"argument\");\n      if (!argument) return unsupported(id, property);\n      const spread = evaluateNode(resolver, id, argument, state);\n      if (!spread.ok) return spread;\n      if (!spread.value || typeof spread.value !== \"object\" || Array.isArray(spread.value)) {\n        return {\n          ok: false,\n          bailout: localBailout(\n            \"local/non-object-spread\",\n            spanOf(id, property),\n            \"Static object spread did not evaluate to an object\"\n          )\n        };\n      }\n      Object.assign(output, spread.value);\n      continue;\n    }\n    if (property.type !== \"Property\" && property.type !== \"ObjectProperty\") {\n      return unsupported(id, property);\n    }\n    const keyNode = childNode(property, \"key\");\n    const valueNode = childNode(property, \"value\");\n    if (!keyNode || !valueNode) return unsupported(id, property);\n    let key = identifierName(keyNode) ?? void 0;\n    if (property.computed === true || key === void 0) {\n      const evaluatedKey = evaluateNode(resolver, id, keyNode, state);\n      if (!evaluatedKey.ok) return evaluatedKey;\n      key = evaluatedKey.value;\n    }\n    if (typeof key !== \"string\" && typeof key !== \"number\") {\n      return unsupported(id, keyNode, \"Static object key is not a string or number\");\n    }\n    const value = evaluateNode(resolver, id, valueNode, state);\n    if (!value.ok) return value;\n    output[String(key)] = value.value;\n  }\n  return success(output);\n}\nfunction evaluateArray(resolver, id, node, state) {\n  const output = [];\n  const rawElements = node.elements;\n  if (!Array.isArray(rawElements) || rawElements.some((element) => element === null || !isAstNode(element))) {\n    return unsupported(id, node, \"Sparse arrays are not statically supported\");\n  }\n  for (const element of rawElements.filter(isAstNode)) {\n    if (element.type === \"SpreadElement\") {\n      const argument = childNode(element, \"argument\");\n      if (!argument) return unsupported(id, element);\n      const spread = evaluateNode(resolver, id, argument, state);\n      if (!spread.ok) return spread;\n      if (!Array.isArray(spread.value)) {\n        return unsupported(\n          id,\n          element,\n          \"Static array spread did not evaluate to an array\"\n        );\n      }\n      output.push(...spread.value);\n      continue;\n    }\n    const value = evaluateNode(resolver, id, element, state);\n    if (!value.ok) return value;\n    output.push(value.value);\n  }\n  return success(output);\n}\nfunction evaluateNode(resolver, id, input, state) {\n  const node = unwrapExpression(input);\n  const literalValue = literal(node);\n  if (literalValue !== void 0) return success(literalValue);\n  switch (node.type) {\n    case \"Identifier\": {\n      const name = identifierName(node);\n      if (!name) return unsupported(id, node);\n      const definition = resolver.resolveBinding(id, name);\n      if (!definition) {\n        return {\n          ok: false,\n          bailout: linkedBailout(\n            \"linked/unresolved-binding\",\n            spanOf(id, node),\n            `Binding ${name} has no host-linked definition`\n          )\n        };\n      }\n      return evaluateDefinition(resolver, definition, spanOf(id, node), state);\n    }\n    case \"ObjectExpression\":\n      return evaluateObject(resolver, id, node, state);\n    case \"ArrayExpression\":\n      return evaluateArray(resolver, id, node, state);\n    case \"MemberExpression\": {\n      const objectNode = childNode(node, \"object\");\n      const propertyNode = childNode(node, \"property\");\n      if (!objectNode || !propertyNode) return unsupported(id, node);\n      const object = evaluateNode(resolver, id, objectNode, state);\n      if (!object.ok) return object;\n      let property = identifierName(propertyNode);\n      if (node.computed === true || property === null) {\n        const evaluatedProperty = evaluateNode(resolver, id, propertyNode, state);\n        if (!evaluatedProperty.ok) return evaluatedProperty;\n        property = evaluatedProperty.value;\n      }\n      if ((typeof object.value !== \"object\" || object.value === null) && typeof object.value !== \"string\") {\n        return unsupported(id, node, \"Static member target is not indexable\");\n      }\n      if (typeof property !== \"string\" && typeof property !== \"number\") {\n        return unsupported(\n          id,\n          propertyNode,\n          \"Static member key is not a string or number\"\n        );\n      }\n      const value = object.value[String(property)];\n      return value === void 0 ? unsupported(id, node, `Static member ${String(property)} does not exist`) : success(value);\n    }\n    case \"UnaryExpression\": {\n      const argument = childNode(node, \"argument\");\n      if (!argument) return unsupported(id, node);\n      const value = evaluateNode(resolver, id, argument, state);\n      if (!value.ok) return value;\n      if (node.operator === \"-\" && typeof value.value === \"number\") {\n        return success(-value.value);\n      }\n      if (node.operator === \"+\" && typeof value.value === \"number\") {\n        return success(value.value);\n      }\n      if (node.operator === \"!\") return success(!value.value);\n      return unsupported(\n        id,\n        node,\n        `Unary operator ${String(node.operator)} is unsupported`\n      );\n    }\n    case \"BinaryExpression\":\n    case \"LogicalExpression\": {\n      const leftNode = childNode(node, \"left\");\n      const rightNode = childNode(node, \"right\");\n      if (!leftNode || !rightNode) return unsupported(id, node);\n      const left = evaluateNode(resolver, id, leftNode, state);\n      if (!left.ok) return left;\n      if (node.type === \"LogicalExpression\") {\n        if (node.operator === \"&&\" && !left.value) return left;\n        if (node.operator === \"||\" && left.value) return left;\n        if (node.operator === \"??\" && left.value !== null) return left;\n      }\n      const right = evaluateNode(resolver, id, rightNode, state);\n      if (!right.ok) return right;\n      switch (node.operator) {\n        case \"+\":\n          if (typeof left.value === \"number\" && typeof right.value === \"number\") {\n            return success(left.value + right.value);\n          }\n          if (typeof left.value === \"string\" || typeof right.value === \"string\") {\n            return success(String(left.value) + String(right.value));\n          }\n          break;\n        case \"-\":\n          if (typeof left.value === \"number\" && typeof right.value === \"number\") {\n            return success(left.value - right.value);\n          }\n          break;\n        case \"*\":\n          if (typeof left.value === \"number\" && typeof right.value === \"number\") {\n            return success(left.value * right.value);\n          }\n          break;\n        case \"/\":\n          if (typeof left.value === \"number\" && typeof right.value === \"number\") {\n            return success(left.value / right.value);\n          }\n          break;\n        case \"&&\":\n        case \"||\":\n        case \"??\":\n          return right;\n      }\n      return unsupported(\n        id,\n        node,\n        `Binary operator ${String(node.operator)} is unsupported`\n      );\n    }\n    case \"ConditionalExpression\": {\n      const testNode = childNode(node, \"test\");\n      const consequent = childNode(node, \"consequent\");\n      const alternate = childNode(node, \"alternate\");\n      if (!testNode || !consequent || !alternate) return unsupported(id, node);\n      const test = evaluateNode(resolver, id, testNode, state);\n      if (!test.ok) return test;\n      return evaluateNode(resolver, id, test.value ? consequent : alternate, state);\n    }\n    case \"TemplateLiteral\": {\n      const quasis = childNodes(node, \"quasis\");\n      const expressions = childNodes(node, \"expressions\");\n      let output = \"\";\n      for (let index = 0; index < quasis.length; index++) {\n        const quasi = quasis[index];\n        const cooked = quasi?.value?.cooked;\n        const raw = quasi?.value?.raw;\n        output += typeof cooked === \"string\" ? cooked : typeof raw === \"string\" ? raw : \"\";\n        const expression = expressions[index];\n        if (expression) {\n          const value = evaluateNode(resolver, id, expression, state);\n          if (!value.ok) return value;\n          output += String(value.value);\n        }\n      }\n      return success(output);\n    }\n    default:\n      return unsupported(id, node);\n  }\n}\nfunction dynamicPrimitive(value) {\n  if (value === null) return \"null\";\n  if (typeof value === \"number\") return \"number\";\n  if (typeof value === \"string\") return \"string\";\n  if (typeof value === \"boolean\") return \"boolean\";\n  return null;\n}\nfunction evaluateDynamicNode(resolver, id, input, state) {\n  const exact = evaluateNode(resolver, id, input, state);\n  if (exact.ok) {\n    const type = dynamicPrimitive(exact.value);\n    return type ? { type, values: [exact.value] } : null;\n  }\n  const node = unwrapExpression(input);\n  if (node.type === \"Identifier\") {\n    if (!identifierName(node)) return null;\n    const definition = resolver.resolveReference(expressionReference(id, node));\n    if (!definition?.constant || !definition.initializer) return null;\n    const key = `${definition.id}:${definition.span.start}`;\n    if (state.activeDefinitions.has(key)) return null;\n    const initializer = resolver.expressionNode(definition.initializer);\n    if (!initializer) return null;\n    state.dependencies.add(definition.id);\n    state.activeDefinitions.add(key);\n    try {\n      return evaluateDynamicNode(resolver, definition.id, initializer, state);\n    } finally {\n      state.activeDefinitions.delete(key);\n    }\n  }\n  if (node.type === \"MemberExpression\") {\n    const objectNode = childNode(node, \"object\");\n    const propertyNode = childNode(node, \"property\");\n    if (!objectNode || !propertyNode) return null;\n    const object = evaluateNode(resolver, id, objectNode, state);\n    if (!object.ok || !Array.isArray(object.value)) return null;\n    const property = evaluateDynamicNode(resolver, id, propertyNode, state);\n    if (property?.type !== \"number\" || object.value.length > 32) return null;\n    const values = [];\n    let type = null;\n    for (const value of object.value) {\n      const nextType = dynamicPrimitive(value);\n      if (!nextType || type && type !== nextType) return null;\n      type = nextType;\n      const primitive = value;\n      if (!values.includes(primitive)) values.push(primitive);\n    }\n    return type ? { type, values } : null;\n  }\n  if (node.type === \"BinaryExpression\") {\n    const leftNode = childNode(node, \"left\");\n    const rightNode = childNode(node, \"right\");\n    if (!leftNode || !rightNode) return null;\n    const left = evaluateDynamicNode(resolver, id, leftNode, state);\n    const right = evaluateDynamicNode(resolver, id, rightNode, state);\n    if (node.operator === \"+\") {\n      return left?.type === \"number\" && right?.type === \"number\" ? { type: \"number\" } : null;\n    }\n    if (node.operator === \"-\" || node.operator === \"*\" || node.operator === \"/\" || node.operator === \"%\" || node.operator === \"**\") {\n      if (left?.type === \"number\" || right?.type === \"number\") {\n        return { type: \"number\" };\n      }\n    }\n  }\n  return null;\n}\nfunction collectLeaves(node) {\n  if (node.kind === \"leaf\") return [node];\n  return [...collectLeaves(node.whenTrue), ...collectLeaves(node.whenFalse)];\n}\nfunction collectBranchDependencies(node) {\n  if (node.kind === \"leaf\") return node.dependencies;\n  return [\n    .../* @__PURE__ */ new Set([\n      ...collectBranchDependencies(node.whenTrue),\n      ...collectBranchDependencies(node.whenFalse)\n    ])\n  ].sort();\n}\nfunction evaluateBranchChild(resolver, id, node, depth, state, sourceId) {\n  const leafState = {\n    activeDefinitions: new Set(state.activeDefinitions),\n    dependencies: new Set(state.dependencies)\n  };\n  const leafRes = evaluateNode(resolver, id, node, leafState);\n  if (leafRes.ok) {\n    return {\n      kind: \"leaf\",\n      value: leafRes.value,\n      dependencies: [...leafState.dependencies].sort()\n    };\n  }\n  return evaluateBranchesNode(resolver, id, node, depth + 1, leafState, sourceId);\n}\nfunction evaluateBranchesNode(resolver, id, input, depth, state, sourceId) {\n  const node = unwrapExpression(input);\n  if (!isAstNode(node)) return null;\n  if (node.type === \"Identifier\") {\n    const name = identifierName(node);\n    if (!name) return null;\n    const definition = resolver.resolveBinding(id, name);\n    if (!definition || !definition.constant || !definition.initializer) return null;\n    const initializer = resolver.expressionNode(definition.initializer);\n    if (!initializer) return null;\n    const key = `${definition.id}:${definition.span.start}`;\n    if (state.activeDefinitions.has(key)) return null;\n    state.activeDefinitions.add(key);\n    state.dependencies.add(definition.id);\n    try {\n      return evaluateBranchesNode(\n        resolver,\n        definition.id,\n        initializer,\n        depth,\n        state,\n        sourceId\n      );\n    } finally {\n      state.activeDefinitions.delete(key);\n    }\n  }\n  if (depth >= 3) return null;\n  if (node.type === \"ConditionalExpression\") {\n    const testNode = childNode(node, \"test\");\n    const consequent = childNode(node, \"consequent\");\n    const alternate = childNode(node, \"alternate\");\n    if (!testNode || !consequent || !alternate) return null;\n    const test = spanOf(id, testNode);\n    if (test.id !== sourceId) return null;\n    const whenTrue = evaluateBranchChild(resolver, id, consequent, depth, state, sourceId);\n    if (!whenTrue) return null;\n    const whenFalse = evaluateBranchChild(resolver, id, alternate, depth, state, sourceId);\n    if (!whenFalse) return null;\n    return {\n      kind: \"branch\",\n      test,\n      whenTrue,\n      whenFalse\n    };\n  }\n  if (node.type === \"LogicalExpression\") {\n    const left = childNode(node, \"left\");\n    const right = childNode(node, \"right\");\n    if (!left || !right) return null;\n    if (node.operator === \"&&\") {\n      const test = spanOf(id, left);\n      if (test.id !== sourceId) return null;\n      const whenTrue = evaluateBranchChild(resolver, id, right, depth, state, sourceId);\n      if (!whenTrue) return null;\n      const whenFalse = {\n        kind: \"leaf\",\n        value: void 0,\n        dependencies: [...state.dependencies].sort()\n      };\n      return {\n        kind: \"branch\",\n        test,\n        whenTrue,\n        whenFalse\n      };\n    }\n    if (node.operator === \"||\" || node.operator === \"??\") {\n      const test = spanOf(id, left);\n      if (test.id !== sourceId) return null;\n      const leftState = {\n        activeDefinitions: new Set(state.activeDefinitions),\n        dependencies: new Set(state.dependencies)\n      };\n      const leftRes = evaluateNode(resolver, id, left, leftState);\n      if (!leftRes.ok) return null;\n      const whenTrue = {\n        kind: \"leaf\",\n        value: leftRes.value,\n        dependencies: [...leftState.dependencies].sort()\n      };\n      const whenFalse = evaluateBranchChild(resolver, id, right, depth, state, sourceId);\n      if (!whenFalse) return null;\n      return {\n        kind: \"branch\",\n        test,\n        whenTrue,\n        whenFalse\n      };\n    }\n  }\n  return null;\n}\nfunction evaluateBranches(resolver, reference) {\n  const node = resolver.expressionNode(reference);\n  if (!node) return null;\n  const state = {\n    activeDefinitions: /* @__PURE__ */ new Set(),\n    dependencies: /* @__PURE__ */ new Set()\n  };\n  const tree = evaluateBranchesNode(resolver, reference.id, node, 0, state, reference.id);\n  return tree?.kind === \"branch\" ? tree : null;\n}\nfunction evaluateExpression(resolver, reference) {\n  const node = resolver.expressionNode(reference);\n  if (!node) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/missing-initializer\",\n        reference,\n        \"Expression is outside the linked project graph\",\n        reference.id\n      )\n    };\n  }\n  const state = {\n    activeDefinitions: /* @__PURE__ */ new Set(),\n    dependencies: /* @__PURE__ */ new Set()\n  };\n  const result = evaluateNode(resolver, reference.id, node, state);\n  return result.ok ? {\n    ok: true,\n    value: result.value,\n    dependencies: [...state.dependencies].sort()\n  } : result;\n}\nfunction evaluateDynamicExpression(resolver, reference) {\n  const node = resolver.expressionNode(reference);\n  if (!node) return null;\n  const state = {\n    activeDefinitions: /* @__PURE__ */ new Set(),\n    dependencies: /* @__PURE__ */ new Set()\n  };\n  const result = evaluateDynamicNode(resolver, reference.id, node, state);\n  return result ? { ...result, dependencies: [...state.dependencies].sort() } : null;\n}\nfunction evaluateBinding(resolver, id, localName) {\n  const definition = resolver.resolveBinding(id, localName);\n  if (!definition) {\n    const emptySpan = { id, start: 0, end: 0 };\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/unresolved-binding\",\n        emptySpan,\n        `Binding ${localName} has no host-linked definition`\n      )\n    };\n  }\n  if (!definition.initializer) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/missing-initializer\",\n        definition.span,\n        `Binding ${localName} has no static initializer`,\n        definition.id\n      )\n    };\n  }\n  return evaluateExpression(\n    resolver,\n    expressionReference(definition.id, definition.initializer)\n  );\n}\nexport {\n  collectBranchDependencies,\n  collectLeaves,\n  evaluateBinding,\n  evaluateBranches,\n  evaluateDynamicExpression,\n  evaluateExpression\n};\n//# sourceMappingURL=evaluate.js.map\n"],"mappings":";;;;;AAGA,SAAS,QAAQ,OAAO;CACtB,OAAO;EAAE,IAAI;EAAM;CAAM;AAC3B;AACA,SAAS,QAAQ,MAAM;CACrB,IAAI,KAAK,SAAS,eAAe,OAAO;CACxC,IAAI,KAAK,SAAS,aAAa,KAAK,KAAK,SAAS,SAAS,GAAG;EAC5D,MAAM,QAAQ,KAAK;EACnB,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU,aAAa,UAAU,MAAM;GAC1G,OAAO;EACT;CACF;CACA,OAAO,KAAK;AACd;AACA,SAAS,YAAY,IAAI,MAAM,SAAS,cAAc,KAAK,KAAK,+BAA+B;CAC7F,OAAO;EACL,IAAI;EACJ,SAAS,aAAa,gCAAgC,OAAO,IAAI,IAAI,GAAG,MAAM;CAChF;AACF;AACA,SAAS,mBAAmB,UAAU,YAAY,SAAS,OAAO;CAChE,MAAM,MAAM,GAAG,WAAW,GAAG,GAAG,WAAW,KAAK;CAChD,IAAI,MAAM,kBAAkB,IAAI,GAAG,GAAG;EACpC,OAAO;GACL,IAAI;GACJ,SAAS,aACP,iCACA,SACA,mCAAmC,WAAW,MAChD;EACF;CACF;CACA,IAAI,CAAC,WAAW,aAAa;EAC3B,OAAO;GACL,IAAI;GACJ,SAAS,cACP,8BACA,SACA,WAAW,WAAW,KAAK,6BAC3B,WAAW,EACb;EACF;CACF;CACA,IAAI,CAAC,WAAW,UAAU;EACxB,OAAO;GACL,IAAI;GACJ,SAAS,cACP,6BACA,SACA,WAAW,WAAW,KAAK,iDAC3B,WAAW,EACb;EACF;CACF;CACA,MAAM,cAAc,SAAS,eAAe,WAAW,WAAW;CAClE,IAAI,CAAC,aAAa;EAChB,OAAO;GACL,IAAI;GACJ,SAAS,cACP,8BACA,SACA,WAAW,WAAW,KAAK,2CAC3B,WAAW,EACb;EACF;CACF;CACA,MAAM,aAAa,IAAI,WAAW,EAAE;CACpC,MAAM,kBAAkB,IAAI,GAAG;CAC/B,IAAI;EACF,OAAO,aAAa,UAAU,WAAW,IAAI,aAAa,KAAK;CACjE,UAAU;EACR,MAAM,kBAAkB,OAAO,GAAG;CACpC;AACF;AACA,SAAS,eAAe,UAAU,IAAI,MAAM,OAAO;CACjD,MAAM,SAAS,CAAC;CAChB,KAAK,MAAM,YAAY,WAAW,MAAM,YAAY,GAAG;EACrD,IAAI,SAAS,SAAS,iBAAiB;GACrC,MAAM,WAAW,UAAU,UAAU,UAAU;GAC/C,IAAI,CAAC,UAAU,OAAO,YAAY,IAAI,QAAQ;GAC9C,MAAM,SAAS,aAAa,UAAU,IAAI,UAAU,KAAK;GACzD,IAAI,CAAC,OAAO,IAAI,OAAO;GACvB,IAAI,CAAC,OAAO,SAAS,OAAO,OAAO,UAAU,YAAY,MAAM,QAAQ,OAAO,KAAK,GAAG;IACpF,OAAO;KACL,IAAI;KACJ,SAAS,aACP,2BACA,OAAO,IAAI,QAAQ,GACnB,oDACF;IACF;GACF;GACA,OAAO,OAAO,QAAQ,OAAO,KAAK;GAClC;EACF;EACA,IAAI,SAAS,SAAS,cAAc,SAAS,SAAS,kBAAkB;GACtE,OAAO,YAAY,IAAI,QAAQ;EACjC;EACA,MAAM,UAAU,UAAU,UAAU,KAAK;EACzC,MAAM,YAAY,UAAU,UAAU,OAAO;EAC7C,IAAI,CAAC,WAAW,CAAC,WAAW,OAAO,YAAY,IAAI,QAAQ;EAC3D,IAAI,MAAM,eAAe,OAAO,KAAK,KAAK;EAC1C,IAAI,SAAS,aAAa,QAAQ,QAAQ,KAAK,GAAG;GAChD,MAAM,eAAe,aAAa,UAAU,IAAI,SAAS,KAAK;GAC9D,IAAI,CAAC,aAAa,IAAI,OAAO;GAC7B,MAAM,aAAa;EACrB;EACA,IAAI,OAAO,QAAQ,YAAY,OAAO,QAAQ,UAAU;GACtD,OAAO,YAAY,IAAI,SAAS,6CAA6C;EAC/E;EACA,MAAM,QAAQ,aAAa,UAAU,IAAI,WAAW,KAAK;EACzD,IAAI,CAAC,MAAM,IAAI,OAAO;EACtB,OAAO,OAAO,GAAG,KAAK,MAAM;CAC9B;CACA,OAAO,QAAQ,MAAM;AACvB;AACA,SAAS,cAAc,UAAU,IAAI,MAAM,OAAO;CAChD,MAAM,SAAS,CAAC;CAChB,MAAM,cAAc,KAAK;CACzB,IAAI,CAAC,MAAM,QAAQ,WAAW,KAAK,YAAY,MAAM,YAAY,YAAY,QAAQ,CAAC,UAAU,OAAO,CAAC,GAAG;EACzG,OAAO,YAAY,IAAI,MAAM,4CAA4C;CAC3E;CACA,KAAK,MAAM,WAAW,YAAY,OAAO,SAAS,GAAG;EACnD,IAAI,QAAQ,SAAS,iBAAiB;GACpC,MAAM,WAAW,UAAU,SAAS,UAAU;GAC9C,IAAI,CAAC,UAAU,OAAO,YAAY,IAAI,OAAO;GAC7C,MAAM,SAAS,aAAa,UAAU,IAAI,UAAU,KAAK;GACzD,IAAI,CAAC,OAAO,IAAI,OAAO;GACvB,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,GAAG;IAChC,OAAO,YACL,IACA,SACA,kDACF;GACF;GACA,OAAO,KAAK,GAAG,OAAO,KAAK;GAC3B;EACF;EACA,MAAM,QAAQ,aAAa,UAAU,IAAI,SAAS,KAAK;EACvD,IAAI,CAAC,MAAM,IAAI,OAAO;EACtB,OAAO,KAAK,MAAM,KAAK;CACzB;CACA,OAAO,QAAQ,MAAM;AACvB;AACA,SAAS,aAAa,UAAU,IAAI,OAAO,OAAO;CAChD,MAAM,OAAO,iBAAiB,KAAK;CACnC,MAAM,eAAe,QAAQ,IAAI;CACjC,IAAI,iBAAiB,KAAK,GAAG,OAAO,QAAQ,YAAY;CACxD,QAAQ,KAAK,MAAb;EACE,KAAK,cAAc;GACjB,MAAM,OAAO,eAAe,IAAI;GAChC,IAAI,CAAC,MAAM,OAAO,YAAY,IAAI,IAAI;GACtC,MAAM,aAAa,SAAS,eAAe,IAAI,IAAI;GACnD,IAAI,CAAC,YAAY;IACf,OAAO;KACL,IAAI;KACJ,SAAS,cACP,6BACA,OAAO,IAAI,IAAI,GACf,WAAW,KAAK,+BAClB;IACF;GACF;GACA,OAAO,mBAAmB,UAAU,YAAY,OAAO,IAAI,IAAI,GAAG,KAAK;EACzE;EACA,KAAK,oBACH,OAAO,eAAe,UAAU,IAAI,MAAM,KAAK;EACjD,KAAK,mBACH,OAAO,cAAc,UAAU,IAAI,MAAM,KAAK;EAChD,KAAK,oBAAoB;GACvB,MAAM,aAAa,UAAU,MAAM,QAAQ;GAC3C,MAAM,eAAe,UAAU,MAAM,UAAU;GAC/C,IAAI,CAAC,cAAc,CAAC,cAAc,OAAO,YAAY,IAAI,IAAI;GAC7D,MAAM,SAAS,aAAa,UAAU,IAAI,YAAY,KAAK;GAC3D,IAAI,CAAC,OAAO,IAAI,OAAO;GACvB,IAAI,WAAW,eAAe,YAAY;GAC1C,IAAI,KAAK,aAAa,QAAQ,aAAa,MAAM;IAC/C,MAAM,oBAAoB,aAAa,UAAU,IAAI,cAAc,KAAK;IACxE,IAAI,CAAC,kBAAkB,IAAI,OAAO;IAClC,WAAW,kBAAkB;GAC/B;GACA,KAAK,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU,SAAS,OAAO,OAAO,UAAU,UAAU;IACnG,OAAO,YAAY,IAAI,MAAM,uCAAuC;GACtE;GACA,IAAI,OAAO,aAAa,YAAY,OAAO,aAAa,UAAU;IAChE,OAAO,YACL,IACA,cACA,6CACF;GACF;GACA,MAAM,QAAQ,OAAO,MAAM,OAAO,QAAQ;GAC1C,OAAO,UAAU,KAAK,IAAI,YAAY,IAAI,MAAM,iBAAiB,OAAO,QAAQ,EAAE,gBAAgB,IAAI,QAAQ,KAAK;EACrH;EACA,KAAK,mBAAmB;GACtB,MAAM,WAAW,UAAU,MAAM,UAAU;GAC3C,IAAI,CAAC,UAAU,OAAO,YAAY,IAAI,IAAI;GAC1C,MAAM,QAAQ,aAAa,UAAU,IAAI,UAAU,KAAK;GACxD,IAAI,CAAC,MAAM,IAAI,OAAO;GACtB,IAAI,KAAK,aAAa,OAAO,OAAO,MAAM,UAAU,UAAU;IAC5D,OAAO,QAAQ,CAAC,MAAM,KAAK;GAC7B;GACA,IAAI,KAAK,aAAa,OAAO,OAAO,MAAM,UAAU,UAAU;IAC5D,OAAO,QAAQ,MAAM,KAAK;GAC5B;GACA,IAAI,KAAK,aAAa,KAAK,OAAO,QAAQ,CAAC,MAAM,KAAK;GACtD,OAAO,YACL,IACA,MACA,kBAAkB,OAAO,KAAK,QAAQ,EAAE,gBAC1C;EACF;EACA,KAAK;EACL,KAAK,qBAAqB;GACxB,MAAM,WAAW,UAAU,MAAM,MAAM;GACvC,MAAM,YAAY,UAAU,MAAM,OAAO;GACzC,IAAI,CAAC,YAAY,CAAC,WAAW,OAAO,YAAY,IAAI,IAAI;GACxD,MAAM,OAAO,aAAa,UAAU,IAAI,UAAU,KAAK;GACvD,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,IAAI,KAAK,SAAS,qBAAqB;IACrC,IAAI,KAAK,aAAa,QAAQ,CAAC,KAAK,OAAO,OAAO;IAClD,IAAI,KAAK,aAAa,QAAQ,KAAK,OAAO,OAAO;IACjD,IAAI,KAAK,aAAa,QAAQ,KAAK,UAAU,MAAM,OAAO;GAC5D;GACA,MAAM,QAAQ,aAAa,UAAU,IAAI,WAAW,KAAK;GACzD,IAAI,CAAC,MAAM,IAAI,OAAO;GACtB,QAAQ,KAAK,UAAb;IACE,KAAK;KACH,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;KACzC;KACA,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,OAAO,KAAK,KAAK,IAAI,OAAO,MAAM,KAAK,CAAC;KACzD;KACA;IACF,KAAK;KACH,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;KACzC;KACA;IACF,KAAK;KACH,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;KACzC;KACA;IACF,KAAK;KACH,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;KACzC;KACA;IACF,KAAK;IACL,KAAK;IACL,KAAK,MACH,OAAO;GACX;GACA,OAAO,YACL,IACA,MACA,mBAAmB,OAAO,KAAK,QAAQ,EAAE,gBAC3C;EACF;EACA,KAAK,yBAAyB;GAC5B,MAAM,WAAW,UAAU,MAAM,MAAM;GACvC,MAAM,aAAa,UAAU,MAAM,YAAY;GAC/C,MAAM,YAAY,UAAU,MAAM,WAAW;GAC7C,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,WAAW,OAAO,YAAY,IAAI,IAAI;GACvE,MAAM,OAAO,aAAa,UAAU,IAAI,UAAU,KAAK;GACvD,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,OAAO,aAAa,UAAU,IAAI,KAAK,QAAQ,aAAa,WAAW,KAAK;EAC9E;EACA,KAAK,mBAAmB;GACtB,MAAM,SAAS,WAAW,MAAM,QAAQ;GACxC,MAAM,cAAc,WAAW,MAAM,aAAa;GAClD,IAAI,SAAS;GACb,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;IAClD,MAAM,QAAQ,OAAO;IACrB,MAAM,SAAS,OAAO,OAAO;IAC7B,MAAM,MAAM,OAAO,OAAO;IAC1B,UAAU,OAAO,WAAW,WAAW,SAAS,OAAO,QAAQ,WAAW,MAAM;IAChF,MAAM,aAAa,YAAY;IAC/B,IAAI,YAAY;KACd,MAAM,QAAQ,aAAa,UAAU,IAAI,YAAY,KAAK;KAC1D,IAAI,CAAC,MAAM,IAAI,OAAO;KACtB,UAAU,OAAO,MAAM,KAAK;IAC9B;GACF;GACA,OAAO,QAAQ,MAAM;EACvB;EACA,SACE,OAAO,YAAY,IAAI,IAAI;CAC/B;AACF;AACA,SAAS,iBAAiB,OAAO;CAC/B,IAAI,UAAU,MAAM,OAAO;CAC3B,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,IAAI,OAAO,UAAU,WAAW,OAAO;CACvC,OAAO;AACT;AACA,SAAS,oBAAoB,UAAU,IAAI,OAAO,OAAO;CACvD,MAAM,QAAQ,aAAa,UAAU,IAAI,OAAO,KAAK;CACrD,IAAI,MAAM,IAAI;EACZ,MAAM,OAAO,iBAAiB,MAAM,KAAK;EACzC,OAAO,OAAO;GAAE;GAAM,QAAQ,CAAC,MAAM,KAAK;EAAE,IAAI;CAClD;CACA,MAAM,OAAO,iBAAiB,KAAK;CACnC,IAAI,KAAK,SAAS,cAAc;EAC9B,IAAI,CAAC,eAAe,IAAI,GAAG,OAAO;EAClC,MAAM,aAAa,SAAS,iBAAiB,oBAAoB,IAAI,IAAI,CAAC;EAC1E,IAAI,CAAC,YAAY,YAAY,CAAC,WAAW,aAAa,OAAO;EAC7D,MAAM,MAAM,GAAG,WAAW,GAAG,GAAG,WAAW,KAAK;EAChD,IAAI,MAAM,kBAAkB,IAAI,GAAG,GAAG,OAAO;EAC7C,MAAM,cAAc,SAAS,eAAe,WAAW,WAAW;EAClE,IAAI,CAAC,aAAa,OAAO;EACzB,MAAM,aAAa,IAAI,WAAW,EAAE;EACpC,MAAM,kBAAkB,IAAI,GAAG;EAC/B,IAAI;GACF,OAAO,oBAAoB,UAAU,WAAW,IAAI,aAAa,KAAK;EACxE,UAAU;GACR,MAAM,kBAAkB,OAAO,GAAG;EACpC;CACF;CACA,IAAI,KAAK,SAAS,oBAAoB;EACpC,MAAM,aAAa,UAAU,MAAM,QAAQ;EAC3C,MAAM,eAAe,UAAU,MAAM,UAAU;EAC/C,IAAI,CAAC,cAAc,CAAC,cAAc,OAAO;EACzC,MAAM,SAAS,aAAa,UAAU,IAAI,YAAY,KAAK;EAC3D,IAAI,CAAC,OAAO,MAAM,CAAC,MAAM,QAAQ,OAAO,KAAK,GAAG,OAAO;EACvD,MAAM,WAAW,oBAAoB,UAAU,IAAI,cAAc,KAAK;EACtE,IAAI,UAAU,SAAS,YAAY,OAAO,MAAM,SAAS,IAAI,OAAO;EACpE,MAAM,SAAS,CAAC;EAChB,IAAI,OAAO;EACX,KAAK,MAAM,SAAS,OAAO,OAAO;GAChC,MAAM,WAAW,iBAAiB,KAAK;GACvC,IAAI,CAAC,YAAY,QAAQ,SAAS,UAAU,OAAO;GACnD,OAAO;GACP,MAAM,YAAY;GAClB,IAAI,CAAC,OAAO,SAAS,SAAS,GAAG,OAAO,KAAK,SAAS;EACxD;EACA,OAAO,OAAO;GAAE;GAAM;EAAO,IAAI;CACnC;CACA,IAAI,KAAK,SAAS,oBAAoB;EACpC,MAAM,WAAW,UAAU,MAAM,MAAM;EACvC,MAAM,YAAY,UAAU,MAAM,OAAO;EACzC,IAAI,CAAC,YAAY,CAAC,WAAW,OAAO;EACpC,MAAM,OAAO,oBAAoB,UAAU,IAAI,UAAU,KAAK;EAC9D,MAAM,QAAQ,oBAAoB,UAAU,IAAI,WAAW,KAAK;EAChE,IAAI,KAAK,aAAa,KAAK;GACzB,OAAO,MAAM,SAAS,YAAY,OAAO,SAAS,WAAW,EAAE,MAAM,SAAS,IAAI;EACpF;EACA,IAAI,KAAK,aAAa,OAAO,KAAK,aAAa,OAAO,KAAK,aAAa,OAAO,KAAK,aAAa,OAAO,KAAK,aAAa,MAAM;GAC9H,IAAI,MAAM,SAAS,YAAY,OAAO,SAAS,UAAU;IACvD,OAAO,EAAE,MAAM,SAAS;GAC1B;EACF;CACF;CACA,OAAO;AACT;AACA,SAAS,cAAc,MAAM;CAC3B,IAAI,KAAK,SAAS,QAAQ,OAAO,CAAC,IAAI;CACtC,OAAO,CAAC,GAAG,cAAc,KAAK,QAAQ,GAAG,GAAG,cAAc,KAAK,SAAS,CAAC;AAC3E;AACA,SAAS,0BAA0B,MAAM;CACvC,IAAI,KAAK,SAAS,QAAQ,OAAO,KAAK;CACtC,OAAO,CACL,mBAAmB,IAAI,IAAI,CACzB,GAAG,0BAA0B,KAAK,QAAQ,GAC1C,GAAG,0BAA0B,KAAK,SAAS,CAC7C,CAAC,CACH,CAAC,CAAC,KAAK;AACT;AACA,SAAS,oBAAoB,UAAU,IAAI,MAAM,OAAO,OAAO,UAAU;CACvE,MAAM,YAAY;EAChB,mBAAmB,IAAI,IAAI,MAAM,iBAAiB;EAClD,cAAc,IAAI,IAAI,MAAM,YAAY;CAC1C;CACA,MAAM,UAAU,aAAa,UAAU,IAAI,MAAM,SAAS;CAC1D,IAAI,QAAQ,IAAI;EACd,OAAO;GACL,MAAM;GACN,OAAO,QAAQ;GACf,cAAc,CAAC,GAAG,UAAU,YAAY,CAAC,CAAC,KAAK;EACjD;CACF;CACA,OAAO,qBAAqB,UAAU,IAAI,MAAM,QAAQ,GAAG,WAAW,QAAQ;AAChF;AACA,SAAS,qBAAqB,UAAU,IAAI,OAAO,OAAO,OAAO,UAAU;CACzE,MAAM,OAAO,iBAAiB,KAAK;CACnC,IAAI,CAAC,UAAU,IAAI,GAAG,OAAO;CAC7B,IAAI,KAAK,SAAS,cAAc;EAC9B,MAAM,OAAO,eAAe,IAAI;EAChC,IAAI,CAAC,MAAM,OAAO;EAClB,MAAM,aAAa,SAAS,eAAe,IAAI,IAAI;EACnD,IAAI,CAAC,cAAc,CAAC,WAAW,YAAY,CAAC,WAAW,aAAa,OAAO;EAC3E,MAAM,cAAc,SAAS,eAAe,WAAW,WAAW;EAClE,IAAI,CAAC,aAAa,OAAO;EACzB,MAAM,MAAM,GAAG,WAAW,GAAG,GAAG,WAAW,KAAK;EAChD,IAAI,MAAM,kBAAkB,IAAI,GAAG,GAAG,OAAO;EAC7C,MAAM,kBAAkB,IAAI,GAAG;EAC/B,MAAM,aAAa,IAAI,WAAW,EAAE;EACpC,IAAI;GACF,OAAO,qBACL,UACA,WAAW,IACX,aACA,OACA,OACA,QACF;EACF,UAAU;GACR,MAAM,kBAAkB,OAAO,GAAG;EACpC;CACF;CACA,IAAI,SAAS,GAAG,OAAO;CACvB,IAAI,KAAK,SAAS,yBAAyB;EACzC,MAAM,WAAW,UAAU,MAAM,MAAM;EACvC,MAAM,aAAa,UAAU,MAAM,YAAY;EAC/C,MAAM,YAAY,UAAU,MAAM,WAAW;EAC7C,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,WAAW,OAAO;EACnD,MAAM,OAAO,OAAO,IAAI,QAAQ;EAChC,IAAI,KAAK,OAAO,UAAU,OAAO;EACjC,MAAM,WAAW,oBAAoB,UAAU,IAAI,YAAY,OAAO,OAAO,QAAQ;EACrF,IAAI,CAAC,UAAU,OAAO;EACtB,MAAM,YAAY,oBAAoB,UAAU,IAAI,WAAW,OAAO,OAAO,QAAQ;EACrF,IAAI,CAAC,WAAW,OAAO;EACvB,OAAO;GACL,MAAM;GACN;GACA;GACA;EACF;CACF;CACA,IAAI,KAAK,SAAS,qBAAqB;EACrC,MAAM,OAAO,UAAU,MAAM,MAAM;EACnC,MAAM,QAAQ,UAAU,MAAM,OAAO;EACrC,IAAI,CAAC,QAAQ,CAAC,OAAO,OAAO;EAC5B,IAAI,KAAK,aAAa,MAAM;GAC1B,MAAM,OAAO,OAAO,IAAI,IAAI;GAC5B,IAAI,KAAK,OAAO,UAAU,OAAO;GACjC,MAAM,WAAW,oBAAoB,UAAU,IAAI,OAAO,OAAO,OAAO,QAAQ;GAChF,IAAI,CAAC,UAAU,OAAO;GACtB,MAAM,YAAY;IAChB,MAAM;IACN,OAAO,KAAK;IACZ,cAAc,CAAC,GAAG,MAAM,YAAY,CAAC,CAAC,KAAK;GAC7C;GACA,OAAO;IACL,MAAM;IACN;IACA;IACA;GACF;EACF;EACA,IAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,MAAM;GACpD,MAAM,OAAO,OAAO,IAAI,IAAI;GAC5B,IAAI,KAAK,OAAO,UAAU,OAAO;GACjC,MAAM,YAAY;IAChB,mBAAmB,IAAI,IAAI,MAAM,iBAAiB;IAClD,cAAc,IAAI,IAAI,MAAM,YAAY;GAC1C;GACA,MAAM,UAAU,aAAa,UAAU,IAAI,MAAM,SAAS;GAC1D,IAAI,CAAC,QAAQ,IAAI,OAAO;GACxB,MAAM,WAAW;IACf,MAAM;IACN,OAAO,QAAQ;IACf,cAAc,CAAC,GAAG,UAAU,YAAY,CAAC,CAAC,KAAK;GACjD;GACA,MAAM,YAAY,oBAAoB,UAAU,IAAI,OAAO,OAAO,OAAO,QAAQ;GACjF,IAAI,CAAC,WAAW,OAAO;GACvB,OAAO;IACL,MAAM;IACN;IACA;IACA;GACF;EACF;CACF;CACA,OAAO;AACT;AACA,SAAS,iBAAiB,UAAU,WAAW;CAC7C,MAAM,OAAO,SAAS,eAAe,SAAS;CAC9C,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,QAAQ;EACZ,mCAAmC,IAAI,IAAI;EAC3C,8BAA8B,IAAI,IAAI;CACxC;CACA,MAAM,OAAO,qBAAqB,UAAU,UAAU,IAAI,MAAM,GAAG,OAAO,UAAU,EAAE;CACtF,OAAO,MAAM,SAAS,WAAW,OAAO;AAC1C;AACA,SAAS,mBAAmB,UAAU,WAAW;CAC/C,MAAM,OAAO,SAAS,eAAe,SAAS;CAC9C,IAAI,CAAC,MAAM;EACT,OAAO;GACL,IAAI;GACJ,SAAS,cACP,8BACA,WACA,kDACA,UAAU,EACZ;EACF;CACF;CACA,MAAM,QAAQ;EACZ,mCAAmC,IAAI,IAAI;EAC3C,8BAA8B,IAAI,IAAI;CACxC;CACA,MAAM,SAAS,aAAa,UAAU,UAAU,IAAI,MAAM,KAAK;CAC/D,OAAO,OAAO,KAAK;EACjB,IAAI;EACJ,OAAO,OAAO;EACd,cAAc,CAAC,GAAG,MAAM,YAAY,CAAC,CAAC,KAAK;CAC7C,IAAI;AACN;AACA,SAAS,0BAA0B,UAAU,WAAW;CACtD,MAAM,OAAO,SAAS,eAAe,SAAS;CAC9C,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,QAAQ;EACZ,mCAAmC,IAAI,IAAI;EAC3C,8BAA8B,IAAI,IAAI;CACxC;CACA,MAAM,SAAS,oBAAoB,UAAU,UAAU,IAAI,MAAM,KAAK;CACtE,OAAO,SAAS;EAAE,GAAG;EAAQ,cAAc,CAAC,GAAG,MAAM,YAAY,CAAC,CAAC,KAAK;CAAE,IAAI;AAChF;AACA,SAAS,gBAAgB,UAAU,IAAI,WAAW;CAChD,MAAM,aAAa,SAAS,eAAe,IAAI,SAAS;CACxD,IAAI,CAAC,YAAY;EACf,MAAM,YAAY;GAAE;GAAI,OAAO;GAAG,KAAK;EAAE;EACzC,OAAO;GACL,IAAI;GACJ,SAAS,cACP,6BACA,WACA,WAAW,UAAU,+BACvB;EACF;CACF;CACA,IAAI,CAAC,WAAW,aAAa;EAC3B,OAAO;GACL,IAAI;GACJ,SAAS,cACP,8BACA,WAAW,MACX,WAAW,UAAU,6BACrB,WAAW,EACb;EACF;CACF;CACA,OAAO,mBACL,UACA,oBAAoB,WAAW,IAAI,WAAW,WAAW,CAC3D;AACF"}
+{"version":3,"file":"evaluate.js","names":[],"sources":["esm/evaluate.js"],"sourcesContent":["import { childNode, childNodes, identifierName, isAstNode, unwrapExpression } from \"./ast\";\nimport { expressionReference, spanOf } from \"./contracts\";\nimport { linkedBailout, localBailout } from \"./diagnostics\";\nfunction success(value) {\n  return { ok: true, value };\n}\nfunction literal(node) {\n  if (node.type === \"NullLiteral\") return null;\n  if (node.type === \"Literal\" || node.type.endsWith(\"Literal\")) {\n    const value = node.value;\n    if (typeof value === \"string\" || typeof value === \"number\" || typeof value === \"boolean\" || value === null) {\n      return value;\n    }\n  }\n  return void 0;\n}\nfunction unsupported(id, node, detail = `Expression ${node.type} is not statically supported`) {\n  return {\n    ok: false,\n    bailout: localBailout(\"local/unsupported-expression\", spanOf(id, node), detail)\n  };\n}\nfunction evaluateDefinition(resolver, definition, useSpan, state) {\n  const key = `${definition.id}:${definition.span.start}`;\n  if (state.activeDefinitions.has(key)) {\n    return {\n      ok: false,\n      bailout: localBailout(\n        \"local/static-evaluation-cycle\",\n        useSpan,\n        `Static evaluation cycle reached ${definition.name}`\n      )\n    };\n  }\n  if (!definition.initializer) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/missing-initializer\",\n        useSpan,\n        `Binding ${definition.name} has no static initializer`,\n        definition.id\n      )\n    };\n  }\n  if (!definition.constant) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/unresolved-binding\",\n        useSpan,\n        `Binding ${definition.name} is mutable and cannot be statically evaluated`,\n        definition.id\n      )\n    };\n  }\n  const initializer = resolver.expressionNode(definition.initializer);\n  if (!initializer) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/missing-initializer\",\n        useSpan,\n        `Binding ${definition.name} initializer is outside the linked graph`,\n        definition.id\n      )\n    };\n  }\n  state.dependencies.add(definition.id);\n  state.activeDefinitions.add(key);\n  try {\n    return evaluateNode(resolver, definition.id, initializer, state);\n  } finally {\n    state.activeDefinitions.delete(key);\n  }\n}\nfunction evaluateObject(resolver, id, node, state) {\n  const output = {};\n  for (const property of childNodes(node, \"properties\")) {\n    if (property.type === \"SpreadElement\") {\n      const argument = childNode(property, \"argument\");\n      if (!argument) return unsupported(id, property);\n      const spread = evaluateNode(resolver, id, argument, state);\n      if (!spread.ok) return spread;\n      if (!spread.value || typeof spread.value !== \"object\" || Array.isArray(spread.value)) {\n        return {\n          ok: false,\n          bailout: localBailout(\n            \"local/non-object-spread\",\n            spanOf(id, property),\n            \"Static object spread did not evaluate to an object\"\n          )\n        };\n      }\n      Object.assign(output, spread.value);\n      continue;\n    }\n    if (property.type !== \"Property\" && property.type !== \"ObjectProperty\") {\n      return unsupported(id, property);\n    }\n    const keyNode = childNode(property, \"key\");\n    const valueNode = childNode(property, \"value\");\n    if (!keyNode || !valueNode) return unsupported(id, property);\n    let key = identifierName(keyNode) ?? void 0;\n    if (property.computed === true || key === void 0) {\n      const evaluatedKey = evaluateNode(resolver, id, keyNode, state);\n      if (!evaluatedKey.ok) return evaluatedKey;\n      key = evaluatedKey.value;\n    }\n    if (typeof key !== \"string\" && typeof key !== \"number\") {\n      return unsupported(id, keyNode, \"Static object key is not a string or number\");\n    }\n    const value = evaluateNode(resolver, id, valueNode, state);\n    if (!value.ok) return value;\n    output[String(key)] = value.value;\n  }\n  return success(output);\n}\nfunction evaluateArray(resolver, id, node, state) {\n  const output = [];\n  const rawElements = node.elements;\n  if (!Array.isArray(rawElements) || rawElements.some((element) => element === null || !isAstNode(element))) {\n    return unsupported(id, node, \"Sparse arrays are not statically supported\");\n  }\n  for (const element of rawElements.filter(isAstNode)) {\n    if (element.type === \"SpreadElement\") {\n      const argument = childNode(element, \"argument\");\n      if (!argument) return unsupported(id, element);\n      const spread = evaluateNode(resolver, id, argument, state);\n      if (!spread.ok) return spread;\n      if (!Array.isArray(spread.value)) {\n        return unsupported(\n          id,\n          element,\n          \"Static array spread did not evaluate to an array\"\n        );\n      }\n      output.push(...spread.value);\n      continue;\n    }\n    const value = evaluateNode(resolver, id, element, state);\n    if (!value.ok) return value;\n    output.push(value.value);\n  }\n  return success(output);\n}\nfunction evaluateNode(resolver, id, input, state) {\n  const node = unwrapExpression(input);\n  const literalValue = literal(node);\n  if (literalValue !== void 0) return success(literalValue);\n  switch (node.type) {\n    case \"Identifier\": {\n      const name = identifierName(node);\n      if (!name) return unsupported(id, node);\n      const definition = resolver.resolveBinding(id, name);\n      if (!definition) {\n        return {\n          ok: false,\n          bailout: linkedBailout(\n            \"linked/unresolved-binding\",\n            spanOf(id, node),\n            `Binding ${name} has no host-linked definition`\n          )\n        };\n      }\n      return evaluateDefinition(resolver, definition, spanOf(id, node), state);\n    }\n    case \"ObjectExpression\":\n      return evaluateObject(resolver, id, node, state);\n    case \"ArrayExpression\":\n      return evaluateArray(resolver, id, node, state);\n    case \"MemberExpression\": {\n      const objectNode = childNode(node, \"object\");\n      const propertyNode = childNode(node, \"property\");\n      if (!objectNode || !propertyNode) return unsupported(id, node);\n      const object = evaluateNode(resolver, id, objectNode, state);\n      if (!object.ok) return object;\n      let property = identifierName(propertyNode);\n      if (node.computed === true || property === null) {\n        const evaluatedProperty = evaluateNode(resolver, id, propertyNode, state);\n        if (!evaluatedProperty.ok) return evaluatedProperty;\n        property = evaluatedProperty.value;\n      }\n      if ((typeof object.value !== \"object\" || object.value === null) && typeof object.value !== \"string\") {\n        return unsupported(id, node, \"Static member target is not indexable\");\n      }\n      if (typeof property !== \"string\" && typeof property !== \"number\") {\n        return unsupported(\n          id,\n          propertyNode,\n          \"Static member key is not a string or number\"\n        );\n      }\n      const value = object.value[String(property)];\n      return value === void 0 ? unsupported(id, node, `Static member ${String(property)} does not exist`) : success(value);\n    }\n    case \"UnaryExpression\": {\n      const argument = childNode(node, \"argument\");\n      if (!argument) return unsupported(id, node);\n      const value = evaluateNode(resolver, id, argument, state);\n      if (!value.ok) return value;\n      if (node.operator === \"-\" && typeof value.value === \"number\") {\n        return success(-value.value);\n      }\n      if (node.operator === \"+\" && typeof value.value === \"number\") {\n        return success(value.value);\n      }\n      if (node.operator === \"!\") return success(!value.value);\n      return unsupported(\n        id,\n        node,\n        `Unary operator ${String(node.operator)} is unsupported`\n      );\n    }\n    case \"BinaryExpression\":\n    case \"LogicalExpression\": {\n      const leftNode = childNode(node, \"left\");\n      const rightNode = childNode(node, \"right\");\n      if (!leftNode || !rightNode) return unsupported(id, node);\n      const left = evaluateNode(resolver, id, leftNode, state);\n      if (!left.ok) return left;\n      if (node.type === \"LogicalExpression\") {\n        if (node.operator === \"&&\" && !left.value) return left;\n        if (node.operator === \"||\" && left.value) return left;\n        if (node.operator === \"??\" && left.value !== null) return left;\n      }\n      const right = evaluateNode(resolver, id, rightNode, state);\n      if (!right.ok) return right;\n      switch (node.operator) {\n        case \"+\":\n          if (typeof left.value === \"number\" && typeof right.value === \"number\") {\n            return success(left.value + right.value);\n          }\n          if (typeof left.value === \"string\" || typeof right.value === \"string\") {\n            return success(String(left.value) + String(right.value));\n          }\n          break;\n        case \"-\":\n          if (typeof left.value === \"number\" && typeof right.value === \"number\") {\n            return success(left.value - right.value);\n          }\n          break;\n        case \"*\":\n          if (typeof left.value === \"number\" && typeof right.value === \"number\") {\n            return success(left.value * right.value);\n          }\n          break;\n        case \"/\":\n          if (typeof left.value === \"number\" && typeof right.value === \"number\") {\n            return success(left.value / right.value);\n          }\n          break;\n        case \"&&\":\n        case \"||\":\n        case \"??\":\n          return right;\n      }\n      return unsupported(\n        id,\n        node,\n        `Binary operator ${String(node.operator)} is unsupported`\n      );\n    }\n    case \"ConditionalExpression\": {\n      const testNode = childNode(node, \"test\");\n      const consequent = childNode(node, \"consequent\");\n      const alternate = childNode(node, \"alternate\");\n      if (!testNode || !consequent || !alternate) return unsupported(id, node);\n      const test = evaluateNode(resolver, id, testNode, state);\n      if (!test.ok) return test;\n      return evaluateNode(resolver, id, test.value ? consequent : alternate, state);\n    }\n    case \"TemplateLiteral\": {\n      const quasis = childNodes(node, \"quasis\");\n      const expressions = childNodes(node, \"expressions\");\n      let output = \"\";\n      for (let index = 0; index < quasis.length; index++) {\n        output += quasiText(quasis[index]);\n        const expression = expressions[index];\n        if (expression) {\n          const value = evaluateNode(resolver, id, expression, state);\n          if (!value.ok) return value;\n          output += String(value.value);\n        }\n      }\n      return success(output);\n    }\n    default:\n      return unsupported(id, node);\n  }\n}\nfunction quasiText(quasi) {\n  const cooked = quasi?.value?.cooked;\n  const raw = quasi?.value?.raw;\n  return typeof cooked === \"string\" ? cooked : typeof raw === \"string\" ? raw : \"\";\n}\nfunction dynamicPrimitive(value) {\n  if (value === null) return \"null\";\n  if (typeof value === \"number\") return \"number\";\n  if (typeof value === \"string\") return \"string\";\n  if (typeof value === \"boolean\") return \"boolean\";\n  return null;\n}\nfunction evaluateDynamicNode(resolver, id, input, state) {\n  const exact = evaluateNode(resolver, id, input, state);\n  if (exact.ok) {\n    const type = dynamicPrimitive(exact.value);\n    return type ? { type, values: [exact.value] } : null;\n  }\n  const node = unwrapExpression(input);\n  if (node.type === \"Identifier\") {\n    if (!identifierName(node)) return null;\n    const definition = resolver.resolveReference(expressionReference(id, node));\n    if (!definition?.constant || !definition.initializer) return null;\n    const key = `${definition.id}:${definition.span.start}`;\n    if (state.activeDefinitions.has(key)) return null;\n    const initializer = resolver.expressionNode(definition.initializer);\n    if (!initializer) return null;\n    state.dependencies.add(definition.id);\n    state.activeDefinitions.add(key);\n    try {\n      return evaluateDynamicNode(resolver, definition.id, initializer, state);\n    } finally {\n      state.activeDefinitions.delete(key);\n    }\n  }\n  if (node.type === \"MemberExpression\") {\n    const objectNode = childNode(node, \"object\");\n    const propertyNode = childNode(node, \"property\");\n    if (!objectNode || !propertyNode) return null;\n    const object = evaluateNode(resolver, id, objectNode, state);\n    if (!object.ok || !Array.isArray(object.value)) return null;\n    const property = evaluateDynamicNode(resolver, id, propertyNode, state);\n    if (property?.type !== \"number\" || object.value.length > 32) return null;\n    const values = [];\n    let type = null;\n    for (const value of object.value) {\n      const nextType = dynamicPrimitive(value);\n      if (!nextType || type && type !== nextType) return null;\n      type = nextType;\n      const primitive = value;\n      if (!values.includes(primitive)) values.push(primitive);\n    }\n    return type ? { type, values } : null;\n  }\n  if (node.type === \"BinaryExpression\") {\n    const leftNode = childNode(node, \"left\");\n    const rightNode = childNode(node, \"right\");\n    if (!leftNode || !rightNode) return null;\n    const left = evaluateDynamicNode(resolver, id, leftNode, state);\n    const right = evaluateDynamicNode(resolver, id, rightNode, state);\n    if (node.operator === \"+\") {\n      return left?.type === \"number\" && right?.type === \"number\" ? { type: \"number\" } : null;\n    }\n    if (node.operator === \"-\" || node.operator === \"*\" || node.operator === \"/\" || node.operator === \"%\" || node.operator === \"**\") {\n      if (left?.type === \"number\" || right?.type === \"number\") {\n        return { type: \"number\" };\n      }\n    }\n  }\n  return null;\n}\nfunction collectLeaves(node) {\n  if (node.kind === \"leaf\") return [node];\n  return [...collectLeaves(node.whenTrue), ...collectLeaves(node.whenFalse)];\n}\nfunction collectBranchDependencies(node) {\n  if (node.kind === \"leaf\") return node.dependencies;\n  return [\n    .../* @__PURE__ */ new Set([\n      ...collectBranchDependencies(node.whenTrue),\n      ...collectBranchDependencies(node.whenFalse)\n    ])\n  ].sort();\n}\nfunction evaluateBranchChild(resolver, id, node, depth, state, sourceId) {\n  const leafState = {\n    activeDefinitions: new Set(state.activeDefinitions),\n    dependencies: new Set(state.dependencies)\n  };\n  const leafRes = evaluateNode(resolver, id, node, leafState);\n  if (leafRes.ok) {\n    return {\n      kind: \"leaf\",\n      value: leafRes.value,\n      dependencies: [...leafState.dependencies].sort()\n    };\n  }\n  return evaluateBranchesNode(resolver, id, node, depth + 1, leafState, sourceId);\n}\nfunction evaluateBranchesNode(resolver, id, input, depth, state, sourceId) {\n  const node = unwrapExpression(input);\n  if (!isAstNode(node)) return null;\n  if (node.type === \"Identifier\") {\n    const name = identifierName(node);\n    if (!name) return null;\n    const definition = resolver.resolveBinding(id, name);\n    if (!definition || !definition.constant || !definition.initializer) return null;\n    const initializer = resolver.expressionNode(definition.initializer);\n    if (!initializer) return null;\n    const key = `${definition.id}:${definition.span.start}`;\n    if (state.activeDefinitions.has(key)) return null;\n    state.activeDefinitions.add(key);\n    state.dependencies.add(definition.id);\n    try {\n      return evaluateBranchesNode(\n        resolver,\n        definition.id,\n        initializer,\n        depth,\n        state,\n        sourceId\n      );\n    } finally {\n      state.activeDefinitions.delete(key);\n    }\n  }\n  if (depth >= 3) return null;\n  if (node.type === \"ConditionalExpression\") {\n    const testNode = childNode(node, \"test\");\n    const consequent = childNode(node, \"consequent\");\n    const alternate = childNode(node, \"alternate\");\n    if (!testNode || !consequent || !alternate) return null;\n    const test = spanOf(id, testNode);\n    if (test.id !== sourceId) return null;\n    const whenTrue = evaluateBranchChild(resolver, id, consequent, depth, state, sourceId);\n    if (!whenTrue) return null;\n    const whenFalse = evaluateBranchChild(resolver, id, alternate, depth, state, sourceId);\n    if (!whenFalse) return null;\n    return {\n      kind: \"branch\",\n      test,\n      whenTrue,\n      whenFalse\n    };\n  }\n  if (node.type === \"TemplateLiteral\") {\n    return templateBranchesNode(\n      resolver,\n      id,\n      childNodes(node, \"quasis\"),\n      childNodes(node, \"expressions\"),\n      0,\n      \"\",\n      depth,\n      state,\n      sourceId\n    );\n  }\n  if (node.type === \"LogicalExpression\") {\n    const left = childNode(node, \"left\");\n    const right = childNode(node, \"right\");\n    if (!left || !right) return null;\n    if (node.operator === \"&&\") {\n      const test = spanOf(id, left);\n      if (test.id !== sourceId) return null;\n      const whenTrue = evaluateBranchChild(resolver, id, right, depth, state, sourceId);\n      if (!whenTrue) return null;\n      const whenFalse = {\n        kind: \"leaf\",\n        value: void 0,\n        dependencies: [...state.dependencies].sort()\n      };\n      return {\n        kind: \"branch\",\n        test,\n        whenTrue,\n        whenFalse\n      };\n    }\n    if (node.operator === \"||\" || node.operator === \"??\") {\n      const test = spanOf(id, left);\n      if (test.id !== sourceId) return null;\n      const leftState = {\n        activeDefinitions: new Set(state.activeDefinitions),\n        dependencies: new Set(state.dependencies)\n      };\n      const leftRes = evaluateNode(resolver, id, left, leftState);\n      if (!leftRes.ok) return null;\n      const whenTrue = {\n        kind: \"leaf\",\n        value: leftRes.value,\n        dependencies: [...leftState.dependencies].sort()\n      };\n      const whenFalse = evaluateBranchChild(resolver, id, right, depth, state, sourceId);\n      if (!whenFalse) return null;\n      return {\n        kind: \"branch\",\n        test,\n        whenTrue,\n        whenFalse\n      };\n    }\n  }\n  return null;\n}\nfunction mapBranchLeaves(node, map) {\n  if (node.kind === \"leaf\") return map(node);\n  const whenTrue = mapBranchLeaves(node.whenTrue, map);\n  if (!whenTrue) return null;\n  const whenFalse = mapBranchLeaves(node.whenFalse, map);\n  if (!whenFalse) return null;\n  return { kind: \"branch\", test: node.test, whenTrue, whenFalse };\n}\nfunction templateBranchesNode(resolver, id, quasis, expressions, index, prefix, depth, state, sourceId) {\n  let text = prefix;\n  for (let position = index; position < quasis.length; position++) {\n    text += quasiText(quasis[position]);\n    const expression = expressions[position];\n    if (!expression) continue;\n    const exact = evaluateNode(resolver, id, expression, state);\n    if (exact.ok) {\n      const interpolated = templateInterpolation(exact.value);\n      if (interpolated === null) return null;\n      text += interpolated;\n      continue;\n    }\n    const tree = evaluateBranchesNode(\n      resolver,\n      id,\n      expression,\n      depth + 1,\n      state,\n      sourceId\n    );\n    if (!tree) return null;\n    return mapBranchLeaves(tree, (leaf) => {\n      if (leaf.value === void 0) return null;\n      const interpolated = templateInterpolation(leaf.value);\n      if (interpolated === null) return null;\n      return templateBranchesNode(\n        resolver,\n        id,\n        quasis,\n        expressions,\n        position + 1,\n        text + interpolated,\n        depth + 1,\n        state,\n        sourceId\n      );\n    });\n  }\n  return { kind: \"leaf\", value: text, dependencies: [...state.dependencies].sort() };\n}\nfunction templateInterpolation(value) {\n  if (value === null) return \"null\";\n  if (typeof value === \"string\" || typeof value === \"number\" || typeof value === \"boolean\") {\n    return String(value);\n  }\n  return null;\n}\nfunction evaluateBranches(resolver, reference) {\n  const node = resolver.expressionNode(reference);\n  if (!node) return null;\n  const state = {\n    activeDefinitions: /* @__PURE__ */ new Set(),\n    dependencies: /* @__PURE__ */ new Set()\n  };\n  const tree = evaluateBranchesNode(resolver, reference.id, node, 0, state, reference.id);\n  return tree?.kind === \"branch\" ? tree : null;\n}\nfunction evaluateExpression(resolver, reference) {\n  const node = resolver.expressionNode(reference);\n  if (!node) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/missing-initializer\",\n        reference,\n        \"Expression is outside the linked project graph\",\n        reference.id\n      )\n    };\n  }\n  const state = {\n    activeDefinitions: /* @__PURE__ */ new Set(),\n    dependencies: /* @__PURE__ */ new Set()\n  };\n  const result = evaluateNode(resolver, reference.id, node, state);\n  return result.ok ? {\n    ok: true,\n    value: result.value,\n    dependencies: [...state.dependencies].sort()\n  } : result;\n}\nfunction evaluateDynamicExpression(resolver, reference) {\n  const node = resolver.expressionNode(reference);\n  if (!node) return null;\n  const state = {\n    activeDefinitions: /* @__PURE__ */ new Set(),\n    dependencies: /* @__PURE__ */ new Set()\n  };\n  const result = evaluateDynamicNode(resolver, reference.id, node, state);\n  return result ? { ...result, dependencies: [...state.dependencies].sort() } : null;\n}\nfunction evaluateBinding(resolver, id, localName) {\n  const definition = resolver.resolveBinding(id, localName);\n  if (!definition) {\n    const emptySpan = { id, start: 0, end: 0 };\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/unresolved-binding\",\n        emptySpan,\n        `Binding ${localName} has no host-linked definition`\n      )\n    };\n  }\n  if (!definition.initializer) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/missing-initializer\",\n        definition.span,\n        `Binding ${localName} has no static initializer`,\n        definition.id\n      )\n    };\n  }\n  return evaluateExpression(\n    resolver,\n    expressionReference(definition.id, definition.initializer)\n  );\n}\nexport {\n  collectBranchDependencies,\n  collectLeaves,\n  evaluateBinding,\n  evaluateBranches,\n  evaluateDynamicExpression,\n  evaluateExpression\n};\n//# sourceMappingURL=evaluate.js.map\n"],"mappings":";;;;;AAGA,SAAS,QAAQ,OAAO;CACtB,OAAO;EAAE,IAAI;EAAM;CAAM;AAC3B;AACA,SAAS,QAAQ,MAAM;CACrB,IAAI,KAAK,SAAS,eAAe,OAAO;CACxC,IAAI,KAAK,SAAS,aAAa,KAAK,KAAK,SAAS,SAAS,GAAG;EAC5D,MAAM,QAAQ,KAAK;EACnB,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU,aAAa,UAAU,MAAM;GAC1G,OAAO;EACT;CACF;CACA,OAAO,KAAK;AACd;AACA,SAAS,YAAY,IAAI,MAAM,SAAS,cAAc,KAAK,KAAK,+BAA+B;CAC7F,OAAO;EACL,IAAI;EACJ,SAAS,aAAa,gCAAgC,OAAO,IAAI,IAAI,GAAG,MAAM;CAChF;AACF;AACA,SAAS,mBAAmB,UAAU,YAAY,SAAS,OAAO;CAChE,MAAM,MAAM,GAAG,WAAW,GAAG,GAAG,WAAW,KAAK;CAChD,IAAI,MAAM,kBAAkB,IAAI,GAAG,GAAG;EACpC,OAAO;GACL,IAAI;GACJ,SAAS,aACP,iCACA,SACA,mCAAmC,WAAW,MAChD;EACF;CACF;CACA,IAAI,CAAC,WAAW,aAAa;EAC3B,OAAO;GACL,IAAI;GACJ,SAAS,cACP,8BACA,SACA,WAAW,WAAW,KAAK,6BAC3B,WAAW,EACb;EACF;CACF;CACA,IAAI,CAAC,WAAW,UAAU;EACxB,OAAO;GACL,IAAI;GACJ,SAAS,cACP,6BACA,SACA,WAAW,WAAW,KAAK,iDAC3B,WAAW,EACb;EACF;CACF;CACA,MAAM,cAAc,SAAS,eAAe,WAAW,WAAW;CAClE,IAAI,CAAC,aAAa;EAChB,OAAO;GACL,IAAI;GACJ,SAAS,cACP,8BACA,SACA,WAAW,WAAW,KAAK,2CAC3B,WAAW,EACb;EACF;CACF;CACA,MAAM,aAAa,IAAI,WAAW,EAAE;CACpC,MAAM,kBAAkB,IAAI,GAAG;CAC/B,IAAI;EACF,OAAO,aAAa,UAAU,WAAW,IAAI,aAAa,KAAK;CACjE,UAAU;EACR,MAAM,kBAAkB,OAAO,GAAG;CACpC;AACF;AACA,SAAS,eAAe,UAAU,IAAI,MAAM,OAAO;CACjD,MAAM,SAAS,CAAC;CAChB,KAAK,MAAM,YAAY,WAAW,MAAM,YAAY,GAAG;EACrD,IAAI,SAAS,SAAS,iBAAiB;GACrC,MAAM,WAAW,UAAU,UAAU,UAAU;GAC/C,IAAI,CAAC,UAAU,OAAO,YAAY,IAAI,QAAQ;GAC9C,MAAM,SAAS,aAAa,UAAU,IAAI,UAAU,KAAK;GACzD,IAAI,CAAC,OAAO,IAAI,OAAO;GACvB,IAAI,CAAC,OAAO,SAAS,OAAO,OAAO,UAAU,YAAY,MAAM,QAAQ,OAAO,KAAK,GAAG;IACpF,OAAO;KACL,IAAI;KACJ,SAAS,aACP,2BACA,OAAO,IAAI,QAAQ,GACnB,oDACF;IACF;GACF;GACA,OAAO,OAAO,QAAQ,OAAO,KAAK;GAClC;EACF;EACA,IAAI,SAAS,SAAS,cAAc,SAAS,SAAS,kBAAkB;GACtE,OAAO,YAAY,IAAI,QAAQ;EACjC;EACA,MAAM,UAAU,UAAU,UAAU,KAAK;EACzC,MAAM,YAAY,UAAU,UAAU,OAAO;EAC7C,IAAI,CAAC,WAAW,CAAC,WAAW,OAAO,YAAY,IAAI,QAAQ;EAC3D,IAAI,MAAM,eAAe,OAAO,KAAK,KAAK;EAC1C,IAAI,SAAS,aAAa,QAAQ,QAAQ,KAAK,GAAG;GAChD,MAAM,eAAe,aAAa,UAAU,IAAI,SAAS,KAAK;GAC9D,IAAI,CAAC,aAAa,IAAI,OAAO;GAC7B,MAAM,aAAa;EACrB;EACA,IAAI,OAAO,QAAQ,YAAY,OAAO,QAAQ,UAAU;GACtD,OAAO,YAAY,IAAI,SAAS,6CAA6C;EAC/E;EACA,MAAM,QAAQ,aAAa,UAAU,IAAI,WAAW,KAAK;EACzD,IAAI,CAAC,MAAM,IAAI,OAAO;EACtB,OAAO,OAAO,GAAG,KAAK,MAAM;CAC9B;CACA,OAAO,QAAQ,MAAM;AACvB;AACA,SAAS,cAAc,UAAU,IAAI,MAAM,OAAO;CAChD,MAAM,SAAS,CAAC;CAChB,MAAM,cAAc,KAAK;CACzB,IAAI,CAAC,MAAM,QAAQ,WAAW,KAAK,YAAY,MAAM,YAAY,YAAY,QAAQ,CAAC,UAAU,OAAO,CAAC,GAAG;EACzG,OAAO,YAAY,IAAI,MAAM,4CAA4C;CAC3E;CACA,KAAK,MAAM,WAAW,YAAY,OAAO,SAAS,GAAG;EACnD,IAAI,QAAQ,SAAS,iBAAiB;GACpC,MAAM,WAAW,UAAU,SAAS,UAAU;GAC9C,IAAI,CAAC,UAAU,OAAO,YAAY,IAAI,OAAO;GAC7C,MAAM,SAAS,aAAa,UAAU,IAAI,UAAU,KAAK;GACzD,IAAI,CAAC,OAAO,IAAI,OAAO;GACvB,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,GAAG;IAChC,OAAO,YACL,IACA,SACA,kDACF;GACF;GACA,OAAO,KAAK,GAAG,OAAO,KAAK;GAC3B;EACF;EACA,MAAM,QAAQ,aAAa,UAAU,IAAI,SAAS,KAAK;EACvD,IAAI,CAAC,MAAM,IAAI,OAAO;EACtB,OAAO,KAAK,MAAM,KAAK;CACzB;CACA,OAAO,QAAQ,MAAM;AACvB;AACA,SAAS,aAAa,UAAU,IAAI,OAAO,OAAO;CAChD,MAAM,OAAO,iBAAiB,KAAK;CACnC,MAAM,eAAe,QAAQ,IAAI;CACjC,IAAI,iBAAiB,KAAK,GAAG,OAAO,QAAQ,YAAY;CACxD,QAAQ,KAAK,MAAb;EACE,KAAK,cAAc;GACjB,MAAM,OAAO,eAAe,IAAI;GAChC,IAAI,CAAC,MAAM,OAAO,YAAY,IAAI,IAAI;GACtC,MAAM,aAAa,SAAS,eAAe,IAAI,IAAI;GACnD,IAAI,CAAC,YAAY;IACf,OAAO;KACL,IAAI;KACJ,SAAS,cACP,6BACA,OAAO,IAAI,IAAI,GACf,WAAW,KAAK,+BAClB;IACF;GACF;GACA,OAAO,mBAAmB,UAAU,YAAY,OAAO,IAAI,IAAI,GAAG,KAAK;EACzE;EACA,KAAK,oBACH,OAAO,eAAe,UAAU,IAAI,MAAM,KAAK;EACjD,KAAK,mBACH,OAAO,cAAc,UAAU,IAAI,MAAM,KAAK;EAChD,KAAK,oBAAoB;GACvB,MAAM,aAAa,UAAU,MAAM,QAAQ;GAC3C,MAAM,eAAe,UAAU,MAAM,UAAU;GAC/C,IAAI,CAAC,cAAc,CAAC,cAAc,OAAO,YAAY,IAAI,IAAI;GAC7D,MAAM,SAAS,aAAa,UAAU,IAAI,YAAY,KAAK;GAC3D,IAAI,CAAC,OAAO,IAAI,OAAO;GACvB,IAAI,WAAW,eAAe,YAAY;GAC1C,IAAI,KAAK,aAAa,QAAQ,aAAa,MAAM;IAC/C,MAAM,oBAAoB,aAAa,UAAU,IAAI,cAAc,KAAK;IACxE,IAAI,CAAC,kBAAkB,IAAI,OAAO;IAClC,WAAW,kBAAkB;GAC/B;GACA,KAAK,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU,SAAS,OAAO,OAAO,UAAU,UAAU;IACnG,OAAO,YAAY,IAAI,MAAM,uCAAuC;GACtE;GACA,IAAI,OAAO,aAAa,YAAY,OAAO,aAAa,UAAU;IAChE,OAAO,YACL,IACA,cACA,6CACF;GACF;GACA,MAAM,QAAQ,OAAO,MAAM,OAAO,QAAQ;GAC1C,OAAO,UAAU,KAAK,IAAI,YAAY,IAAI,MAAM,iBAAiB,OAAO,QAAQ,EAAE,gBAAgB,IAAI,QAAQ,KAAK;EACrH;EACA,KAAK,mBAAmB;GACtB,MAAM,WAAW,UAAU,MAAM,UAAU;GAC3C,IAAI,CAAC,UAAU,OAAO,YAAY,IAAI,IAAI;GAC1C,MAAM,QAAQ,aAAa,UAAU,IAAI,UAAU,KAAK;GACxD,IAAI,CAAC,MAAM,IAAI,OAAO;GACtB,IAAI,KAAK,aAAa,OAAO,OAAO,MAAM,UAAU,UAAU;IAC5D,OAAO,QAAQ,CAAC,MAAM,KAAK;GAC7B;GACA,IAAI,KAAK,aAAa,OAAO,OAAO,MAAM,UAAU,UAAU;IAC5D,OAAO,QAAQ,MAAM,KAAK;GAC5B;GACA,IAAI,KAAK,aAAa,KAAK,OAAO,QAAQ,CAAC,MAAM,KAAK;GACtD,OAAO,YACL,IACA,MACA,kBAAkB,OAAO,KAAK,QAAQ,EAAE,gBAC1C;EACF;EACA,KAAK;EACL,KAAK,qBAAqB;GACxB,MAAM,WAAW,UAAU,MAAM,MAAM;GACvC,MAAM,YAAY,UAAU,MAAM,OAAO;GACzC,IAAI,CAAC,YAAY,CAAC,WAAW,OAAO,YAAY,IAAI,IAAI;GACxD,MAAM,OAAO,aAAa,UAAU,IAAI,UAAU,KAAK;GACvD,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,IAAI,KAAK,SAAS,qBAAqB;IACrC,IAAI,KAAK,aAAa,QAAQ,CAAC,KAAK,OAAO,OAAO;IAClD,IAAI,KAAK,aAAa,QAAQ,KAAK,OAAO,OAAO;IACjD,IAAI,KAAK,aAAa,QAAQ,KAAK,UAAU,MAAM,OAAO;GAC5D;GACA,MAAM,QAAQ,aAAa,UAAU,IAAI,WAAW,KAAK;GACzD,IAAI,CAAC,MAAM,IAAI,OAAO;GACtB,QAAQ,KAAK,UAAb;IACE,KAAK;KACH,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;KACzC;KACA,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,OAAO,KAAK,KAAK,IAAI,OAAO,MAAM,KAAK,CAAC;KACzD;KACA;IACF,KAAK;KACH,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;KACzC;KACA;IACF,KAAK;KACH,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;KACzC;KACA;IACF,KAAK;KACH,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;KACzC;KACA;IACF,KAAK;IACL,KAAK;IACL,KAAK,MACH,OAAO;GACX;GACA,OAAO,YACL,IACA,MACA,mBAAmB,OAAO,KAAK,QAAQ,EAAE,gBAC3C;EACF;EACA,KAAK,yBAAyB;GAC5B,MAAM,WAAW,UAAU,MAAM,MAAM;GACvC,MAAM,aAAa,UAAU,MAAM,YAAY;GAC/C,MAAM,YAAY,UAAU,MAAM,WAAW;GAC7C,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,WAAW,OAAO,YAAY,IAAI,IAAI;GACvE,MAAM,OAAO,aAAa,UAAU,IAAI,UAAU,KAAK;GACvD,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,OAAO,aAAa,UAAU,IAAI,KAAK,QAAQ,aAAa,WAAW,KAAK;EAC9E;EACA,KAAK,mBAAmB;GACtB,MAAM,SAAS,WAAW,MAAM,QAAQ;GACxC,MAAM,cAAc,WAAW,MAAM,aAAa;GAClD,IAAI,SAAS;GACb,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;IAClD,UAAU,UAAU,OAAO,MAAM;IACjC,MAAM,aAAa,YAAY;IAC/B,IAAI,YAAY;KACd,MAAM,QAAQ,aAAa,UAAU,IAAI,YAAY,KAAK;KAC1D,IAAI,CAAC,MAAM,IAAI,OAAO;KACtB,UAAU,OAAO,MAAM,KAAK;IAC9B;GACF;GACA,OAAO,QAAQ,MAAM;EACvB;EACA,SACE,OAAO,YAAY,IAAI,IAAI;CAC/B;AACF;AACA,SAAS,UAAU,OAAO;CACxB,MAAM,SAAS,OAAO,OAAO;CAC7B,MAAM,MAAM,OAAO,OAAO;CAC1B,OAAO,OAAO,WAAW,WAAW,SAAS,OAAO,QAAQ,WAAW,MAAM;AAC/E;AACA,SAAS,iBAAiB,OAAO;CAC/B,IAAI,UAAU,MAAM,OAAO;CAC3B,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,IAAI,OAAO,UAAU,WAAW,OAAO;CACvC,OAAO;AACT;AACA,SAAS,oBAAoB,UAAU,IAAI,OAAO,OAAO;CACvD,MAAM,QAAQ,aAAa,UAAU,IAAI,OAAO,KAAK;CACrD,IAAI,MAAM,IAAI;EACZ,MAAM,OAAO,iBAAiB,MAAM,KAAK;EACzC,OAAO,OAAO;GAAE;GAAM,QAAQ,CAAC,MAAM,KAAK;EAAE,IAAI;CAClD;CACA,MAAM,OAAO,iBAAiB,KAAK;CACnC,IAAI,KAAK,SAAS,cAAc;EAC9B,IAAI,CAAC,eAAe,IAAI,GAAG,OAAO;EAClC,MAAM,aAAa,SAAS,iBAAiB,oBAAoB,IAAI,IAAI,CAAC;EAC1E,IAAI,CAAC,YAAY,YAAY,CAAC,WAAW,aAAa,OAAO;EAC7D,MAAM,MAAM,GAAG,WAAW,GAAG,GAAG,WAAW,KAAK;EAChD,IAAI,MAAM,kBAAkB,IAAI,GAAG,GAAG,OAAO;EAC7C,MAAM,cAAc,SAAS,eAAe,WAAW,WAAW;EAClE,IAAI,CAAC,aAAa,OAAO;EACzB,MAAM,aAAa,IAAI,WAAW,EAAE;EACpC,MAAM,kBAAkB,IAAI,GAAG;EAC/B,IAAI;GACF,OAAO,oBAAoB,UAAU,WAAW,IAAI,aAAa,KAAK;EACxE,UAAU;GACR,MAAM,kBAAkB,OAAO,GAAG;EACpC;CACF;CACA,IAAI,KAAK,SAAS,oBAAoB;EACpC,MAAM,aAAa,UAAU,MAAM,QAAQ;EAC3C,MAAM,eAAe,UAAU,MAAM,UAAU;EAC/C,IAAI,CAAC,cAAc,CAAC,cAAc,OAAO;EACzC,MAAM,SAAS,aAAa,UAAU,IAAI,YAAY,KAAK;EAC3D,IAAI,CAAC,OAAO,MAAM,CAAC,MAAM,QAAQ,OAAO,KAAK,GAAG,OAAO;EACvD,MAAM,WAAW,oBAAoB,UAAU,IAAI,cAAc,KAAK;EACtE,IAAI,UAAU,SAAS,YAAY,OAAO,MAAM,SAAS,IAAI,OAAO;EACpE,MAAM,SAAS,CAAC;EAChB,IAAI,OAAO;EACX,KAAK,MAAM,SAAS,OAAO,OAAO;GAChC,MAAM,WAAW,iBAAiB,KAAK;GACvC,IAAI,CAAC,YAAY,QAAQ,SAAS,UAAU,OAAO;GACnD,OAAO;GACP,MAAM,YAAY;GAClB,IAAI,CAAC,OAAO,SAAS,SAAS,GAAG,OAAO,KAAK,SAAS;EACxD;EACA,OAAO,OAAO;GAAE;GAAM;EAAO,IAAI;CACnC;CACA,IAAI,KAAK,SAAS,oBAAoB;EACpC,MAAM,WAAW,UAAU,MAAM,MAAM;EACvC,MAAM,YAAY,UAAU,MAAM,OAAO;EACzC,IAAI,CAAC,YAAY,CAAC,WAAW,OAAO;EACpC,MAAM,OAAO,oBAAoB,UAAU,IAAI,UAAU,KAAK;EAC9D,MAAM,QAAQ,oBAAoB,UAAU,IAAI,WAAW,KAAK;EAChE,IAAI,KAAK,aAAa,KAAK;GACzB,OAAO,MAAM,SAAS,YAAY,OAAO,SAAS,WAAW,EAAE,MAAM,SAAS,IAAI;EACpF;EACA,IAAI,KAAK,aAAa,OAAO,KAAK,aAAa,OAAO,KAAK,aAAa,OAAO,KAAK,aAAa,OAAO,KAAK,aAAa,MAAM;GAC9H,IAAI,MAAM,SAAS,YAAY,OAAO,SAAS,UAAU;IACvD,OAAO,EAAE,MAAM,SAAS;GAC1B;EACF;CACF;CACA,OAAO;AACT;AACA,SAAS,cAAc,MAAM;CAC3B,IAAI,KAAK,SAAS,QAAQ,OAAO,CAAC,IAAI;CACtC,OAAO,CAAC,GAAG,cAAc,KAAK,QAAQ,GAAG,GAAG,cAAc,KAAK,SAAS,CAAC;AAC3E;AACA,SAAS,0BAA0B,MAAM;CACvC,IAAI,KAAK,SAAS,QAAQ,OAAO,KAAK;CACtC,OAAO,CACL,mBAAmB,IAAI,IAAI,CACzB,GAAG,0BAA0B,KAAK,QAAQ,GAC1C,GAAG,0BAA0B,KAAK,SAAS,CAC7C,CAAC,CACH,CAAC,CAAC,KAAK;AACT;AACA,SAAS,oBAAoB,UAAU,IAAI,MAAM,OAAO,OAAO,UAAU;CACvE,MAAM,YAAY;EAChB,mBAAmB,IAAI,IAAI,MAAM,iBAAiB;EAClD,cAAc,IAAI,IAAI,MAAM,YAAY;CAC1C;CACA,MAAM,UAAU,aAAa,UAAU,IAAI,MAAM,SAAS;CAC1D,IAAI,QAAQ,IAAI;EACd,OAAO;GACL,MAAM;GACN,OAAO,QAAQ;GACf,cAAc,CAAC,GAAG,UAAU,YAAY,CAAC,CAAC,KAAK;EACjD;CACF;CACA,OAAO,qBAAqB,UAAU,IAAI,MAAM,QAAQ,GAAG,WAAW,QAAQ;AAChF;AACA,SAAS,qBAAqB,UAAU,IAAI,OAAO,OAAO,OAAO,UAAU;CACzE,MAAM,OAAO,iBAAiB,KAAK;CACnC,IAAI,CAAC,UAAU,IAAI,GAAG,OAAO;CAC7B,IAAI,KAAK,SAAS,cAAc;EAC9B,MAAM,OAAO,eAAe,IAAI;EAChC,IAAI,CAAC,MAAM,OAAO;EAClB,MAAM,aAAa,SAAS,eAAe,IAAI,IAAI;EACnD,IAAI,CAAC,cAAc,CAAC,WAAW,YAAY,CAAC,WAAW,aAAa,OAAO;EAC3E,MAAM,cAAc,SAAS,eAAe,WAAW,WAAW;EAClE,IAAI,CAAC,aAAa,OAAO;EACzB,MAAM,MAAM,GAAG,WAAW,GAAG,GAAG,WAAW,KAAK;EAChD,IAAI,MAAM,kBAAkB,IAAI,GAAG,GAAG,OAAO;EAC7C,MAAM,kBAAkB,IAAI,GAAG;EAC/B,MAAM,aAAa,IAAI,WAAW,EAAE;EACpC,IAAI;GACF,OAAO,qBACL,UACA,WAAW,IACX,aACA,OACA,OACA,QACF;EACF,UAAU;GACR,MAAM,kBAAkB,OAAO,GAAG;EACpC;CACF;CACA,IAAI,SAAS,GAAG,OAAO;CACvB,IAAI,KAAK,SAAS,yBAAyB;EACzC,MAAM,WAAW,UAAU,MAAM,MAAM;EACvC,MAAM,aAAa,UAAU,MAAM,YAAY;EAC/C,MAAM,YAAY,UAAU,MAAM,WAAW;EAC7C,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,WAAW,OAAO;EACnD,MAAM,OAAO,OAAO,IAAI,QAAQ;EAChC,IAAI,KAAK,OAAO,UAAU,OAAO;EACjC,MAAM,WAAW,oBAAoB,UAAU,IAAI,YAAY,OAAO,OAAO,QAAQ;EACrF,IAAI,CAAC,UAAU,OAAO;EACtB,MAAM,YAAY,oBAAoB,UAAU,IAAI,WAAW,OAAO,OAAO,QAAQ;EACrF,IAAI,CAAC,WAAW,OAAO;EACvB,OAAO;GACL,MAAM;GACN;GACA;GACA;EACF;CACF;CACA,IAAI,KAAK,SAAS,mBAAmB;EACnC,OAAO,qBACL,UACA,IACA,WAAW,MAAM,QAAQ,GACzB,WAAW,MAAM,aAAa,GAC9B,GACA,IACA,OACA,OACA,QACF;CACF;CACA,IAAI,KAAK,SAAS,qBAAqB;EACrC,MAAM,OAAO,UAAU,MAAM,MAAM;EACnC,MAAM,QAAQ,UAAU,MAAM,OAAO;EACrC,IAAI,CAAC,QAAQ,CAAC,OAAO,OAAO;EAC5B,IAAI,KAAK,aAAa,MAAM;GAC1B,MAAM,OAAO,OAAO,IAAI,IAAI;GAC5B,IAAI,KAAK,OAAO,UAAU,OAAO;GACjC,MAAM,WAAW,oBAAoB,UAAU,IAAI,OAAO,OAAO,OAAO,QAAQ;GAChF,IAAI,CAAC,UAAU,OAAO;GACtB,MAAM,YAAY;IAChB,MAAM;IACN,OAAO,KAAK;IACZ,cAAc,CAAC,GAAG,MAAM,YAAY,CAAC,CAAC,KAAK;GAC7C;GACA,OAAO;IACL,MAAM;IACN;IACA;IACA;GACF;EACF;EACA,IAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,MAAM;GACpD,MAAM,OAAO,OAAO,IAAI,IAAI;GAC5B,IAAI,KAAK,OAAO,UAAU,OAAO;GACjC,MAAM,YAAY;IAChB,mBAAmB,IAAI,IAAI,MAAM,iBAAiB;IAClD,cAAc,IAAI,IAAI,MAAM,YAAY;GAC1C;GACA,MAAM,UAAU,aAAa,UAAU,IAAI,MAAM,SAAS;GAC1D,IAAI,CAAC,QAAQ,IAAI,OAAO;GACxB,MAAM,WAAW;IACf,MAAM;IACN,OAAO,QAAQ;IACf,cAAc,CAAC,GAAG,UAAU,YAAY,CAAC,CAAC,KAAK;GACjD;GACA,MAAM,YAAY,oBAAoB,UAAU,IAAI,OAAO,OAAO,OAAO,QAAQ;GACjF,IAAI,CAAC,WAAW,OAAO;GACvB,OAAO;IACL,MAAM;IACN;IACA;IACA;GACF;EACF;CACF;CACA,OAAO;AACT;AACA,SAAS,gBAAgB,MAAM,KAAK;CAClC,IAAI,KAAK,SAAS,QAAQ,OAAO,IAAI,IAAI;CACzC,MAAM,WAAW,gBAAgB,KAAK,UAAU,GAAG;CACnD,IAAI,CAAC,UAAU,OAAO;CACtB,MAAM,YAAY,gBAAgB,KAAK,WAAW,GAAG;CACrD,IAAI,CAAC,WAAW,OAAO;CACvB,OAAO;EAAE,MAAM;EAAU,MAAM,KAAK;EAAM;EAAU;CAAU;AAChE;AACA,SAAS,qBAAqB,UAAU,IAAI,QAAQ,aAAa,OAAO,QAAQ,OAAO,OAAO,UAAU;CACtG,IAAI,OAAO;CACX,KAAK,IAAI,WAAW,OAAO,WAAW,OAAO,QAAQ,YAAY;EAC/D,QAAQ,UAAU,OAAO,SAAS;EAClC,MAAM,aAAa,YAAY;EAC/B,IAAI,CAAC,YAAY;EACjB,MAAM,QAAQ,aAAa,UAAU,IAAI,YAAY,KAAK;EAC1D,IAAI,MAAM,IAAI;GACZ,MAAM,eAAe,sBAAsB,MAAM,KAAK;GACtD,IAAI,iBAAiB,MAAM,OAAO;GAClC,QAAQ;GACR;EACF;EACA,MAAM,OAAO,qBACX,UACA,IACA,YACA,QAAQ,GACR,OACA,QACF;EACA,IAAI,CAAC,MAAM,OAAO;EAClB,OAAO,gBAAgB,OAAO,SAAS;GACrC,IAAI,KAAK,UAAU,KAAK,GAAG,OAAO;GAClC,MAAM,eAAe,sBAAsB,KAAK,KAAK;GACrD,IAAI,iBAAiB,MAAM,OAAO;GAClC,OAAO,qBACL,UACA,IACA,QACA,aACA,WAAW,GACX,OAAO,cACP,QAAQ,GACR,OACA,QACF;EACF,CAAC;CACH;CACA,OAAO;EAAE,MAAM;EAAQ,OAAO;EAAM,cAAc,CAAC,GAAG,MAAM,YAAY,CAAC,CAAC,KAAK;CAAE;AACnF;AACA,SAAS,sBAAsB,OAAO;CACpC,IAAI,UAAU,MAAM,OAAO;CAC3B,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;EACxF,OAAO,OAAO,KAAK;CACrB;CACA,OAAO;AACT;AACA,SAAS,iBAAiB,UAAU,WAAW;CAC7C,MAAM,OAAO,SAAS,eAAe,SAAS;CAC9C,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,QAAQ;EACZ,mCAAmC,IAAI,IAAI;EAC3C,8BAA8B,IAAI,IAAI;CACxC;CACA,MAAM,OAAO,qBAAqB,UAAU,UAAU,IAAI,MAAM,GAAG,OAAO,UAAU,EAAE;CACtF,OAAO,MAAM,SAAS,WAAW,OAAO;AAC1C;AACA,SAAS,mBAAmB,UAAU,WAAW;CAC/C,MAAM,OAAO,SAAS,eAAe,SAAS;CAC9C,IAAI,CAAC,MAAM;EACT,OAAO;GACL,IAAI;GACJ,SAAS,cACP,8BACA,WACA,kDACA,UAAU,EACZ;EACF;CACF;CACA,MAAM,QAAQ;EACZ,mCAAmC,IAAI,IAAI;EAC3C,8BAA8B,IAAI,IAAI;CACxC;CACA,MAAM,SAAS,aAAa,UAAU,UAAU,IAAI,MAAM,KAAK;CAC/D,OAAO,OAAO,KAAK;EACjB,IAAI;EACJ,OAAO,OAAO;EACd,cAAc,CAAC,GAAG,MAAM,YAAY,CAAC,CAAC,KAAK;CAC7C,IAAI;AACN;AACA,SAAS,0BAA0B,UAAU,WAAW;CACtD,MAAM,OAAO,SAAS,eAAe,SAAS;CAC9C,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,QAAQ;EACZ,mCAAmC,IAAI,IAAI;EAC3C,8BAA8B,IAAI,IAAI;CACxC;CACA,MAAM,SAAS,oBAAoB,UAAU,UAAU,IAAI,MAAM,KAAK;CACtE,OAAO,SAAS;EAAE,GAAG;EAAQ,cAAc,CAAC,GAAG,MAAM,YAAY,CAAC,CAAC,KAAK;CAAE,IAAI;AAChF;AACA,SAAS,gBAAgB,UAAU,IAAI,WAAW;CAChD,MAAM,aAAa,SAAS,eAAe,IAAI,SAAS;CACxD,IAAI,CAAC,YAAY;EACf,MAAM,YAAY;GAAE;GAAI,OAAO;GAAG,KAAK;EAAE;EACzC,OAAO;GACL,IAAI;GACJ,SAAS,cACP,6BACA,WACA,WAAW,UAAU,+BACvB;EACF;CACF;CACA,IAAI,CAAC,WAAW,aAAa;EAC3B,OAAO;GACL,IAAI;GACJ,SAAS,cACP,8BACA,WAAW,MACX,WAAW,UAAU,6BACrB,WAAW,EACb;EACF;CACF;CACA,OAAO,mBACL,UACA,oBAAoB,WAAW,IAAI,WAAW,WAAW,CAC3D;AACF"}

package/dist/esm/graph.mjs

@@ -64,6 +64,16 @@ var ProjectGraph = class {
 	dependentsOf(id) {
 		return [...this.#dependents.get(id) ?? []].sort(compareIds);
 	}
+	/** resolved ids a module imports that the graph does not own (package entries) */
+	externalImportsOf(id) {
+		const record = this.#modules.get(id);
+		if (!record) return [];
+		const ids = /* @__PURE__ */ new Set();
+		for (const dependency of record.input.imports) {
+			if (dependency.external) ids.add(dependency.resolvedId);
+		}
+		return [...ids].sort(compareIds);
+	}
 	affectedBy(id) {
 		const affected = /* @__PURE__ */ new Set([id]);
 		const queue = [id];

package/dist/esm/graph.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"graph.js","names":["#installHostRecord","#files","#resolutions","#candidate","#modules","#dependencies","#dependents","#elementCache","#removeOutgoingEdges","#removeResolutions"],"sources":["esm/graph.js"],"sourcesContent":["import { createHash } from \"node:crypto\";\nimport { expressionReference, resolutionKey, resolvedModuleId } from \"./contracts\";\nimport { linkedBailout, localBailout } from \"./diagnostics\";\nimport {\n  evaluateBinding,\n  evaluateBranches,\n  evaluateDynamicExpression,\n  evaluateExpression\n} from \"./evaluate\";\nimport { nodeAtSpan, normalizeElements } from \"./normalize\";\nfunction compareIds(left, right) {\n  return compareCodeUnits(left, right);\n}\nfunction compareCodeUnits(left, right) {\n  return left < right ? -1 : left > right ? 1 : 0;\n}\nfunction stableImports(imports) {\n  return [...imports].sort((left, right) => {\n    const bySpecifier = compareCodeUnits(left.specifier, right.specifier);\n    return bySpecifier || compareCodeUnits(left.resolvedId, right.resolvedId);\n  });\n}\nfunction moduleContentHash(input) {\n  const hash = createHash(\"sha256\");\n  hash.update(input.source);\n  hash.update(\"\\0\");\n  for (const dependency of stableImports(input.imports)) {\n    hash.update(dependency.specifier);\n    hash.update(\"\\0\");\n    hash.update(dependency.resolvedId);\n    hash.update(\"\\0\");\n    hash.update(dependency.external ? \"external\" : \"internal\");\n    hash.update(\"\\0\");\n  }\n  return hash.digest(\"hex\");\n}\nclass ProjectGraph {\n  #files = /* @__PURE__ */ new Map();\n  #resolutions = /* @__PURE__ */ new Map();\n  #modules = /* @__PURE__ */ new Map();\n  #dependencies = /* @__PURE__ */ new Map();\n  #dependents = /* @__PURE__ */ new Map();\n  #elementCache = /* @__PURE__ */ new Map();\n  #candidate;\n  constructor(factory, project) {\n    for (const input of project.modules) this.#installHostRecord(input);\n    const candidateProject = {\n      files: this.#files,\n      resolutions: this.#resolutions\n    };\n    this.#candidate = factory.create(candidateProject);\n    this.#candidate.link();\n  }\n  moduleIds() {\n    return [...this.#modules.keys()].sort(compareIds);\n  }\n  contentHash(id) {\n    return this.#modules.get(id)?.hash ?? null;\n  }\n  sourceOf(id) {\n    const source = this.#modules.get(id)?.input.source;\n    if (source === void 0) throw new Error(`Unknown host module ${id}`);\n    return source;\n  }\n  dependenciesOf(id) {\n    return [...this.#dependencies.get(id) ?? []].sort(compareIds);\n  }\n  dependentsOf(id) {\n    return [...this.#dependents.get(id) ?? []].sort(compareIds);\n  }\n  affectedBy(id) {\n    const affected = /* @__PURE__ */ new Set([id]);\n    const queue = [id];\n    while (queue.length) {\n      const current = queue.shift();\n      for (const dependent of this.#dependents.get(current) ?? []) {\n        if (affected.has(dependent)) continue;\n        affected.add(dependent);\n        queue.push(dependent);\n      }\n    }\n    return [...affected].sort(compareIds);\n  }\n  parseCount(id) {\n    return this.#candidate.parseCount(id);\n  }\n  resolveBinding(id, localName) {\n    const definition = this.#candidate.definitionOf(id, localName);\n    if (!definition) return null;\n    return {\n      id: definition.id,\n      name: definition.name,\n      span: {\n        id: definition.id,\n        start: definition.start,\n        end: definition.end\n      },\n      initializer: definition.initializer ? expressionReference(definition.id, definition.initializer) : null,\n      constant: definition.constant\n    };\n  }\n  resolveReference(reference) {\n    const definition = this.#candidate.definitionAt(\n      reference.id,\n      reference.start,\n      reference.end\n    );\n    if (!definition) return null;\n    return {\n      id: definition.id,\n      name: definition.name,\n      span: {\n        id: definition.id,\n        start: definition.start,\n        end: definition.end\n      },\n      initializer: definition.initializer ? expressionReference(definition.id, definition.initializer) : null,\n      constant: definition.constant\n    };\n  }\n  expressionNode(reference) {\n    if (!this.#modules.has(reference.id)) return null;\n    return nodeAtSpan(\n      this.#candidate.programOf(reference.id),\n      reference.start,\n      reference.end\n    );\n  }\n  evaluate(reference) {\n    return evaluateExpression(this, reference);\n  }\n  evaluateBranches(reference) {\n    return evaluateBranches(this, reference);\n  }\n  evaluateDynamic(reference) {\n    return evaluateDynamicExpression(this, reference);\n  }\n  evaluateBinding(id, localName) {\n    return evaluateBinding(this, id, localName);\n  }\n  elementsOf(id) {\n    const record = this.#modules.get(id);\n    if (!record) throw new Error(`Unknown host module ${id}`);\n    const cached = this.#elementCache.get(id);\n    if (cached?.hash === record.hash) return cached.result;\n    const result = normalizeElements(this.#candidate, id, record.input.imports);\n    this.#elementCache.set(id, { hash: record.hash, result });\n    return result;\n  }\n  diagnostics() {\n    const diagnostics = this.#candidate.diagnostics().map(\n      (diagnostic) => diagnostic.kind === \"parse\" ? localBailout(\n        \"local/parse-error\",\n        { id: diagnostic.id, start: 0, end: 0 },\n        diagnostic.message\n      ) : linkedBailout(\n        \"linked/unresolved-binding\",\n        { id: diagnostic.id, start: 0, end: 0 },\n        diagnostic.message\n      )\n    );\n    for (const [id, record] of this.#modules) {\n      for (const dependency of record.input.imports) {\n        if (dependency.external) continue;\n        if (this.#modules.has(dependency.resolvedId)) continue;\n        diagnostics.push(\n          linkedBailout(\n            \"linked/unresolved-import\",\n            { id, start: 0, end: 0 },\n            `Host-resolved import ${dependency.specifier} points outside the project graph`,\n            dependency.resolvedId\n          )\n        );\n      }\n    }\n    return diagnostics.sort((left, right) => {\n      const byId = compareCodeUnits(left.span.id, right.span.id);\n      return byId || left.span.start - right.span.start || compareCodeUnits(left.code, right.code);\n    });\n  }\n  updateModule(input) {\n    const previous = this.#modules.get(input.id);\n    const nextHash = moduleContentHash(input);\n    if (previous?.hash === nextHash) {\n      return {\n        changed: false,\n        id: input.id,\n        previousHash: previous.hash,\n        contentHash: previous.hash,\n        invalidatedIds: []\n      };\n    }\n    const invalidatedIds = this.affectedBy(input.id);\n    const previousHash = previous?.hash ?? null;\n    if (previous) this.#candidate.removeFile(input.id);\n    this.#installHostRecord(input);\n    this.#candidate.addFile(input.id, input.source);\n    this.#candidate.link();\n    for (const id of invalidatedIds) this.#elementCache.delete(id);\n    return {\n      changed: true,\n      id: input.id,\n      previousHash,\n      contentHash: nextHash,\n      invalidatedIds\n    };\n  }\n  removeModule(id) {\n    const previous = this.#modules.get(id);\n    if (!previous) {\n      return {\n        changed: false,\n        id,\n        previousHash: null,\n        contentHash: null,\n        invalidatedIds: []\n      };\n    }\n    const invalidatedIds = this.affectedBy(id);\n    this.#candidate.removeFile(id);\n    this.#removeOutgoingEdges(id);\n    this.#removeResolutions(id);\n    this.#modules.delete(id);\n    this.#files.delete(id);\n    this.#candidate.link();\n    for (const invalidated of invalidatedIds) this.#elementCache.delete(invalidated);\n    return {\n      changed: true,\n      id,\n      previousHash: previous.hash,\n      contentHash: null,\n      invalidatedIds\n    };\n  }\n  #installHostRecord(input) {\n    resolvedModuleId(input.id);\n    const seenSpecifiers = /* @__PURE__ */ new Set();\n    for (const dependency of input.imports) {\n      resolvedModuleId(dependency.resolvedId);\n      if (seenSpecifiers.has(dependency.specifier)) {\n        throw new Error(\n          `Duplicate host resolution for ${input.id}:${dependency.specifier}`\n        );\n      }\n      seenSpecifiers.add(dependency.specifier);\n    }\n    this.#removeOutgoingEdges(input.id);\n    this.#removeResolutions(input.id);\n    const dependencies = new Set(\n      input.imports.filter(({ external }) => !external).map(({ resolvedId }) => resolvedId)\n    );\n    this.#dependencies.set(input.id, dependencies);\n    for (const dependency of dependencies) {\n      let reverse = this.#dependents.get(dependency);\n      if (!reverse) {\n        reverse = /* @__PURE__ */ new Set();\n        this.#dependents.set(dependency, reverse);\n      }\n      reverse.add(input.id);\n    }\n    for (const dependency of input.imports) {\n      if (dependency.external) continue;\n      this.#resolutions.set(\n        resolutionKey(input.id, dependency.specifier),\n        dependency.resolvedId\n      );\n    }\n    const installedInput = {\n      ...input,\n      imports: input.imports.map((dependency) => ({ ...dependency }))\n    };\n    this.#files.set(installedInput.id, installedInput.source);\n    this.#modules.set(installedInput.id, {\n      input: installedInput,\n      hash: moduleContentHash(installedInput)\n    });\n  }\n  #removeOutgoingEdges(id) {\n    for (const dependency of this.#dependencies.get(id) ?? []) {\n      const reverse = this.#dependents.get(dependency);\n      reverse?.delete(id);\n      if (reverse?.size === 0) this.#dependents.delete(dependency);\n    }\n    this.#dependencies.delete(id);\n  }\n  #removeResolutions(id) {\n    const prefix = `${id}\\0`;\n    for (const key of this.#resolutions.keys()) {\n      if (key.startsWith(prefix)) this.#resolutions.delete(key);\n    }\n  }\n}\nexport {\n  ProjectGraph,\n  moduleContentHash\n};\n//# sourceMappingURL=graph.js.map\n"],"mappings":";;;;;;;AAUA,SAAS,WAAW,MAAM,OAAO;CAC/B,OAAO,iBAAiB,MAAM,KAAK;AACrC;AACA,SAAS,iBAAiB,MAAM,OAAO;CACrC,OAAO,OAAO,QAAQ,CAAC,IAAI,OAAO,QAAQ,IAAI;AAChD;AACA,SAAS,cAAc,SAAS;CAC9B,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,MAAM,UAAU;EACxC,MAAM,cAAc,iBAAiB,KAAK,WAAW,MAAM,SAAS;EACpE,OAAO,eAAe,iBAAiB,KAAK,YAAY,MAAM,UAAU;CAC1E,CAAC;AACH;AACA,SAAS,kBAAkB,OAAO;CAChC,MAAM,OAAO,WAAW,QAAQ;CAChC,KAAK,OAAO,MAAM,MAAM;CACxB,KAAK,OAAO,IAAI;CAChB,KAAK,MAAM,cAAc,cAAc,MAAM,OAAO,GAAG;EACrD,KAAK,OAAO,WAAW,SAAS;EAChC,KAAK,OAAO,IAAI;EAChB,KAAK,OAAO,WAAW,UAAU;EACjC,KAAK,OAAO,IAAI;EAChB,KAAK,OAAO,WAAW,WAAW,aAAa,UAAU;EACzD,KAAK,OAAO,IAAI;CAClB;CACA,OAAO,KAAK,OAAO,KAAK;AAC1B;AACA,IAAM,eAAN,MAAmB;CACjB,yBAAyB,IAAI,IAAI;CACjC,+BAA+B,IAAI,IAAI;CACvC,2BAA2B,IAAI,IAAI;CACnC,gCAAgC,IAAI,IAAI;CACxC,8BAA8B,IAAI,IAAI;CACtC,gCAAgC,IAAI,IAAI;CACxC;CACA,YAAY,SAAS,SAAS;EAC5B,KAAK,MAAM,SAAS,QAAQ,SAAS,KAAKA,mBAAmB,KAAK;EAClE,MAAM,mBAAmB;GACvB,OAAO,KAAKC;GACZ,aAAa,KAAKC;EACpB;EACA,KAAKC,aAAa,QAAQ,OAAO,gBAAgB;EACjD,KAAKA,WAAW,KAAK;CACvB;CACA,YAAY;EACV,OAAO,CAAC,GAAG,KAAKC,SAAS,KAAK,CAAC,CAAC,CAAC,KAAK,UAAU;CAClD;CACA,YAAY,IAAI;EACd,OAAO,KAAKA,SAAS,IAAI,EAAE,CAAC,EAAE,QAAQ;CACxC;CACA,SAAS,IAAI;EACX,MAAM,SAAS,KAAKA,SAAS,IAAI,EAAE,CAAC,EAAE,MAAM;EAC5C,IAAI,WAAW,KAAK,GAAG,MAAM,IAAI,MAAM,uBAAuB,IAAI;EAClE,OAAO;CACT;CACA,eAAe,IAAI;EACjB,OAAO,CAAC,GAAG,KAAKC,cAAc,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,UAAU;CAC9D;CACA,aAAa,IAAI;EACf,OAAO,CAAC,GAAG,KAAKC,YAAY,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,UAAU;CAC5D;CACA,WAAW,IAAI;EACb,MAAM,2BAA2B,IAAI,IAAI,CAAC,EAAE,CAAC;EAC7C,MAAM,QAAQ,CAAC,EAAE;EACjB,OAAO,MAAM,QAAQ;GACnB,MAAM,UAAU,MAAM,MAAM;GAC5B,KAAK,MAAM,aAAa,KAAKA,YAAY,IAAI,OAAO,KAAK,CAAC,GAAG;IAC3D,IAAI,SAAS,IAAI,SAAS,GAAG;IAC7B,SAAS,IAAI,SAAS;IACtB,MAAM,KAAK,SAAS;GACtB;EACF;EACA,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK,UAAU;CACtC;CACA,WAAW,IAAI;EACb,OAAO,KAAKH,WAAW,WAAW,EAAE;CACtC;CACA,eAAe,IAAI,WAAW;EAC5B,MAAM,aAAa,KAAKA,WAAW,aAAa,IAAI,SAAS;EAC7D,IAAI,CAAC,YAAY,OAAO;EACxB,OAAO;GACL,IAAI,WAAW;GACf,MAAM,WAAW;GACjB,MAAM;IACJ,IAAI,WAAW;IACf,OAAO,WAAW;IAClB,KAAK,WAAW;GAClB;GACA,aAAa,WAAW,cAAc,oBAAoB,WAAW,IAAI,WAAW,WAAW,IAAI;GACnG,UAAU,WAAW;EACvB;CACF;CACA,iBAAiB,WAAW;EAC1B,MAAM,aAAa,KAAKA,WAAW,aACjC,UAAU,IACV,UAAU,OACV,UAAU,GACZ;EACA,IAAI,CAAC,YAAY,OAAO;EACxB,OAAO;GACL,IAAI,WAAW;GACf,MAAM,WAAW;GACjB,MAAM;IACJ,IAAI,WAAW;IACf,OAAO,WAAW;IAClB,KAAK,WAAW;GAClB;GACA,aAAa,WAAW,cAAc,oBAAoB,WAAW,IAAI,WAAW,WAAW,IAAI;GACnG,UAAU,WAAW;EACvB;CACF;CACA,eAAe,WAAW;EACxB,IAAI,CAAC,KAAKC,SAAS,IAAI,UAAU,EAAE,GAAG,OAAO;EAC7C,OAAO,WACL,KAAKD,WAAW,UAAU,UAAU,EAAE,GACtC,UAAU,OACV,UAAU,GACZ;CACF;CACA,SAAS,WAAW;EAClB,OAAO,mBAAmB,MAAM,SAAS;CAC3C;CACA,iBAAiB,WAAW;EAC1B,OAAO,iBAAiB,MAAM,SAAS;CACzC;CACA,gBAAgB,WAAW;EACzB,OAAO,0BAA0B,MAAM,SAAS;CAClD;CACA,gBAAgB,IAAI,WAAW;EAC7B,OAAO,gBAAgB,MAAM,IAAI,SAAS;CAC5C;CACA,WAAW,IAAI;EACb,MAAM,SAAS,KAAKC,SAAS,IAAI,EAAE;EACnC,IAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,uBAAuB,IAAI;EACxD,MAAM,SAAS,KAAKG,cAAc,IAAI,EAAE;EACxC,IAAI,QAAQ,SAAS,OAAO,MAAM,OAAO,OAAO;EAChD,MAAM,SAAS,kBAAkB,KAAKJ,YAAY,IAAI,OAAO,MAAM,OAAO;EAC1E,KAAKI,cAAc,IAAI,IAAI;GAAE,MAAM,OAAO;GAAM;EAAO,CAAC;EACxD,OAAO;CACT;CACA,cAAc;EACZ,MAAM,cAAc,KAAKJ,WAAW,YAAY,CAAC,CAAC,KAC/C,eAAe,WAAW,SAAS,UAAU,aAC5C,qBACA;GAAE,IAAI,WAAW;GAAI,OAAO;GAAG,KAAK;EAAE,GACtC,WAAW,OACb,IAAI,cACF,6BACA;GAAE,IAAI,WAAW;GAAI,OAAO;GAAG,KAAK;EAAE,GACtC,WAAW,OACb,CACF;EACA,KAAK,MAAM,CAAC,IAAI,WAAW,KAAKC,UAAU;GACxC,KAAK,MAAM,cAAc,OAAO,MAAM,SAAS;IAC7C,IAAI,WAAW,UAAU;IACzB,IAAI,KAAKA,SAAS,IAAI,WAAW,UAAU,GAAG;IAC9C,YAAY,KACV,cACE,4BACA;KAAE;KAAI,OAAO;KAAG,KAAK;IAAE,GACvB,wBAAwB,WAAW,UAAU,oCAC7C,WAAW,UACb,CACF;GACF;EACF;EACA,OAAO,YAAY,MAAM,MAAM,UAAU;GACvC,MAAM,OAAO,iBAAiB,KAAK,KAAK,IAAI,MAAM,KAAK,EAAE;GACzD,OAAO,QAAQ,KAAK,KAAK,QAAQ,MAAM,KAAK,SAAS,iBAAiB,KAAK,MAAM,MAAM,IAAI;EAC7F,CAAC;CACH;CACA,aAAa,OAAO;EAClB,MAAM,WAAW,KAAKA,SAAS,IAAI,MAAM,EAAE;EAC3C,MAAM,WAAW,kBAAkB,KAAK;EACxC,IAAI,UAAU,SAAS,UAAU;GAC/B,OAAO;IACL,SAAS;IACT,IAAI,MAAM;IACV,cAAc,SAAS;IACvB,aAAa,SAAS;IACtB,gBAAgB,CAAC;GACnB;EACF;EACA,MAAM,iBAAiB,KAAK,WAAW,MAAM,EAAE;EAC/C,MAAM,eAAe,UAAU,QAAQ;EACvC,IAAI,UAAU,KAAKD,WAAW,WAAW,MAAM,EAAE;EACjD,KAAKH,mBAAmB,KAAK;EAC7B,KAAKG,WAAW,QAAQ,MAAM,IAAI,MAAM,MAAM;EAC9C,KAAKA,WAAW,KAAK;EACrB,KAAK,MAAM,MAAM,gBAAgB,KAAKI,cAAc,OAAO,EAAE;EAC7D,OAAO;GACL,SAAS;GACT,IAAI,MAAM;GACV;GACA,aAAa;GACb;EACF;CACF;CACA,aAAa,IAAI;EACf,MAAM,WAAW,KAAKH,SAAS,IAAI,EAAE;EACrC,IAAI,CAAC,UAAU;GACb,OAAO;IACL,SAAS;IACT;IACA,cAAc;IACd,aAAa;IACb,gBAAgB,CAAC;GACnB;EACF;EACA,MAAM,iBAAiB,KAAK,WAAW,EAAE;EACzC,KAAKD,WAAW,WAAW,EAAE;EAC7B,KAAKK,qBAAqB,EAAE;EAC5B,KAAKC,mBAAmB,EAAE;EAC1B,KAAKL,SAAS,OAAO,EAAE;EACvB,KAAKH,OAAO,OAAO,EAAE;EACrB,KAAKE,WAAW,KAAK;EACrB,KAAK,MAAM,eAAe,gBAAgB,KAAKI,cAAc,OAAO,WAAW;EAC/E,OAAO;GACL,SAAS;GACT;GACA,cAAc,SAAS;GACvB,aAAa;GACb;EACF;CACF;CACA,mBAAmB,OAAO;EACxB,iBAAiB,MAAM,EAAE;EACzB,MAAM,iCAAiC,IAAI,IAAI;EAC/C,KAAK,MAAM,cAAc,MAAM,SAAS;GACtC,iBAAiB,WAAW,UAAU;GACtC,IAAI,eAAe,IAAI,WAAW,SAAS,GAAG;IAC5C,MAAM,IAAI,MACR,iCAAiC,MAAM,GAAG,GAAG,WAAW,WAC1D;GACF;GACA,eAAe,IAAI,WAAW,SAAS;EACzC;EACA,KAAKC,qBAAqB,MAAM,EAAE;EAClC,KAAKC,mBAAmB,MAAM,EAAE;EAChC,MAAM,eAAe,IAAI,IACvB,MAAM,QAAQ,QAAQ,EAAE,eAAe,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,iBAAiB,UAAU,CACtF;EACA,KAAKJ,cAAc,IAAI,MAAM,IAAI,YAAY;EAC7C,KAAK,MAAM,cAAc,cAAc;GACrC,IAAI,UAAU,KAAKC,YAAY,IAAI,UAAU;GAC7C,IAAI,CAAC,SAAS;IACZ,0BAA0B,IAAI,IAAI;IAClC,KAAKA,YAAY,IAAI,YAAY,OAAO;GAC1C;GACA,QAAQ,IAAI,MAAM,EAAE;EACtB;EACA,KAAK,MAAM,cAAc,MAAM,SAAS;GACtC,IAAI,WAAW,UAAU;GACzB,KAAKJ,aAAa,IAChB,cAAc,MAAM,IAAI,WAAW,SAAS,GAC5C,WAAW,UACb;EACF;EACA,MAAM,iBAAiB;GACrB,GAAG;GACH,SAAS,MAAM,QAAQ,KAAK,gBAAgB,EAAE,GAAG,WAAW,EAAE;EAChE;EACA,KAAKD,OAAO,IAAI,eAAe,IAAI,eAAe,MAAM;EACxD,KAAKG,SAAS,IAAI,eAAe,IAAI;GACnC,OAAO;GACP,MAAM,kBAAkB,cAAc;EACxC,CAAC;CACH;CACA,qBAAqB,IAAI;EACvB,KAAK,MAAM,cAAc,KAAKC,cAAc,IAAI,EAAE,KAAK,CAAC,GAAG;GACzD,MAAM,UAAU,KAAKC,YAAY,IAAI,UAAU;GAC/C,SAAS,OAAO,EAAE;GAClB,IAAI,SAAS,SAAS,GAAG,KAAKA,YAAY,OAAO,UAAU;EAC7D;EACA,KAAKD,cAAc,OAAO,EAAE;CAC9B;CACA,mBAAmB,IAAI;EACrB,MAAM,SAAS,GAAG,GAAG;EACrB,KAAK,MAAM,OAAO,KAAKH,aAAa,KAAK,GAAG;GAC1C,IAAI,IAAI,WAAW,MAAM,GAAG,KAAKA,aAAa,OAAO,GAAG;EAC1D;CACF;AACF"}
+{"version":3,"file":"graph.js","names":["#installHostRecord","#files","#resolutions","#candidate","#modules","#dependencies","#dependents","#elementCache","#removeOutgoingEdges","#removeResolutions"],"sources":["esm/graph.js"],"sourcesContent":["import { createHash } from \"node:crypto\";\nimport { expressionReference, resolutionKey, resolvedModuleId } from \"./contracts\";\nimport { linkedBailout, localBailout } from \"./diagnostics\";\nimport {\n  evaluateBinding,\n  evaluateBranches,\n  evaluateDynamicExpression,\n  evaluateExpression\n} from \"./evaluate\";\nimport { nodeAtSpan, normalizeElements } from \"./normalize\";\nfunction compareIds(left, right) {\n  return compareCodeUnits(left, right);\n}\nfunction compareCodeUnits(left, right) {\n  return left < right ? -1 : left > right ? 1 : 0;\n}\nfunction stableImports(imports) {\n  return [...imports].sort((left, right) => {\n    const bySpecifier = compareCodeUnits(left.specifier, right.specifier);\n    return bySpecifier || compareCodeUnits(left.resolvedId, right.resolvedId);\n  });\n}\nfunction moduleContentHash(input) {\n  const hash = createHash(\"sha256\");\n  hash.update(input.source);\n  hash.update(\"\\0\");\n  for (const dependency of stableImports(input.imports)) {\n    hash.update(dependency.specifier);\n    hash.update(\"\\0\");\n    hash.update(dependency.resolvedId);\n    hash.update(\"\\0\");\n    hash.update(dependency.external ? \"external\" : \"internal\");\n    hash.update(\"\\0\");\n  }\n  return hash.digest(\"hex\");\n}\nclass ProjectGraph {\n  #files = /* @__PURE__ */ new Map();\n  #resolutions = /* @__PURE__ */ new Map();\n  #modules = /* @__PURE__ */ new Map();\n  #dependencies = /* @__PURE__ */ new Map();\n  #dependents = /* @__PURE__ */ new Map();\n  #elementCache = /* @__PURE__ */ new Map();\n  #candidate;\n  constructor(factory, project) {\n    for (const input of project.modules) this.#installHostRecord(input);\n    const candidateProject = {\n      files: this.#files,\n      resolutions: this.#resolutions\n    };\n    this.#candidate = factory.create(candidateProject);\n    this.#candidate.link();\n  }\n  moduleIds() {\n    return [...this.#modules.keys()].sort(compareIds);\n  }\n  contentHash(id) {\n    return this.#modules.get(id)?.hash ?? null;\n  }\n  sourceOf(id) {\n    const source = this.#modules.get(id)?.input.source;\n    if (source === void 0) throw new Error(`Unknown host module ${id}`);\n    return source;\n  }\n  dependenciesOf(id) {\n    return [...this.#dependencies.get(id) ?? []].sort(compareIds);\n  }\n  dependentsOf(id) {\n    return [...this.#dependents.get(id) ?? []].sort(compareIds);\n  }\n  /** resolved ids a module imports that the graph does not own (package entries) */\n  externalImportsOf(id) {\n    const record = this.#modules.get(id);\n    if (!record) return [];\n    const ids = /* @__PURE__ */ new Set();\n    for (const dependency of record.input.imports) {\n      if (dependency.external) ids.add(dependency.resolvedId);\n    }\n    return [...ids].sort(compareIds);\n  }\n  affectedBy(id) {\n    const affected = /* @__PURE__ */ new Set([id]);\n    const queue = [id];\n    while (queue.length) {\n      const current = queue.shift();\n      for (const dependent of this.#dependents.get(current) ?? []) {\n        if (affected.has(dependent)) continue;\n        affected.add(dependent);\n        queue.push(dependent);\n      }\n    }\n    return [...affected].sort(compareIds);\n  }\n  parseCount(id) {\n    return this.#candidate.parseCount(id);\n  }\n  resolveBinding(id, localName) {\n    const definition = this.#candidate.definitionOf(id, localName);\n    if (!definition) return null;\n    return {\n      id: definition.id,\n      name: definition.name,\n      span: {\n        id: definition.id,\n        start: definition.start,\n        end: definition.end\n      },\n      initializer: definition.initializer ? expressionReference(definition.id, definition.initializer) : null,\n      constant: definition.constant\n    };\n  }\n  resolveReference(reference) {\n    const definition = this.#candidate.definitionAt(\n      reference.id,\n      reference.start,\n      reference.end\n    );\n    if (!definition) return null;\n    return {\n      id: definition.id,\n      name: definition.name,\n      span: {\n        id: definition.id,\n        start: definition.start,\n        end: definition.end\n      },\n      initializer: definition.initializer ? expressionReference(definition.id, definition.initializer) : null,\n      constant: definition.constant\n    };\n  }\n  expressionNode(reference) {\n    if (!this.#modules.has(reference.id)) return null;\n    return nodeAtSpan(\n      this.#candidate.programOf(reference.id),\n      reference.start,\n      reference.end\n    );\n  }\n  evaluate(reference) {\n    return evaluateExpression(this, reference);\n  }\n  evaluateBranches(reference) {\n    return evaluateBranches(this, reference);\n  }\n  evaluateDynamic(reference) {\n    return evaluateDynamicExpression(this, reference);\n  }\n  evaluateBinding(id, localName) {\n    return evaluateBinding(this, id, localName);\n  }\n  elementsOf(id) {\n    const record = this.#modules.get(id);\n    if (!record) throw new Error(`Unknown host module ${id}`);\n    const cached = this.#elementCache.get(id);\n    if (cached?.hash === record.hash) return cached.result;\n    const result = normalizeElements(this.#candidate, id, record.input.imports);\n    this.#elementCache.set(id, { hash: record.hash, result });\n    return result;\n  }\n  diagnostics() {\n    const diagnostics = this.#candidate.diagnostics().map(\n      (diagnostic) => diagnostic.kind === \"parse\" ? localBailout(\n        \"local/parse-error\",\n        { id: diagnostic.id, start: 0, end: 0 },\n        diagnostic.message\n      ) : linkedBailout(\n        \"linked/unresolved-binding\",\n        { id: diagnostic.id, start: 0, end: 0 },\n        diagnostic.message\n      )\n    );\n    for (const [id, record] of this.#modules) {\n      for (const dependency of record.input.imports) {\n        if (dependency.external) continue;\n        if (this.#modules.has(dependency.resolvedId)) continue;\n        diagnostics.push(\n          linkedBailout(\n            \"linked/unresolved-import\",\n            { id, start: 0, end: 0 },\n            `Host-resolved import ${dependency.specifier} points outside the project graph`,\n            dependency.resolvedId\n          )\n        );\n      }\n    }\n    return diagnostics.sort((left, right) => {\n      const byId = compareCodeUnits(left.span.id, right.span.id);\n      return byId || left.span.start - right.span.start || compareCodeUnits(left.code, right.code);\n    });\n  }\n  updateModule(input) {\n    const previous = this.#modules.get(input.id);\n    const nextHash = moduleContentHash(input);\n    if (previous?.hash === nextHash) {\n      return {\n        changed: false,\n        id: input.id,\n        previousHash: previous.hash,\n        contentHash: previous.hash,\n        invalidatedIds: []\n      };\n    }\n    const invalidatedIds = this.affectedBy(input.id);\n    const previousHash = previous?.hash ?? null;\n    if (previous) this.#candidate.removeFile(input.id);\n    this.#installHostRecord(input);\n    this.#candidate.addFile(input.id, input.source);\n    this.#candidate.link();\n    for (const id of invalidatedIds) this.#elementCache.delete(id);\n    return {\n      changed: true,\n      id: input.id,\n      previousHash,\n      contentHash: nextHash,\n      invalidatedIds\n    };\n  }\n  removeModule(id) {\n    const previous = this.#modules.get(id);\n    if (!previous) {\n      return {\n        changed: false,\n        id,\n        previousHash: null,\n        contentHash: null,\n        invalidatedIds: []\n      };\n    }\n    const invalidatedIds = this.affectedBy(id);\n    this.#candidate.removeFile(id);\n    this.#removeOutgoingEdges(id);\n    this.#removeResolutions(id);\n    this.#modules.delete(id);\n    this.#files.delete(id);\n    this.#candidate.link();\n    for (const invalidated of invalidatedIds) this.#elementCache.delete(invalidated);\n    return {\n      changed: true,\n      id,\n      previousHash: previous.hash,\n      contentHash: null,\n      invalidatedIds\n    };\n  }\n  #installHostRecord(input) {\n    resolvedModuleId(input.id);\n    const seenSpecifiers = /* @__PURE__ */ new Set();\n    for (const dependency of input.imports) {\n      resolvedModuleId(dependency.resolvedId);\n      if (seenSpecifiers.has(dependency.specifier)) {\n        throw new Error(\n          `Duplicate host resolution for ${input.id}:${dependency.specifier}`\n        );\n      }\n      seenSpecifiers.add(dependency.specifier);\n    }\n    this.#removeOutgoingEdges(input.id);\n    this.#removeResolutions(input.id);\n    const dependencies = new Set(\n      input.imports.filter(({ external }) => !external).map(({ resolvedId }) => resolvedId)\n    );\n    this.#dependencies.set(input.id, dependencies);\n    for (const dependency of dependencies) {\n      let reverse = this.#dependents.get(dependency);\n      if (!reverse) {\n        reverse = /* @__PURE__ */ new Set();\n        this.#dependents.set(dependency, reverse);\n      }\n      reverse.add(input.id);\n    }\n    for (const dependency of input.imports) {\n      if (dependency.external) continue;\n      this.#resolutions.set(\n        resolutionKey(input.id, dependency.specifier),\n        dependency.resolvedId\n      );\n    }\n    const installedInput = {\n      ...input,\n      imports: input.imports.map((dependency) => ({ ...dependency }))\n    };\n    this.#files.set(installedInput.id, installedInput.source);\n    this.#modules.set(installedInput.id, {\n      input: installedInput,\n      hash: moduleContentHash(installedInput)\n    });\n  }\n  #removeOutgoingEdges(id) {\n    for (const dependency of this.#dependencies.get(id) ?? []) {\n      const reverse = this.#dependents.get(dependency);\n      reverse?.delete(id);\n      if (reverse?.size === 0) this.#dependents.delete(dependency);\n    }\n    this.#dependencies.delete(id);\n  }\n  #removeResolutions(id) {\n    const prefix = `${id}\\0`;\n    for (const key of this.#resolutions.keys()) {\n      if (key.startsWith(prefix)) this.#resolutions.delete(key);\n    }\n  }\n}\nexport {\n  ProjectGraph,\n  moduleContentHash\n};\n//# sourceMappingURL=graph.js.map\n"],"mappings":";;;;;;;AAUA,SAAS,WAAW,MAAM,OAAO;CAC/B,OAAO,iBAAiB,MAAM,KAAK;AACrC;AACA,SAAS,iBAAiB,MAAM,OAAO;CACrC,OAAO,OAAO,QAAQ,CAAC,IAAI,OAAO,QAAQ,IAAI;AAChD;AACA,SAAS,cAAc,SAAS;CAC9B,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,MAAM,UAAU;EACxC,MAAM,cAAc,iBAAiB,KAAK,WAAW,MAAM,SAAS;EACpE,OAAO,eAAe,iBAAiB,KAAK,YAAY,MAAM,UAAU;CAC1E,CAAC;AACH;AACA,SAAS,kBAAkB,OAAO;CAChC,MAAM,OAAO,WAAW,QAAQ;CAChC,KAAK,OAAO,MAAM,MAAM;CACxB,KAAK,OAAO,IAAI;CAChB,KAAK,MAAM,cAAc,cAAc,MAAM,OAAO,GAAG;EACrD,KAAK,OAAO,WAAW,SAAS;EAChC,KAAK,OAAO,IAAI;EAChB,KAAK,OAAO,WAAW,UAAU;EACjC,KAAK,OAAO,IAAI;EAChB,KAAK,OAAO,WAAW,WAAW,aAAa,UAAU;EACzD,KAAK,OAAO,IAAI;CAClB;CACA,OAAO,KAAK,OAAO,KAAK;AAC1B;AACA,IAAM,eAAN,MAAmB;CACjB,yBAAyB,IAAI,IAAI;CACjC,+BAA+B,IAAI,IAAI;CACvC,2BAA2B,IAAI,IAAI;CACnC,gCAAgC,IAAI,IAAI;CACxC,8BAA8B,IAAI,IAAI;CACtC,gCAAgC,IAAI,IAAI;CACxC;CACA,YAAY,SAAS,SAAS;EAC5B,KAAK,MAAM,SAAS,QAAQ,SAAS,KAAKA,mBAAmB,KAAK;EAClE,MAAM,mBAAmB;GACvB,OAAO,KAAKC;GACZ,aAAa,KAAKC;EACpB;EACA,KAAKC,aAAa,QAAQ,OAAO,gBAAgB;EACjD,KAAKA,WAAW,KAAK;CACvB;CACA,YAAY;EACV,OAAO,CAAC,GAAG,KAAKC,SAAS,KAAK,CAAC,CAAC,CAAC,KAAK,UAAU;CAClD;CACA,YAAY,IAAI;EACd,OAAO,KAAKA,SAAS,IAAI,EAAE,CAAC,EAAE,QAAQ;CACxC;CACA,SAAS,IAAI;EACX,MAAM,SAAS,KAAKA,SAAS,IAAI,EAAE,CAAC,EAAE,MAAM;EAC5C,IAAI,WAAW,KAAK,GAAG,MAAM,IAAI,MAAM,uBAAuB,IAAI;EAClE,OAAO;CACT;CACA,eAAe,IAAI;EACjB,OAAO,CAAC,GAAG,KAAKC,cAAc,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,UAAU;CAC9D;CACA,aAAa,IAAI;EACf,OAAO,CAAC,GAAG,KAAKC,YAAY,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,UAAU;CAC5D;;CAEA,kBAAkB,IAAI;EACpB,MAAM,SAAS,KAAKF,SAAS,IAAI,EAAE;EACnC,IAAI,CAAC,QAAQ,OAAO,CAAC;EACrB,MAAM,sBAAsB,IAAI,IAAI;EACpC,KAAK,MAAM,cAAc,OAAO,MAAM,SAAS;GAC7C,IAAI,WAAW,UAAU,IAAI,IAAI,WAAW,UAAU;EACxD;EACA,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,UAAU;CACjC;CACA,WAAW,IAAI;EACb,MAAM,2BAA2B,IAAI,IAAI,CAAC,EAAE,CAAC;EAC7C,MAAM,QAAQ,CAAC,EAAE;EACjB,OAAO,MAAM,QAAQ;GACnB,MAAM,UAAU,MAAM,MAAM;GAC5B,KAAK,MAAM,aAAa,KAAKE,YAAY,IAAI,OAAO,KAAK,CAAC,GAAG;IAC3D,IAAI,SAAS,IAAI,SAAS,GAAG;IAC7B,SAAS,IAAI,SAAS;IACtB,MAAM,KAAK,SAAS;GACtB;EACF;EACA,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK,UAAU;CACtC;CACA,WAAW,IAAI;EACb,OAAO,KAAKH,WAAW,WAAW,EAAE;CACtC;CACA,eAAe,IAAI,WAAW;EAC5B,MAAM,aAAa,KAAKA,WAAW,aAAa,IAAI,SAAS;EAC7D,IAAI,CAAC,YAAY,OAAO;EACxB,OAAO;GACL,IAAI,WAAW;GACf,MAAM,WAAW;GACjB,MAAM;IACJ,IAAI,WAAW;IACf,OAAO,WAAW;IAClB,KAAK,WAAW;GAClB;GACA,aAAa,WAAW,cAAc,oBAAoB,WAAW,IAAI,WAAW,WAAW,IAAI;GACnG,UAAU,WAAW;EACvB;CACF;CACA,iBAAiB,WAAW;EAC1B,MAAM,aAAa,KAAKA,WAAW,aACjC,UAAU,IACV,UAAU,OACV,UAAU,GACZ;EACA,IAAI,CAAC,YAAY,OAAO;EACxB,OAAO;GACL,IAAI,WAAW;GACf,MAAM,WAAW;GACjB,MAAM;IACJ,IAAI,WAAW;IACf,OAAO,WAAW;IAClB,KAAK,WAAW;GAClB;GACA,aAAa,WAAW,cAAc,oBAAoB,WAAW,IAAI,WAAW,WAAW,IAAI;GACnG,UAAU,WAAW;EACvB;CACF;CACA,eAAe,WAAW;EACxB,IAAI,CAAC,KAAKC,SAAS,IAAI,UAAU,EAAE,GAAG,OAAO;EAC7C,OAAO,WACL,KAAKD,WAAW,UAAU,UAAU,EAAE,GACtC,UAAU,OACV,UAAU,GACZ;CACF;CACA,SAAS,WAAW;EAClB,OAAO,mBAAmB,MAAM,SAAS;CAC3C;CACA,iBAAiB,WAAW;EAC1B,OAAO,iBAAiB,MAAM,SAAS;CACzC;CACA,gBAAgB,WAAW;EACzB,OAAO,0BAA0B,MAAM,SAAS;CAClD;CACA,gBAAgB,IAAI,WAAW;EAC7B,OAAO,gBAAgB,MAAM,IAAI,SAAS;CAC5C;CACA,WAAW,IAAI;EACb,MAAM,SAAS,KAAKC,SAAS,IAAI,EAAE;EACnC,IAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,uBAAuB,IAAI;EACxD,MAAM,SAAS,KAAKG,cAAc,IAAI,EAAE;EACxC,IAAI,QAAQ,SAAS,OAAO,MAAM,OAAO,OAAO;EAChD,MAAM,SAAS,kBAAkB,KAAKJ,YAAY,IAAI,OAAO,MAAM,OAAO;EAC1E,KAAKI,cAAc,IAAI,IAAI;GAAE,MAAM,OAAO;GAAM;EAAO,CAAC;EACxD,OAAO;CACT;CACA,cAAc;EACZ,MAAM,cAAc,KAAKJ,WAAW,YAAY,CAAC,CAAC,KAC/C,eAAe,WAAW,SAAS,UAAU,aAC5C,qBACA;GAAE,IAAI,WAAW;GAAI,OAAO;GAAG,KAAK;EAAE,GACtC,WAAW,OACb,IAAI,cACF,6BACA;GAAE,IAAI,WAAW;GAAI,OAAO;GAAG,KAAK;EAAE,GACtC,WAAW,OACb,CACF;EACA,KAAK,MAAM,CAAC,IAAI,WAAW,KAAKC,UAAU;GACxC,KAAK,MAAM,cAAc,OAAO,MAAM,SAAS;IAC7C,IAAI,WAAW,UAAU;IACzB,IAAI,KAAKA,SAAS,IAAI,WAAW,UAAU,GAAG;IAC9C,YAAY,KACV,cACE,4BACA;KAAE;KAAI,OAAO;KAAG,KAAK;IAAE,GACvB,wBAAwB,WAAW,UAAU,oCAC7C,WAAW,UACb,CACF;GACF;EACF;EACA,OAAO,YAAY,MAAM,MAAM,UAAU;GACvC,MAAM,OAAO,iBAAiB,KAAK,KAAK,IAAI,MAAM,KAAK,EAAE;GACzD,OAAO,QAAQ,KAAK,KAAK,QAAQ,MAAM,KAAK,SAAS,iBAAiB,KAAK,MAAM,MAAM,IAAI;EAC7F,CAAC;CACH;CACA,aAAa,OAAO;EAClB,MAAM,WAAW,KAAKA,SAAS,IAAI,MAAM,EAAE;EAC3C,MAAM,WAAW,kBAAkB,KAAK;EACxC,IAAI,UAAU,SAAS,UAAU;GAC/B,OAAO;IACL,SAAS;IACT,IAAI,MAAM;IACV,cAAc,SAAS;IACvB,aAAa,SAAS;IACtB,gBAAgB,CAAC;GACnB;EACF;EACA,MAAM,iBAAiB,KAAK,WAAW,MAAM,EAAE;EAC/C,MAAM,eAAe,UAAU,QAAQ;EACvC,IAAI,UAAU,KAAKD,WAAW,WAAW,MAAM,EAAE;EACjD,KAAKH,mBAAmB,KAAK;EAC7B,KAAKG,WAAW,QAAQ,MAAM,IAAI,MAAM,MAAM;EAC9C,KAAKA,WAAW,KAAK;EACrB,KAAK,MAAM,MAAM,gBAAgB,KAAKI,cAAc,OAAO,EAAE;EAC7D,OAAO;GACL,SAAS;GACT,IAAI,MAAM;GACV;GACA,aAAa;GACb;EACF;CACF;CACA,aAAa,IAAI;EACf,MAAM,WAAW,KAAKH,SAAS,IAAI,EAAE;EACrC,IAAI,CAAC,UAAU;GACb,OAAO;IACL,SAAS;IACT;IACA,cAAc;IACd,aAAa;IACb,gBAAgB,CAAC;GACnB;EACF;EACA,MAAM,iBAAiB,KAAK,WAAW,EAAE;EACzC,KAAKD,WAAW,WAAW,EAAE;EAC7B,KAAKK,qBAAqB,EAAE;EAC5B,KAAKC,mBAAmB,EAAE;EAC1B,KAAKL,SAAS,OAAO,EAAE;EACvB,KAAKH,OAAO,OAAO,EAAE;EACrB,KAAKE,WAAW,KAAK;EACrB,KAAK,MAAM,eAAe,gBAAgB,KAAKI,cAAc,OAAO,WAAW;EAC/E,OAAO;GACL,SAAS;GACT;GACA,cAAc,SAAS;GACvB,aAAa;GACb;EACF;CACF;CACA,mBAAmB,OAAO;EACxB,iBAAiB,MAAM,EAAE;EACzB,MAAM,iCAAiC,IAAI,IAAI;EAC/C,KAAK,MAAM,cAAc,MAAM,SAAS;GACtC,iBAAiB,WAAW,UAAU;GACtC,IAAI,eAAe,IAAI,WAAW,SAAS,GAAG;IAC5C,MAAM,IAAI,MACR,iCAAiC,MAAM,GAAG,GAAG,WAAW,WAC1D;GACF;GACA,eAAe,IAAI,WAAW,SAAS;EACzC;EACA,KAAKC,qBAAqB,MAAM,EAAE;EAClC,KAAKC,mBAAmB,MAAM,EAAE;EAChC,MAAM,eAAe,IAAI,IACvB,MAAM,QAAQ,QAAQ,EAAE,eAAe,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,iBAAiB,UAAU,CACtF;EACA,KAAKJ,cAAc,IAAI,MAAM,IAAI,YAAY;EAC7C,KAAK,MAAM,cAAc,cAAc;GACrC,IAAI,UAAU,KAAKC,YAAY,IAAI,UAAU;GAC7C,IAAI,CAAC,SAAS;IACZ,0BAA0B,IAAI,IAAI;IAClC,KAAKA,YAAY,IAAI,YAAY,OAAO;GAC1C;GACA,QAAQ,IAAI,MAAM,EAAE;EACtB;EACA,KAAK,MAAM,cAAc,MAAM,SAAS;GACtC,IAAI,WAAW,UAAU;GACzB,KAAKJ,aAAa,IAChB,cAAc,MAAM,IAAI,WAAW,SAAS,GAC5C,WAAW,UACb;EACF;EACA,MAAM,iBAAiB;GACrB,GAAG;GACH,SAAS,MAAM,QAAQ,KAAK,gBAAgB,EAAE,GAAG,WAAW,EAAE;EAChE;EACA,KAAKD,OAAO,IAAI,eAAe,IAAI,eAAe,MAAM;EACxD,KAAKG,SAAS,IAAI,eAAe,IAAI;GACnC,OAAO;GACP,MAAM,kBAAkB,cAAc;EACxC,CAAC;CACH;CACA,qBAAqB,IAAI;EACvB,KAAK,MAAM,cAAc,KAAKC,cAAc,IAAI,EAAE,KAAK,CAAC,GAAG;GACzD,MAAM,UAAU,KAAKC,YAAY,IAAI,UAAU;GAC/C,SAAS,OAAO,EAAE;GAClB,IAAI,SAAS,SAAS,GAAG,KAAKA,YAAY,OAAO,UAAU;EAC7D;EACA,KAAKD,cAAc,OAAO,EAAE;CAC9B;CACA,mBAAmB,IAAI;EACrB,MAAM,SAAS,GAAG,GAAG;EACrB,KAAK,MAAM,OAAO,KAAKH,aAAa,KAAK,GAAG;GAC1C,IAAI,IAAI,WAAW,MAAM,GAAG,KAAKA,aAAa,OAAO,GAAG;EAC1D;CACF;AACF"}